A new pivoting strategy for Gaussian elimination
- 1 June 1996
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 240, 131-151
- https://doi.org/10.1016/0024-3795(94)00192-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- QMR: a quasi-minimal residual method for non-Hermitian linear systemsNumerische Mathematik, 1991
- An efficient labeling technique for solving sparse assignment problemsComputing, 1986
- Methods for scaling to doubly stochastic formLinear Algebra and its Applications, 1982
- Algorithm 548: Solution of the Assignment Problem [H]ACM Transactions on Mathematical Software, 1980
- Assignment and Matching Problems: Solution Methods with FORTRAN-ProgramsPublished by Springer Nature ,1980
- On the Automatic Scaling of Matrices for Gaussian EliminationIMA Journal of Applied Mathematics, 1972
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Error Analysis of Direct Methods of Matrix InversionJournal of the ACM, 1961
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955