Skip to main content
Log in

Bounding Perturbations in Zeros of Nonlinear Systems

  • Published:
Reliable Computing

Abstract

Algorithms for determining computationally rigorous componentwise bounds on the solutions xR n of equations F(x, t) = 0 ∈ R m containing parameters tR l due to small perturbations in t when mn and when F is at most twice continuously differentiable in x and in t are described. Numerical results which illustrate the behaviour of the algorithms are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Alefeld, G. and Herzberger, J.: Introduction to Interval Computations, Academic Press, London, 1983.

    Google Scholar 

  2. Ben-Israel, A. and Greville, T. N. E.: Generalized Inverses: Theory and Applications, John Wiley & Sons, New York, 1974.

    Google Scholar 

  3. Campbell, S. L. and Meyer, C. D.: Generalized Inverses of Linear Transformations, Dover Publications Inc., New York, 1991.

    Google Scholar 

  4. Gay, D. M.: Computing Perturbation Bounds for Nonlinear Algebraic Equations, SIAM J. Numer. Anal. 20 (1983), pp. 638–651.

    Google Scholar 

  5. Greville, T. N. E.: The Pseudoinverse of a Rectangular or Singular Matrix and Its Application to the Solution of Systems of Linear Equations, SIAM Review 1 (1959), pp. 38–43.

    Google Scholar 

  6. Hammer, R., Hocks, M., Kulisch, U., and Ratz, D.: Numerical Toolbox for Verified Computing I, Springer-Verlag, Berlin Heidelberg, 1993.

    Google Scholar 

  7. Kearfott, R. B.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, Dordrecht, 1996.

    Google Scholar 

  8. Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990.

    Google Scholar 

  9. Neumaier, A.: Rigorous Sensitivity Analysis for Parameter-Dependent Systems of Equations, Journal of Mathematical Analysis and Applications 144 (1989), pp. 16–25.

    Google Scholar 

  10. Ortega, J. M. and Rheinboldt, W. C.: Iterative Solution of Systems of Nonlinear AlgebraicEquations, Academic Press, London, 1970.

    Google Scholar 

  11. Penrose, R.: A Generalized Inverse for Matrices, Proc. Camb. Phil. Soc. 51 (1955), pp. 406–413.

    Google Scholar 

  12. Rheinboldt, W. C.: Numerical Analysis of Parametrized Nonlinear Equations, John Wiley & Sons, New York, 1986.

    Google Scholar 

  13. Walker, H. F.: Newton-Like Methods for Underdetermined Systems, in: Algower, E. L. and Georg, K. (eds), Computational Solutions of Nonlinear Systems of Equations, Lecture Notes in Applied Mathematics 26, American Mathematical Society, Providence, 1990, pp. 679–699.

    Google Scholar 

  14. Wolfe, M. A.: Interval Mathematics, Algebraic Equations and Optimization, Journal of Computational and Applied Mathematics 124 (2000), pp. 263–280.

    Google Scholar 

  15. Wolfe, M. A.: On Bounding Solutions of Underdetermined Systems, Reliable Computing 7 (3) (2001), pp. 195–207.

    Google Scholar 

  16. Yamamura, K., Kawata, H., and Tokue, A.: Interval Solution of Nonlinear Equations Using Linear Programming, BIT 38 (1) (1998), pp. 186–199.

    Google Scholar 

  17. Zhang, D., Li, W., and Shen, Z.: Solving Undetermined Systems with Interval Methods, Reliable Computing 5(1) (1999), pp. 23–33.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wolfe, M.A. Bounding Perturbations in Zeros of Nonlinear Systems. Reliable Computing 8, 177–188 (2002). https://doi.org/10.1023/A:1015559628657

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1015559628657

Keywords

Navigation