Solving sparse rational linear systems

DOI10.1145/1145768.1145785zbMath1356.65118OpenAlexW2032080903MaRDI QIDQ2958972

Pascal Giorgi, Arne Storjohann, Gilles Villard, Wayne Eberly, Mark W. Giesbrecht

Publication date: 3 February 2017

Published in: Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1145768.1145785

zbMATH Keywords

sparse integer matrixstructured matrixlinear system solving

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Matrices of integers (15B36)

Related Items (8)

Checking strict positivity of Kraus maps is NP-hard ⋮ Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation ⋮ Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates ⋮ Cryptanalysis of the privacy-preserving ride-hailing service TRACE ⋮ When e-th Roots Become Easier Than Factoring ⋮ Solving structured linear systems with large displacement rank ⋮ Roundoff-Error-Free Algorithms for Solving Linear Systems via Cholesky and LU Factorizations ⋮ Converting between quadrilateral and standard solution sets in normal surface theory

Uses Software

• LinBox

This page was built for publication: Solving sparse rational linear systems