论文信息 - Parallel algorithms for the capacitance matrix method in domain decompositions

Parallel algorithms for the capacitance matrix method in domain decompositions

We characterize the capacitance matrix associated with domain decompositions by spectral collocation methods for the solution of elliptic problems. Richardson and conjugate gradient iterations with preconditioners wel suited for computation in a parallel environment are discussed. The spectral properties of the preconditioned capacitance matrix are analyzed, also for the case of substructures with internal vertices.

A. Quarteroni | A. Quarteroni | G. Sacchi-Landriani | G. Sacchi-Landriani

[1] Alfio Quarteroni,et al. An Iterative Procedure with Interface Relaxation for Domain Decomposition Methods , 1988 .

[2] Philip Rabinowitz,et al. Methods of Numerical Integration , 1985 .

[3] Christine Bernardi,et al. Properties of some weighted Sobolev spaces and application to spectral approximations , 1989 .

[4] Alfio Quarteroni,et al. A relaxation procedure for domain decomposition methods using finite elements , 1989 .

[5] R. Cottle. Manifestations of the Schur complement , 1974 .

[6] J. Lions,et al. Non-homogeneous boundary value problems and applications , 1972 .

[7] T. Chan. Analysis of preconditioners for domain decomposition , 1987 .

[8] Gene H. Golub,et al. Matrix computations , 1983 .

[9] T. A. Zang,et al. Spectral methods for fluid dynamics , 1987 .

[10] Daniele Funaro,et al. Domain decomposition methods for pseudo spectral approximations , 1987 .

[11] Daniele Funaro. A multidomain spectral approximation of elliptic equations , 1986 .

[12] J. Pasciak,et al. The Construction of Preconditioners for Elliptic Problems by Substructuring. , 2010 .