Generalization of the numerical Schwarz algorithm
Conference
·
OSTI ID:5398436
The Schwarz alternating method of decomposing the domain has lately been found to be an effective means for solving elliptic partial differential equations on a multiprocessing computing system. In this paper, the method is recast into numerical linear algebra so that classical techniques of acceleration can be applied. Computional results using an incomplete-factorization as a pre-conditioner are given. A study of the effects of convergence by varying the subdomains is made.
- Research Organization:
- Lawrence Livermore National Lab., CA (USA)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 5398436
- Report Number(s):
- UCRL-90030; CONF-831256-1; ON: DE84003735
- Country of Publication:
- United States
- Language:
- English
Similar Records
Inner/outer iterative methods and numerical Schwarz algorithms - II
Parallel Newton-Krylov-Schwarz algorithms for the transonic full potential equation
Newton-Krylov-Schwarz algorithms for the 2D full potential equation
Conference
·
Wed May 01 00:00:00 EDT 1985
·
OSTI ID:5595190
Parallel Newton-Krylov-Schwarz algorithms for the transonic full potential equation
Journal Article
·
Wed Dec 31 23:00:00 EST 1997
· SIAM Journal on Scientific Computing
·
OSTI ID:599817
Newton-Krylov-Schwarz algorithms for the 2D full potential equation
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:440679