Results 281 to 290 of about 59,261 (316)
Some of the next articles are maybe not open access.
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
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\).
Hu, Ning +2 more
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\).
Hu, Ning +2 more
openaire +2 more sources
Multiresolution Approximate Inverse Preconditioners
SIAM Journal on Scientific Computing, 2001Summary: We introduce a new preconditioner for elliptic partial differential equations (PDEs) on unstructured meshes. Using a wavelet-inspired basis we compress the inverse of the matrix, allowing an effective sparse approximate inverse by solving the sparsity vs. accuracy conflict. The key issue in this compression is to use second generation wavelets
Bridson, Robert, Tang, Wei-Pai
openaire +2 more sources
Generalized circulant Strang‐type preconditioners
Numerical Linear Algebra with Applications, 2011SUMMARYStrang's proposal to use a circulant preconditioner for linear systems of equations with a Hermitian positive definite Toeplitz matrix has given rise to considerable research on circulant preconditioners. This paper presents an {eiφ}‐circulant Strang‐type preconditioner. Copyright © 2011 John Wiley & Sons, Ltd.
NOSCHESE, Silvia, Lothar Reichel
openaire +3 more sources
An approximate BDDC preconditioner
Numerical Linear Algebra with Applications, 2007AbstractThe balancing domain decomposition by constraints (BDDC) preconditioner requires direct solutions of two linear systems for each substructure and one linear system for a global coarse problem. The computations and memory needed for these solutions can be prohibitive if any one system is too large.
openaire +1 more source
Circulant Preconditioners Constructed from Kernels
SIAM Journal on Numerical Analysis, 1992The concept of a model operator as a preconditioner is one of the widely used for the solution of large elliptic grid systems. During the last decade it gained a recognition in some ``nonelliptic'' applications like the solution of systems with Toeplitz matrix \(A\) which arise, for example, in signal processing and control theory.
Chan, Raymond H., Yeung, Man-Chung
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
BDDC PRECONDITIONERS FOR ISOGEOMETRIC ANALYSIS
Mathematical Models and Methods in Applied Sciences, 2013A Balancing Domain Decomposition by Constraints (BDDC) preconditioner for Isogeometric Analysis of scalar elliptic problems is constructed and analyzed by introducing appropriate discrete norms. A main result of this work is the proof that the proposed isogeometric BDDC preconditioner is scalable in the number of subdomains and quasi-optimal in the ...
L. Beirao da Veiga +3 more
openaire +4 more sources
Preconditioners for block Toeplitz systems based on circulant preconditioners
Numerical Algorithms, 2001The numerical solution of block Toeplitz systems by preconditioned conjugate gradient methods is considered. Two types of preconditioners based on circulant preconditioners are proposed by combining the ideas which are used in the construction of circulant preconditioners with Toeplitz-like preconditioners.
openaire +2 more sources

