Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The complex-step Newton method and its convergence (2312.08395v2)

Published 12 Dec 2023 in math.NA and cs.NA

Abstract: Considered herein is a modified Newton method for the numerical solution of nonlinear equations where the Jacobian is approximated using a complex-step derivative approximation. We show that this method converges for sufficiently small complex-step values, which need not be infinitesimal. Notably, when the individual derivatives in the Jacobian matrix are approximated using the complex-step method, the convergence is linear and becomes quadratic as the complex-step approaches zero. However, when the Jacobian matrix is approximated by the nonlinear complex-step derivative approximation, the convergence rate remains quadratic for any appropriately small complex-step value, not just in the limit as it approaches zero. This claim is supported by numerical experiments. Additionally, we demonstrate the method's robust applicability in solving nonlinear systems arising from differential equations, where it is implemented as a Jacobian-free Newton-Krylov method.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (18)
  1. M. Ablowitz and A. Fokas. Complex variables: Introduction and applications. Cambridge University Press, 2003.
  2. Geometric numerical integration: Structure-preserving algorithms for ordinary differential equations. Springer-Verlag Berlin Heidelberg, 2006.
  3. E. Hairer and G. Wanner. Solving ordinary differential equations II: Stiff and differential-algebraic problems. Springer-Verlag Berlin Heidelberg, 1996.
  4. Extension of complex step finite difference method to Jacobian-free Newton–Krylov method. Journal of Computational and Applied Mathematics, 399:113732, 2022.
  5. On optimal order error estimates for the nonlinear Schrödinger equation. SIAM Journal on numerical analysis, 30:377–400, 1993.
  6. C. Kelley. Iterative method for linear and nonlinear equations. SIAM, Philadelphia, 1995.
  7. C. Kelley. Newton’s method in mixed precision. SIAM Review, 64:191–211, 2022.
  8. P. Kevrekidis. The Discrete Nonlinear Schrödinger Equation. Springer Berlin, Heidelberg, 2009.
  9. D. Knoll and D. Keyes. Jacobian-free Newton–Krylov methods: a survey of approaches and applications. Journal of Computational Physics, 193:357–397, 2004.
  10. J. Lyness and C. Moler. Numerical differentiation of analytic functions. SIAM Journal on Numerical Analysis, 4:202–210, 1967.
  11. A surface of heteroclinic connections between two saddle slow manifolds in the Olsen model. International Journal of Bifurcation and Chaos, 30:2030048, 2020.
  12. L. Olsen. An enzyme reaction with a strange attractor. Physics Letters A, 94(9):454–457, 1983.
  13. J. Ortega. Numerical analysis: A second course. SIAM, Philadelphia, 1990.
  14. J. Ortega and W. Rheinboldt. Iterative solution of nonlinear equations in several variables. SIAM, Philadelphia, 2000.
  15. Y. Saad. Iterative methods for sparse linear systems. SIAM, Philadelphia, 2003.
  16. Numerical Hamiltonian problems. Chapman and Hall/CRC Press, London, 1994.
  17. W. Squire and G. Trapp. Using complex variables to estimate derivatives of real functions. SIAM review, 40:110–112, 1998.
  18. J.L. Taylor. Foundations of Analysis. American Mathematical Society, 2012.

Summary

We haven't generated a summary for this paper yet.