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

Authors:
Victor Y. Pan;Brian Murphy;Rhys E. Rosholt
Affiliations:
Lehman College of the City University of New York, Bronx, NY, USA;Lehman College of the City University of New York, Bronx, NY, USA;Lehman College of the City University of New York, Bronx, NY, USA
Venue:
Proceedings of the 2009 conference on Symbolic numeric computation
Year:
2009

Citing 12
Cited 1

Solving sparse linear equations over finite fields

IEEE Transactions on Information Theory
SIMP (Single Instruction stream/Multiple instruction Pipelining): a novel high-speed single-processor architecture

ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Modular arithmetic for linear algebra computations in the real field

Journal of Symbolic Computation
Structured matrices and polynomials: unified superfast algorithms

Structured matrices and polynomials: unified superfast algorithms
Acceleration of Euclidean Algorithm and Rational Number Reconstruction

SIAM Journal on Computing
On Wiedemann's Method of Solving Sparse Linear Systems

AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Approximate algorithms to derive exact solutions to systems of linear equations

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
On computing the determinant and Smith form of an integer matrix

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Modern Computer Algebra

Modern Computer Algebra
Solving structured linear systems with large displacement rank

Theoretical Computer Science
Schur aggregation for linear systems and determinants

Theoretical Computer Science

Algebraic and numerical algorithms

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our unified superfast algorithms for solving Toeplitz, Hankel, Vandermonde, Cauchy, and other structured linear systems of equations with integer coefficients combine Hensel's symbolic lifting and numerical iterative refinement and run in nearly optimal randomized Boolean time for both solution and its correctness verification. The algorithms and nearly optimal time bounds are extended to some fundamental computations with univariate polynomials that have integer coefficients. Furthermore, we develop lifting modulo powers of two to implement our algorithms in the binary mode within a fixed precision.