OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Arnoldi iteration

 Home Mathematics Fields of mathematics Algebra Linear algebra Numerical linear algebra
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Arnoldi iteration is an important numerical method used in linear algebra for approximating the eigenvalues and eigenvectors of a large, sparse matrix. It is particularly useful for solving problems in fields such as scientific computing, quantum mechanics, and engineering, where one may encounter large systems that cannot be solved directly due to computational limitations. ### Overview The Arnoldi iteration algorithm builds an orthonormal basis for the Krylov subspace generated by the matrix in question.

 Ancestors (6)

  1. Numerical linear algebra
  2. Linear algebra
  3. Algebra
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook