Which pivot to solve linear systems?
From MaRDI portal
Several algorithms are presented for pivoting used in the solutions of linear equations. It is pointed out that if exact calculations are required, then fraction-free pivots and division-free pivots may permit an increase in the precision. The authors choose some particular problems to illustrate the algorithms. They avoid the use of a multi-precision library and perform calculations with relatively low cost with runtimes close to the fastest approximate calculation schemes.
Recommendations
Cites work
- A method for cutting squares into distinct squares
- A New Version of the Euclidean Algorith
- Computational Solutions of Matrix Problems Over an Integral Domain
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- scientific article; zbMATH DE number 1303552 (Why is no real title available?)
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- Note sur les Q-matrices d’Edmonds
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
- Systems of distinct representatives and linear algebra
- The Algebraic Solution of Sparse Linear Systems via Minor Expansion
Cited in
(4)- Numerically accurate code synthesis for Gauss pivoting method to solve linear systems coming from mechanics
- When is a linear system conservative?
- An algorithm for avoiding zero pivots in the modified nodal approach
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction
This page was built for publication: Which pivot to solve linear systems?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1860424)