We propose a multi-level type operator that can be used in the framework of operator (or Caldéron) preconditioning to construct uniform preconditioners for negative order operators discretized by piecewise polynomials on a family of possibly locally refined partitions. The cost of applying this multi-level operator scales linearly in the number of mesh cells. Therefore, it provides a uniform preconditioner that can be applied in linear complexity when used within the preconditioning framework from our earlier work [Uniform preconditioners for problems of negative order, Math. Comp. 89 (2020), 645–674]
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
AbstractA new class of preconditioners for the iterative solution of the linear systems arising from...
Using the framework of operator or Caldéron preconditioning, uniform preconditioners are constructed...
In this paper, we consider preconditioning for PDE-constrained optimization problems. The underlying...
In this paper, we introduce a class of recursive multilevel preconditioning strategies suited for so...
In this paper, we introduce a class of recursive multilevel preconditioning strategies suited for so...
In this paper, we introduce a class of recursive multilevel preconditioning strategies suited for so...
In this paper, we introduce a class of recursive multilevel preconditioning strategies suited for so...
. For a sparse linear system Ax = b, preconditioners of the form C = D + L + U , where D is the blo...
A new class of preconditioners for the iterative solution of the linear systems arising from interio...
This paper presents a class of preconditioners for sparse systems arising from discretized partial d...
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
AbstractA new class of preconditioners for the iterative solution of the linear systems arising from...
Using the framework of operator or Caldéron preconditioning, uniform preconditioners are constructed...
In this paper, we consider preconditioning for PDE-constrained optimization problems. The underlying...
In this paper, we introduce a class of recursive multilevel preconditioning strategies suited for so...
In this paper, we introduce a class of recursive multilevel preconditioning strategies suited for so...
In this paper, we introduce a class of recursive multilevel preconditioning strategies suited for so...
In this paper, we introduce a class of recursive multilevel preconditioning strategies suited for so...
. For a sparse linear system Ax = b, preconditioners of the form C = D + L + U , where D is the blo...
A new class of preconditioners for the iterative solution of the linear systems arising from interio...
This paper presents a class of preconditioners for sparse systems arising from discretized partial d...
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
Introduction In recent years, domain decomposition methods have been used extensively to efficiently...
AbstractA new class of preconditioners for the iterative solution of the linear systems arising from...