Search NASA⌕ Search

SEARCH · Search NASA

Results for “Multigrid 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 577 records · Page 32

Origin of large variations of current on/off ratio and switching voltage in atomically thin memristors: an exascale ab initio transport study

Nonvolatile resistive switching in two-dimensional monolayers opens a new avenue for high-density memory/computing devices. However, questions remain as to why the current on/off ratio and switching voltage vary significantly among different devices. Here, we simulate electronic transport of large systems consisting of a h-BN monolayer sandwiched by gold electrodes, enabled by an implementation of the nonequilibrium Green’s function method in the exascale density functional theory (DFT) code: Real-space MultiGrid. Systematic calculations reveal that the wide range of on/off ratios is due to variations in interface distances between the electrode and h-BN that significantly modulate their wavefunction overlap. In addition, DFT calculations demonstrate that the energy barrier of a gold atom dissociating from the electrode to h-BN increases dramatically with the interface distance, thereby explaining the strong dependence of the switching voltage on distance. Our work demonstrates the significance of interface distance in governing the current on/off ratio and switching voltage.

Electronic devices↗

Accelerating Multigrid-based Hierarchical Scientific Data Refactoring on GPUs

Rapid growth in scientific data and a widening gap between computational speed and I/O bandwidth make it increasingly infeasible to store and share all data produced by scientific simulations. Instead, we need methods for reducing data volumes: ideally, methods that can scale data volumes adaptively so as to enable negotiation of performance and fidelity tradeoffs in different situations. Multigrid-based hierarchical data representations hold promise as a solution to this problem, allowing for flexible conversion between different fidelities so that, for example, data can be created at high fidelity and then transferred or stored at lower fidelity via logically simple and mathematically sound operations. However, the effective use of such representations has been hindered until now by the relatively high costs of creating, accessing, reducing, and otherwise operating on such representations. We describe here highly optimized data refactoring kernels for GPU accelerators that enable efficient creation and manipulation of data in multigrid-based hierarchical forms. We demonstrate that our optimized design can achieve up to 250 TB/s aggregated data refactoring throughput—83% of theoretical peak—on 1024 nodes of the Summit supercomputer. We showcase our optimized design by applying it to a large-scale scientific visualization workflow and the MGARD lossy compression software.

Data refactoring↗

Adaptive Space-Time Methods for Large Scale Optimal Design

When modeling complex physical systems with advanced dynamics, such as shocks and singularities, many classic methods for solving partial differential equations can return inaccurate or unusable results. One way to resolve these complex dynamics is through r-adaptive refinement methods, in which a fixed number of mesh points are shifted to areas of high interest. The mesh refinement map can be found through the solution of the Monge-Ampére equation, a highly nonlinear partial differential equation. Due to its nonlinearity, the numerical solution of the Monge-Ampére equation is nontrivial and has previously required computationally expensive methods. In this report, we detail our novel optimization-based, multigrid-enabled solver for a low-order finite element approximation of the Monge-Ampére equation. This fast and scalable solver makes r-adaptive meshing more readily available for problems related to large-scale optimal design. Beyond mesh adaptivity, our report discusses additional applications where our fast solver for the Monge-Ampére equation could be easily applied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Error norms for the adaptive solution of the Navier-Stokes equations

The adaptive solution of the Navier-Stokes equations depends upon the successful interaction of three key elements: (1) the ability to flexibly select grid length scales in composite grids, (2) the ability to efficiently control residual error in composite grids, and (3) the ability to define reliable, convenient error norms to guide the grid adjustment and optimize the residual levels relative to the local truncation errors. An initial investigation was conducted to explore how to approach developing these key elements. Conventional error assessment methods were defined and defect and deferred correction methods were surveyed. The one dimensional potential equation was used as a multigrid test bed to investigate how to achieve successful interaction of these three key elements.

Forester, C. K.↗

Progress and supercomputing in computational fluid dynamics; Proceedings of U.S.-Israel Workshop, Jerusalem, Israel, December 1984

Current developments and future trends in the application of supercomputers to computational fluid dynamics are discussed in reviews and reports. Topics examined include algorithm development for personal-size supercomputers, a multiblock three-dimensional Euler code for out-of-core and multiprocessor calculations, simulation of compressible inviscid and viscous flow, high-resolution solutions of the Euler equations for vortex flows, algorithms for the Navier-Stokes equations, and viscous-flow simulation by FEM and related techniques. Consideration is given to marching iterative methods for the parabolized and thin-layer Navier-Stokes equations, multigrid solutions to quasi-elliptic schemes, secondary instability of free shear flows, simulation of turbulent flow, and problems connected with weather prediction.

Murman, E. M.↗

Zonal multigrid solution of compressible flow problems on unstructured and adaptive meshes

The simultaneous use of adaptive meshing techniques with a multigrid strategy for solving the 2-D Euler equations in the context of unstructured meshes is studied. To obtain optimal efficiency, methods capable of computing locally improved solutions without recourse to global recalculations are pursued. A method for locally refining an existing unstructured mesh, without regenerating a new global mesh is employed, and the domain is automatically partitioned into refined and unrefined regions. Two multigrid strategies are developed. In the first, time-stepping is performed on a global fine mesh covering the entire domain, and convergence acceleration is achieved through the use of zonal coarse grid accelerator meshes, which lie under the adaptively refined regions of the global fine mesh. Both schemes are shown to produce similar convergence rates to each other, and also with respect to a previously developed global multigrid algorithm, which performs time-stepping throughout the entire domain, on each mesh level. However, the present schemes exhibit higher computational efficiency due to the smaller number of operations on each level.

Mavriplis, Dimitri J.↗

Pseudo-time methods for constrained optimization problems governed by PDE

In this paper we present a novel method for solving optimization problems governed by partial differential equations. Existing methods are gradient information in marching toward the minimum, where the constrained PDE is solved once (sometimes only approximately) per each optimization step. Such methods can be viewed as a marching techniques on the intersection of the state and costate hypersurfaces while improving the residuals of the design equations per each iteration. In contrast, the method presented here march on the design hypersurface and at each iteration improve the residuals of the state and costate equations. The new method is usually much less expensive per iteration step since, in most problems of practical interest, the design equation involves much less unknowns that that of either the state or costate equations. Convergence is shown using energy estimates for the evolution equations governing the iterative process. Numerical tests show that the new method allows the solution of the optimization problem in a cost of solving the analysis problems just a few times, independent of the number of design parameters. The method can be applied using single grid iterations as well as with multigrid solvers.

Taasan, Shlomo↗

MGLab: An Interactive Multigrid Environment

MGLab is a set of Matlab functions that defines an interactive environment for experimenting with multigrid algorithms. The package solves two-dimensional elliptic partial differential equations discretized using either finite differences or finite volumes, depending on the problem. Built-in problems include the Poisson equation, the Helmholtz equation, a convection-diffusion problem, and a discontinuous coefficient problem. A number of parameters controlling the multigrid V-cycle can be set using a point-and-click mechanism. The menu-based user interface also allows a choice of several Krylov subspace methods, including CG, GMRES(k), and Bi-CGSTAB, which can be used either as stand-alone solvers or as multigrid acceleration schemes. The package exploits Matlab's visualization and sparse matrix features and has been structured to be easily extensible.

Bordner, James↗

Accelerating Multigrid-based Hierarchical Scientific Data Refactoring on GPUs

Rapid growth in scientific data and a widening gap between computational speed and I/O bandwidth make it increasingly infeasible to store and share all data produced by scientific simulations. Instead, we need methods for reducing data volumes: ideally, methods that can scale data volumes adaptively so as to enable negotiation of performance and fidelity tradeoffs in different situations. Multigrid-based hierarchical data representations hold promise as a solution to this problem, allowing for flexible conversion between different fidelities so that, for example, data can be created at high fidelity and then transferred or stored at lower fidelity via logically simple and mathematically sound operations. However, the effective use of such representations has been hindered until now by the relatively high costs of creating, accessing, reducing, and otherwise operating on such representations. We describe here highly optimized data refactoring kernels for GPU accelerators that enable efficient creation and manipulation of data in multigrid-based hierarchical forms. We demonstrate that our optimized design can achieve up to 250 TB/s aggregated data refactoring throughput—83% of theoretical peak—on 1024 nodes of the Summit supercomputer. We showcase our optimized design by applying it to a large-scale scientific visualization workflow and the MGARD lossy compression software.

Chen, Jieyang↗

A robust fourth-order finite-difference discretization for the strongly anisotropic transport equation in magnetized plasmas

We propose a second-order temporally implicit, fourth-order-accurate spatial discretization scheme for the strongly anisotropic heat transport equation characteristic of hot, fusion-grade plasmas. Following Du Toit et al. (2018), the scheme transforms mixed-derivative diffusion fluxes (which are responsible for the lack of a discrete maximum principle) into nonlinear advective fluxes, amenable to nonlinear-solver-friendly monotonicity-preserving limiters. The scheme enables accurate multi-dimensional heat transport simulations with up to seven orders of magnitude of heat-transport-coefficient anisotropies with low cross-field numerical error pollution and excellent algorithmic performance, with the number of linear iterations scaling very weakly with grid resolution and grid anisotropy, and scaling with the square-root of the implicit timestep. We propose a multigrid preconditioning strategy based on a lower-order approximation that renders the scheme efficient and scalable under grid refinement. Several numerical tests are presented that display the expected spatial convergence rates and strong algorithmic performance, including fully nonlinear magnetohydrodynamics simulations of kink instabilities in a Bennett pinch in 2D helical geometry and of ITER in 3D toroidal geometry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multigrid treatment of implicit continuum diffusion

Implicit treatment of diffusive terms of various differential orders common in continuum mechanics modeling, such as computational fluid dynamics, is investigated with spectral and multigrid algorithms in non-periodic 2D domains. In doubly periodic time dependent problems these terms are handled efficiently by spectral methods, but in non-periodic systems solved with distributed memory parallel computing and 2D domain decomposition, this efficiency is lost for a large number of processors. Here, we built and present here a multigrid algorithm for these types of problems that outperforms a spectral solution employing the highly optimized FFTW library. This solver is suitable for high performance computing and may be able to efficiently treat implicit diffusion of arbitrary order by introducing auxiliary equations of lower order. We test these solvers for fourth and sixth order diffusion with harmonic test functions as well as turbulent 2D magnetohydrodynamic simulations. It is also shown that an anisotropic operator without mixed-derivative terms improves model accuracy and speed, and we examine the impact that the various diffusion operators have on the energy, the enstrophy, and the qualitative aspect of a simulation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

TEMPORAL EVOLUTION OF FREE MAGNETIC ENERGY ASSOCIATED WITH FOUR X-CLASS FLARES

We study the temporal variation of free magnetic energy E {sub free} around the time of four X-class flares. The high-cadence photospheric vector magnetograms obtained by the digital vector magnegograph system at the Big Bear Solar Observatory are used as the boundary conditions to reconstruct the three-dimensional nonlinear force-free (NLFF) coronal field. In order to remove the effect of the net Lorentz force and torque acting in the photosphere, the vector magnetograms are preprocessed using the method devised by Wiegelmann et al.. Then a well-tested multigrid-like optimization code by Wiegelmann is applied to the preprocessed boundary data to extrapolate the NLFF coronal field with which we are able to estimate the free energy E {sub free}. In all the four events, we find a significant drop of E {sub free} starting {approx}15 minutes before the peak time of the associated nonthermal flare emission, although long-term trend varies from event to event. We discuss the physical implication of the result, i.e., the magnetic relaxation is already going on in the corona well before the flare reconnection.

99 GENERAL AND MISCELLANEOUS↗

Efficient Solution Methods for Large-scale Optimization Problems Constrained by Time-dependent Partial Differential Equations (Final Report)

The objectives of this project are to devise and analyze efficient solvers for several classes of PDE- constrained optimization problems. The project was initially focused on, but not restricted to time- dependent PDE-constraints such as parabolic equations, time-dependent fluid flows (Navier-Stokes equations), hyperbolic equations (Burgers equation, shallow water equations). Other constraints considered are PDEs with stochastic coefficients. Additional elements of interest are the handling of problems with control and/or state inequality constraints or non-differentiable regularization terms, and boundary controls. A direction of work not initially listed among the goals, which was triggered by conversations with DOE scientists from the Sandia National Labs, is to develop efficient solvers for optimization- based domain-decomposition PDE-solvers. Also targeted in the project are a number of technical issues necessary for facilitating the integration of the methods resulted from this project with existing high-performance packages developed at DOE national labs; this integration is expected to further enable the scientific community to use the novel methods. An example of such a task is the need to develop algebraic multigrid (AMG) versions of the algorithms. A list of accomplishments in several areas is detailed as well as a list of publications.

97 MATHEMATICS AND COMPUTING↗

URANS Application with CFL3D

This case was run using CFL3D, a multi-zone Reynolds-averaged Navier-Stokes code developed at NASA Langley [1]. It solves the thin-layer form of the Navier-Stokes equations in each of the (selected) coordinate directions. It can use 1-to-1, patched, or overset grids, and employs local time step scaling, grid sequencing, and multigrid to accelerate convergence to steady state. In time-accurate mode, CFL3D has the option to employ dual-time stepping with subiterations and multigrid, and it achieves second order temporal accuracy. CFL3D is a finite volume method. It uses third-order upwind-biased spatial differencing on the convective and pressure terms, and second-order differencing on the viscous terms; it is globally second-order spatially accurate. The flux difference-splitting (FDS) method of Roe is employed to obtain fluxes at the cell faces. It is advanced in time with an implicit three-factor approximate factorization method.

Rumsey, C. L.↗

RANS and URANS Application with CFL3D

This case was run using CFL3D, a multi-zone Reynolds-averaged Navier-Stokes code developed at NASA Langley [1]. It solves the thin-layer form of the Navier-Stokes equations in each of the (selected) coordinate directions. It can use 1-to-1, patched, or overset grids, and employs local time step scaling, grid sequencing, and multigrid to accelerate convergence to steady state. In time-accurate mode, CFL3D has the option to employ dual-time stepping with subiterations and multigrid, and it achieves second order temporal accuracy. CFL3D is a finite volume method. It uses third-order upwind-biased spatial differencing on the convective and pressure terms, and second-order differencing on the viscous terms; it is globally second-order spatially accurate. The flux difference-splitting (FDS) method of Roe is employed to obtain fluxes at the cell faces. It is advanced in time with an implicit three-factor approximate factorization method.

Rumsey, C. L.↗

Mixed-Precision Spectral Deferred Correction: Preprint

Convergence of spectral deferred correction (SDC), where low-order time integration methods are used to construct higher-order methods through iterative refinement, can be accelerated in terms of computational effort by using mixed-precision methods. Using ideas from multi-level SDC (in turn based on FAS multigrid ideas), some of the SDC correction sweeps can use function values computed in reduced precision without adversely impacting the accuracy of the final solution. This is particularly beneficial for the performance of combustion solvers such as S3D [6] which require double precision accuracy but are performance limited by the cost of data motion.

97 MATHEMATICS AND COMPUTING↗

Parallel-in-Time Solution of Hyperbolic PDE Systems via Characteristic-Variable Block Preconditioning

We consider the parallel-in-time solution of both linear and nonlinear hyperbolic partial differential equation (PDE) systems in one spatial dimension. In the nonlinear setting, the discretized equations are solved with a preconditioned residual iteration based on a global linearization. The linear(ized) equation systems are approximately solved parallel-in-time using a block preconditioner applied in the characteristic variables of the underlying linear(ized) hyperbolic PDE. This change of variables is motivated by the observation that intervariable coupling between characteristic variables is weak, at least locally where spatio-temporal variations in the eigenvectors of the associated flux Jacobian are sufficiently small, while that between the original variables is not. For an ℓ-dimensional system of PDEs, applying the preconditioner consists of solving a sequence of ℓ scalar linear(ized)-advection-like problems, each associated with a different characteristic wave-speed in the underlying linear(ized) PDE. Furthermore, we approximately solve these linear advection problems using multigrid reduction-in-time (MGRIT); however, any other suitable parallel-in-time method could be used. Numerical examples are shown for the (linear) acoustics equations in heterogeneous media and for the (nonlinear) shallow water equations and Euler equations of gas dynamics with shocks and rarefactions. For many test problems, the solver converges in just a handful of iterations and with mesh-independent convergence rates.

97 MATHEMATICS AND COMPUTING↗

Mimetic Finite Differences and Algebraic Multilevel Methods for Reservoir Performance Predictions: CRADA Final Report

The need to better predict and control reservoir performance is driving the development of increasingly sophisticated reservoir models that use unstructured general polyhedral grids to capture highly detailed stratigraphy. However, both discretization methods and scalable iterative solution algorithms for these situations are an active area of research. In this work we compared the performance of a new Mimetic Finite Difference (MFD) method with two new Mixed Finite Element methods, and LANL and the CRADA Participant investigated the performance of Los Alamos National Laboratory’s algebraic multigrid code on realistic flow problems. Furthermore, uncertainty quantification requires rapid evaluations of reservoir models. To do this, fine-scale reservoir models need to be coarsened and yet important fine-scale features and processes that have a significant impact on flows need to be preserved. To this end, we investigated the use of multi-resolution methods, such as the Multilevel Multiscale Mimetic (M3) method, to coarsen reservoir models.

97 MATHEMATICS AND COMPUTING↗