Search NASA⌕ Search

SEARCH · Search NASA

Results for “Multilevel Methods”

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 55 records · Page 3

Self-balanced modulation and magnetic rebalancing method for parallel multilevel inverters

A self-balanced modulation method and a closed-loop magnetic flux rebalancing control method for parallel multilevel inverters. The combination of the two methods provides for balancing of the magnetic flux of the inter-cell transformers (ICTs) of the parallel multilevel inverters without deteriorating the quality of the output voltage. In various embodiments a parallel multi-level inverter modulator is provide including a multi-channel comparator to generate a multiplexed digitized ideal waveform for a parallel multi-level inverter and a finite state machine (FSM) module coupled to the parallel multi-channel comparator, the FSM module to receive the multiplexed digitized ideal waveform and to generate a pulse width modulated gate-drive signal for each switching device of the parallel multi-level inverter. The system and method provides for optimization of the output voltage spectrum without influence the magnetic balancing.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Stabilized multilevel Monte Carlo method for stiff stochastic differential equations

A multilevel Monte Carlo (MLMC) method for mean square stable stochastic differential equations with multiple scales is proposed. For such problems, that we call stiff, the performance of MLMC methods based on classical explicit methods deteriorates because of the time step restriction to resolve the fastest scales that prevents to exploit all the levels of the MLMC approach. We show that by switching to explicit stabilized stochastic methods and balancing the stabilization procedure simultaneously with the hierarchical sampling strategy of MLMC methods, the computational cost for stiff systems is significantly reduced, while keeping the computational algorithm fully explicit and easy to implement. Numerical experiments on linear and nonlinear stochastic differential equations and on a stochastic partial differential equation illustrate the performance of the stabilized MLMC method and corroborate our theoretical findings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Final Report - Subcontract B629114

During my visits to LLNL August 20-24, 2018, and September 10-14, 2018, I worked on linear system solvers. The two level hierarchical solver that initiated our study was developed to solve linear systems arising from $hp$ adaptive finite element calculations, and is implemented in the PLTMG software package, version 13. This preconditioner typically requires 3 – 20% of the space used by the stiffness matrix for higher order elements. It has multigrid like convergence rates for a wide variety of PDEs (self-adjoint positive definite elliptic equations, convection dominated convection-diffusion equations, and highly indefinite Helmholtz equations, among others). The convergence rate is not independent of the polynomial degree $p$ as $p → ∞$, but but remains strong for $p ≤$ 9, which is the highest polynomial degree allowed in PLTMG , due to limitations of the numerical quadrature rules implemented in the software package. A more complete description of the method and some numerical experiments illustrating its effectiveness appear. Like traditional geometric multilevel methods, this scheme relies on knowledge of the underlying finite element space in order to construct the smoother and the coarse grid correction.

97 MATHEMATICS AND COMPUTING↗

Automated registration of diagnostic to prediagnostic x-ray mammograms: Evaluation and comparison to radiologists' accuracy

Purpose: To compare and evaluate intensity-based registration methods for computation of serial x-ray mammogram correspondence. Methods: X-ray mammograms were simulated from MRIs of 20 women using finite element methods for modeling breast compressions and employing a MRI/x-ray appearance change model. The parameter configurations of three registration methods, affine, fluid, and free-form deformation (FFD), were optimized for registering x-ray mammograms on these simulated images. Five mammography film readers independently identified landmarks (tumor, nipple, and usually two other normal features) on pairs of diagnostic and corresponding prediagnostic digitized images from 52 breast cancer cases. Landmarks were independently reidentified by each reader. Target registration errors were calculated to compare the three registration methods using the reader landmarks as a gold standard. Data were analyzed using multilevel methods. Results: Between-reader variability varied with landmark (p<0.01) and screen (p=0.03), with between-reader mean distance (mm) in point location on the diagnostic/prediagnostic images of 2.50 (95% CI 1.95, 3.15)/2.84 (2.24, 3.55) for nipples and 4.26 (3.43, 5.24)/4.76 (3.85, 5.84) for tumors. Registration accuracy was sensitive to the type of landmark and the amount of breast density. For dense breasts ({>=}40%), the affine and fluid methods outperformed FFD. For breasts with lower density, the affine registration surpassed both fluid and FFD. Mean accuracy (mm) of the affine registration varied between 3.16 (95% CI 2.56, 3.90) for nipple points in breasts with density 20%-39% and 5.73 (4.80, 6.84) for tumor points in breasts with density <20%. Conclusions: Affine registration accuracy was comparable to that between independent film readers. More advanced two-dimensional nonrigid registration algorithms were incapable of increasing the accuracy of image alignment when compared to affine registration.

60 APPLIED LIFE SCIENCES↗

Final Report - Subcontract B623760

During my visit to LLNL during July 17{27, 2017, I worked on linear system solvers. The two level hierarchical solver that initiated our study was developed to solve linear systems arising from hp adaptive finite element calculations, and is implemented in the PLTMG software package, version 12. This preconditioner typically requires 3-20% of the space used by the stiffness matrix for higher order elements. It has multigrid like convergence rates for a wide variety of PDEs (self-adjoint positive de nite elliptic equations, convection dominated convection-diffusion equations, and highly indefinite Helmholtz equations, among others). The convergence rate is not independent of the polynomial degree p as p ! 1, but but remains strong for p 9, which is the highest polynomial degree allowed in PLTMG, due to limitations of the numerical quadrature rules implemented in the software package. A more complete description of the method and some numerical experiments illustrating its effectiveness appear in. Like traditional geometric multilevel methods, this scheme relies on knowledge of the underlying finite element space in order to construct the smoother and the coarse grid correction.

97 MATHEMATICS AND COMPUTING↗

Subcontract B635525 (Final Report)

During my visits to LLNL July 8–12 and July 22–26, 2019, I worked on linear system solvers. The two level hierarchical solver that initiated our study was developed to solve linear systems arising from $\textit{hp}$ adaptive finite element calculations, and is implemented in the $\textit{PLTMG}$ software package, version 13. This preconditioner typically requires 3–20% of the space used by the stiffness matrix for higher order elements. It has multigrid like convergence rates for a wide variety of PDEs (self-adjoint positive definite elliptic equations, convection dominated convection-diffusion equations, and highly indefinite Helmholtz equations, among others). The convergence rate is not independent of the polynomial degree $\textit{p}$ as $\textit{p} → ∞$, but remains strong for $\textit{p}$ ≤ 9, which is the highest polynomial degree allowed in $\textit{PLTMG}$, due to limitations of the numerical quadrature rules implemented in the soft- ware package. A more complete description of the method and some numerical experiments illustrating its effectiveness appear in. Like traditional geometric multilevel methods, this scheme relies on knowledge of the underlying finite element space in order to construct the smoother and the coarse grid correction.

97 MATHEMATICS AND COMPUTING↗

Final Report - Subcontract B6183769

During my visit to LLNL during July 5{15, 2016, we worked on linear system solvers. The two level hierarchical solver that initiated our study was developed to solve linear system arising from hp adaptive finite element calculations, and is implemented in the PLTMG software package, version 12 [1]. This preconditioner typically requires 3-20% of the space used by the stiffness matrix for higher order elements. It has multigrid like convergence rates for a wide variety of PDEs (self-adjoint positive definite elliptic equations, convection dominated convection-diffusion equations, and highly inde nite Helmholtz equations, among others). The convergence rate is not independent of the polynomial degree p as p ! 1, but but remains strong for p 9, which is the highest polynomial degree allowed in PLTMG, due to limitations of numerical quadrature formulae. A more complete description of the method and some numerical experiments illustrating its effectiveness appear in [2]. Like traditional geometric multilevel methods, this scheme relies on extensive knowledge of the underlying finite element space in order to construct both the smoother and the coarse grid correction components.

97 MATHEMATICS AND COMPUTING↗

Multilevel techniques for nonelliptic problems

Multigrid and multilevel methods are extended to the solution of nonelliptic problems. A framework for analyzing these methods is established. A simple nonelliptic problem is given, and it is shown how a multilevel technique can be used for its solution. Emphasis is on smoothness properties of eigenvectors and attention is drawn to the possibility of conditioning the eigensystem so that eigenvectors have the desired smoothness properties.

Jespersen, D. C.↗

Progress in the Simulation of Steady and Time-Dependent Flows with 3D Parallel Unstructured Cartesian Methods

The proposed paper will present recent extensions in the development of an efficient Euler solver for adaptively-refined Cartesian meshes with embedded boundaries. The paper will focus on extensions of the basic method to include solution adaptation, time-dependent flow simulation, and arbitrary rigid domain motion. The parallel multilevel method makes use of on-the-fly parallel domain decomposition to achieve extremely good scalability on large numbers of processors, and is coupled with an automatic coarse mesh generation algorithm for efficient processing by a multigrid smoother. Numerical results are presented demonstrating parallel speed-ups of up to 435 on 512 processors. Solution-based adaptation may be keyed off truncation error estimates using tau-extrapolation or a variety of feature detection based refinement parameters. The multigrid method is extended to for time-dependent flows through the use of a dual-time approach. The extension to rigid domain motion uses an Arbitrary Lagrangian-Eulerlarian (ALE) formulation, and results will be presented for a variety of two- and three-dimensional example problems with both simple and complex geometry.

Aftosmis, M. J.↗

Multilevel Monte Carlo methods for the Grad-Shafranov free boundary problem

The equilibrium configuration of a plasma in an axially symmetric reactor is described mathematically by a free boundary problem associated with the celebrated Grad-Shafranov equation. The presence of uncertainty in the model parameters introduces the need to quantify the variability in the predictions. This is often done by computing a large number of model solutions on a computational grid for an ensemble of parameter values and then obtaining estimates for the statistical properties of solutions. In this study, we explore the savings that can be obtained using multilevel Monte Carlo methods, which reduce costs by performing the bulk of the computations on a sequence of spatial grids that are coarser than the one that would typically be used for a simple Monte Carlo simulation. We examine this approach using both a set of uniformly refined grids and a set of adaptively refined grids guided by a discrete error estimator. Numerical experiments show that multilevel methods dramatically reduce the cost of simulation, with cost reductions typically on the order of 60 or more and possibly as large as 200. Furthermore, adaptive griding results in more accurate computation of geometric quantities such as x-points associated with the model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multilevel Hierarchical Decomposition of Finite Element White Noise with Application to Multilevel Markov Chain Monte Carlo

In this work we develop a new hierarchical multilevel approach to generate Gaussian random field realizations in an algorithmically scalable manner that is well suited to incorporating into multilevel Markov chain Monte Carlo (MCMC) algorithms. This approach builds off of other partial differential equation (PDE) approaches for generating Gaussian random field realizations; in particular, a single field realization may be formed by solving a reaction-diffusion PDE with a spatial white noise source function as the right-hand side. While these approaches have been explored to accelerate forward uncertainty quantification tasks, e.g., multilevel Monte Carlo, the previous constructions are not directly applicable to multilevel MCMC frameworks which build fine-scale random fields in a hierarchical fashion from coarse-scale random fields. Our new hierarchical multilevel method relies on a hierarchical decomposition of the white noise source function in $L^2$ which allows us to form Gaussian random field realizations across multiple levels of discretization in a way that fits into multilevel MCMC algorithmic frameworks. After presenting our main theoretical results and numerical scaling results to showcase the utility of this new hierarchical PDE method for generating Gaussian random field realizations, this method is tested on a four-level MCMC algorithm to explore its feasibility.

algebraic multigrid↗

Robust parallel iterative solvers for linear and least-squares problems (Final Technical Report)

The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the problem of evaluating f(A)v which arises in statistical sampling. 11. As an application to the methods we developed, we tackled the problem of computing the diagonal of the inverse of a matrix. This arises in statistical applications as well as in many applications in physics. We explored probing methods as well as domain-decomposition type methods. 12. A collaboration with researchers from Toulouse, France, considered the important problem of computing the Schur complement in a domain-decomposition approach. 13. We explored new ways of preconditioning linear systems, based on low-rank approximations.

97 MATHEMATICS AND COMPUTING↗

Commuting projections on graphs

For a given (connected) graph, we consider vector spaces of (discrete) functions defined on its vertices and its edges. These two spaces are related by a discrete gradient operator, Grad and its adjoint, ₋Div, referred to as (negative) discrete divergence. We also consider a coarse graph obtained by aggregation of vertices of the original one. Then a coarse vertex space is identified with the subspace of piecewise constant functions over the aggregates. We consider the ℓ 2 -projection Q H onto the space of these piecewise constants. In the present paper, our main result is the construction of a projection π H from the original edge-space onto a properly constructed coarse edge-space associated with the edges of the coarse graph. The projections π H and Q H commute with the discrete divergence operator, i.e., we have div π H = Q H div. The respective pair of coarse edge-space and coarse vertexspace offer the potential to construct two-level, and by recursion, multilevel methods for the mixed formulation of the graph Laplacian which utilizes the discrete divergence operator. The performance of one two-level method with overlapping Schwarz smoothing and correction based on the constructed coarse spaces for solving such mixed graph Laplacian systems is illustrated on a number of graph examples.

97 MATHEMATICS AND COMPUTING↗

Weighted relaxation for multigrid reduction in time

Current trends in computer architectures now mean that faster computation speed must come primarily from increased concurrency, not faster clock speeds, which are stagnating. Thus, this situation creates bottlenecks for serial algorithms, including the well-known bottleneck for sequential time-integration, where each individual time-value (i.e., time-step) is computed sequentially. One approach to alleviate this and achieve parallelism in time is with multigrid. Here, in this work, we consider multigrid-reduction-in-time (MGRIT), a multilevel method applied to the time dimension that computes multiple time-steps in parallel. Like all multigrid methods, MGRIT relies on the complementary relationship between relaxation on a fine-grid and a correction from the coarse grid to solve the problem. All current MGRIT implementations are based on unweighted-Jacobi relaxation; here we introduce the concept of weighted relaxation to MGRIT. We derive new convergence bounds for weighted relaxation, and use this analysis to guide the selection of relaxation weights. Numerical results then demonstrate that by choosing appropriate non-unitary relaxation weights, one can achieve faster convergence rates and lower iteration counts for MGRIT when compared with unweighted relaxation. In most cases, weighted relaxation yields a 10%–20% saving in iterations, which is significant when using large high-performance computers. For A-stable integration schemes, results also illustrate that under-relaxation can restore convergence in some cases where unweighted relaxation is not convergent.

97 MATHEMATICS AND COMPUTING↗

Block Preconditioners for Stable Mixed Nodal and Edge finite element Representations of Incompressible Resistive MHD

The scalable iterative solution of strongly coupled three-dimensional incompressible resistive magnetohydrodynamics (MHD) equations is quite challenging because disparate time scales arise from the electromagnetics, the hydrodynamics, as well as the coupling between these systems. This study considers a mixed finite element discretization of a dual saddle point formulation of the incompressible resistive MHD equations using a stable nodal (Q2/Q1) discretization for the hydrodynamics and a stable edge-node discretization of a reduced form of the Maxwell equations. This paper introduces new approximate block factorization preconditioners for this system which reduce the system to approximate Schur complement systems that can be solved using algebraic multilevel methods. These preconditioners include a new augmentation-based approximation for the magnetic induction saddle point system as well as efficient approximations of the Schur complements that arise from the complex coupling between the Navier--Stokes equations and the Maxwell equations.

97 MATHEMATICS AND COMPUTING↗

Final Technical Report for "Applied Mathematics Research: Simulation Based Optimization and Application to Electromagnetic Inverse Problems"

The focus of research was: Developing adaptive mesh for the solution of Maxwell's equations; Developing a parallel framework for time dependent inverse Maxwell's equations; Developing multilevel methods for optimization problems with inequality constraints; A new inversion code for inverse Maxwell's equations in the 0th frequency (DC resistivity); A new inversion code for inverse Maxwell's equations in low frequency regime. Although the research concentrated on electromagnetic forward and in- verse problems the results of the research was applied to the problem of image registration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ML Enhancements via the Calculation of Rigid Body Modes (RBMs) for Mechanics Problems Implemented within the Albany Code Base

The algebraic multigrid approach known as smoothed aggregation is very efficient at solving systems that arise from elasticity problems. In order to construct an efficient algebraic multilevel method, a multigrid solver should be provided with a small set of vectors that represent the error components that are difficult to resolve. It is well-known that for linear elasticity problems, these components correspond to the the so-called rigid body modes (RBMs). The present document summarizes some new development within the Albany code base that has enabled the application of algebraic multigrid preconditioners from the ML package of Trilinos to mechanics problems implemented within Albany via a new function that calculates the RBMs using information about the problem's underlying mesh. The performance of these preconditioners is evaluated on four problems: a 3D static elasticity problem, a 3D non-linear elasticity problem, a 3D thermo-elasticity problem, and a 3D thermo-poro-plasticity problem. The tests reveal the superiority of the ML preconditioners over ILU preconditioners from the Trilinos Ifpack package for mechanics problems in Albany.

97 MATHEMATICS AND COMPUTING↗