The weak and strong stability of algorithms in numerical linear algebra
From MaRDI portal
(Redirected from Publication:1107263)
Recommendations
Cites work
- A new algorithm for solving Toeplitz systems of equations
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Analysis of the Diagonal Pivoting Method
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- Error Analysis of Direct Methods of Matrix Inversion
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 862514 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3248502 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Numerical Inverting of Matrices of High Order. II
- Stability of Methods for Solving Toeplitz Systems of Equations
- The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of Equations
- The Solution of a Toeplitz Set of Linear Equations
Cited in
(53)- 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
- Applying numerical linear algebra techniques to analyzing algorithms in signal processing
- 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 backward error analysis for generalized saddle point problems
- A note on the structured perturbation analysis for the inversion formula of Toeplitz matrices
- Structured maximal perturbations for Hamiltonian eigenvalue problems
- On normwise structured backward errors for the generalized saddle point systems
- On the stability of some algorithms for computing the action of the matrix exponential
- 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
- scientific article; zbMATH DE number 4203576 (Why is no real title available?)
- A note on backward errors for Toeplitz systems
- A note on backward errors for structured linear systems
- Structured Eigenvalue Problems
- scientific article; zbMATH DE number 4022486 (Why is no real title available?)
- scientific article; zbMATH DE number 17444 (Why is no real title available?)
- Structured backward errors for generalized saddle point systems
- The Strong Stability of Algorithms for Solving Symmetric Linear Systems
- On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
- scientific article; zbMATH DE number 2078353 (Why is no real title available?)
- On numerical stability in large scale linear algebraic computations
- Stabilité numérique de l'algorithme de Levinson
- scientific article; zbMATH DE number 813875 (Why is no real title available?)
- Approximated structured pseudospectra
- A note on the inversion of Sylvester matrices in control systems
- Conditioning of coefficient matrices of ordinary kriging
- Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems
- Structured backward errors for block three-by-three saddle point systems
- Structured backward errors for special classes of saddle point problems with applications
- On a class of alternating coefficient matrices quadratic eigenvalue problem
- Structured backward errors of sparse generalized saddle point problems with Hermitian block matrices
- On Hamiltonian and symplectic Hessenberg forms
- A numerical method for computing the Hamiltonian Schur form
- A note on a Toeplitz inversion formula
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)
