Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials
From MaRDI portal
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
- Superfast computations with singular structured matrices over abstract fields
Cited in
(9)- The shifted number system for fast linear algebra on integer matrices
- Symbolic-numeric QD-algorithms with applications in function theory and linear algebra
- Unified nearly optimal algorithms for structured integer matrices
- Efficient algorithms for computing the Jacobi symbol. (Extended abstract)
- 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)