Computational cost of function eig
조회 수: 9 (최근 30일)
이전 댓글 표시
I am wondering what is the computational cost (using asymptotic notation) of function eig in MatLab r2016, and what algorithm is used to compute the diagonal matrix and the change of basis matrix. In this discussion http://it.mathworks.com/matlabcentral/answers/10335-computational-complexity-of-eig-and-pinv it says it is something around O(n^3), or maybe something less, but why? Thank you in advance
댓글 수: 3
Walter Roberson
2016년 12월 12일
It depends on the properties of the matrix whose eigenvalues are being taken.
답변 (1개)
Walter Roberson
2016년 12월 12일
https://en.m.wikipedia.org/wiki/Eigenvalue_algorithm
댓글 수: 1
Walter Roberson
2016년 12월 12일
You should probably assume that for sufficiently large arrays that MATLAB invokes one of the below routines:
참고 항목
카테고리
Help Center 및 File Exchange에서 Creating and Concatenating Matrices에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!