Loading [MathJax]/extensions/TeX/cancel.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

Search

  • Filter Results
  • Location
  • Classification
    • Article type
    • Stage
    • Author
    • Embed Hypothes.is?
    • Cover Page
    • License
    • Show Page TOC
    • Transcluded
    • PrintOptions
    • OER program or Publisher
    • Autonumber Section Headings
    • License Version
    • Print CSS
    • Screen CSS
  • Include attachments
Searching in
About 2 results
  • https://math.libretexts.org/Bookshelves/Linear_Algebra/Linear_Algebra_with_Applications_(Nicholson)/08%3A_Orthogonality/8.05%3A_Computing_Eigenvalues
    In practice, the problem of finding eigenvalues of a matrix is virtually never solved by finding the roots of the characteristic polynomial. This is difficult for large matrices and iterative methods ...In practice, the problem of finding eigenvalues of a matrix is virtually never solved by finding the roots of the characteristic polynomial. This is difficult for large matrices and iterative methods are much better. Two such methods are described briefly in this section.
  • https://math.libretexts.org/Bookshelves/Linear_Algebra/Understanding_Linear_Algebra_(Austin)/05%3A_Linear_algebra_and_computing/5.02%3A_Finding_eigenvectors_numerically
    In this section, we will explore a technique called the power method that finds numerical approximations to the eigenvalues and eigenvectors of a square matrix. Generally speaking, this method is how ...In this section, we will explore a technique called the power method that finds numerical approximations to the eigenvalues and eigenvectors of a square matrix. Generally speaking, this method is how eigenvectors are found in practical computing applications.

Support Center

How can we help?