Add-sub pivoting triangular factorization for symmetric matrix
From MaRDI portal
Publication:2423596
Recommendations
- A pivoting strategy for symmetric tridiagonal matrices
- A simplified pivoting strategy for symmetric tridiagonal matrices
- Stable Factorizations of Symmetric Tridiagonal and Triadic Matrices
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- Analysis of the Diagonal Pivoting Method
Cites work
- scientific article; zbMATH DE number 48972 (Why is no real title available?)
- scientific article; zbMATH DE number 1341052 (Why is no real title available?)
- scientific article; zbMATH DE number 1474908 (Why is no real title available?)
- A Modified Cholesky Algorithm Based on a Symmetric Indefinite Factorization
- A symmetric linear system solver
- Accuracy and Stability of Numerical Algorithms
- Accurate Symmetric Indefinite Linear Equation Solvers
- An alternative full-pivoting algorithm for the factorization of indefinite symmetric matrices
- Analysis of the Diagonal Pivoting Method
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- On the reduction of a symmetric matrix to tridiagonal form
- Partial pivoting strategies for symmetric gaussian elimination
- Pivoting techniques for symmetric Gaussian elimination
- Relaxed forms of BBK algorithm and FBP algorithm for symmetric indefinite linear systems
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Stability of the Diagonal Pivoting Method with Partial Pivoting
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The choleski Q.I.F. algorithm for solving symmetric linear systems
- The growth-factor bound for the Bunch-Kaufman factorization is tight
This page was built for publication: Add-sub pivoting triangular factorization for symmetric matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2423596)