Computation of a simple bifurcation point using one singular value decomposition nearby
From MaRDI portal
Publication:1362831
DOI10.1007/BF02684346zbMath0880.65024OpenAlexW1499481339MaRDI QIDQ1362831
Publication date: 2 February 1998
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02684346
singular value decompositionquadratic convergenceLU factorizationdirect methodJacobian matrixbordered matrixsimple bifurcation points
Related Items (4)
Rank deficiencies and bifurcation into affine subspaces for separable parameterized equations ⋮ Solving rank-deficient separable nonlinear equations ⋮ Spatially quasi-periodic bifurcations from periodic traveling water waves and a method for detecting bifurcations using signed singular values ⋮ Newton's method for singular nonlinear equations using approximate left and right nullspaces of the Jacobian
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on computing simple bifurcation points
- Computing simple bifurcation points using a minimally extended system of nonlinear equations
- Singularities and groups in bifurcation theory. Volume I
- Numerical methods in bifurcation problems. Lectures delivered at the Indian Institute of Science, Bangalore, under the T.I.F.R.-I.I.Sc. Programme in Applications of Mathematics. Notes by A. K. Nandakumaran and Mythily Ramaswamy
- An efficiently implementable Gauss-Newton-like method for solving singular nonlinear equations
- Bifurcations via singular value decompositions
- Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter
- Characterization and Computation of Generalized Turning Points
- Continuity of the null space basis and constrained optimization
- Characterization and Computation of Singular Points with Maximum Rank Deficiency
This page was built for publication: Computation of a simple bifurcation point using one singular value decomposition nearby
