Verified error bounds for multiple roots of systems of nonlinear equations

Numerical Algorithms

Volumn 54, Issue 3, 2010, Pages 359-377

  Rump, Siegfried M ^a,b,c   Graillat, Stef ^c  

^a HAMBURG UNIVERSITY OF TECHNOLOGY   (Germany)

^b WASEDA UNIVERSITY   (Japan)

^c UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Double roots; Error bounds; INTLAB; Multiple roots; Nonlinear equations; Verification

Indexed keywords

EID: 77953478326     PISSN: 10171398     EISSN: 15729265     Source Type: Journal    
DOI: 10.1007/s11075-009-9339-3     Document Type: Article

References (22)

1. Alefeld, G., Spreuer, H.: Iterative improvement of componentwise errorbounds for invariant subspaces belonging to a double or nearly double eigenvalue. Computing 36, 321-334 (1986).
2. Alt, R., Vignes, J.: Stabilizing Bairstow's method. Comput. Math. Appl. 8(5), 379-387 (1982).
3. Frommer, A., Lang, B., Schnurr, M.: A comparison of the moore and miranda existence test. Computing 72(3-4), 349-354 (2004).
4. Higham, N. J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia (2002).
5. Kanzawa, Y., Oishi, S.: Calculating bifurcation points with guaranteed accuracy. IEICE Trans. Fundam. E82-A(6), 1055-1061 (1999).
6. Kanzawa, Y., Oishi, S.: Imperfect singular solutions of nonlinear equations and a numerical method of proving their existence. IEICE Trans. Fundam. E82-A(6), 1062-1069 (1999).
7. Krawczyk, R.: Newton-algorithmen zur bestimmung von nullstellen mit fehlerschranken. Computing 4, 187-201 (1969).
8. La Porte, M., Vignes, J.: Étude statistique des erreurs dans l'arithmétique des ordinateurs; application au controle des resultats d'algorithmes numériques. Numer. Math. 23, 63-72 (1974).
9. La Porte, M., Vignes, J.: Méthode numérique de détection de la singularité d'une matrice. Numer. Math. 23, 73-81 (1974).
10. MATLAB User's Guide, Version 7. The MathWorks Inc (2004).
11. Moore, R. E.: A Test for Existence of Solutions for Non-Linear Systems. SIAM J. Numer. Anal. (SINUM) 4, 611-615 (1977).
12. Moré, J. J., Cosnard, M. Y.: Numerical solution of non-linear equations. ACM Trans. Math. Software 5, 64-85 (1979).
13. Nakao, M. R.: Numerical verification methods for solutions of ordinary and partial differential equations. Numer. Funct. Anal. Optim. 33(3/4), 321-356 (2001).
14. Neumaier, A.: Introduction to Numerical Analysis. Cambridge University Press, Cambridge (2001).
15. Plum, M., Wieners, Ch.: New solutions of the gelfand problem. J. Math. Anal. Appl. 269, 588-606 (2002).
16. Poljak, S., Rohn, J.: Checking robust nonsingularity is np-hard. Math. of Control, Signals, and Systems 6, 1-9 (1993).
17. Rump, S. M.: Solving algebraic problems with high accuracy. Habilitationsschrift. In: Kulisch, U. W., Miranker, W. L. (eds.) A New Approach to Scientific Computation, pp. 51-120. Academic, New York (1983).
18. Rump, S. M.: INTLAB - INTerval LABoratory. In: Csendes, T. (ed.). Developments in Reliable Computing. pp. 77-104. Kluwer, Dordrecht (1999).
19. Rump, S. M.: Computational Error Bounds for Multiple or Nearly Multiple Eigenvalues. Linear Algebra Appl. (LAA) 324, 209-226 (2001).
20. Rump, S. M. Ten methods to bound multiple roots of polynomials. J. Comput. Appl. Math. (JCAM) 156, 403-432 (2003).
21. Rump, S. M., Zemke, J.: On eigenvector bounds. BIT Numer. Math. 43, 823-837 (2004).
22. Vignes, J.: Algorithmes numériques, analyse et mise en œuvre. 2. Éditions Technip, Paris, 1980. Équations et systèmes non linéaires. [Nonlinear equations and systems], With the collaboration of René Alt and Michèle Pichat, Collection Langages et Algorithmes de l'Informatique.