Which pivot to solve linear systems?

DOI10.1016/S0377-0427(02)00482-XMaRDI QIDQ1860424zbMATH OpenFDO

Authors David-Olivier Azulay, I. Gambini

Publication date 23 February 2003

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmslinear systemsdivision-free pivotsfraction free pivotsinteger calculations

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Recommendations

• Publication:5751844
• Solving linear systems on a vector computer
• Computing and proving with pivots
• Parallel pivoting algorithms for sparse symmetric matrices
• scientific article; zbMATH DE number 1496696

Cites work

• 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?)
• A New Version of the Euclidean Algorith
• A method for cutting squares into distinct squares
• Computational Solutions of Matrix Problems Over an Integral Domain
• 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)

• When is a linear system conservative?
• An algorithm for avoiding zero pivots in the modified nodal approach
• Numerically accurate code synthesis for Gauss pivoting method to solve linear systems coming from mechanics
• 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)