Verified error bounds for multiple roots of systems of nonlinear equations
DOI10.1007/s11075-009-9339-3zbMath1201.65081OpenAlexW2168526415MaRDI QIDQ5962124
Siegfried Michael Rump, Stef Graillat
Publication date: 16 September 2010
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-009-9339-3
verificationsystem of nonlinear equationsnumerical exampleserror boundseigenvalue problemsmultivariate polynomialsmultiple rootsdouble rootsINTLAB
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to systems of equations (65H10) Algorithms with automatic result verification (65G20) Numerical computation of roots of polynomial equations (65H04)
Related Items (18)
Uses Software
Cites Work
- Unnamed Item
- Iterative improvement of componentwise error bounds of invariant subspaces belonging to a double or nearly double eigenvalue
- Stabilizing Bairstow's method
- Méthode numérique de detection de la singularite d'une matrice
- Ten methods to bound multiple roots of polynomials
- On eigenvector bounds
- New solutions of the Gelfand problem
- Checking robust nonsingularity is NP-hard
- A comparison of the Moore and Miranda existence tests
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- NUMERICAL VERIFICATION METHODS FOR SOLUTIONS OF ORDINARY AND PARTIAL DIFFERENTIAL EQUATIONS
- A Test for Existence of Solutions to Nonlinear Systems
- Numerical Solution of Nonlinear Equations
- Introduction to Numerical Analysis
- Accuracy and Stability of Numerical Algorithms
- Computational error bounds for multiple or nearly multiple eigenvalues
This page was built for publication: Verified error bounds for multiple roots of systems of nonlinear equations