computational complexity of eig and pinv

Hi,
I was wondering if anyone knew where to look up expressions for the computational complexity of these 2 matlab functions: eig and pinv.
Thank you in advance, Ina

Respuestas (1)

Luca  Fenzi
Luca Fenzi el 30 de Oct. de 2016

0 votos

The computational cost of eig should be O(N^3) with N dimension of the matrix

1 comentario

Walter Roberson
Walter Roberson el 30 de Oct. de 2016
If I recall, in theory it could be a little better, closer to N^e -- but I have no idea which of the optimizations are implemented.

Iniciar sesión para comentar.

Categorías

Más información sobre Linear Algebra en Centro de ayuda y File Exchange.

Etiquetas

Preguntada:

Ina
el 27 de Jun. de 2011

Comentada:

el 30 de Oct. de 2016

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by