Hello,

i have following expression and i need to calculate time complexity of this algorithm. could anybody help to get correct time complexity of this algorithms.

% save a matrix-vector multiply

Atb = A'*b;

% cache the factorization (using cholesky factorization)

[L U] = factor(A, a);

for( k = 0; k < maxiter; k++)

{

x^k+1 = (A^TA + a* I)^-1 (A^Tb + a (z^k - u^k))^T

}

Where A = mxn matrix and n>>>m, b,u,z = nx1 vectors, I = identity matrix and a=0.001

More Mahammad Humayoo's questions See All
Similar questions and discussions