On approximate triangular decompositions in dimension zero

DOI10.1016/J.JSC.2006.12.004MaRDI QIDQ2470055zbMATH OpenOpenAlexFDO

Authors Marc Moreno Maza, Greg Reid, Robin Scott, Wenyuan Wu

Publication date 13 February 2008

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2006.12.004

zbMATH Keywords

polynomial system solvingtriangular decompositionssymbolic-numeric computationsdimension zero

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)

Recommendations

• On approximate linearized triangular decompositions
• Algorithms for computing triangular decomposition of polynomial systems
• scientific article; zbMATH DE number 1736022
• A new method for solving algebraic systems of positive dimension
• scientific article; zbMATH DE number 1500718

Cites work

• scientific article; zbMATH DE number 41286 (Why is no real title available?)
• scientific article; zbMATH DE number 1262421 (Why is no real title available?)
• scientific article; zbMATH DE number 1096865 (Why is no real title available?)
• scientific article; zbMATH DE number 835835 (Why is no real title available?)
• scientific article; zbMATH DE number 3050844 (Why is no real title available?)
• A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
• Algorithm 795
• Approximate radical of ideals with clusters of roots (extended abstract)
• Barycentric Lagrange Interpolation
• Change of ordering for regular chains in positive dimension
• Complexity results for triangular sets
• Computing the multiplicity structure in solving polynomial systems
• Evaluation of Jacobian matrices for Newton's method with deflation to approximate isolated singular solutions of polynomial systems
• Gröbner bases and primary decomposition of polynomial ideals
• Lifting techniques for triangular decompositions
• Numerical Polynomial Algebra
• Numerical decomposition of the solution sets of polynomial systems into irreducible components
• Numerical homotopies to compute generic points on positive dimensional algebraic sets
• On the theories of triangular sets
• Quadratic Newton iteration for systems with multiplicity
• Sharp estimates for triangular sets
• Solving zero-dimensional algebraic systems
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• The RegularChains library in Maple 10
• The effect of wall compliance on the Goertler vortex instability
• The nearest polynomial with a given zero, and similar problems
• The numerical stability of barycentric Lagrange interpolation
• Triangular sets for solving polynomial systems: a comparative implementation of four methods
• Using Galois ideals for computing relative resolvents

Cited in

(6)

• Optimal triangular decompositions of matrices with entries from residuated lattices
• On the complexity of computing with zero-dimensional triangular sets
• ZERO DECOMPOSITION THEOREMS FOR COUNTING THE NUMBER OF SOLUTIONS FOR PARAMETRIC EQUATION SYSTEMS
• Approximate decomposability in and the canonical decomposition of 3-vectors
• scientific article; zbMATH DE number 1736022 (Why is no real title available?)
• On approximate linearized triangular decompositions

Describes a project that uses

Uses Software

• PHCpack
• RegularChains
• SymbolicData
• FRISCO
• Phcmaple

This page was built for publication: On approximate triangular decompositions in dimension zero

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