The weak and strong stability of algorithms in numerical linear algebra
From MaRDI portal
Publication:1107263
DOI10.1016/0024-3795(87)90102-9zbMath0652.65032MaRDI QIDQ1107263
Publication date: 1987
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(87)90102-9
conditioning; strong stability; weak stability; backward error analysis; Toeplitz systems; stability of algorithm
65G50: Roundoff error
65F35: Numerical computation of matrix norms, conditioning, scaling
15A12: Conditioning of matrices
Related Items
Stabilité numérique de l'algorithme de Levinson, Conditioning of coefficient matrices of ordinary kriging, Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems, Structured backward errors for generalized saddle point systems, A note on the inversion of Sylvester matrices in control systems, On a class of alternating coefficient matrices quadratic eigenvalue problem, On Hamiltonian and symplectic Hessenberg forms, A numerical method for computing the Hamiltonian Schur form, A note on a Toeplitz inversion formula, Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing, On the stability of solution methods for band Toeplitz systems, Parallel solution of Toeplitzlike linear systems, A global minimum search algorithm for estimating the distance to uncontrollability, Product rules for the displacement of near-Toeplitz matrices, Structured backward errors for KKT systems, \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem, The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method, Fast inversion of Vandermonde-like matrices involving orthogonal polynomials, Solution of bordered singular systems in numerical continuation and bifurcation, Solution of augmented linear systems using orthogonal factorizations, An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem, A new method for computing the stable invariant subspace of a real Hamiltonian matrix, Methods and algorithms of solving spectral problems for polynomial and rational matrices, Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian, Efficient implementation of a structured total least squares based speech compression method, The stability of inversion formulas for Toeplitz matrices, Stability analysis of a general Toeplitz system solver, Numerical stability of GMRES, The stable computation of formal orthogonal polynomials, Structured maximal perturbations for Hamiltonian eigenvalue problems, A periodic Krylov-Schur algorithm for large matrix products, The periodic QR algorithm is a disguised QR algorithm, A modification to the LINPACK downdating algorithm, A note on backward errors for Toeplitz systems, A note on backward errors for structured linear systems, Structured Eigenvalue Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new algorithm for solving Toeplitz systems of equations
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Stability of Methods for Solving Toeplitz Systems of Equations
- Error Analysis of Direct Methods of Matrix Inversion
- The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of Equations
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- The Solution of a Toeplitz Set of Linear Equations
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Analysis of the Diagonal Pivoting Method
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- Numerical Inverting of Matrices of High Order. II
