An efficient algorithm for the minimal least squares solution of linear systems with indefinite symmetric matrices
From MaRDI portal
Cites work
- A geometric analysis of Gaussian elimination. II
- A Note on the Generation of Random Normal Deviates
- Accurate Symmetric Indefinite Linear Equation Solvers
- An alternative full-pivoting algorithm for the factorization of indefinite symmetric matrices
- An efficient LDU algorithm for the minimal least squares solution of linear systems
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- Error Analysis of Direct Methods of Matrix Inversion
- Fehleranalyse für die Gauß-Elimination zur Berechnung der Lösung minimaler Länge
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Mersenne twister
- Random matrices generating large growth in LU factorization with pivoting
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Stability of the Diagonal Pivoting Method with Partial Pivoting
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- The growth factor and efficiency of Gaussian elimination with rook pivoting
- The growth-factor bound for the Bunch-Kaufman factorization is tight
- The least squares problem and pseudo-inverses
- The Null Space Problem I. Complexity
- The Rook's pivoting strategy
This page was built for publication: An efficient algorithm for the minimal least squares solution of linear systems with indefinite symmetric matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556719)
