Search NASA⌕ Search

SEARCH · Search NASA

Results for “preconditioner”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2

Robust block preconditioners for poroelasticity

In this paper we develop and analyze several preconditioners for the linear systems arising from discretized poroelasticity problems. The preconditioners include one block preconditioner for the two-field Biot model and several preconditioners for the classical three-field Biot model. We manage to analyze these different preconditioners under a same theoretical framework and show that all of them are uniformly optimal with respect to material and discretization parameters. Numerical tests demonstrate the robustness of these preconditioners.

42 ENGINEERING↗

Application of the inverse fast multipole method as a preconditioner in a 3D Helmholtz boundary element method

Here we investigate an efficient preconditioning of iterative methods (such as GMRES) for solving dense linear systems Ax = b that follow from a boundary element method (BEM) for the 3D Helmholtz equation, focusing on the low-frequency regime. While matrix–vector products in GMRES can be accelerated through the low-frequency fast multipole method (LFFMM), the BEM often remains computationally expensive due to the large number of GMRES iterations. We propose the application of the inverse fast multipole method (IFMM) as a preconditioner to accelerate the convergence of GMRES. The IFMM is in essence an approximate direct solver that uses a multilevel hierarchical decomposition and low-rank approximations. The proposed IFMM-based preconditioning has a tunable parameter ε that balances the cost to construct a preconditioner M, which is an approximation of A -1 , and the cost to perform the iterative process by means of M. Namely, using a small (respectively, large) value of ε takes a long (respectively, short) time to construct M, while the number of iterations can be small (respectively, large). A comprehensive set of numerical examples involving various boundary value problems with complicated geometries and mixed boundary conditions is presented to validate the efficiency of the proposed method. We show that the IFMM preconditioner (with a nearly optimal ε of 10 -2 ) clearly outperforms some common preconditioners for the BEM, achieving 1.2–10.8 times speed-up of the computations, in particular when the scale of the underlying scatterer is about five wavelengths or more. In addition, the IFMM preconditioner is capable of solving complicated problems (in a reasonable amount of time) that BD preconditioner can not.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Initial performance of fully-coupled AMG and approximate block factorization preconditioners for solution of implicit FE resistive MHD.

This brief paper explores the development of scalable, nonlinear, fully-implicit solution methods for a stabilized unstructured finite element (FE) discretization of the 2D incompressible (reduced) resistive MHD system. The discussion considers the stabilized FE formulation in context of a fully-implicit time integration and direct-to-steady-state solution capability. The nonlinear solver strategy employs Newton-Krylov methods, which are preconditioned using fully-coupled algebraic multilevel (AMG) techniques and a new approximate block factorization (ABF) preconditioner. The intent of these preconditioners is to enable robust, scalable and efficient solution approaches for the large-scale sparse linear systems generated by the Newton linearization. We present results for the fully-coupled AMG preconditioner for two prototype problems, a low Lundquist number MHD Faraday conduction pump and moderately-high Lundquist number incompressible magnetic island coalescence problem. For the MHD pump results we explore the scaling of the fully-coupled AMG preconditioner for up to 4096 processors for problems with up to 64M unknowns on a CrayXT3/4. Using the island coalescence problem we explore the weak scaling of the AMG preconditioner and the influence of the Lundquist number on the iteration count. Finally we present some very recent results for the algorithmic scaling of the ABF preconditioner.

99 GENERAL AND MISCELLANEOUS↗

A new relaxed splitting preconditioner for the generalized saddle point problems from the incompressible Navier–Stokes equations

Based on the modified relaxed splitting (MRS) preconditioner proposed by Fan and Zhu (Appl Math Lett 55:18–26, 2016), a new relaxed splitting preconditioner is proposed for the generalized saddle point problems arising from the incompressible Navier–Stokes equations. The eigenvalue distribution and an upper bound of the degree of the minimal polynomial of the preconditioned matrix are analyzed. Numerical results show that the proposed preconditioner is superior to the MRS preconditioner when they are used as preconditioners to accelerate the convergence rate of the Krylov subspace methods, such as GMRES.

97 MATHEMATICS AND COMPUTING↗

Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients

We present a robust and scalable preconditioner for the solution of large-scale linear systems that arise from the discretization of elliptic PDEs amenable to rank compression. The preconditioner is based on hierarchical low-rank approximations and the cyclic reduction method. The setup and application phases of the preconditioner achieve log-linear complexity in memory footprint and number of operations, and numerical experiments exhibit good weak and strong scalability at large processor counts in a distributed memory environment. Numerical experiments with linear systems that feature symmetry and nonsymmetry, definiteness and indefiniteness, constant and variable coefficients demonstrate the preconditioner applicability and robustness. Furthermore, it is possible to control the number of iterations via the accuracy threshold of the hierarchical matrix approximations and their arithmetic operations, and the tuning of the admissibility condition parameter. Together, these parameters allow for optimization of the memory requirements and performance of the preconditioner.

97 MATHEMATICS AND COMPUTING↗

Two-level overlapping additive Schwarz preconditioner for training scientific machine learning applications

In this work we introduce a novel two-level overlapping additive Schwarz preconditioner for accelerating the training of scientific machine learning applications. The design of the proposed preconditioner is motivated by the nonlinear two-level overlapping additive Schwarz preconditioner. The neural network parameters are decomposed into groups (subdomains) with overlapping regions. In addition, the network’s feed-forward structure is indirectly imposed through a novel subdomain-wise synchronization strategy and a coarse-level training step. Through a series of numerical experiments, which consider physicsinformed neural networks and operator learning approaches, we demonstrate that the proposed two-level preconditioner significantly speeds up the convergence of the standard (LBFGS) optimizer while also yielding more accurate machine learning models. Moreover, the devised preconditioner is designed to take advantage of model-parallel computations, which can further reduce the training time.

97 MATHEMATICS AND COMPUTING↗

Optimal-Order Preconditioners for Linear Systems Arising in the Semismooth Newton Solution of a Class of Control-Constrained Problems

We present a new multigrid preconditioner for the linear systems arising in the semismooth Newton method solution of certain control-constrained, quadratic distributed optimal control problems. Using a piecewise constant discretization of the control space, each semismooth Newton iteration essentially requires inverting a principal submatrix of the matrix entering the normal equations of the associated unconstrained optimal control problem, the rows (and columns) of the submatrix representing the constraints deemed inactive at the current iteration. Previously developed multigrid preconditioners for the aforementioned submatrices were based on constructing a sequence of conforming coarser spaces and proved to be of suboptimal quality for the class of problems considered. Instead, the multigrid preconditioner introduced in this work uses nonconforming coarse spaces, and it is shown that, under reasonable geometric assumptions on the constraints that are deemed inactive, the preconditioner approximates the inverse of the desired submatrix to optimal order. The preconditioner is tested numerically on a classical elliptic-constrained optimal control problem and further on a constrained image-deblurring problem.

97 MATHEMATICS AND COMPUTING↗

KKT Preconditioners for PDE-Constrained Optimization with the Helmholtz Equation

This paper considers preconditioners for the linear systems that arise from optimal control and inverse problems involving the Helmholtz equation. Specifically, we explore an all-at-once approach. The main contribution centers on the analysis of two block preconditioners. Variations of these preconditioners have been proposed and analyzed in prior works for optimal control problems where the underlying partial differential equation is a Laplace-like operator. In this paper, we extend some of the prior convergence results to Helmholtz-based optimization applications. Our analysis examines situations where control variables and observations are restricted to subregions of the computational domain. We prove that solver convergence rates do not deteriorate as the mesh is refined or as the wavenumber increases. More specifically, for one of the preconditioners we prove accelerated convergence as the wavenumber increases. Additionally, in situations where the control and observation subregions are disjoint, we observe that solver convergence rates have a weak dependence on the regularization parameter. We give a partial analysis of this behavior. We illustrate the performance of the preconditioners on control problems motivated by acoustic testing.

97 MATHEMATICS AND COMPUTING↗

Multilevel filtering elliptic preconditioners

A class of preconditioners is presented for elliptic problems built on ideas borrowed from the digital filtering theory and implemented on a multilevel grid structure. They are designed to be both rapidly convergent and highly parallelizable. The digital filtering viewpoint allows the use of filter design techniques for constructing elliptic preconditioners and also provides an alternative framework for understanding several other recently proposed multilevel preconditioners. Numerical results are presented to assess the convergence behavior of the new methods and to compare them with other preconditioners of multilevel type, including the usual multigrid method as preconditioner, the hierarchical basis method and a recent method proposed by Bramble-Pasciak-Xu.

Kuo, C. C. Jay↗

Efficient discontinuous Galerkin implementations and preconditioners for implicit unsteady compressible flow simulations

This work presents and compares efficient implementations of high-order discontinuous Galerkin methods: a modal matrix-free discontinuous Galerkin (DG) method, a hybridizable discontinuous Galerkin (HDG) method, and a primal formulation of HDG, applied to the implicit solution of unsteady compressible flows. The matrix-free implementation allows for a reduction of the memory footprint of the solver when dealing with implicit time-accurate discretizations. HDG reduces the number of globally-coupled degrees of freedom relative to DG, at high order, by statically condensing element-interior degrees of freedom from the system in favor of face unknowns. The primal formulation further reduces the element-interior degrees of freedom by eliminating the gradient as a separate unknown. This paper introduces a p-multigrid preconditioner implementation for these discretizations and presents results for various flow problems. Benefits of the p-multigrid strategy relative to simpler, less expensive, preconditioners are observed for stiff systems, such as those arising from low-Mach number flows at high-order approximation. The p-multigrid preconditioner also shows excellent scalability for parallel computations. Finally, additional savings in both speed and memory occur with a matrix-free/reduced version of the preconditioner.

97 MATHEMATICS AND COMPUTING↗

A domain decomposition method of stochastic PDEs: An iterative solution techniques using a two-level scalable preconditioner

Recent advances in high performance computing systems and sensing technologies motivate computational simulations with extremely high resolution models with capabilities to quantify uncertainties for credible numerical predictions. A two-level domain decomposition method is reported in this investigation to devise a linear solver for the large-scale system in the Galerkin spectral stochastic finite element method (SSFEM). In particular, a two-level scalable preconditioner is introduced in order to iteratively solve the large-scale linear system in the intrusive SSFEM using an iterative substructuring based domain decomposition solver. The implementation of the algorithm involves solving a local problem on each subdomain that constructs the local part of the preconditioner and a coarse problem that propagates information globally among the subdomains. The numerical and parallel scalabilities of the two-level preconditioner are contrasted with the previously developed one-level preconditioner for two-dimensional flow through porous media and elasticity problems with spatially varying non-Gaussian material properties. A distributed implementation of the parallel algorithm is carried out using MPI and PETSc parallel libraries. The scalabilities of the algorithm are investigated in a Linux cluster.

42 ENGINEERING↗

Double sweep preconditioner for optimized Schwarz methods applied to the Helmholtz problem

This paper presents a preconditioner for non-overlapping Schwarz methods applied to the Helmholtz problem. Starting from a simple analytic example, we show how such a preconditioner can be designed by approximating the inverse of the iteration operator for a layered partitioning of the domain. The preconditioner works by propagating information globally by concurrently sweeping in both directions over the subdomains, and can be interpreted as a coarse grid for the domain decomposition method. The resulting algorithm is shown to converge very fast, independently of the number of subdomains and frequency. The preconditioner has the advantage that, like the original Schwarz algorithm, it can be implemented as a matrix-free routine, with no additional preprocessing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large-scale harmonic balance simulations with Krylov subspace and preconditioner recycling

The multi-harmonic balance method combined with numerical continuation provides an efficient framework to compute a family of time-periodic solutions, or response curves, for large-scale, nonlinear mechanical systems. The predictor and corrector steps repeatedly solve a sequence of linear systems that scale by the model size and number of harmonics in the assumed Fourier series approximation. In this paper, a novel Newton–Krylov iterative method is embedded within the multi-harmonic balance and continuation algorithm to efficiently compute the approximate solutions from the sequence of linear systems that arise during the prediction and correction steps. Further, the method recycles, or reuses, both the preconditioner and the Krylov subspace generated by previous linear systems in the solution sequence. A delayed frequency preconditioner refactorizes the preconditioner only when the performance of the iterative solver deteriorates. The GCRO-DR iterative solver recycles a subset of harmonic Ritz vectors to initialize the solution subspace for the next linear system in the sequence. The performance of the iterative solver is demonstrated on two exemplars with contact-type nonlinearities and benchmarked against a direct solver with traditional Newton–Raphson iterations.

97 MATHEMATICS AND COMPUTING↗

High resolution viscous fingering simulation in miscible displacement using a p-adaptive discontinuous Galerkin method with algebraic multigrid preconditioner

High resolution simulation of viscous fingering can offer an accurate and detailed prediction for subsurface engineering processes involving fingering phenomena. The fully implicit discontinuous Galerkin (DG) method has been shown to be an accurate and stable method to model viscous fingering with high Peclet number and mobility ratio. In this study, we present two techniques to speedup large scale simulations of this kind. The first technique relies on a simple p-adaptive scheme in which high order basis functions are employed only in elements near the finger fronts where the concentration has a sharp change. As a result, the number of degrees of freedom is significantly reduced and the simulation yields almost identical results to the more expensive simulation with uniform high order elements throughout the mesh. The second technique for speedup involves improving the solver efficiency. We present an algebraic multigrid (AMG) preconditioner which allows the DG matrix to leverage the robust AMG preconditioner designed for the continuous Galerkin (CG) finite element method. The resulting preconditioner works effectively for fixed order DG as well as p-adaptive DG problems. Finally, with the improvements provided by the p-adaptivity and AMG preconditioning, we can perform high resolution three-dimensional viscous fingering simulations required for miscible displacement with high Peclet number and mobility ratio in greater detail than before for well injection problems.

97 MATHEMATICS AND COMPUTING↗

An Algebraic Multilevel Preconditioner with Low-Rank Corrections for Sparse Symmetric Matrices

In this work, we describe a multilevel preconditioning technique for solving sparse symmetric linear systems of equations. This “Multilevel Schur Low-Rank” (MSLR) preconditioner first builds a tree structure $\mathcal{T}$ based on a hierarchical decomposition of the matrix and then computes an approximate inverse of the original matrix level by level. Unlike classical direct solvers, the construction of the MSLR preconditioner follows a top-down traversal of $\mathcal{T}$ and exploits a low-rank property that is satisfied by the difference between the inverses of the local Schur complements and specific blocks of the original matrix. A few steps of the generalized Lanczos tridiagonalization procedure are applied to capture most of this difference. Numerical results are reported to illustrate the efficiency and robustness of the MSLR preconditioner with both two- and three-dimensional discretized PDE problems and with publicly available test problems.

97 MATHEMATICS AND COMPUTING↗

The Auxiliary Space Preconditioner for the de Rham Complex

Here we generalize the construction and analysis of auxiliary space preconditioners to the $n$-dimensional finite element subcomplex of the de Rham complex. These preconditioners are based on a generalization of a decomposition of Sobolev space functions into a regular part and a potential. A discrete version is easily established using the tools of finite element exterior calculus. We then discuss the four-dimensional de Rham complex in detail. By identifying forms in four dimensions with simple proxies, form operations are written out in terms of familiar algebraic operations on matrices, vectors, and scalars. This provides the basis for our implementation of the preconditioners in four dimensions. Extensive numerical experiments illustrate their performance, practical scalability, and parameter robustness, all in accordance with the theory.

4D↗

Algorithmically scalable block preconditioner for fully implicit shallow-water equations in CAM-SE

Performing accurate and efficient numerical simulation of global atmospheric climate models is challenging due to the disparate length and time scales over which physical processes interact. Implicit solvers enable the physical system to be integrated with a time step commensurate with processes being studied. The dominant cost of an implicit time step is the ancillary linear system solves, so we have developed a preconditioner aimed at improving the efficiency of these linear system solves. Our preconditioner is based on an approximate block factorization of the linearized shallow-water equations and has been implemented within the spectral element dynamical core within the Community Atmospheric Model (CAM-SE). Furthermore, in this paper we discuss the development and scalability of the preconditioner for a suite of test cases with the implicit shallow-water solver within CAM-SE.

97 MATHEMATICS AND COMPUTING↗

The generalized double shift-splitting preconditioner for nonsymmetric generalized saddle point problems from the steady Navier–Stokes equations

In this paper, a generalized double shift-splitting (GDSS) preconditioner induced by a newmatrix splitting method is proposed and implemented for nonsymmetric generalized saddle point problems having a nonsymmetric positive definite (1,1)-block and a positive definite (2,2)-block. Detailed theoretical analysis of the iteration matrix is provided to show the GDSS method, which corresponds to the GDSS preconditioner, is unconditionally convergent. Additionally,a deteriorated GDSS (DGDSS) method is proposed. It is shown that, with suitable choice of parameter matrix, the DGDSS preconditioned matrix has an eigenvalue at 1 with multiplicity n,and the other m eigenvalues are of the form1−λwith|λ| < 1,independently of the Schur complement matrix related. Finally, numerical experiments arising from a model Navier–Stokes problem are provided to validate and illustrate the effectiveness of the proposed preconditioner, with which a faster convergence for Krylov subspace iteration methods can be achieved.

42 ENGINEERING↗