An official website of the United States government
Abstract We propose a uniform block-diagonal preconditioner for condensed $$H$$(div)-conforming hybridizable discontinuous Galerkin 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 technique (Xu (1994) The Auxiliary Space Method and Optimal Multigrid Preconditioning Techniques for Unstructured Grids, vol. 56. International GAMM-Workshop on Multi-level Methods (Meisdorf), pp. 215–235). 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 matrix identity. Finally, the numerical results verify the robustness of our proposed preconditioner with respect to model parameters and mesh size.
more »
« less
A field‐split preconditioning technique for fluid‐structure interaction problems with applications in biomechanics
Abstract We present a novel preconditioning technique for Krylov subspace algorithms to solve fluid‐structure interaction (FSI) linearized systems arising from finite element discretizations. An outer Krylov subspace solver preconditioned with a geometric multigrid (GMG) algorithm is used, where for the multigrid level subsolvers, a field‐split (FS) preconditioner is proposed. The block structure of the FS preconditioner is derived using the physical variables as splitting strategy. To solve the subsystems originated by the FS preconditioning, an additive Schwarz (AS) block strategy is employed. The proposed FS preconditioner is tested on biomedical FSI applications. Both 2D and 3D simulations are carried out considering aneurysm and venous valve geometries. The performance of the FS preconditioner is compared with that of a second preconditioner of pure domain decomposition type.
more »
« less
- Award ID(s):
- 1912902
- PAR ID:
- 10453790
- Publisher / Repository:
- Wiley Blackwell (John Wiley & Sons)
- Date Published:
- Journal Name:
- International Journal for Numerical Methods in Biomedical Engineering
- Volume:
- 36
- Issue:
- 3
- ISSN:
- 2040-7939
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract We study a framework that allows to solve the coarse problem in the FETI‐DP method approximately. It is based on the saddle‐point formulation of the FETI‐DP system with a block‐triangular preconditioner. One of the blocks approximates the coarse problem, for which we use the multilevel BDDC method as the main tool. This strategy then naturally leads to a version of multilevel FETI‐DP method, and we show that the spectra of the multilevel FETI‐DP and BDDC preconditioned operators are essentially the same. The theory is illustrated by a set of numerical experiments, and we also present a few experiments when the coarse solve is approximated by algebraic multigrid.more » « less
-
Summary We construct an algebraic multigrid (AMG) based preconditioner for the reduced Hessian of a linear‐quadratic optimization problem constrained by an elliptic partial differential equation. While the preconditioner generalizes a geometric multigrid preconditioner introduced in earlier works, its construction relies entirely on a standard AMG infrastructure built for solving the forward elliptic equation, thus allowing for it to be implemented using a variety of AMG methods and standard packages. Our analysis establishes a clear connection between the quality of the preconditioner and the AMG method used. The proposed strategy has a broad and robust applicability to problems with unstructured grids, complex geometry, and varying coefficients. The method is implemented using the Hypre package and several numerical examples are presented.more » « less
-
Abstract Problems arising in Earth's mantle convection involve finding the solution to Stokes systems with large viscosity contrasts. These systems contain localized features which, even with adaptive mesh refinement, result in linear systems that can be on the order of 109or more unknowns. One common approach for preconditioning to the velocity block of these systems is to apply an Algebraic Multigrid (AMG) V‐cycle (as is done in the ASPECT software, for example), however, we find that AMG is lacking robustness with respect to problem size and number of parallel processes. Additionally, we see an increase in iteration counts with refinement when using AMG. In contrast, the Geometric Multigrid (GMG) method, by using information about the geometry of the problem, should offer a more robust option.Here we present a matrix‐free GMG V‐cycle which works on adaptively refined, distributed meshes, and we will compare it against the current AMG preconditioner (Trilinos ML) used in theASPECT1software. We will demonstrate the robustness of GMG with respect to problem size and show scaling up to 114,688 cores and 217 billion unknowns. All computations are run using the open‐source, finite element librarydeal.II.2more » « less
-
Ye, Qiang (Ed.)An inexact rational Krylov subspace method is studied to solve large-scale nonsymmetric eigenvalue problems. Each iteration (outer step) of the rational Krylov subspace method requires solution to a shifted linear system to enlarge the subspace, performed by an iterative linear solver for large-scale problems. Errors are introduced at each outer step if these linear systems are solved approx- imately by iterative methods (inner step), and they accumulate in the rational Krylov subspace. In this article, we derive an upper bound on the errors intro- duced at each outer step to maintain the same convergence as exact rational Krylov subspace method for approximating an invariant subspace. Since this bound is inversely proportional to the current eigenresidual norm of the target invariant subspace, the tolerance of iterative linear solves at each outer step can be relaxed with the outer iteration progress. A restarted variant of the inexact rational Krylov subspace method is also proposed. Numerical experiments show the effectiveness of relaxing the inner tolerance to save computational cost.more » « less
