QR algorithm (All eigenvalues; Any eigenvalue Eigenvalues (Iterative Methods))

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n^{2})$ words (Computes and stores QR factorization at each iteration) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1962 == Reference == https://academic.oup.com/comjnl/article/4/4/332/432033")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n^{2})$ words

(Computes and stores QR factorization at each iteration)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1962

Reference

https://academic.oup.com/comjnl/article/4/4/332/432033

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=QR_algorithm_(All_eigenvalues;_Any_eigenvalue_Eigenvalues_(Iterative_Methods))&oldid=45342"