Multiple zeros of nonlinear systems
From MaRDI portal
Publication:3094284
DOI10.1090/S0025-5718-2011-02462-2zbMath1242.65102arXiv2103.05738OpenAlexW2041176477MaRDI QIDQ3094284
Barry H. Dayton, Zhonggang Zeng, Tien-Yien Li
Publication date: 24 October 2011
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.05738
algorithmmultiplicitynonlinear systemsnonlinear systemalgebraic geometrynumerical resultmultiple zeros
Related Items (35)
On deflation and multiplicity structure ⋮ A heuristic method for certifying isolated zeros of polynomial systems ⋮ Efficient optimal eighth-order derivative-free methods for nonlinear equations ⋮ Improved two-step Newton's method for computing simple multiple zeros of polynomial systems ⋮ On the complexity of computing the topology of real algebraic space curves ⋮ Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one ⋮ A certified iterative method for isolated singular roots ⋮ Isolating clusters of zeros of analytic systems using arbitrary-degree inflation ⋮ Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros ⋮ The equivalent representation of the breadth-one \(D\)-invariant polynomial subspace and its discretization ⋮ Computing the multiplicity structure of an isolated singular solution: case of breadth one ⋮ A Newton’s iteration converges quadratically to nonisolated solutions too ⋮ Two-step Newton's method for deflation-one singular zeros of analytic systems ⋮ Squarefree normal representation of zeros of zero-dimensional polynomial systems ⋮ On a novel fourth-order algorithm for solving systems of nonlinear equations ⋮ Construction of optimal derivative-free techniques without memory ⋮ The Pitchfork Bifurcation ⋮ Multidimensional realisation theory and polynomial system solving ⋮ Some iterative methods free from derivatives and their basins of attraction for nonlinear equations ⋮ Numerical approximation of multiple isolated roots of analytical systems ⋮ A multi-step class of iterative methods for nonlinear systems ⋮ A new deflation method for verifying the isolated singular zeros of polynomial systems ⋮ New predictor-corrector methods with high efficiency for solving nonlinear systems ⋮ Two optimal eighth-order derivative-free classes of iterative methods ⋮ Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves ⋮ Real Root Isolation of Polynomial Equations Based on Hybrid Computation ⋮ On isolation of simple multiple zeros and clusters of zeros of polynomial systems ⋮ Enumerating Rigid Sphere Packings ⋮ Numerical solution of nonlinear systems by a general class of iterative methods with application to nonlinear PDEs ⋮ Verified error bounds for singular solutions of nonlinear systems ⋮ On the Sensitivity of Singular and Ill-Conditioned Linear Systems ⋮ Two complementary block Macaulay matrix algorithms to solve multiparameter eigenvalue problems ⋮ Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition ⋮ Locating the closest singularity in a polynomial homotopy ⋮ Accurate solution of near-colliding Prony systems via decimation and homotopy continuation
Uses Software
Cites Work
- Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
- Hilbert functions of graded algebras
- Isolated points, duality and residues
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Determining dimension of the solution component that contains a computed zero of a polynomial system
- Newton's method with deflation for isolated singularities of polynomial systems
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations
- A Singular Introduction to Commutative Algebra
- Géométrie des points épais
- Numerical calculation of the multiplicity of a solution to algebraic equations
- Computing multiple roots of inexact polynomials
- Using Algebraic Geometry
- Numerical Polynomial Algebra
- On multiplicities in polynomial system solving
- SINGULAR
- Computing the multiplicity structure in solving polynomial systems
- Computing the multiplicity structure from geometric involutive form
- A Rank-Revealing Method with Updating, Downdating, and Applications
- 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
This page was built for publication: Multiple zeros of nonlinear systems
