Structured matrices and polynomials: unified superfast algorithms

Authors:
Victor Y. Pan
Affiliations:
Lehman College, CUNY, Bronx, NY
Venue:
Structured matrices and polynomials: unified superfast algorithms
Year:
2001

Citing 0
Cited 49

Univariate polynomials: nearly optimal algorithms for factorization and rootfinding

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Symbolic and numeric methods for exploiting structure in constructing resultant matrices

Journal of Symbolic Computation
Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Randomized Acceleration of Fundamental Matrix Computations

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Acceleration of Euclidean algorithm and extensions

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Cited References

Computer algebra handbook
On the hardness of approximating the permanent of structured matrices

Computational Complexity
Displacement rank of the Drazin inverse

Journal of Computational and Applied Mathematics
Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile

Theoretical Computer Science - Algebraic and numerical algorithm
Iterative inversion of structured matrices

Theoretical Computer Science - Algebraic and numerical algorithm
Improved algorithms for computing determinants and resultants

Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
On the complexities of multipoint evaluation and interpolation

Theoretical Computer Science
Solving structured linear systems of large displacement rank

ACM Communications in Computer Algebra
The schur aggregation for solving linear systems of equations

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Null space and eigenspace computations with additive preprocessing

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Real root-finding

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Solving toeplitz- and vandermonde-like linear systems with large displacement rank

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration

Computers & Mathematics with Applications
Matrix-vector multiplication in sub-quadratic time: (some preprocessing required)

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Additive preconditioning and aggregation in matrix computations

Computers & Mathematics with Applications
An Algorithm for Transforming Regular Chain into Normal Chain

Computer Mathematics
Solving structured linear systems with large displacement rank

Theoretical Computer Science
Preface

Theoretical Computer Science
Computations with quasiseparable polynomials and matrices

Theoretical Computer Science
Schur aggregation for linear systems and determinants

Theoretical Computer Science
Preconditioning, randomization, solving linear systems, eigen-solving, and root-finding

Proceedings of the 2009 conference on Symbolic numeric computation
Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials

Proceedings of the 2009 conference on Symbolic numeric computation
The amended DSeSC power method for polynomial root-finding

Computers & Mathematics with Applications
Efficient Public Key Encryption Based on Ideal Lattices

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Block-based transceivers with minimum redundancy

IEEE Transactions on Signal Processing
On the complexity of circuit satisfiability

Proceedings of the forty-second ACM symposium on Theory of computing
Additive preconditioning for matrix computations

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Extending Cardinal's algorithm to a broader class of structured matrices

ACM Communications in Computer Algebra
Real and complex polynomial root-finding with eigen-solving and preprocessing

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Computing specified generators of structured matrix inverses

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Memoryless block transceivers with minimum redundancy based on Hartley transforms

Signal Processing
Algebraic and numerical algorithms

Algorithms and theory of computation handbook
Applications of FFT and structured matrices

Algorithms and theory of computation handbook
New progress in real and complex polynomial root-finding

Computers & Mathematics with Applications
Preface

Theoretical Computer Science
Randomized preconditioning of the MBA algorithm

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Root-finding by expansion with independent constraints

Computers & Mathematics with Applications
Practical divide-and-conquer algorithms for polynomial arithmetic

CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Acceleration of the inversion of triangular Toeplitz matrices and polynomial division

CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
Advancing matrix computations with randomized preprocessing

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Univariate polynomial root-finding by arming with constraints

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Real and complex polynomial root-finding by means of eigen-solving

CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Multi-dimensional Capon spectral estimation using discrete Zhang neural networks

Multidimensional Systems and Signal Processing
Preface

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

Structure matrices serve as a natural bridge between the areas of algebraic computations with polynomials and numerical matrix computations, allowing cross-fertilization of both fields. This book covers most fundamental numerical and algebraic computations with Toeplitz, Hankel, Vandermonde, Cauchy, and other popular structured matrices. Throughout the computations, the matrices are represented by their compressed images, called displacements, enabling both a unified treatment of various matrix structures and dramatic saving of computer time and memory. The resulting superfast algorithms allow further dramatic parallel acceleration using FFT and fast sine and cosine transforms.