Abstract

We describe algorithms for Newton-like interval methods on vector computers. These methods converge under relatively weak conditions to the solution of systems arising from discretizations of nonlinear elliptic PDE. The methods combine the ideas of Newton-like methods and fast solvers by using interval arithmetic tools.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call