Newton-Like Pseudo-Arclength Methods for Computing Simple Turning Points

DOI10.1137/0905010zbMath0536.65029OpenAlexW2038525560WikidataQ57397477 ScholiaQ57397477MaRDI QIDQ3321341

Tony F. Chan

Publication date: 1984

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0905010

zbMATH Keywords

comparisonNewton's methoddeflated block-elimination techniquespseudo-arclength parametersecond order predictorsimple turning points

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (11)

Deflated Krylov subspace methods for nearly singular linear systems ⋮ Dynamos in an annulus with fields linear in the axial coordinate ⋮ Conservative high precision pseudo arc-length method for strong discontinuity of detonation wave ⋮ Adaptive continuation algorithms with application to combustion problems ⋮ ‘Unforced’ Navier–Stokes solutions derived from convection in a curved channel ⋮ Weak-convergence theory of quasi-nonnegative splittings for singular matrices. ⋮ Some similarity solutions for three-dimensional boundary layers ⋮ The modified Broyden-variational method for solving nonlinear elliptic differential equations ⋮ An efficient method for solving Bratu equations ⋮ Tracking birth of vortex in flows ⋮ Numerical computation of nonsimple turning points and cusps

This page was built for publication: Newton-Like Pseudo-Arclength Methods for Computing Simple Turning Points