Efficient Computation of Singular Points

DOI10.1093/IMANUM/9.3.421MaRDI QIDQ3831942zbMATH OpenOpenAlexFDO

Authors Peter Kunkel

Publication date 1989

Published in IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/imanum/9.3.421

zbMATH Keywords

convergence rateGauss-Newton methodMoore-Penrose pseudoinversesingular solutions

Mathematics Subject Classification ID

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

Recommendations

• The Gauss-Newton method for finding singular solutions to systems of nonlinear equations
• Direct Methods for Solving Singular Nonlinear Equations
• scientific article; zbMATH DE number 124988
• Computation of singular points
• Efficient continuation Newton-like method for solving systems of non-linear equations

Cited in

(12)

• A numerical method for branch points of a system of nonlinear algebraic equations
• Computation of cusp singularities for operator equations and their discretizations
• Real-time computation of singular vectors
• A projection method for computing turning points of nonlinear equations
• Efficient computation of dual space and directional multiplicity of an isolated point
• Newton's method with deflation for isolated singularities of polynomial systems
• A special extended system and a Newton-like method for simple singular nonlinear equations
• An incremental method for computing dominant singular spaces
• Computation of singular points
• scientific article; zbMATH DE number 3965329 (Why is no real title available?)
• scientific article; zbMATH DE number 4041176 (Why is no real title available?)
• Fast and accurate spectral treatment of coordinate singularities

This page was built for publication: Efficient Computation of Singular Points

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