Hiptmair–Xu Preconditioner

In mathematics, Hiptmair–Xu (HX) preconditioners are preconditioners for solving $H(\operatorname)$ and $H(\operatorname)$ problems based on the auxiliary space preconditioning framework. An important ingredient in the derivation of HX preconditioners in two and three dimensions is the so-called regular decomposition, which decomposes a Sobolev space function into a component of higher regularity and a scalar or vector potential. The key to the success of HX preconditioners is the discrete version of this decomposition, which is also known as HX decomposition. The discrete decomposition decomposes a discrete Sobolev space function into a discrete component of higher regularity, a discrete scale or vector potential, and a high-frequency component.

HX preconditioners have been used for accelerating a wide variety of solution techniques, thanks to their highly scalable parallel implementations, and are known as AMS and ADS precondition. HX preconditioner was identified by the U.S. Department of Energy as one of the top ten breakthroughs in computational science in recent years. Researchers from Sandia, Los Alamos, and Lawrence Livermore National Labs use this algorithm for modeling fusion with magnetohydrodynamic equations.E.G. Phillips, J. N. Shadid, E.C. Cyr, S.T. Miller, Enabling Scalable Multifluid Plasma Simulations Through Block Preconditioning. In: van Brummelen H., Corsini A., Perotto S., Rozza G. (eds) Numerical Methods for Flows. Lecture Notes in Computational Science and Engineering, vol 132. Springer, Cham 2020. Moreover, this approach will also be instrumental in developing optimal iterative methods in structural mechanics, electrodynamics, and modeling of complex flows.

HX preconditioner for $H(\operatorname)$

Consider the following $H(\operatorname)$ problem: Find $u \in H_h(\operatorname)$ such that

$(\operatorname~u, \operatorname~v) + \tau (u, v) = (f, v), \quad \forall v \in H_h(\operatorname),$ with $\tau > 0$.

The corresponding matrix form is

$A_ u = f.$

The HX preconditioner for $H(\operatorname)$ problem is defined as

$B_ = S_ + \Pi_h^ \, A_^ \, (\Pi_h^)^T + \operatorname \, A_^ \, (\operatorname)^T,$

where $S_$ is a smoother (e.g., Jacobi smoother, Gauss–Seidel smoother), $\Pi_h^$ is the canonical interpolation operator for $H_h(\operatorname)$ space, $A_$ is the matrix representation of discrete vector Laplacian defined on _h(\operatorname)n,$grad$ is the discrete gradient operator, and $A_$ is the matrix representation of the discrete scalar Laplacian defined on $H_h(\operatorname)$. Based on auxiliary space preconditioning framework, one can show that

$\kappa(B_ A_) \leq C,$

where $\kappa(A)$ denotes the condition number of matrix $A$.

In practice, inverting $A_$ and $A_$ might be expensive, especially for large scale problems. Therefore, we can replace their inversion by spectrally equivalent approximations, $B_$ and $B_$, respectively. And the HX preconditioner for $H(\operatorname)$ becomes
$B_ = S_ + \Pi_h^ \, B_ \, (\Pi_h^)^T + \operatorname B_ (\operatorname)^T.$

HX Preconditioner for $H(\operatorname)$

Consider the following $H(\operatorname)$ problem: Find $u \in H_h(\operatorname)$

$(\operatorname \,u, \operatorname \,v) + \tau (u, v) = (f, v), \quad \forall v \in H_h(\operatorname),$ with $\tau > 0$.

The corresponding matrix form is

$A_ \,u = f.$

The HX preconditioner for $H(\operatorname)$ problem is defined as

$B_ = S_ + \Pi_h^ \, A_^ \, (\Pi_h^)^T + \operatorname \, A_^ \, (\operatorname)^T,$

where $S_$ is a smoother (e.g., Jacobi smoother, Gauss–Seidel smoother), $\Pi_h^$ is the canonical interpolation operator for $H(\operatorname)$ space, $A_$ is the matrix representation of discrete vector Laplacian defined on _h(\operatorname)n, and $\operatorname$ is the discrete curl operator.

Based on the auxiliary space preconditioning framework, one can show that

$\kappa(B_ A_) \leq C.$

For $A_^$ in the definition of $B_$, we can replace it by the HX preconditioner for $H(\operatorname)$ problem, e.g., $B_$, since they are spectrally equivalent. Moreover, inverting $A_$ might be expensive and we can replace it by a spectrally equivalent approximations $B_$. These leads to the following practical HX preconditioner for $H(\operatorname)$ problem,

$B_ = S_ + \Pi_h^ B_ (\Pi_h^)^T + \operatorname B_ (\operatorname)^T = S_ + \Pi_h^ B_ (\Pi_h^)^T + \operatorname S_ (\operatorname)^T + \operatorname \Pi_h^ B_ (\Pi_h^)^T (\operatorname)^T.$

Derivation

The derivation of HX preconditioners is based on the discrete regular decompositions for $H_h(\operatorname)$ and $H_h(\operatorname)$, for the completeness, let us briefly recall them.

Theorem: iscrete regular decomposition for $H_h(\operatorname)$
Let $\Omega$ be a simply connected bounded domain. For any function $v_h\in H_h(\operatorname \Omega)$, there exists a vector$\tilde_h\in H_h(\operatorname \Omega)$, \psi_h\in _h (\operatorname \Omega)3, $p_h\in H_h(\operatorname \Omega)$, such that
$v_h=\tilde_h+\Pi_h^\psi_+ \operatorname p_h$ and$\Vert h^ \tilde_h\Vert + \Vert\psi_h\Vert_1 + \Vert p_h\Vert_1 \lesssim \Vert v_\Vert_$

Theorem: iscrete regular decomposition for $H_(\operatorname)$Let $\Omega$ be a simply connected bounded domain. For any function $v_\in H_(\operatorname \Omega)$, there exists a vector $\widetilde_h\in H_h(\operatorname \Omega)$
, \psi_h\in _h(\operatorname \Omega), $w_h\in H_h(\operatorname \Omega),$
such that
$v_=\widetilde_h+\Pi_h^\psi_h+ \operatorname \, w_h,$
and
$\Vert h^\widetilde_h\Vert + \Vert\psi_h\Vert_1 + \Vert w_h\Vert_1 \lesssim \Vert v_h \Vert_$

Based on the above discrete regular decompositions, together with the auxiliary space preconditioning framework, we can derive the HX preconditioners for $H(\operatorname)$ and $H(\operatorname)$ problems as shown before.

References

{{DEFAULTSORT:Hiptmair-Xu preconditioner
Polynomials