Numerical stability of some fast algorithms for structured matrices

MaRDI QIDQ4251277zbMATH OpenFDO

Authors Richard P. Brent

Publication date 6 December 1999

zbMATH Keywords

fast algorithmsHankel matriceslinear least squares problemslow displacement-rank structureMR 8.391numerical stabilitysystems of linear equationsToeplitz matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• Stability of Methods for Solving Toeplitz Systems of Equations
• Stable and Efficient Algorithms for Structured Systems of Linear Equations
• Stability analysis of a general Toeplitz system solver

Cited in

(13)

• On the stability of some algorithms for computing the action of the matrix exponential
• Fast linear algebra is stable
• scientific article; zbMATH DE number 1618011 (Why is no real title available?)
• Stability of the Levinson algorithm for Toeplitz-like systems
• scientific article; zbMATH DE number 4203576 (Why is no real title available?)
• scientific article; zbMATH DE number 5674690 (Why is no real title available?)
• scientific article; zbMATH DE number 4100488 (Why is no real title available?)
• scientific article; zbMATH DE number 17440 (Why is no real title available?)
• The Strong Stability of Algorithms for Solving Symmetric Linear Systems
• scientific article; zbMATH DE number 1974605 (Why is no real title available?)
• On numerical stability in large scale linear algebraic computations
• Stabilizing the Generalized Schur Algorithm
• Displacement Structures of Covariance Matrices, Lossless Systems, and Numerical Algorithm Design

This page was built for publication: Numerical stability of some fast algorithms for structured matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4251277)