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

DOI10.1137/0905010MaRDI QIDQ3321341zbMATH OpenOpenAlexWikidataFDO

Authors 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

comparisondeflated block-elimination techniquesNewton's methodpseudo-arclength parametersecond order predictorsimple turning points

Mathematics Subject Classification ID

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

Recommendations

• The Approximate Solution of Defining Equations for Generalized Turning Points
• scientific article; zbMATH DE number 3858319
• A direct method for the determination of non-simple turning points
• A Pseudo-Arclength Continuation Method for Nonlinear Eigenvalue Problems
• Characterization and Computation of Generalized Turning Points

Cited in

(12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3321341)