Folded spectrum method (Eigenpair closest to mu; Any eigenpair; Any eigenvalue Eigenvalues (Iterative Methods))

From Algorithm Wiki

Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$? words (Requires only a constant number of O(n)-sized vectors per iteration; matrix-to-vector multiplication only requires O(n) aux space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1934 == Reference == https://journals.aps.org/pr/abstract/10.1103/PhysRev.46.828")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n)$? words

(Requires only a constant number of O(n)-sized vectors per iteration; matrix-to-vector multiplication only requires O(n) aux space)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1934

Reference

https://journals.aps.org/pr/abstract/10.1103/PhysRev.46.828

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Folded_spectrum_method_(Eigenpair_closest_to_mu;_Any_eigenpair;_Any_eigenvalue_Eigenvalues_(Iterative_Methods))&oldid=45345"