Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization

Symbolic computation and algebraic computation (68W30) Linear equations (linear algebraic aspects) (15A06) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Toeplitz, Cauchy, and related matrices (15B05)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
Matrix multiplication via arithmetic progressions
Exact solution of linear equations using p-adic expansions
Fast solution of toeplitz systems of equations and computation of Padé approximants
Algebraic methods for Toeplitz-like matrices and operators
Asymptotically fast solution of Toeplitz and related systems of linear equations
Stability of Methods for Solving Toeplitz Systems of Equations
Solving sparse linear equations over finite fields
A stabilized superfast solver for nonsymmetric Toeplitz systems
How bad are Hankel matrices?
Randomized preprocessing versus pivoting
Schur aggregation for linear systems and determinants
Randomized preprocessing of homogeneous linear systems of equations
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
On Computations with Dense Structured Matrices
Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
Certified dense linear system solving
Displacement ranks of matrices and linear equations
Complexity of multiplication with vectors for structured matrices
Hensel and Newton Methods in Valuation Rings
Lower bounds for the condition number of Vandermonde matrices
On practical algorithms for accelerated matrix multiplication
How Can We Speed Up Matrix Multiplication?
Complexity of parallel matrix computations
Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations
Parallel computation of polynomial GCD and some related parallel computations over abstract fields
Acceleration of Euclidean Algorithm and Rational Number Reconstruction
Exact solutions to linear systems of equations using output sensitive lifting
Randomized preconditioning of the MBA algorithm
Numeric-symbolic exact rational linear system solver
Degeneration of structured integer matrices modulo an integer
Solving structured linear systems with large displacement rank

Cited In (3)

Microcomputer symbolic generation of an optimal Crout algorithm for sparse systems of linear equations
Transformations of matrix structures work again
Iterative refinement for linear programming

This page was built for publication: Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization

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