1971
DOI: 10.1007/bf01420899
|View full text |Cite
|
Sign up to set email alerts
|

Newton's method for convex nonlinear elliptic boundary value problems

Abstract: Summary. Newton's method is applied to solving the boundary value problem for the equation L u =/(x, u) where L is a linear second order uniformly elliptic operator and ](x, u) is a convex monotone increasing function of u for each point x in the domain D. The Newton iterates are shown to converge uniformly, quadratically and monotonically downward to the solution of the problem. The convergence is independent of the choice for the initial Newton iterate. Numerical results are presented for several problems of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1971
1971
1985
1985

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…Others have recently generalized them for linear, variable coefficient PDE's in three spatial dimensions.6,11 These techniques have been shown to be practical and efficient for these problems.7,21 Moreover, for nonlinear static PDE's in two spatial dimensions, these ideas have been extended and shown to be very efficient. 23,25 When (if) these techniques mature, the solution of PDE's in two and even three spatial dimensions will be several orders of magnitude cheaper than it currently is, both in terms of computer time and memory.…”
Section: Whither the State Of The Art?mentioning
confidence: 99%
“…Others have recently generalized them for linear, variable coefficient PDE's in three spatial dimensions.6,11 These techniques have been shown to be practical and efficient for these problems.7,21 Moreover, for nonlinear static PDE's in two spatial dimensions, these ideas have been extended and shown to be very efficient. 23,25 When (if) these techniques mature, the solution of PDE's in two and even three spatial dimensions will be several orders of magnitude cheaper than it currently is, both in terms of computer time and memory.…”
Section: Whither the State Of The Art?mentioning
confidence: 99%