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

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Physics LibreTexts

Search

  • Filter Results
  • Location
  • Classification
    • Article type
    • Author
    • Embed Hypothes.is?
    • Embebbed CalcPlot3D?
    • Cover Page
    • License
    • Show TOC
    • Transcluded
    • OER program or Publisher
    • Student Analytics
    • Autonumber Section Headings
    • License Version
    • Print CSS
      • Screen CSS
      • PrintOptions
    • Include attachments
    Searching in
    About 1 results
    • https://phys.libretexts.org/Bookshelves/Mathematical_Physics_and_Pedagogy/Computational_Physics_(Chong)/06%3A_Eigenvalue_Problems/6.02%3A_Numerical_Eigensolvers
      There exist numerical methods, called eigensolvers, which can compute eigenvalues (and eigenvectors) even for very large matrices, with hundreds of rows/columns, or larger. How could this be? The ans...There exist numerical methods, called eigensolvers, which can compute eigenvalues (and eigenvectors) even for very large matrices, with hundreds of rows/columns, or larger. How could this be? The answer is that numerical eigensolvers are approximate, not exact. But even though their results are not exact, they are very precise—they can approach the exact eigenvalues to within the fundamental precision limits of floating-point arithmetic.

    Support Center

    How can we help?