Previous |  Up |  Next


iterative methods; block matrix; domain decomposition; numerical example
An iterative procedure for systems with matrices originalting from the domain decomposition technique is proposed. The procedure introduces one iteration parameter. The convergence and optimization of the method with respect to the parameter is investigated. The method is intended not as a preconditioner for the CG method but for the independent use.
[1] P. Bjørstad O. Widlund: Iterative methods for the solution of elliptic problems on regions partitioned into substructures. SIAM J. Numer. Anal. 23 (1986); 1097-1120. DOI 10.1137/0723075 | MR 0865945
[2] J. Bramble J. Pasciak A. Schatz: An iterative method for elliptic problems on regions partitioned into substructures. Math. Comput. 4(5 (1986), 361-369. MR 0829613
[3] R. Glowinski G. H. Golub G. A. Meurant J. Périaux: First international symposium on domain decomposition methods for partial differential equations. SIAM, Philadelphia, 1988. MR 0972509
[4] L. D. Marini A. Quarteroni: A relaxation procedure for domain decomposition methods using finite elements. Numer. Math. 55 (1989), 575-598. DOI 10.1007/BF01398917 | MR 0998911
Partner of
EuDML logo