Newton's method for gradient equations based upon the fixed point map: Convergence and complexity study
DOI10.1007/BF01389333zbMATH Open0675.65111OpenAlexW2021132089MaRDI QIDQ1122341FDOQ1122341
Authors: Joseph W. Jerome
Publication date: 1989
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133374
Recommendations
Numerical computation of solutions to systems of equations (65H10) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites Work
- Title not available (Why is that?)
- Elliptic Partial Differential Equations of Second Order
- Metric entropy and approximation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation of nonlinear evolution systems
- Title not available (Why is that?)
- Parameter Selection for Newton-Like Methods Applicable to Nonlinear Partial Differential Equations
- Approximate Newton methods and homotopy for stationary operator equations
- An adaptive Newton algorithm based on numerical inversion: Regularization as postconditioner
Cited In (5)
- Multistep approximation algorithms: Improved convergence rates through postconditioning with smoothing kernels
- Newton iteration for partial differential equations and the approximation of the identity
- Newton methods for stationary points: an elementary view of regularity conditions and solution schemes
- Numerical approximation of PDE system fixed-point maps via Newton's method
- An adaptive Newton algorithm based on numerical inversion: Regularization as postconditioner
This page was built for publication: Newton's method for gradient equations based upon the fixed point map: Convergence and complexity study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122341)