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

Answers (1)

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

1 Comment

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.

Sign in to comment.

Categories

Find more on Linear Algebra in Help Center and File Exchange

Asked:

Ina
on 27 Jun 2011

Commented:

on 30 Oct 2016

Community Treasure Hunt

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

Start Hunting!