The complex-step Newton method and its convergence

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.

Authors

Institutions

Publication Details

Journal
Numerische Mathematik
Published
2025-05-14
DOI
https://doi.org/10.1007/s00211-025-01471-w
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The complex-step Newton method and its convergence

Dimitrios Mitsotakis
Numerische Mathematik
Matrix Theory and Algorithms
article

The complex-step Newton method and its convergence

Dimitrios Mitsotakis
article en

Abstract

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.

Numerische MathematikVol. 157(3)
Victoria University of Wellington (NZ)
Victoria University of Wellington
Openalex Percentile: Top 88%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The complex-step Newton method and its convergence — Dimitrios Mitsotakis · Numerische Mathematik (2025) | TGRS Research Map | TGRS