Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials

DOI10.1145/1577190.1577209MaRDI QIDQ2959023zbMATH OpenOpenAlexWikidataFDO

Authors Victor Y. Pan, Brian Murphy, Rhys Eric Rosholt

Publication date 3 February 2017

Published in Proceedings of the 2009 conference on Symbolic numeric computation (Search for Journal in Brave)

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

zbMATH Keywords

Hensel liftingiterative refinement

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20) Symbolic computation and algebraic computation (68W30)

Recommendations

• Unified nearly optimal algorithms for structured integer matrices
• Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
• scientific article; zbMATH DE number 1445400
• Solving Hankel systems over the integers
• scientific article; zbMATH DE number 2125598

Cited in

(9)

• The shifted number system for fast linear algebra on integer matrices
• scientific article; zbMATH DE number 1639652 (Why is no real title available?)
• Unified nearly optimal algorithms for structured integer matrices
• scientific article; zbMATH DE number 1113842 (Why is no real title available?)
• scientific article; zbMATH DE number 1445400 (Why is no real title available?)
• Algorithms for structured linear systems solving and their implementation
• Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
• Degeneration of structured integer matrices modulo an integer
• An effective algorithm of computing symbolic determinants with multivariate polynomial entries

This page was built for publication: Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials

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