Multivariate polynomials, duality, and structured matrices

From MaRDI portal
Revision as of 16:41, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1977144

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




Related Items (37)

Multihomogeneous resultant formulae by means of complexesEigenvalue condition numbers and pseudospectra of Fiedler matricesPolynomial-exponential decomposition from momentsAdjusted least squares fitting of algebraic hypersurfacesSchur aggregation for linear systems and determinantsComputations with infinite Toeplitz matrices and polynomialsThe amended DSeSC power method for polynomial root-findingAccurate solution of polynomial equations using Macaulay resultant matricesPolynomial equation solving by lifting procedures for ramified fibersDeformation techniques to solve generalised Pham systemsSymmetric tensor decompositionAsymptotically fast solution of two-level banded Toeplitz systems of linear equationsFinding inverse systems from coordinatesElimination ideal and bivariate resultant over finite fieldsAdditive preconditioning and aggregation in matrix computationsA Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial SystemsSuperfast solution of Toeplitz systems based on syzygy reductionSolving linear systems of equations with randomization, augmentation and aggregationOn the computation of matrices of traces and radicals of idealsOverdetermined Weierstrass iteration and the nearest consistent systemQR-algebraic method for approximating zeros of system of polynomialsSolving a sparse system using linear algebraSuperfast algorithms for Cauchy-like matrix computations and extensionsOn the structure of positive semi-definite finite rank general domain Hankel and Toeplitz operators in several variablesComputation of a specified root of a polynomial system of equations using eigenvectorsStructured low rank decomposition of multivariate Hankel matricesRelations between roots and coefficients, interpolation and application to system solvingUnivariate polynomials: Nearly optimal algorithms for numerical factorization and root-findingRandomized preprocessing of homogeneous linear systems of equationsNew progress in real and complex polynomial root-findingESPRIT for Multidimensional General GridsA unified approach to resultant matrices for Bernstein basis polynomialsGeometric complexity theory V: Efficient algorithms for Noether normalizationA generalized flat extension theorem for moment matricesThe Hitchhiker guide to: secant varieties and tensor decompositionSymbolic and numeric methods for exploiting structure in constructing resultant matricesExact solution of corner-modified banded block-Toeplitz eigensystems



Cites Work




This page was built for publication: Multivariate polynomials, duality, and structured matrices