Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter
From MaRDI portal
Publication:1153651
DOI10.1007/BF02241778zbMath0463.65036OpenAlexW349593503MaRDI QIDQ1153651
Hubert Schwetlick, Gerd Poenisch
Publication date: 1981
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02241778
Numerical computation of solutions to systems of equations (65H10) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)
Related Items (29)
Design and evaluation of homotopies for efficient and robust continuation ⋮ The approximation of generalized turning points by projection methods with superconvergence to the critical parameter ⋮ Efficient numerical differentiation of implicitly-defined curves for sparse systems ⋮ Computing multiple turning points by using simple extended systems and computational differentiation ⋮ Numerical bifurcation analysis of the bipedal spring-mass model ⋮ Monolithic homotopy continuation with predictor based on higher derivatives ⋮ A relation between Newton and Gauss-Newton steps for singular nonlinear equations ⋮ Existence and enclosure results for continua of solutions of parameter- dependent nonlinear boundary value problems ⋮ Computation of a simple bifurcation point using one singular value decomposition nearby ⋮ An efficiently implementable Gauss-Newton-like method for solving singular nonlinear equations ⋮ Computing multiple pitchfork bifurcation points ⋮ Cell repolarization: a bifurcation study of spatio-temporal perturbations of polar cells ⋮ A note on solving nonlinear optimization problems in variable precision ⋮ A comparison of methods for determining turning points of nonlinear equations ⋮ An efficient algorithm for a class of equality-constrained optimization problems ⋮ Minimally extended defining conditions for singularities of codim≤2 ⋮ An indirect method for computing origins for Hopf bifurcation in two- parameter problems ⋮ Characterization and computation of period doubling points by minimally exteded systems ⋮ A projection method for computing turning points of nonlinear equations ⋮ Variants of the reduced Newton method for nonlinear equality constrained optimization problems ⋮ Parametrization via secant length and application to path following ⋮ Computing hysteresis points of nonlinear equations depending on two parameters ⋮ Linear sorting with O(log n) processors ⋮ Computational error estimates and adaptive processes for some nonlinear structural problems ⋮ A quadratically convergent method for computing simple singular roots and its application to determining simple bifurcation points ⋮ Numerical computation of nonsimple turning points and cusps ⋮ Computing Multiple Turning Points ⋮ Computing simple bifurcation points using a minimally extended system of nonlinear equations ⋮ A global analysis of Newton iterations for determining turning points
Cites Work
- Zur Lösung parameterabhängiger nichtlinearer Gleichungen mit singulären Jacobi-Matrizen
- Ein lokal überlinear konvergentes Verfahren zur Bestimmung von Rückkehrpunkten implizit definierter Raumkurven
- Evaluation of branching points for nonlinear boundary-value problems based on the GPM technique
- An efficient algorithm for the determination of certain bifurcation points
- An extension of the Newton-Kantorovic method for solving nonlinear equations with an application to elasticity
- A Method for the Numerical Determination of Bifurcation States of Nonlinear Systems of Equations
- A switching‐parameter algorithm for finding multiple solutions of nonlinear resistive circuits
- Numerical continuation methods for nonlinear equations and bifurcation problems
- The Application of Newton’s Method to the Problem of Elastic Stability
- The Solution of Non-Linear Equations and of Differential Equations with Two-Point Boundary Conditions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter
