Results 261 to 270 of about 5,336 (304)
Design of a Library of Parallel Preconditioners
The International Journal of High Performance Computing Applications, 2000 The authors outline the design principles underlying the ParPre library of parallel preconditioners. ParPre is a message-passing library of distributed preconditioners for linear systems, written using MPI and Petsc. It comprises Schwarz methods, Schur system domain decompositioning, various parallel incomplete factorizations, and multilevel methods.
Tony F. Chan, Victor Eijkhout
openaire +3 more sources
Approximate inverse-free preconditioners for Toeplitz matrices
Applied Mathematics and Computation, 2011 In this paper, we propose approximate inverse-free preconditioners for solving Toeplitz systems. The preconditioners are constructed based on the famous Gohberg-Semencul formula.
You-Wei Wen +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Scientific Computing, 1997
In analogy with the multigrid method, the authors present a solution method for problems based on the \(p\)-version of the finite element method whereby degrees of freedom associated with approximation order \(p\) are visited at once and separately from those of approximation order \(p-1\) and \(p+1\).
Ning Hu, Xian-Zhong Guo, I. Norman Katz
openaire +2 more sources
In analogy with the multigrid method, the authors present a solution method for problems based on the \(p\)-version of the finite element method whereby degrees of freedom associated with approximation order \(p\) are visited at once and separately from those of approximation order \(p-1\) and \(p+1\).
Ning Hu, Xian-Zhong Guo, I. Norman Katz
openaire +2 more sources
Robust preconditioners for incompressible MHD models
Journal of Computational Physics, 2016 In this paper, we develop two classes of robust preconditioners for the structure preserving discretization of the incompressible magnetohydrodynamics (MHD) system.
Kaibo Hu, Xiaozhe Hu, Jinchao Xu
exaly +2 more sources
Optimal Equivalent Preconditioners
SIAM Journal on Numerical Analysis, 1993Preconditioning strategies for elliptic partial differential operators and their discrete counterparts are compared by a model problem. The technique uses a selfadjoint positive definite operator \(B\) as the preconditioner for the nonselfadjoint convection-diffusion operator \(A\). Preconditioning is done by \(A\)'s leading term plus a positive zeroth
Manteuffel, Thomas, Otto, James
openaire +1 more source
Applied Numerical Mathematics, 1998
This is the second part of a paper concerned with the use of successive overrelaxation (SOR) as a preconditioner for the nonsymmetric iterative solver GMRES [for the first part see ibid. 18, 431-440 (1995; Zbl 0840.65018)]. The focus of the second part is on parallel implementation issues.
DeLong, M. A., Ortega, J. M.
openaire +1 more source
This is the second part of a paper concerned with the use of successive overrelaxation (SOR) as a preconditioner for the nonsymmetric iterative solver GMRES [for the first part see ibid. 18, 431-440 (1995; Zbl 0840.65018)]. The focus of the second part is on parallel implementation issues.
DeLong, M. A., Ortega, J. M.
openaire +1 more source
A Multilevel AINV Preconditioner
Numerical Algorithms, 2002An algebraic multilevel approximate inverse preconditioner, which uses the same design as the algebraic multigrid algorithm, is proposed for solving efficiently symmetric positive definite sparse linear systems in conjunction with preconditioned conjugate gradient method.
openaire +2 more sources
Applied Numerical Mathematics, 2017
Preconditioning is usually necessary for CG-type iterative algorithms for the solution of large sparse nonsymmetric linear systems. However, many good preconditioners have only marginal intrinsic parallelism -- ILU and SSOR in the natural ordering are essentially sequential algorithms.
DeLong, M. A., Ortega, J. M.
openaire +3 more sources
Preconditioning is usually necessary for CG-type iterative algorithms for the solution of large sparse nonsymmetric linear systems. However, many good preconditioners have only marginal intrinsic parallelism -- ILU and SSOR in the natural ordering are essentially sequential algorithms.
DeLong, M. A., Ortega, J. M.
openaire +3 more sources
A Schwarz Preconditioner for the Cubed-Sphere
SIAM Journal on Scientific Computing, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephen J. Thomas +3 more
openaire +2 more sources
Some Remarks on a Multigrid Preconditioner
SIAM Journal on Scientific Computing, 1994A class of multilevel preconditioners is studied. A simple proof for optimal estimate of conditioning is given. Numerical examples are presented.
Jinchao Xu, Jinshui Qin
openaire +2 more sources