The weak and strong stability of algorithms in numerical linear algebra

From MaRDI portal
Publication:1107263

DOI10.1016/0024-3795(87)90102-9zbMath0652.65032OpenAlexW2038336192MaRDI QIDQ1107263

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



Related Items

On normwise structured backward errors for the generalized saddle point systems, Efficient implementation of a structured total least squares based speech compression method, Solution of bordered singular systems in numerical continuation and bifurcation, Solution of augmented linear systems using orthogonal factorizations, The stability of inversion formulas for Toeplitz matrices, Analysis of a recursive least squares hyperbolic rotation algorithm for signal processing, A modification to the LINPACK downdating algorithm, Stability analysis of a general Toeplitz system solver, Numerical stability of GMRES, A numerical method for computing the Hamiltonian Schur form, An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem, The stable computation of formal orthogonal polynomials, Stabilité numérique de l'algorithme de Levinson, 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, Structured backward errors for generalized saddle point systems, A note on a Toeplitz inversion formula, On the stability of solution methods for band Toeplitz systems, Parallel solution of Toeplitzlike linear systems, Structured backward error analysis for generalized saddle point problems, Structured maximal perturbations for Hamiltonian eigenvalue problems, A note on the inversion of Sylvester matrices in control systems, Conditioning of coefficient matrices of ordinary kriging, On a class of alternating coefficient matrices quadratic eigenvalue problem, A periodic Krylov-Schur algorithm for large matrix products, Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems, A note on backward errors for structured linear systems, The periodic QR algorithm is a disguised QR algorithm, Structured Eigenvalue Problems, A global minimum search algorithm for estimating the distance to uncontrollability, Product rules for the displacement of near-Toeplitz matrices, A note on backward errors for Toeplitz systems, On Hamiltonian and symplectic Hessenberg forms, 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, Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian, Fast inversion of Vandermonde-like matrices involving orthogonal polynomials, A note on the structured perturbation analysis for the inversion formula of Toeplitz matrices, Approximated structured pseudospectra


Uses Software


Cites Work