On approximate triangular decompositions in dimension zero
From MaRDI portal
Publication:2470055
DOI10.1016/j.jsc.2006.12.004zbMath1146.68484MaRDI QIDQ2470055
Marc Moreno Maza, Wenyuan Wu, Greg Reid, Robin Scott
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
68W30: Symbolic computation and algebraic computation
13P05: Polynomials, factorization in commutative rings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gröbner bases and primary decomposition of polynomial ideals
- Solving zero-dimensional algebraic systems
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- On the theories of triangular sets
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- Quadratic Newton iteration for systems with multiplicity
- Complexity results for triangular sets
- Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
- Approximate radical of ideals with clusters of roots
- The effect of wall compliance on the Goertler vortex instability
- Algorithm 795
- Barycentric Lagrange Interpolation
- The numerical stability of barycentric Lagrange interpolation
- Sharp estimates for triangular sets
- The nearest polynomial with a given zero, and similar problems
- Numerical Polynomial Algebra
- Lifting techniques for triangular decompositions
- Computing the multiplicity structure in solving polynomial systems
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Using Galois ideals for computing relative resolvents
