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 [Math. of Comp., 322(89) (2020), pp. 645-674].
Coupled multiphysics problems often give rise to interface conditions naturally formulated in fractional Sobolev spaces. Here, both positive and negative fractionality are common. When designing efficient solvers for discretizations of such problems it would then be useful to have a preconditioner for the fractional Laplacian, $(-Δ)^s$, with $s \in [-1,1]$. Previously, additive multigrid preconditioners for the case when $s \geq 0$ have been proposed. In this work we complement this construction with auxiliary space preconditioners suitable when $s \leq 0$. These preconditioners are shown to b…
Using the framework of operator or Caldéron preconditioning, uniform preconditioners are constructed for elliptic operators of order $2s \in [0,2]$ discretized with continuous finite (or boundary) elements. The cost of the preconditioner is the cost of the application an elliptic opposite order operator discretized with discontinuous or continuous finite elements on the same mesh, plus minor cost of linear complexity. Herewith the construction of a so-called dual mesh is avoided.
A new preconditioner is developed for high order finite element approximation of linear elastic problems on triangular meshes in two dimensions. The new preconditioner results in a condition number that is bounded independently of the degree $p$, the mesh-size $h$ and the ratio $λ/μ$. The resulting condition number is reduced to roughly $6.0$ for all values of the parameters and discretization parameters on standard test problems. Crucially, the overall cost of the new preconditioner is comparable to the cost of applying standard domain decomposition based preconditioners.
We propose a uniform block-diagonal preconditioner for condensed $H$(div)-conforming HDG schemes for parameter-dependent saddle point problems, including the generalized Stokes equations and the linear elasticity equations. An optimal preconditioner is obtained for the stiffness matrix on the global velocity/displacement space via the auxiliary space preconditioning (ASP) technique \cite{Xu96}. A spectrally equivalent approximation to the Schur complement on the element-wise constant pressure space is also constructed, and an explicit computable exact inverse is obtained via the Woodbury matri…
When solving a multi-physics problem one often decomposes a monolithic system into simpler, frequently single-physics, subproblems. A comprehensive solution strategy may commonly be attempted, then, by means of combining strategies devised for the constituent subproblems. When decomposing the monolithic problem, however, it may be that requiring a particular scaling for one subproblem enforces an undesired scaling on another. In this manuscript we consider the H(div)-based mixed formulation of the Darcy problem as a single-physics subproblem; the hydraulic conductivity, K, is considered intrin…
In this paper, we develop subspace correction preconditioners for discontinuous Galerkin (DG) discretizations of elliptic problems with $hp$-refinement. These preconditioners are based on the decomposition of the DG finite element space into a conforming subspace, and a set of small nonconforming edge spaces. The conforming subspace is preconditioned using a matrix-free low-order refined technique, which in this work we extend to the $hp$-refinement context using a variational restriction approach. The condition number of the resulting linear system is independent of the granularity of the mes…
Solution methods for the nonlinear partial differential equation of the Rudin-Osher-Fatemi (ROF) and minimum-surface models are fundamental for many modern applications. Many efficient algorithms have been proposed. First order methods are common. They are popular due to their simplicity and easy implementation. Some second order Newton-type iterative methods have been proposed like Chan-Golub-Mulet method. In this paper, we propose a new Newton-Krylov solver for primal-dual finite element discretization of the ROF model. The method is so simple that we just need to use some diagonal precondit…
In this paper we study the linear systems arising from discretized poroelasticity problems. We formulate one block preconditioner for the two-filed Biot model and several preconditioners for the classical three-filed Biot model under the unified relationship framework between well-posedness and preconditioners. By the unified theory, we show all the considered preconditioners are uniformly optimal with respect to material and discretization parameters. Numerical tests demonstrate the robustness of these preconditioners.
This work presents uniform preconditioners for the discrete Laplace--Beltrami operator on hypersurfaces. In particular, within the framework of fast auxiliary space preconditioning (FASP), we develop efficient and user-friendly multilevel preconditioners for the Laplace--Beltrami type equation discretized by Lagrange, nonconforming linear, and discontinuous Galerkin elements. The analysis applies to semi-definite problems on a closed surface. Numerical experiments on 2d surfaces and 3d hypersurfaces are presented to illustrate the efficiency of the proposed preconditioners.
In this paper we consider a class of unfitted finite element methods for scalar elliptic problems. These so-called CutFEM methods use standard finite element spaces on a fixed unfitted triangulation combined with the Nitsche technique and a ghost penalty stabilization. As a model problem we consider the application of such a method to the Poisson interface problem. We introduce and analyze a new class of preconditioners that is based on a subspace decomposition approach. The unfitted finite element space is split into two subspaces, where one subspace is the standard finite element space assoc…
Using the framework of operator or Calderón preconditioning, uniform preconditioners are constructed for elliptic operators discretized with continuous finite (or boundary) elements. The preconditioners are constructed as the composition of an opposite order operator, discretized on the same ansatz space, and two diagonal scaling operators.
In this paper, we design preconditioners for the matrix-free solution of high-order continuous and discontinuous Galerkin discretizations of elliptic problems based on FEM-SEM equivalence and additive Schwarz methods. The high-order operators are applied without forming the system matrix, making use of sum factorization for efficient evaluation. The system is preconditioned using a spectrally equivalent low-order ($p=1$) finite element operator discretization on a refined mesh. The low-order refined mesh is anisotropic and not shape regular in the polynomial degree of the high-order operator, …
This paper provides a provably quasi-optimal preconditioning strategy of the linear Schrödinger eigenvalue problem with periodic potentials for a possibly non-uniform spatial expansion of the domain. The quasi-optimality is achieved by having the iterative eigenvalue algorithms converge in a constant number of iterations for different domain sizes. In the analysis, we derive an analytic factorization of the spectrum and asymptotically describe it using concepts from the homogenization theory. This decomposition allows us to express the eigenpair as an easy-to-calculate cell problem solution co…
Robust Preconditioners for DG-Discretizations with Arbitrary Polynomial Degrees
Institut für Geometrie und Praktische Mathematik, RWTH Aachen（亚琛工业大学几何与应用数学研究所）；Dipartimento di Scienze Matematiche, Politecnico di Torino（都灵理工大学数学科学系）
Discrete Edge Multiscale Space based Hybrid Schwarz Preconditioner for High-Frequency Helmholtz Problems
Eastern Institute for Advanced Study, Eastern Institute of Technology（宁波东方理工大学高级研究院）；School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen（香港中文大学（深圳）理工学院）；Department of Mathematics, The University of Hong Kong（香港大学数学系）；Department of Mathematics, Purdue University（普渡大学数学系）
For a prescribed porosity, the coupled magma/mantle flow equations can be formulated as a two-field system of equations with velocity and pressure as unknowns. Previous work has shown that while optimal preconditioners for the two-field formulation can be obtained, the construction of preconditioners that are uniform with respect to model parameters is difficult. This limits the applicability of two-field preconditioners in certain regimes of practical interest. We address this issue by reformulating the governing equations as a three-field problem, which removes a term that was problematic in…
Two-level hybrid Schwarz preconditioners with preasymptotic piecewise-polynomial coarse spaces for the high-frequency Helmholtz equation
University College London（伦敦大学学院）；University of Bath（巴斯大学）；Sorbonne Université, Université Paris Cité, CNRS, INRIA, Laboratoire Jacques-Louis Lions（索邦大学，巴黎西岱大学，法国国家科学研究中心，法国国家信息与自动化研究所，雅克-路易·利翁斯实验室）
We consider multilevel decompositions of piecewise constants on simplicial meshes that are stable in $H^{-s}$ for $s\in (0,1)$. Proofs are given in the case of uniformly and locally refined meshes. Our findings can be applied to define local multilevel diagonal preconditioners that lead to bounded condition numbers (independent of the mesh-sizes and levels) and have optimal computational complexity. Furthermore, we discuss multilevel norms based on local (quasi-)projection operators that allow the efficient evaluation of negative order Sobolev norms. Numerical examples and a discussion on seve…
In this paper, we study a parallel-in-time (PinT) algorithm for all-at-once system from a non-local evolutionary equation with weakly singular kernel where the temporal term involves a non-local convolution with a weakly singular kernel and the spatial term is the usual Laplacian operator with variable coefficients. We propose to use a two-sided preconditioning technique for the all-at-once discretization of the equation. Our preconditioner is constructed by replacing the variable diffusion coefficients with a constant coefficient to obtain a constant-coefficient all-at-once matrix. We split a…
The auxiliary space preconditioning (ASP) technique is applied to the HDG schemes for three different elliptic problems with a parameter dependent low order term, namely, a symmetric interior penalty HDG scheme for the scalar reaction-diffusion equation, a divergence-conforming HDG scheme for a vectorial reaction-diffusion equation, and a C 0 -continuous interior penalty HDG scheme for the generalized biharmonic equation with a low order term. Uniform preconditioners are obtained for each case and the general ASP theory by J. Xu [21] is used to prove the optimality with respect to the mesh siz…
In this paper, we analyze the spectra of the preconditioned matrices arising from discretized multi-dimensional Riesz spatial fractional diffusion equations. The finite difference method is employed to approximate the multi-dimensional Riesz fractional derivatives, which will generate symmetric positive definite ill-conditioned multi-level Toeplitz matrices. The preconditioned conjugate gradient method with a preconditioner based on the sine transform is employed to solve the resulting linear system. Theoretically, we prove that the spectra of the preconditioned matrices are uniformly bounded …
Freezing Calderón: Robust Preconditioning for Maxwell Scattering under Shape Uncertainty
Facultad de Ingeniería y Ciencias, Universidad Adolfo Ibáñez（阿道夫·伊巴涅斯大学工程与科学学院）；Department of Mathematics and Digital Futures, KTH Royal Institute of Technology（瑞典皇家理工学院数学与数字未来系）；Inria Chile（法国国家信息与自动化研究所智利分部）
Folding grid value vectors of size $2^L$ into $L$th order tensors of mode sizes $2\times \cdots\times 2$, combined with low-rank representation in the tensor train format, has been shown to lead to highly efficient approximations for various classes of functions. These include solutions of elliptic PDEs on nonsmooth domains or with oscillatory data. This tensor-structured approach is attractive because it leads to highly compressed, adaptive approximations based on simple discretizations. Standard choices of the underlying basis, such as piecewise multilinear finite elements on uniform tensor …
Optimal solvers for fourth-order PDEs discretized on unstructured grids
LSEC, Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and System Sciences, Chinese Academy of Sciences（中国科学院数学与系统科学研究院计算数学与科学工程计算研究所）；Center for Computational Mathematics and Applications, Department of Mathematics, The Pennsylvania State University（宾夕法尼亚州立大学数学系计算数学与应用中心）
A Two-Level Method for Mimetic Finite Difference Discretizations of Elliptic Problems
Politecnico di Milano（米兰理工大学）；Penn State University（宾夕法尼亚州立大学）；Institute of Mathematics and Informatics, Bulgarian Academy of Sciences（保加利亚科学院数学与信息学研究所）
We propose an adaptive multigrid preconditioning technology for solving linear systems arising from Discontinuous Petrov-Galerkin (DPG) discretizations. Unlike standard multigrid techniques, this preconditioner involves only trace spaces defined on the mesh skeleton, and it is suitable for adaptive hp-meshes. The key point of the construction is the integration of the iterative solver with a fully automatic and reliable mesh refinement process provided by the DPG technology. The efficacy of the solution technique is showcased with numerous examples of linear acoustics and electromagnetic simul…
