The weak and strong stability of algorithms in numerical linear algebra

DOI10.1016/0024-3795(87)90102-9zbMATH Open0652.65032OpenAlexW2038336192MaRDI QIDQ1107263FDOQ1107263

Authors: James R. Bunch 

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

Recommendations

• scientific article; zbMATH DE number 17444
• Stability and conditioning in numerical analysis
• scientific article; zbMATH DE number 4022486
• On the stability of solution methods for band Toeplitz systems
• scientific article; zbMATH DE number 813875

zbMATH Keywords

conditioningstrong stabilitybackward error analysisToeplitz systemsweak stabilitystability of algorithm

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An Algorithm for the Inversion of Finite Toeplitz Matrices
• Numerical Inverting of Matrices of High Order. II
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
• Title not available (Why is that?)
• 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
• A new algorithm for solving Toeplitz systems of equations
• Title not available (Why is that?)
• The Solution of a Toeplitz Set of Linear Equations
• Title not available (Why is that?)
• Analysis of the Diagonal Pivoting Method

Cited In (51)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
• Structured maximal perturbations for Hamiltonian eigenvalue problems
• A global minimum search algorithm for estimating the distance to uncontrollability
• Fast inversion of Vandermonde-like matrices involving orthogonal polynomials
• Product rules for the displacement of near-Toeplitz matrices
• Structured backward errors for generalized saddle point systems
• The stable computation of formal orthogonal polynomials
• Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems
• A numerical method for computing the Hamiltonian Schur form
• A note on backward errors for Toeplitz systems
• The periodic QR algorithm is a disguised QR algorithm
• Applying numerical linear algebra techniques to analyzing algorithms in signal processing
• Structured backward errors for KKT systems
• A note on the structured perturbation analysis for the inversion formula of Toeplitz matrices
• An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
• Parallel solution of Toeplitzlike linear systems
• The stability of inversion formulas for Toeplitz matrices
• Conditioning of coefficient matrices of ordinary kriging
• Structured backward error analysis for generalized saddle point problems
• On numerical stability in large scale linear algebraic computations
• On Hamiltonian and symplectic Hessenberg forms
• A modification to the LINPACK downdating algorithm
• Title not available (Why is that?)
• A new method for computing the stable invariant subspace of a real Hamiltonian matrix
• On normwise structured backward errors for the generalized saddle point systems
• Stability analysis of a general Toeplitz system solver
• Approximated structured pseudospectra
• A note on the inversion of Sylvester matrices in control systems
• On a class of alternating coefficient matrices quadratic eigenvalue problem
• A periodic Krylov-Schur algorithm for large matrix products
• Solution of bordered singular systems in numerical continuation and bifurcation
• On the stability of solution methods for band Toeplitz systems
• The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
• Numerical stability of GMRES
• Structured backward errors for block three-by-three saddle point systems
• A note on a Toeplitz inversion formula
• Stabilité numérique de l'algorithme de Levinson
• On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
• Efficient implementation of a structured total least squares based speech compression method
• Title not available (Why is that?)
• Solution of augmented linear systems using orthogonal factorizations
• A note on backward errors for structured linear systems
• Title not available (Why is that?)
• Structured Eigenvalue Problems
• On the stability of some algorithms for computing the action of the matrix exponential
• \(SR\) and \(SZ\) algorithms for the symplectic (butterfly) eigenproblem
• The Strong Stability of Algorithms for Solving Symmetric Linear Systems
• Methods and algorithms of solving spectral problems for polynomial and rational matrices
• Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing

Uses Software

• LINPACK

This page was built for publication: The weak and strong stability of algorithms in numerical linear algebra

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