Francis’s Algorithm
From MaRDI portal
Publication:3002528
DOI10.4169/amer.math.monthly.118.05.387zbMath1214.65016OpenAlexW2112277662WikidataQ58300129 ScholiaQ58300129MaRDI QIDQ3002528
Publication date: 20 May 2011
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4169/amer.math.monthly.118.05.387
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) History of mathematics in the 20th century (01A60) History of numerical analysis (65-03) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Related Items (13)
Computing the Square Root of a Low-Rank Perturbation of the Scaled Identity Matrix ⋮ An extended Hessenberg form for Hamiltonian matrices ⋮ Rutishauser’s LR algorithm and Bruhat iteration ⋮ An extended Hamiltonian QR algorithm ⋮ The dynamical functional particle method for multi-term linear matrix equations ⋮ Locally Sparse Function-on-Function Regression ⋮ Numerical solution of linear eigenvalue problems ⋮ On pole-swapping algorithms for the eigenvalue problem ⋮ Fast computation of eigenvalues of companion, comrade, and related matrices ⋮ Pole-swapping algorithms for alternating and palindromic eigenvalue problems ⋮ Periodic Eigendecomposition and Its Application to Kuramoto--Sivashinsky System ⋮ A Rational QZ Method ⋮ Fast and Backward Stable Computation of Roots of Polynomials
This page was built for publication: Francis’s Algorithm
