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 size and uniformity with respect to the low order parameter.
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…
In this study, we present an $hp$-multigrid preconditioner for a divergence-conforming HDG scheme for the generalized Stokes and the Navier-Stokes equations using an augmented Lagrangian formulation. Our method relies on conforming simplicial meshes in two- and three-dimensions. The $hp$-multigrid algorithm is a multiplicative auxiliary space preconditioner that employs the lowest-order space as the auxiliary space, and we developed a geometric multigrid method as the auxiliary space solver. For the generalized Stokes problem, the crucial ingredient of the geometric multigrid method is the equ…
This paper presents a study of large linear systems resulting from the regular $B$-splines finite element discretization of the $\bm{curl}-\bm{curl}$ and $\bm{grad}-div$ elliptic problems on unit square/cube domains. We consider systems subject to both homogeneous essential and natural boundary conditions. Our objective is to develop a preconditioning strategy that is optimal and robust, based on the Auxiliary Space Preconditioning method proposed by Hiptmair et al. \cite{hiptmair2007nodal}. Our approach is demonstrated to be robust with respect to mesh size, and we also show how it can be com…
We modify the well-known interior penalty finite element discretization method so that it allows for element-by-element assembly. This is possible due to the introduction of additional unknowns associated with the interfaces between neighboring elements. The resulting bilinear form, and a Schur complement (reduced) version of it, are utilized in a number of auxiliary space preconditioners for the original conforming finite element discretization problem. These preconditioners are analyzed on the fine scale and their performance is illustrated on model second order scalar elliptic problems disc…
This paper presents and studies an approach for constructing auxiliary space preconditioners for finite element problems using a constrained nonconforming reformulation, that is based on a proposed modified version of the mortar method. The well-known mortar finite element discretization method is modified to admit a local structure, providing an element-by-element or subdomain-by-subdomain assembly property. This is achieved via the introduction of additional trace finite element spaces and degrees of freedom (unknowns) associated with the interfaces between adjacent elements or subdomains. T…
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.
The main difficulty in solving the discrete source or eigenvalue problems of the operator $ d^*d $ with iterative methods is to deal with its huge kernel, for example, the $ \nabla \times \nabla \times $ and $- \nabla ( \nabla \cdot ) $ operator. In this paper, we construct a kind of auxiliary schemes for their discrete systems based on Hodge Laplacian on de Rham complex. The spectra of the new schemes are Laplace-like. Then many efficient iterative methods and preconditioning techniques can be applied to them. After getting the solutions of the auxiliary schemes, the desired solutions of the …
Legendre-Gauss-Lobatto grids and associated nested dyadic grids
Institut für Geometrie und Praktische Mathematik, RWTH Aachen（亚琛工业大学几何与实际数学研究所）；Dipartimento di Scienze Matematiche, Politecnico di Torino（都灵理工大学数学科学系）
