A Newton method for systems of m equations in n variables.
From MaRDI portal
(Redirected from Publication:1875221)
A Newton method for systems of \(m\) equations in \(n\) variables.
A Newton method for systems of \(m\) equations in \(n\) variables.
Recommendations
- A generalization of the Newton-Kantorovich method for systems of nonlinear real equations
- scientific article; zbMATH DE number 1270378
- Generalized equations and the generalized Newton method
- Newton's method for singular nonlinear equations using approximate left and right nullspaces of the Jacobian
- New versions of Newton method: step-size choice, convergence domain and under-determined equations
Cited in
(11)- A direct Newton method for calculus of variations
- Deterministic quantum dense coding networks
- Sparse solutions of optimal control via Newton method for under-determined systems
- Using low-rank approximation of the Jacobian matrix in the Newton-Raphson method to solve certain singular equations
- Repeated play and Newton's method.
- Variable dimension Newton-Raphson method
- A generalization of the Newton-Kantorovich method for systems of nonlinear real equations
- Partial Newton methods for a system of equations
- scientific article; zbMATH DE number 3994925 (Why is no real title available?)
- New versions of Newton method: step-size choice, convergence domain and under-determined equations
- A Newton’s iteration converges quadratically to nonisolated solutions too
This page was built for publication: A Newton method for systems of \(m\) equations in \(n\) variables.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1875221)