Using low-rank approximation of the Jacobian matrix in the Newton-Raphson method to solve certain singular equations

DOI10.1016/j.cam.2014.04.024zbMath1294.65056OpenAlexW1979551146MaRDI QIDQ2253058

Stepan~Yu. Gatilov

Publication date: 25 July 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2014.04.024

zbMATH Keywords

convergencecomputer-aided geometric designnumerical examplesNewton-Raphson methodpseudoinversesurface-surface intersectionpredictor-corrector approach

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items

Remanufacturing supply chain coordination under the stochastic remanufacturability rate and the random demand ⋮ Gauss-Newton-type methods for bilevel optimization

Cites Work

• Unnamed Item
• Unnamed Item
• GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems
• Tracing surface intersections
• Improved test for closed loops in surface intersections
• Newton's method for analytic systems of equations with constant rank derivatives
• Differential geometry of intersection curves of two surfaces
• Generalized inverses: theory and computations
• A Newton-Raphson method for the solution of systems of equations
• Introduction to Numerical Continuation Methods
• Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization

This page was built for publication: Using low-rank approximation of the Jacobian matrix in the Newton-Raphson method to solve certain singular equations