A generalized Sylvester identity and fraction-free random Gaussian elimination

DOI10.1006/jsco.2000.0409zbMath0980.65024OpenAlexW2040178979MaRDI QIDQ5933502

Thom Mulders

Publication date: 25 February 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/158dbabb0b00e381887a9bd9ab13cd83f5bee56e

zbMATH Keywords

performancelinear programmingnumerical examplesGaussian eliminationfraction free algorithmmultifrontal methodrandom Gaussian eliminationsimplex methodsparse Cholesky factorizationsparse matrix factorizationSylvester identity

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Linear programming (90C05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction ⋮ Can Sylvester's determinantal identity, equivalently Muir's law of extensible minors be generalized?

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact arithmetic at low cost. -- A case study in linear programming
• Matrix Analysis
• Note sur les $Q$-matrices d’Edmonds
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• Computational Solutions of Matrix Problems Over an Integral Domain