Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solving”

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 1,477 records · Page 82

miniGMG

miniGMG is a compact geometric multigrid (MG benchmark designed to proxy the performance characteristics of the solves found in adaptive mesh refinement multigrid (AMR MG) applications. It solves the equation a*alpha*u - b div beta grad u = f on a large cubical domain using cell-centered values and periodic boundaries. a and b are scalar constants, alpha and beta are space varying constants, f is the right hand side, and u is the solution. The cubical domain is divided into cubical subdomains which are distributed across the supercomputer. The righthand side f is generated from a continuous function for u. Thus, one can solve this linear system of equations and verify the error properties of the discrete solution u by comparing to a sampling of the continuous u. miniGMG implements both v- and f- cycles, as well as two constant coeffficient discretications of the equation above (one 27pt 2nd order, and one 13pt 4th order). In both cases, the (embedded) v-cycles are truncated when a subdomain reaces 4^3, 2^3, or 1^3 cells (a u-cycle). The multigrd solver then swtiches to one of seven coarse grid (bottom) solves. relaxation, BiCGStab, CABiCGStab, TelescopingCABiCGStab, CG, or CACG. The code exploits two forms of communication-avoiding. The first is exemplified by the referenced SC'12 paper in which DRAM data movment is avoided when smoothing. The second, described in the IPDPS'14 paper avoids collectives in a bottom solve (the CA bottom solves). There are a number of implementations of the operators for both CPUs and NVIDIA GPUs. The CPUs have been optimized to exploit a wavefront approach to communication-avoiding. The GPU versions include a number of optimized and tunable implementations. The code has been demonstrated to scale to 46K nodes on the BGQ Mira (750K cores), 9K nodes on Edison (111K cores), and 14K GPUs on Titan (37M cuda cores). It thus acts as a scalable testbed for a wide range of computer science and applied math research. Nominally, one invokes the benchmark as ./run b x y z alpha beta gamma Each subdomain is (2^b)^3 cells Each MPI process receives a x-by-y-by-z collection of subdomains. There are alpha*beta*gamma total MPI processes For correctness (a cubical domain), *alpha==y*beta==z*gamma.

Williams, Sameul↗

Gradient flow based phase-field modeling using separable neural networks

Allen–Cahn equation is a reaction–diffusion equation and is widely used for modeling phase separation. Machine learning methods for solving the Allen–Cahn equation in its strong form suffer from inaccuracies in collocation techniques, errors in computing higher-order spatial derivatives, and the large system size required by the space–time approach. To overcome these challenges, we propose solving the gradient flow of the Ginzburg–Landau free energy functional, which is equivalent to the Allen–Cahn equation, thereby avoiding the second-order spatial derivatives associated with the Allen–Cahn equation. A minimizing movement scheme is employed to solve the gradient flow problem, eliminating the complexities of a space–time approach. We utilize a separable neural network that efficiently represents the phase field through low-rank tensor decomposition. As we use the minimizing movement scheme to numerically solve the gradient flow problem, we thus, refer to the proposed method as the Separable Deep Minimizing Movement (SDMM) method. The evaluation of the functional in the minimizing movement scheme using the Gauss quadrature technique bypasses the inaccuracies associated with collocation techniques traditionally used to solve partial differential equations. A hyperbolic tangent transformation is introduced on the phase field prior to the evaluation of the functional to ensure that it remains strictly bounded within the values of the two phases. For this transformation, theoretical guarantee for energy stability of the minimizing movement scheme is established. Our results suggest that this transformation helps to improve the accuracy and efficiency significantly. The proposed method resolves the challenges faced by state-of-the-art machine learning techniques, outperforming them in both accuracy and efficiency. It is also the first machine learning method to achieve an order of magnitude speed improvement over the finite element method. In addition to its formulation and computational implementation, several case studies illustrate the applicability of the proposed method.

42 ENGINEERING↗

AETHER: A simulation platform for inductively coupled plasma

An in-house code is developed to simulate the inductively coupled plasma (ICP). The model comprises the fluid, electromagnetic and transformer submodels. Fluid equations are solved to evaluate the plasma flow parameters, including the plasma and neutral densities, ion and neutral velocities, electron flux, electron temperature, and electric potential. The model relies on the ambipolar approximation and offers the evaluation of plasma parameters without solving the sheath region. The electromagnetic model handles the calculation of the electric and magnetic fields using the magnetic vector potential. The transformer model captures the effect of the matching circuit utilized in laboratory experiments for RF power deposition. The continuity and momentum equations are solved using finite volume method. The energy, electric potential, and magnetic vector potential equations are solved using finite difference method. The resulting linear systems of equations are solved with iterative solvers including Jacobi and GMRES. The code is written using the C++ programming language, it works in parallel and has graphical user interface. The model is applied to study ICP characteristics of a plasma confined within a cylindrical chamber with dielectric walls for two different power deposition cases. The results obtained from the developed model are verified using the plasma module of COMSOL Multiphysics. The model is also applied to a plasma source configuration, and it is demonstrated that there is an overall increase in the plasma potential when current is extracted from ICP with a biased wall electrode.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive spectral solution method for the Landau and Lenard-Balescu equations

In this paper, we present an adaptive spectral method for solving the Landau/Fokker-Planck equation for electron-ion systems. The heart of the algorithm is an expansion in Laguerre polynomials, which has several advantages, including automatic conservation of both energy and particles without the need for any special discretization or time-stepping schemes. One drawback of such an expansion is the O(N 3 ) memory requirement, where N is the number of polynomials used. This can impose an inconvenient limit in cases of practical interest, such as when two particle species have widely separated temperatures. The algorithm we describe here addresses this problem by periodically re-projecting the solution onto a judicious choice of new basis functions that are still Laguerre polynomials but have arguments adapted to the current physical conditions. This results in a reduction in the number of polynomials needed, at the expense of increased solution time. Because the equations are solved with little difficulty, this added time is not of much concern compared to the savings in memory. To demonstrate the algorithm, we solve several relaxation problems that could not be computed with the spectral method without re-projection. Another major advantage of this method is that it can be used for collision operators more complicated than that of the Landau equation, and we demonstrate this here by using it to solve the non-degenerate quantum Lenard-Balescu (QLB) equation for a hydrogen plasma. We conclude with some comparisons of temperature relaxation problems solved with the latter equation and the Landau equation with a Coulomb logarithm inspired by the properties of the QLB operator. We find that with this choice of Coulomb logarithm, there is little difference between using the two equations for these particular systems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NH-PINN: Neural homogenization-based physics-informed neural network for multiscale problems

Physics-informed neural network (PINN) is a data-driven approach to solving equations. It is successful in many applications; however, the accuracy of the PINN is not satisfactory when it is used to solve multiscale equations. Homogenization approximates a multiscale equation by a homogenized equation without multiscale property; it includes solving cell problems and the homogenized equation. The cell problems are periodic, and we propose an oversampling strategy that significantly improves the PINN accuracy on periodic problems. The homogenized equation has a constant or slow dependency coefficient and can also be solved by PINN accurately. We hence proposed a 3-step method, neural homogenization based PINN (NH-PINN), to improve the PINN accuracy for solving multiscale problems with the help of homogenization.

97 MATHEMATICS AND COMPUTING↗

1-D coupled surface flow and transport equations revisited via the physics-informed neural network approach

The de Saint-Venant equation (SVE) and advection–diffusion equation (ADE) are commonly employed to solve solute transport problems in surface water. In this work, we propose a mesh-free method based on the physics-informed neural network (PINN) to solve the one dimensional (1-D) SVE, ADE, and the coupled SVE and ADE (SVE-ADE) under various initial and boundary conditions. The PINN model extends the architecture of deep neural networks (DNNs) with implementation of loss function, which are additionally subject to constraints imposed by the physical laws of SVE and ADE, along with their initial and boundary conditions. In such a manner, PINNs can be quickly steered to the true solution while obeying the physical laws. The results of PINN model are compared with the analytical and/or numerical solutions under various conditions to investigate its accuracy and efficiency in solving the SVE, ADE, and SVE-ADE. Our results indicate PINN can accurately simulate the shock wave morphology and avoid numerical dissipation in unsteady flow condition. The PINN method outweighed traditional numerical methods in several aspects, including its ability to function with small amounts of data, no grid discretization, and random selection of sampling points, etc. Additionally, the PINN method is also suitable for solving inverse problems with sparse and noisy data. With 1% noise and 2000 initial and boundary condition points (N u ), the errors of the estimated flow rate (v) and diffusion coefficient (D) are 0.003% and 0.105%, respectively, which indicate the accuracy and robustness of the proposed method. Finally, our results indicate the capability and robustness of the proposed PINN methodology for solving multi-physics problems, irrespective of the presence of sparse and noisy data in the training dataset.

54 ENVIRONMENTAL SCIENCES↗

Finite domain solution of a KGD hydraulic fracture in the viscosity-dominated regime

This paper describes a numerical algorithm for solving the classic problem of a plane strain (KGD) fracture propagating in an impermeable elastic medium with zero toughness. The method, which takes advantage of the self-similar nature of the solution, combines a domain-based scheme to solve the elasticity equations and a finite volume method to solve the nonlinear lubrication equation. This work represents a first step towards developing a model able to account for pore pressure diffusion in the medium and corresponding poroelastic effects, noting that these processes are more efficiently solved using a domain-based rather than a boundary integral method. To enhance the efficiency and accuracy of the numerical scheme, the far-field crack asymptotics is embedded in the discretized elastic relationship between the fluid pressure and the crack opening, while the coupled fluid-solid tip asymptote is enforced in a weak form when solving the nonlinear lubrication equation. The proposed technique yields results that closely match the analytical solution, even with a coarse mesh. This approach offers potential for addressing more complex hydraulic fracturing problems in the future.

Domain-based method↗

Redox Potentials for Hydrogen Species in Acetonitrile and Tetrahydrofuran

The properties of the fundamental hydrogen species, proton (H+), hydrogen atom (H•), and hydride anion (H-) are critical to a vast range of chemical processes, yet their thermodynamic properties in nonaqueous solvents are not well established. A hybrid supermolecule-continuum approach is used to predict the Gibbs free energies of solvation (?G°solv) and standard redox potentials (E°) for the 2H+/H2 and H•/H- couples in acetonitrile (MeCN) and tetrahydrofuran (THF) following the approach previously used for water. Gas phase geometry optimizations were done using density functional theory (DFT) with the ?B97XD functional, Møller-Plesset second-order perturbation theory (MP2) with augmented correlation-consistent basis sets and composite-correlated molecular orbital theory (G3MP2 and G3MP2B3). Additional single point calculations in gas phase were performed for H- affinity for MeCN and THF at the coupled cluster CCSD(T) level using MP2 geometries. Solvation was included using the self-consistent reaction field SMD model. For H+, the ?G°solv values are predicted to be -252.2 kcal/mol in MeCN and -261.0 kcal/mol in THF. The redox potentials for the 2H+/H2 couple are +0.49 V in MeCN and +0.11 V in THF relative to the aqueous SHE, consistent with the available experimental data. The ?G°solv for H- is predicted to be -80 kcal/mol in MeCN and -68 in THF, and for H•, ?G°solv is predicted to be -1.3 kcal/mol in THF and -2.0 kcal/mol in MeCN. These solvation energies yield respective calculated redox potentials for the H•/H- couple of -0.14 V in MeCN and -0.68 V in THF relative to the aqueous SHE. H2 solvation is slightly exergonic in MeCN (-3.3 kcal/mol) and near thermoneutral in THF (+1.3 kcal/mol). The pKa(H2) is predicted to be 45.4 in MeCN and 47.8 in THF. The proton-coupled electron transfer (PCET) accounting term CG was evaluated giving values on the ferrocene scale within approximately 2 kcal/mol of literature in both solvents. These results provide benchmarks for hydrogen redox chemistry in MeCN and THF and improve consistency across E°, ?G°solv, pKa, and CG. These results provide benchmarks for hydrogen redox chemistry in nonaqueous media challenging previous estimates based on indirect extrapolations and assumptions.

Duda, Damian P.↗

Algorithms for the Electronic and Vibrational Properties of Nanocrystals

Solving the electronic structure problem for nanoscale systems remains a computationally challenging problem. The numerous degrees of freedom, both electronic and nuclear, make the problem impossible to solve without some effective approximations. Here we illustrate some advances in algorithm developments to solve the Kohn-Sham eigenvalue problem, i.e., we solve the electronic structure problem within density functional theory using pseudopotentials expressed in real space. Our algorithms are based on a nonlinear Chebyshev-filtered subspace iteration method, which avoids computing explicit eigenvectors except at the first self-consistent-field iteration. Our method may be viewed as an approach to solve the original nonlinear Kohn-Sham equation by a nonlinear subspace iteration technique, without emphasizing the intermediate linearized Kohn-Sham eigenvalue problems. Replacing the standard iterative diagonalization at each self-consistent-field iteration by a Chebyshev subspace filtering step results in a significant speedup, often an order of magnitude or more, over methods based on standard diagonalization. We illustrate this method by predicting the electronic and vibrational states for silicon nanocrystals.

Chelikowsky, James↗

The nanostructure problem

Diffraction techniques are making progress in tackling the difficult problem of solving the structures of nanoparticles and nanoscale materials. The great gift of x-ray crystallography has made us almost complacent in our ability to locate the three-dimensional coordinates of atoms in a crystal with a precision of around 10{sup -4} nm. However, the powerful methods of crystallography break down for structures in which order only extends over a few nanometers. In fact, as we near the one hundred year mark since the birth of crystallography, we face a resilient frontier in condensed matter physics: our inability to routinely and robustly determine the structure of complex nanostructured and amorphous materials. Knowing the structure and arrangement of atoms in a solid is so fundamental to understanding its properties that the topic routinely occupies the early chapters of every solid-state physics textbook. Yet what has become clear with the emergence of nanotechnology is that diffraction data alone may not be enough to uniquely solve the structure of nanomaterials. As part of a growing effort to incorporate the results of other techniques to constrain x-ray refinements - a method called 'complex modeling' which is a simple but elegant approach for combining information from spectroscopy with diffraction data to solve the structure of several amorphous and nanostructured materials. Crystallography just works, so we rarely question how and why this is so, yet understanding the physics of diffraction can be very helpful as we consider the nanostructure problem. The relationship between the electron density distribution in three dimensions (i.e., the crystal structure) and an x-ray diffraction pattern is well established: the measured intensity distribution in reciprocal space is the square of the Fourier transform of the autocorrelation function <{rho}(r){rho}(r+r')> of the electron density distribution {rho}(r). The fact that we get the autocorrelation function (rather than just the density distribution) by Fourier transforming the measured intensity leaves us with a very tricky inverse problem: we have to extract the density from its autocorrelation function. The direct problem of predicting the diffraction intensity given a particular density distribution is trivial, but the inverse, unraveling from the intensity distribution the density that gives rise to it, is a highly nontrivial problem in global optimization. In crystallography, this challenging, nontrivial task is sometimes referred to as the 'phase problem.' The diffraction pattern is a wave-interference pattern, but we measure only the intensities (the squares of the waves) not the wave amplitudes. To get the amplitude, you take the square root of the intensity I, but in so doing you lose any knowledge of the phase of the wave {phi}, and half the information needed to reconstruct the density is lost. When solving such inverse problems, you hope you can start with a uniqueness theorem that reassures you that, under ideal conditions, there is only one solution: one density distribution that corresponds to the measured intensity. Then you have to establish that your data set contains sufficient information to constrain that unique solution. This is a problem from information theory that originated with Reverend Thomas Bayes work in the 18th century, and the work of Nyquist and Shannon in the 20 th century, and describes the fact that the degrees of freedom in the model must not exceed the number of pieces of independent information in the data. Finally, you need an efficient algorithm for doing the reconstruction. This is exactly how crystallography works. The information is in the form of Bragg peak intensities and the degrees of freedom are the atomic coordinates. Crystal symmetry lets us confine the model to the contents of a unit cell, rather than all of the atoms in the crystal, keeping the degrees of freedom admirably small in number. A measurement yields a multitude of Bragg peak intensities, providing ample redundant intensity information to make up for the lost phases. Finally, there are highly efficient algorithms, such as 'direct methods,' that make excellent use of the available information and constraints to find the solution quickly from a horrendously large search space. The problem is often so overconstrained that we can cavalierly throw away lots of directional information. In particular, even though Bragg peaks are orientationally averaged to a 1D function in a powder diffraction measurement, we still can get a 3D structural solution. Now it becomes easy to understand the enormous challenge of solving nanostructures: the information content in the data is degraded while the complexity of the model is much greater.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Likelihood-based molecular-replacement solution for a highly pathological crystal with tetartohedral twinning and sevenfold translational noncrystallographic symmetry

With the implementation of a molecular-replacement likelihood target that accounts for translational noncrystallographic symmetry, it became possible to solve the crystal structure of a protein with seven tetrameric assemblies arrayed translationally along the c axis. The new algorithm found 56 protein molecules in reduced symmetry (P1), which was used to resolve space-group ambiguity caused by severe twinning. Translational noncrystallographic symmetry (tNCS) is a pathology of protein crystals in which multiple copies of a molecule or assembly are found in similar orientations. Structure solution is problematic because this breaks the assumptions used in current likelihood-based methods. To cope with such cases, new likelihood approaches have been developed and implemented in Phaser to account for the statistical effects of tNCS in molecular replacement. Using these new approaches, it was possible to solve the crystal structure of a protein exhibiting an extreme form of this pathology with seven tetrameric assemblies arrayed along the c axis. To resolve space-group ambiguities caused by tetartohedral twinning, the structure was initially solved by placing 56 copies of the monomer in space group P1 and using the symmetry of the solution to define the true space group, C2. The resulting structure of Hyp-1, a pathogenesis-related class 10 (PR-10) protein from the medicinal herb St John’s wort, reveals the binding modes of the fluorescent probe 8-anilino-1-naphthalene sulfonate (ANS), providing insight into the function of the protein in binding or storing hydrophobic ligands.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Tucker-1 Boolean Tensor Factorization with Quantum Annealers

Quantum annealers are an emerging computational architecture that have the potential to address some challenging computational issues that will be left unresolved as we approach the end of the Moore's Law era of computing. D-Wave quantum annealers are designed to solve a challenging set of problems - quadratic unconstrained binary optimization problems. This makes them a natural fit for solving problems with binary or Boolean variables. Here, we explore the use of a quantum annealer to solve Boolean tensor factorization. The goal of Boolean tensor factorization is to represent a high-dimensional tensor filled with Boolean values as a product of Boolean matrices and a Boolean core tensor. We show that a particular Boolean tensor factorization problem (called Tucker-1 factorization) can be decomposed into a sequence of quadratic unconstrained binary optimization problems that can be solved with a D-Wave 2000Q quantum annealer. While quantum annealers specifically and quantum computers in general are at a fairly early stage in their development, they are currently capable of solving these Boolean tensor factorization problems. Importantly, our results show that for fairly small tensors, we are frequently able to obtain an accurate (sometimes exact) factorization using quantum annealing.

97 MATHEMATICS AND COMPUTING↗

A Performance and Energy Study of GPU-Resident Preconditioners for Conjugate Gradient Solvers: In the Context of Existing and Novel Approaches

Optimizing a particular subprogram out of the set of Basic (sparse) Linear Algebra Subprograms (BLAS) for a given architecture is a common topic of research. In applications, however, these BLAS functions rarely appear in isolation; usually, many of them are used together, in various combinations and with varying inputs. As the need to solve a large, sparse linear system is ubiquitous throughout HPC applications, linear solvers constitute a realistic, sufficiently complex and well-defined representative use case for composite BLAS routines. To this end, based on a representative set of matrices drawn from a diverse set of fields, we present a framework to study, from the performance and energy perspective, the efficacy of GPU- resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process. The development of this preconditioner was motivated by solving large graph Laplacian linear systems, for which the existing preconditioners either perform slow on GPU-based platforms or are not applicable. We compare the performance of these preconditioners on different hardware accelerator architectures, i.e., AMD MI250X, MI100, Nvidia A100, V100, and Jetson. Our experiments reveal performance trade-offs and provide information on how to select the best strategy for the given linear system, dictated by its properties, and the platform of interest. We demonstrate the application of our novel preconditioner for solving CG and graph Laplacian systems. Overall, the framework can be utilized as a benchmark to guide informed decisions in choosing a specific preconditioner, i.e., whether it is better to rely on the performance of a triangular solver or on the performance of sparse matrix-vector product. Finally, by considering power consumption to solve the linear systems, we report the energy footprint for the solvers.

Preconditioned Conjugate Gradient, GPUs, iterative↗

Multispecies Hypersonic Flow Simulator

MHYSA is a conservative finite-difference code to solve the 1D, 2D, and 3D multispecies Navier-Stokes equations for hypersonic flow applications. It supports Cartesian grids only and has the option of including immersed boundaries. - Solves 1D Euler and 2D and 3D Navier-Stokes equations. - Solves the PDEs over Cartesian grids. - Written entirely in C and uses the MPICH library. It also uses OpenMP threads but this is a work-inprogress. - Can be compiled with PETSc (http://www.mcs.anl.gov/petsc/), if available, where it can use PETSc's time integration module TS (http://www.mcs.anl.gov/petsc/petsc-current/src/ts/). - For 3-dimensional simulations, the immersed boundaries can be used to solve over non-Cartesian geometries. MHYSA has been developed to be scalable, and apart from the usual functionalities to solve a system of PDEs on distributed architectures, it provides scalable file I/O functions.

Ghosh, Debojyoti↗

SUNDIALS time integrators for exascale applications with many independent systems of ordinary differential equations

Many complex systems can be accurately modeled as a set of coupled time-dependent partial differential equations (PDEs). However, solving such equations can be prohibitively expensive, easily taxing the world’s largest supercomputers. One pragmatic strategy for attacking such problems is to split the PDEs into components that can more easily be solved in isolation. This operator splitting approach is used ubiquitously across scientific domains, and in many cases leads to a set of ordinary differential equations (ODEs) that need to be solved as part of a larger “outer-loop” time-stepping approach. The SUNDIALS library provides a plethora of robust time integration algorithms for solving ODEs, and the U.S. Department of Energy Exascale Computing Project (ECP) has supported its extension to applications on exascale-capable computing hardware. In this paper, we highlight some SUNDIALS capabilities and its deployment in combustion and cosmology application codes (Pele and Nyx, respectively) where operator splitting gives rise to numerous, small ODE systems that must be solved concurrently.

97 MATHEMATICS AND COMPUTING↗

An Efficient Multiscale Finite-Element Method for Frequency-Domain Seismic Wave Propagation

The frequency-domain seismic-wave equation, that is, the Helmholtz equation, has many important applications in seismological studies, yet is very challenging to solve, particularly for large geological models. Iterative solvers, domain decomposition, or parallel strategies can partially alleviate the computational burden, but these approaches may still encounter nontrivial difficulties in complex geological models where a sufficiently fine mesh is required to represent the fine-scale heterogeneities. We develop a novel numerical method to solve the frequency-domain acoustic wave equation on the basis of the multiscale finite-element theory. We discretize a heterogeneous model with a coarse mesh and employ carefully constructed high-order multiscale basis functions to form the basis space for the coarse mesh. Solved from medium- and frequency-dependent local problems, these multiscale basis functions can effectively capture themedium’s fine-scale heterogeneity and the source’s frequency information, leading to a discrete system matrix with a much smaller dimension compared with those from conventional methods.We then obtain an accurate solution to the acoustic Helmholtz equation by solving only a small linear system instead of a large linear system constructed on the fine mesh in conventional methods.We verify our new method using several models of complicated heterogeneities, and the results show that our new multiscale method can solve the Helmholtz equation in complex models with high accuracy and extremely low computational costs.

58 GEOSCIENCES↗

Closures for Two-fluid Five-moment Equations for Magnetized Plasmas (Final Scientific Report)

In the proposed work, we will develop a complete set of closures for two-fluid five-moment equations for magnetized plasmas. Specifically, we propose to obtain explicit formulas for electrons and ions to express heat flow, viscosity, frictional force, and collisional heating in terms of density, and temperature, flow velocity. For this purpose, we solve a set of general moment equations for the relevant closure moments. An infinite hierarchy of general moment equations is completely equivalent to the original Landau-Fokker-Planck kinetic equation. In the small gyro-period expansion, the parallel components of the general moment equations agree with the moments of the drift-kinetic equation (DKE). The advantages of solving the moment equations include (i) an exact treatment of the collision operator, (ii) closure and transport relations with no flux-surface average, and (iii) a unified form of closures for general collisionality. Practically we solve a truncated set of moment equations and hence must verify the convergence of the solutions by increasing number of moments. The parallel integral (nonlocal) closures obtained by solving a set of linearized parallel moment equations are useful only when the nonlinear coupling of moments to the temperature and magnetic field gradient terms is negligible. When the nonlinear coupling terms are substantial, we propose a Fourier transform method to solve the parallel moment equations. By Fourier-expanding the magnetic field, we can convert the differential equations of parallel moments to linear algebraic equations for Fourier components of the moments. The convergence of the solutions can be confirmed by increasing the number of Fourier modes. Our preliminary study in axisymmetric circular magnetic geometry with a large aspect ratio shows that (i) the solutions for Fourier modes n=0 and n=1 converge when modes up to n=2 are included in the expansion, and (ii) lower collisionality requires more moments for convergent closures, as in the case of the integral closures. The proposed work will start from this simple magnetic geometry to find general parallel closures and then be generalized to explore a non-circular magnetic field with finite aspect-ratio. With parallel moments known, the perpendicular component of moment closures can be obtained by inverting the generalized cross product operator in the general moment equations. These efforts will be performed in conjunction with several multi-institutional projects, NIMROD, the Center for Extended MHD Modeling (CEMM), and the Plasma Science and Innovation (PSI) Center.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Performance Evaluation of hypre Solvers

This report compares GPU and CPU performance of structured and unstructured hypre solvers on Lassen and Summit. We applied the solvers to various problems of different sizes varying the number of nodes and processes. We provide the individual results for setup phase and solve phase, since preconditioned solvers are often used in different settings. While for a single system solve the total time is determined by the sum of setup and solve time, this can change for different scenarios. For example, in time dependent problems the preconditioner might have to be setup only occasionally or possibly even only once. In that situation solve times will dominate. Thus, since often better GPU speedups can be attained in the solve phase, this will lead to generally better speedups.

97 MATHEMATICS AND COMPUTING↗