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




Related Items (29)

Design and evaluation of homotopies for efficient and robust continuationThe approximation of generalized turning points by projection methods with superconvergence to the critical parameterEfficient numerical differentiation of implicitly-defined curves for sparse systemsComputing multiple turning points by using simple extended systems and computational differentiationNumerical bifurcation analysis of the bipedal spring-mass modelMonolithic homotopy continuation with predictor based on higher derivativesA relation between Newton and Gauss-Newton steps for singular nonlinear equationsExistence and enclosure results for continua of solutions of parameter- dependent nonlinear boundary value problemsComputation of a simple bifurcation point using one singular value decomposition nearbyAn efficiently implementable Gauss-Newton-like method for solving singular nonlinear equationsComputing multiple pitchfork bifurcation pointsCell repolarization: a bifurcation study of spatio-temporal perturbations of polar cellsA note on solving nonlinear optimization problems in variable precisionA comparison of methods for determining turning points of nonlinear equationsAn efficient algorithm for a class of equality-constrained optimization problemsMinimally extended defining conditions for singularities of codim≤2An indirect method for computing origins for Hopf bifurcation in two- parameter problemsCharacterization and computation of period doubling points by minimally exteded systemsA projection method for computing turning points of nonlinear equationsVariants of the reduced Newton method for nonlinear equality constrained optimization problemsParametrization via secant length and application to path followingComputing hysteresis points of nonlinear equations depending on two parametersLinear sorting with O(log n) processorsComputational error estimates and adaptive processes for some nonlinear structural problemsA quadratically convergent method for computing simple singular roots and its application to determining simple bifurcation pointsNumerical computation of nonsimple turning points and cuspsComputing Multiple Turning PointsComputing simple bifurcation points using a minimally extended system of nonlinear equationsA global analysis of Newton iterations for determining turning points



Cites Work


This page was built for publication: Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter