Deterministic reduction of integer nonsingular linear system solving to matrix multiplication

DOI10.1145/3326229.3326263MaRDI QIDQ5120475zbMATH OpenOpenAlexWikidataFDO

Authors Stavros Birmpilis, Arne Storjohann, G. Labahn

Publication date 10 September 2020

Published in Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

derandomizationexact linear algebrainteger matriceslinear system solving

Mathematics Subject Classification ID

Linear equations (linear algebraic aspects) (15A06) Numerical linear algebra (65F99)

Recommendations

• Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
• The shifted number system for fast linear algebra on integer matrices
• High-order lifting and integrality certification
• Deterministic unimodularity certification
• scientific article; zbMATH DE number 1305088

Cited in

(4)

• A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
• Solving norm equations in global function fields
• Optimal fine-grained hardness of approximation of linear equations
• Degeneration of structured integer matrices modulo an integer

This page was built for publication: Deterministic reduction of integer nonsingular linear system solving to matrix multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120475)