Results 1  10
of
4,265
Maximum likelihood from incomplete data via the EM algorithm
 JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B
, 1977
"... A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value situat ..."
Abstract

Cited by 11972 (17 self)
 Add to MetaCart
A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value
A multilevel block incomplete factorization preconditioning
 APPLIED NUMERICAL MATHEMATICS 31 (1999) 209–225
, 1999
"... Incomplete factorization preconditioners based on recursive red–black orderings have been shown efficient for discrete second order elliptic PDEs with isotropic coefficients. However, they suffer for some weakness in presence of anisotropy or grid stretching. Here we propose to combine these orderin ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
these orderings with block incomplete factorization preconditioning techniques. For implementation considerations, the latter are extended to the case where the block pivots are generalized tridiagonal matrices, say matrices that have at most one nonzero entry per row in their strictly upper triangular part
Orderings for incomplete factorization preconditioning of nonsymmetric problems
 SIAM J. SCI. COMPUT
, 1999
"... Numerical experiments are presented whereby the effect of reorderings on the convergence of preconditioned Krylov subspace methods for the solution of nonsymmetric linear systems is shown. The preconditioners used in this study are different variants of incomplete factorizations. It is shown that c ..."
Abstract

Cited by 60 (11 self)
 Add to MetaCart
Numerical experiments are presented whereby the effect of reorderings on the convergence of preconditioned Krylov subspace methods for the solution of nonsymmetric linear systems is shown. The preconditioners used in this study are different variants of incomplete factorizations. It is shown
A scalable parallel algorithm for incomplete factor preconditioning
 SIAM Journal on Scientific Computing
"... Abstract. We describe a parallel algorithm for computing incomplete factor (ILU) preconditioners. The algorithm attains a high degree of parallelism through graph partitioning and a twolevel ordering strategy. Both the subdomains and the nodes within each subdomain are ordered to preserve concurren ..."
Abstract

Cited by 39 (3 self)
 Add to MetaCart
Abstract. We describe a parallel algorithm for computing incomplete factor (ILU) preconditioners. The algorithm attains a high degree of parallelism through graph partitioning and a twolevel ordering strategy. Both the subdomains and the nodes within each subdomain are ordered to preserve
Incomplete Factorization Preconditioning For Linear Least Squares Problems
, 1994
"... this paper is the modified version of GramSchmidt orthogonalization with a rejection test applied right after the formation of the offdiagonal elements of the factor R. For a given rejection parameter 0 / 1, the rejection test is: if r ij ! /= k a ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
this paper is the modified version of GramSchmidt orthogonalization with a rejection test applied right after the formation of the offdiagonal elements of the factor R. For a given rejection parameter 0 / 1, the rejection test is: if r ij ! /= k a
An Efficient Implementation For Ssor And Incomplete Factorization Preconditionings
"... . We investigate methods for efficiently implementing a class of incomplete factorization preconditioners which includes Symmetric Gauss Seidel [9], SSOR [9], generalized SSOR [1], Dupont Kendall Rachford [4], ICCG(0) [7], and MICCG(0) [6]. Our techniques can be extended to similar methods for nonsy ..."
Abstract
 Add to MetaCart
. We investigate methods for efficiently implementing a class of incomplete factorization preconditioners which includes Symmetric Gauss Seidel [9], SSOR [9], generalized SSOR [1], Dupont Kendall Rachford [4], ICCG(0) [7], and MICCG(0) [6]. Our techniques can be extended to similar methods
An Efficient Implementation for SSOR and Incomplete Factorization Preconditionings
"... . We investigate methods for efficiently implementinga class of incomplete factorization preconditioners which includes Symmetric Gauss Seidel [9], SSOR [9], generalized SSOR [1], Dupont Kendall Rachford [4], ICCG(0) [7], and MICCG(0) [6]. Our techniques can be extended to similar methods for nonsym ..."
Abstract
 Add to MetaCart
. We investigate methods for efficiently implementinga class of incomplete factorization preconditioners which includes Symmetric Gauss Seidel [9], SSOR [9], generalized SSOR [1], Dupont Kendall Rachford [4], ICCG(0) [7], and MICCG(0) [6]. Our techniques can be extended to similar methods
On the Implementation of Incomplete Factorization Preconditioning on Workstation Clusters
"... F6.048> d whose diagonal blocks are the different "local" matrices : A d = 2 6 6 6 6 4 A 1 A 2 . . . A n t 3 7 7 7 7 5 : (1) Supported by the "Fonds National de la Recherche Scientifique", Chercheur qualifi'e. 1 Accordingly, we define as right hand s ..."
Abstract
 Add to MetaCart
F6.048> d whose diagonal blocks are the different "local" matrices : A d = 2 6 6 6 6 4 A 1 A 2 . . . A n t 3 7 7 7 7 5 : (1) Supported by the "Fonds National de la Recherche Scientifique", Chercheur qualifi'e. 1 Accordingly, we define as right hand side b d = 2 6 6 4 b 1 b 2 . . . 3 7 7 5 : (2) To these quantities corresponds an extended variable set in which internal boundary nodes are represented a number of times equal to the number of subdomains to which they belongs. This leads us to define on this extended set the operator \Sigma : \Sigma : 8x : 8i : (\Sigmax) i = X j corresponding to the same node as<F10.
Parallel incomplete factorization preconditioning of rotated linear FEM systems
 Computer & Mathematics with Applications
, 2002
"... Abstract. The recent efforts in development of efficient solution methods for nonconforming finite element systems are inspired by their importance for various applications in scientific computations and engineering. This study is focused on the implementation of rotated bilinear elements. A locally ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
locally modified approximation of the global stiffness matrix is proposed allowing for: a) a stable MIC(0) factorization; and b) a scalable parallel implementation. An optimal condition number estimate is derived for the constructed sparse matrix approximation with respect to the original global stiffness
A Study Of Different Orderings For Incomplete Factorization Preconditioning Of Nonsymmetric Linear Systems
, 1998
"... Numerical experiments are presented whereby the effect of reorderings on the convergence of preconditioned Krylov subspace methods for the solution of nonsymmetric linear systems is shown. The preconditioners used in this study are different variants of incomplete factorizations. It is shown that ce ..."
Abstract
 Add to MetaCart
Numerical experiments are presented whereby the effect of reorderings on the convergence of preconditioned Krylov subspace methods for the solution of nonsymmetric linear systems is shown. The preconditioners used in this study are different variants of incomplete factorizations. It is shown
Results 1  10
of
4,265