Multivariate polynomials, duality, and structured matrices

DOI10.1006/jcom.1999.0530zbMath0963.68232OpenAlexW2011114755MaRDI QIDQ1977144

Pan, Victor Y., Mourrain, Bernard

Publication date: 12 June 2001

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00073171/file/RR-3513.pdf

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items

Multihomogeneous resultant formulae by means of complexes, Eigenvalue condition numbers and pseudospectra of Fiedler matrices, Polynomial-exponential decomposition from moments, Adjusted least squares fitting of algebraic hypersurfaces, Schur aggregation for linear systems and determinants, Computations with infinite Toeplitz matrices and polynomials, The amended DSeSC power method for polynomial root-finding, Accurate solution of polynomial equations using Macaulay resultant matrices, Polynomial equation solving by lifting procedures for ramified fibers, Deformation techniques to solve generalised Pham systems, Symmetric tensor decomposition, Asymptotically fast solution of two-level banded Toeplitz systems of linear equations, Finding inverse systems from coordinates, Elimination ideal and bivariate resultant over finite fields, Additive preconditioning and aggregation in matrix computations, A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems, Superfast solution of Toeplitz systems based on syzygy reduction, Solving linear systems of equations with randomization, augmentation and aggregation, On the computation of matrices of traces and radicals of ideals, Overdetermined Weierstrass iteration and the nearest consistent system, QR-algebraic method for approximating zeros of system of polynomials, Solving a sparse system using linear algebra, Superfast algorithms for Cauchy-like matrix computations and extensions, On the structure of positive semi-definite finite rank general domain Hankel and Toeplitz operators in several variables, Computation of a specified root of a polynomial system of equations using eigenvectors, Structured low rank decomposition of multivariate Hankel matrices, Relations between roots and coefficients, interpolation and application to system solving, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, Randomized preprocessing of homogeneous linear systems of equations, New progress in real and complex polynomial root-finding, ESPRIT for Multidimensional General Grids, A unified approach to resultant matrices for Bernstein basis polynomials, Geometric complexity theory V: Efficient algorithms for Noether normalization, A generalized flat extension theorem for moment matrices, The Hitchhiker guide to: secant varieties and tensor decomposition, Symbolic and numeric methods for exploiting structure in constructing resultant matrices, Exact solution of corner-modified banded block-Toeplitz eigensystems

Cites Work

• Multidimensional structured matrices and polynomial systems
• The number of roots of a system of equations
• Computing the isolated roots by matrix methods
• Product formulas for resultants and Chow forms
• Algorithms for residues and Łojasiewicz exponents
• Approximate real polynomial division via approximate inversion of real triangular Toeplitz matrices
• A unifying approach to some old and new theorems on distribution and clustering
• On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
• Asymptotic acceleration of solving multivariate polynomial systems of equations
• Computing Multidimensional Residues
• Matrix eigenproblems are at the heart of polynomial system solving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item