L. Kolotilina, A. Nikishin, and A. Yeremin, Factorized sparse approximate inverse (FSAI) preconditionings for solving 3D FE systems on massively parallel computers II, in Iterative Methods in Linear Algebra, Proc of the IMACS International Symposium, Brussels, April 2-4, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Parallel Preconditioning with Sparse Approximate Inverses - Grote, Huckle (1997) (87 citations) (Correct)
....set of di#cult test problems we consider at the end shows that our algorithm produces a sparse and e#ective preconditioner. The computation of approximate inverses, based on minimizing (4) has been proposed by several authors. Kolotilina and Yeremin [11] Kolotilina, Nikishin, and Yeremin [12]; and Lifshitz, Nikishin, and Yeremin [13] compute a factorized sparse approximate inverse but only consider fixed sparsity patterns. Grote and Simon solve 840 M. J. GROTE AND T. HUCKLE (4) explicitly but only allow for a banded sparsity pattern in M [9] 10] The approach of Cosgrove, Diaz, ....
L. YU.KOLOTILINA,A.A.NIKISHIN, AND A. YU.YEREMIN, Factorized sparse approximate inverse (FSAI) preconditionings for solving 3D FE systems on massively parallel computers II, Iterative Methods in Linear Algebra, in Proceedings of the IMACS International Symposium, R. Beauwens and P. de Groen, eds., Brussels, 1992, pp. 311--312.
An MPI Implementation of the SPAI Preconditioner on the T3E - Barnard, Bernardo, Simon (1997) (9 citations) (Correct)
....can be solved in parallel. Here e k = 0; 0; 1; 0; 0) T . The difficulty lies in determining a good sparsity structure for M, so that the solution of (3) yields an effective preconditioner, and a considerable amount of research has already been done in that direction (Yeremin et al. [6, 7, 8], Grote and Simon [9] Cosgrove, Diaz and Griewank [10] Chow and Saad [11] and Grote and Huckle [2] For the rest of this paper we shall restrict ourselves to SPAI, the method proposed by Grote and Huckle [2] and to spai 1.1, a parallel implementation of SPAI written by one us (Barnard [5] A ....
L.Yu. Kolotilina, A.A. Nikishin and A.Yu. Yeremin, Factorized Sparse Approximate Inverse (FSAI) Preconditionings for Solving 3D FE Systems on Massively Parallel Computers II, in R. Beauwens and P. de Groen, editors, Iterative Meth. in Lin. Alg., Proc. of the IMACS Internat. Sympos., Brussels, pages 311-312, 1991.
Parallel Sparse Approximate Inverse Preconditioner - Deshpande, Grote, Messmer.. (1996) (Correct)
....multiplication an operation which can also be performed in parallel. The difficulty lies in determining a good sparsity structure of the approximate inverse, otherwise the solution of (4) will not yield an effective preconditioner. Yeremin et al. compute a factorized sparse approximate inverse [13, 12, 14], but only consider fixed sparsity patterns. Simon and Grote [9] solve (4) explicitly, but only allow for a banded sparsity pattern in M . The approach of Cosgrove, Diaz, and Griewank [5] Chow and Saad [4] and Grote and Huckle [11, 10] all suggest methods which capture the sparsity pattern of ....
L. Yu. Kolotilina, A. A. Nikishin, and A. Yu. Yeremin. Factorized Sparse Approximate Inverse (FSAI) Preconditionings for Solving 3D FE Systems on Massively Parallel Computers II. In R. Beauwens and P. de Groen, editors, Iterative Meth. in Lin. Alg., Proc. of the IMACS Internat. Sympos., Brussels, pages 311--312, 1991.
Sparse Approximate Inverse Smoother for Multigrid - Tang, Wan (1999) (9 citations) Self-citation (Approximate) (Correct)
No context found.
L. Kolotilina, A. Nikishin, and A. Yeremin, Factorized sparse approximate inverse (FSAI) preconditionings for solving 3D FE systems on massively parallel computers II, in Iterative Methods in Linear Algebra, Proc of the IMACS International Symposium, Brussels, April 2-4, 1991.
Parallel Implementation of a Sparse Approximate Inverse.. - Deshpande, Grote, al. (1996) (7 citations) Self-citation (Sparse Inverse) (Correct)
....multiplication an operation which can also be performed in parallel. The difficulty lies in determining a good sparsity structure of the approximate inverse, otherwise the solution of (4) will not yield an effective preconditioner. Yeremin et al. compute a factorized sparse approximate inverse [15, 14, 16], but only consider fixed sparsity patterns. Simon and Grote [10] solve (4) explicitly, but only allow for a banded sparsity pattern in M . The approach of Cosgrove, Diaz, and Griewank [5] Chow and Saad [4] and Grote and Huckle [12, 11] all suggest methods which capture the sparsity pattern of ....
L. Yu. Kolotilina, A. A. Nikishin, and A. Yu. Yeremin. Factorized Sparse Approximate Inverse (FSAI) Preconditionings for Solving 3D FE Systems on Massively Parallel Computers II. In R. Beauwens and P. de Groen, editors, Iterative Meth. in Lin. Alg., Proc. of the IMACS Internat. Sympos., Brussels, pages 311--312, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC