R. Suda. New Iterative Linear Solvers for Parallel Circuit Simulation. PhD thesis, Department of Information Sciences, University of Tokio, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Experiments With Sparse Preconditioning of Dense.. - Carpentieri, Duff.. (1999) (Correct)
....two di erent levels of incompleteness, rather than one as in the other approximate inverse methods. This usually leads to a large number of user de ned parameters and in general to a deterioration in the quality of the approximate inverse. References to this class can be found in [2] 15] and [40]. 8 3 Test problems. In this paper, we analyse the performance of some preconditioned iterative solvers in the solution of dense, complex, symmetric, non Hermitian systems arising from integral formulation of electromagnetic scattering. We use the following Krylov methods: restarted GMRES ....
R. Suda. New Iterative Linear Solvers for Parallel Circuit Simulation. PhD thesis, Department of Information Sciences, University of Tokio, 1996.
A Comparative Study Of Sparse Approximate Inverse Preconditioners - Benzi, Tuma (1998) (16 citations) (Correct)
.... proposed to construct factorized sparse approximate inverse preconditioners based on the following two stage process: first an incomplete LU factorization A L U is computed using standard techniques, and then the incomplete factors L and U are approximately inverted; see [2] 33] 69] [70], 73] There Sparse Approximate Inverse Preconditioners 17 are various possibilities for computing approximate inverses of L and U , each leading to a different preconditioner. Here we give only a very brief description, referring the interested reader to the original papers for more ....
.... U Gamma1 by forward and back substitution, respectively. Sparsity is preserved by dropping in the solution vectors, either on the basis of position (more generally, using a level of fill scheme) or on the basis of a drop tolerance. Several such schemes have been described in detail in [33] [70], 73] Some authors have proposed to drop in x i = L Gamma1 e i and y i = U Gamma1 e i once the exact solution has been computed, but a more practical scheme is to drop during the substitution process, rather than after [73] The preconditioners in this class share some of the ....
R. Suda. New Iterative Linear Solvers for Parallel Circuit Simulation. Ph.D. thesis, Department of Information Sciences, University of Tokyo, 1996.
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