6 search results - page 1 / 2 » Analysis of non-overlapping domain decomposition algorithms ... |
MOC
1998
13 years 4 months ago
1998
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...
SIAMSC
2011
13 years 4 days ago
2011
The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellb...
VECPAR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
AIPS
1994
13 years 6 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
SIGGRAPH
1992
ACM
13 years 9 months ago
1992
ACM
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...