Search NASA⌕ Search

SEARCH · Search NASA

Results for “solvers”

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 163 records · Page 9

A GPU Accelerated Mixed‐Precision Finite Difference Informed Random Walker (FDiRW) Solver for Strongly Inhomogeneous Diffusion Problems

In nature, many complex multi‐physics coupling problems exhibit significant diffusivity inhomogeneity, where one process occurs several orders of magnitude faster than others temporally. Simulating rapid diffusion alongside slower processes demands intensive computational resources due to the necessity for small time steps. To address these computational challenges, we have developed an efficient numerical solver named Finite Difference informed Random Walker (FDiRW). In this study, we propose a GPU‐accelerated, mixed‐precision configuration for the FDiRW solver to maximize efficiency through GPU multi‐threaded parallel computation and lower precision computation. Numerical evaluation results reveal that the proposed GPU‐accelerated mixed‐precision FDiRW solver can achieve a 117× speedup over the CPU baseline, while an additional 1.75× speedup is achieved by employing lower precision GPU computation. Notably, for large model sizes, the GPU‐accelerated mixed‐precision FDiRW solver demonstrates strong scaling with the number of nodes used in simulation. When simulating radionuclide absorption processes by porous wasteform particles with a medium‐sized model of 192 × 192 × 192, this approach reduces the total computational time to 10 min, enabling the simulation of larger systems with strongly inhomogeneous diffusivity.

97 MATHEMATICS AND COMPUTING↗

deal.II Implementation of a Weak Galerkin Finite Element Solver for Darcy Flow

This paper presents a weak Galerkin (WG) finite element solver for Darcy flow and its implementation on the deal.II platform. The solver works for quadrilateral and hexahedral meshes in a unified way. It approximates pressure by Q-type degree $k(≥ 0)$ polynomials separately defined in element interiors and on edges/faces. In this work, numerical velocity is obtained in the unmapped Raviart-Thomas space $RT_{[k]}$ via postprocessing based on the novel concepts of discrete weak gradients. The solver is locally mass-conservative and produces continuous normal fluxes. The implementation in deal.II allows polynomial degrees up to 5. Numerical experiments show that our new WG solver performs better than the classical mixed finite element methods.

54 ENVIRONMENTAL SCIENCES↗

Implementing a unified solver for nonlinearly constrained optimization

SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno’s software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at https://github.com/cvanaret/Uno and via its C, Julia, Python, Fortran, and AMPL interfaces.

97 MATHEMATICS AND COMPUTING↗

Scalable domain decomposition solvers for stochastic PDEs in high performance computing

Stochastic spectral finite element models of practical engineering systems may involve solutions of linear systems or linearized systems for non-linear problems with billions of unknowns. For stochastic modeling, it is therefore essential to design robust, parallel and scalable algorithms that can efficiently utilize high-performance computing to tackle such large-scale systems. Domain decomposition based iterative solvers can handle such systems. And though these algorithms exhibit excellent scalabilities, significant algorithmic and implementational challenges exist to extend them to solve extreme-scale stochastic systems using emerging computing platforms. Intrusive polynomial chaos expansion based domain decomposition algorithms are extended here to concurrently handle high resolution in both spatial and stochastic domains using an in-house implementation. Sparse iterative solvers with efficient preconditioners are employed to solve the resulting global and subdomain level local systems through multi-level iterative solvers. We also use parallel sparse matrix–vector operations to reduce the floating-point operations and memory requirements. Numerical and parallel scalabilities of these algorithms are presented for the diffusion equation having spatially varying diffusion coefficient modeled by a non-Gaussian stochastic process. Scalability of the solvers with respect to the number of random variables is also investigated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Data-driven selection of stiff chemistry ODE solver in operator-splitting schemes

Most computational fluid dynamics simulations of practical combustion applications employ operator-splitting schemes, where chemistry and transport are separated and integrated with distinct numerical methods. The changes in composition due to chemistry are evaluated by solving ordinary differential equations (ODE) in each cell of the computational domain, which typically dominates the computational cost when detailed chemistry is considered. In this work, a data-driven approach for the selection of chemistry ODE solvers in operator-splitting schemes is presented. Neural networks are used to predict the ODE solvers CPU times and errors for a given thermochemical state. This allows the selection of an optimal ODE solver on a cell-by-cell, timestep-by-timestep basis. The models are trained using a wide set of thermochemical states generated through partially-stirred reactors and flames simulations. The methodology is validated by quantifying the prediction errors, the classification accuracy, and the computational speedup. The model predicts the optimal ODE solver for 70 to 95% of the validation cases and decreases the computional cost by a factor of 3 or more. The generalizability of the methodology to different chemical mechanisms and different fuels is assessed and it is shown that the model’s performance is only slightly degraded and its applicability is significantly enhanced if the inputs to the neural networks are restricted to a small set of thermochemical state variables present in most chemical mechanisms. In conclusion, the models are used in an homogeneous reactor case and a multi-dimensional CFD simulation of a diesel spray at high pressure where a speedup of more than 3 is achieved.

42 ENGINEERING↗

Highly-scalable GPU-accelerated compressible reacting flow solver for modeling high-speed flows

Emerging supercomputing systems utilize a combination of central processing units (CPUs) and graphics processing units (GPUs) in an effort to reach exascale capabilities while minimizing the energy footprint of operating such systems. Such heterogeneous machines introduce new challenges for fluids solvers because the hardware architecture and operation of a GPU are fundamentally different from conventional CPUs. In this work, a general approach for efficient implementation of finite-volume based reacting flow solvers on such heterogeneous systems is presented. Three main challenges, namely, data access pattern, thread divergence, and thread safety, are addressed. Since compressible reacting flows require special methods to deal with chemical reactions, hyperbolic and nonlinear convection terms, and the presence of turbulence, specific algorithms that ensure GPU-based efficiency are developed. The approach is demonstrated on the widely available OpenFOAM open source software by modifying core algorithms for GPU accessibility. The scalability of the resulting solver, is demonstrated using practical test cases, including flow through a scramjet engine and the dynamics of a rotating detonation engine. Here, the solver provides near-ideal scaleup on a large number of GPUs (>3000), and extremely efficient use of the GPUs, with throughput nearly a constant even when processing a large number of control volumes.

42 ENGINEERING↗

A Full-Induction Magnetohydrodynamics Solver for Liquid Metal Fusion Blankets in Vertex-CFD

Multiphysics modeling of liquid metal fusion blankets, which produce tritium and convert energy of neutrons created via fusion reactions into heat, is crucial for predicting performance, ensuring structural integrity, and optimizing energy production. While traditional blanket modeling of liquid metal flows during normal steady operating conditions commonly employs the inductionless approximation of the magnetohydrodynamics (MHD) equations, transient scenarios, when the plasma-confining magnetic field varies on millisecond time scales, require a full-induction MHD approach that dynamically evolves the magnetic field via the time-dependent induction equation. This paper presents the formulation, implementation, and initial verification of a full-induction MHD solver integrated within the open-source Vertex-CFD framework, which aims to achieve tight multiphysics coupling, a flexible software design enabling easy extension and addition of physics models, and performance portability across computing platforms. The solver utilizes finite element spatial discretization, implicit Runge–Kutta time integration, and an inexact Newton method to solve the resulting discrete nonlinear system, leveraging Trilinos packages for efficient computation. Verification against selected benchmark problems demonstrates accuracy and robustness of the solver. Furthermore, when the solver is applied to an idealized blanket model in 2.5D and full 3D, results obtained with Vertex-CFD are in good agreement with recently published quasi-2D simulations. These findings establish a computational foundation for future simulations of transient MHD phenomena in liquid metal blankets with Vertex-CFD, and open avenues for future extensions and performance optimizations.

Endeve, Eirik [ORNL] (ORCID:0000000312519507)↗

Fast elliptic solvers in cylindrical coordinates and the Coulomb collision operator

Highlights: {yields} We describe new fast solvers for elliptic partial differential equations in free space. {yields} We combine integral equation methods with Fourier methods to achieve high order accuracy. {yields} We apply these solvers to the evaluation of the Coulomb collision operator in plasma physics. - Abstract: In this paper, we describe a new class of fast solvers for separable elliptic partial differential equations in cylindrical coordinates (r, {theta}, z) with free-space radiation conditions. By combining integral equation methods in the radial variable r with Fourier methods in {theta} and z, we show that high-order accuracy can be achieved in both the governing potential and its derivatives. A weak singularity arises in the Fourier transform with respect to z that is handled with special purpose quadratures. We show how these solvers can be applied to the evaluation of the Coulomb collision operator in kinetic models of ionized gases.

97 MATHEMATICS AND COMPUTING↗

An approximate Riemann solver for real gas parabolized Navier-Stokes equations

Under specific assumptions, parabolized Navier-Stokes equations are a suitable mean to study channel flows. A special case is that of high pressure flow of real gases in cooling channels where large crosswise gradients of thermophysical properties occur. To solve the parabolized Navier-Stokes equations by a space marching approach, the hyperbolicity of the system of governing equations is obtained, even for very low Mach number flow, by recasting equations such that the streamwise pressure gradient is considered as a source term. For this system of equations an approximate Roe's Riemann solver is developed as the core of a Godunov type finite volume algorithm. The properties of the approximated Riemann solver, which is a modification of Roe's Riemann solver for the parabolized Navier-Stokes equations, are presented and discussed with emphasis given to its original features introduced to handle fluids governed by a generic real gas EoS. Sample solutions are obtained for low Mach number high compressible flows of transcritical methane, heated in straight long channels, to prove the solver ability to describe flows dominated by complex thermodynamic phenomena.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A new efficient formulation of the HLLEM Riemann solver for general conservative and non-conservative hyperbolic systems

In this paper a new, simple and universal formulation of the HLLEM Riemann solver (RS) is proposed that works for general conservative and non-conservative systems of hyperbolic equations. For non-conservative PDE, a path-conservative formulation of the HLLEM RS is presented for the first time in this paper. The HLLEM Riemann solver is built on top of a novel and very robust path-conservative HLL method. It thus naturally inherits the positivity properties and the entropy enforcement of the underlying HLL scheme. However, with just the slight additional cost of evaluating eigenvectors and eigenvalues of intermediate characteristic fields, we can represent linearly degenerate intermediate waves with a minimum of smearing. For conservative systems, our paper provides the easiest and most seamless path for taking a pre-existing HLL RS and quickly and effortlessly converting it to a RS that provides improved results, comparable with those of an HLLC, HLLD, Osher or Roe-type RS. This is done with minimal additional computational complexity, making our variant of the HLLEM RS also a very fast RS that can accurately represent linearly degenerate discontinuities. Our present HLLEM RS also transparently extends these advantages to non-conservative systems. For shallow water-type systems, the resulting method is proven to be well-balanced. Several test problems are presented for shallow water-type equations and two-phase flow models, as well as for gas dynamics with real equation of state, magnetohydrodynamics (MHD & RMHD), and nonlinear elasticity. Since our new formulation accommodates multiple intermediate waves and has a broader applicability than the original HLLEM method, it could alternatively be called the HLLI Riemann solver, where the “I” stands for the intermediate characteristic fields that can be accounted for. -- Highlights: •New simple and general path-conservative formulation of the HLLEM Riemann solver. •Application to general conservative and non-conservative hyperbolic systems. •Inclusion of sub-structure and resolution of intermediate characteristic fields. •Well-balanced for single- and two-layer shallow water equations and multi-phase flows. •Euler equations with real equation of state, MHD equations, nonlinear elasticity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable line and plane relaxation in a parallel structured multigrid solver

The efficient solution of sparse, linear systems that arise through the discretization of partial differential equations remains a key challenge for a range of high performance scientific simulations. One approach for reducing data movement and improving performance is by exposing and exploiting structure in a problem through the use of robust structured multilevel solvers. By choosing coarsening that preserves the structure of the problem, these methods maintain efficient structured computation and communication throughout the multigrid hierarchy. However, when coarsening is not permitted to be dependent on the operator, anisotropy must be addressed by the smoother — producing error compatible for coarse-grid correction with structured coarsening. Here, the components required in a scalable parallel structured solver are described with a focus on memory and communication efficiency of robust smoothers. While the implementation of communication and memory reduction techniques in smoothers integrated in a complete 3D solver present a significant engineering challenge, a novel approach is proposed that addresses these challenges systematically through a change to the solver’s execution model. Enabled by user-level threading paired with a set of data and communication abstractions, this approach permits seamless aggregation of communication in plane smoothers — directly reusing code for a 2D distributed multilevel cycle. Results show an effective reduction in communication costs for coarse-grid problems, and result in a speedup of 8.7x in smoothing routines shown in Fig. 12 using this approach. This produces a significant improvement to strong scalability while maintaining favorable weak scaling behavior. Finally, a parallel scaling study using a series of refined meshes is included that demonstrates the effectiveness of this approach in an application of interest.

97 MATHEMATICS AND COMPUTING↗

Dual-solver hybrid computational approaches for design and analysis of vertical lift vehicles

Abstract The cost of Reynolds-Averaged Navier-Stokes simulations can be restrictive to implement in aeromechanics design and analysis of vertical lift configurations given the cost to resolve the flow on a mesh sufficient to provide accurate aerodynamic and structural loads. Dual-solver hybrid methods have been developed that resolve the configuration and the near field with the Reynolds-Averaged Navier-Stokes solvers, while the wake is resolved with vorticity-preserving methods that are more cost-effective. These dual-solver approaches can be integrated into an organisation’s workflow to bridge the gap between lower-fidelity methods and the expensive Reynolds-Averaged Navier-Stokes when there are complex physics present. This paper provides an overview of different dual-solver hybrid methods, coupling approaches, and future efforts to expand their capabilities in the areas of novel configurations and operations in constrained and turbulent environments.

Engineering↗

Performance of Cloud 3D Solvers in Ice Cloud Shortwave Radiation Closure Over the Equatorial Western Pacific Ocean

Abstract For retrieving cloud optical properties from satellite images or computing these properties from climate model output, computationally efficient treatments of cloud horizontal inhomogeneity include the Monte Carlo Independent Column Approximation (McICA) and the Tripleclouds method. Computationally efficient treatment of cloud horizontal radiation exchanges includes the SPeedy Algorithm for Radiative TrAnsfer through CloUd Sides (SPARTACUS). As a test to derive properties from satellite images, we collocate Moderate Resolution Imaging Spectroradiometer (MODIS) cloud retrievals with near‐nadir Cloud and the Earth's Radiant Energy System (CERES) footprints in July 2008 over an equatorial western Pacific Ocean region to compare the performance of the McICA, Tripleclouds, and SPARTACUS solvers to the conventional plane‐parallel homogeneous (PPH) treatment. PPH overestimates cloud albedo, and the three solvers effectively reduce overestimation with root mean square error of shortwave upwelling irradiance decreasing between 15.72 and 18.53 W m −2 , or about 22%–25%. Although cloud top variability does not get fed into the simulations, all three solvers also reduce the effect of cloud top variability on cloud albedo. Entrapment (energy reflected downward from clouds) and horizontal radiation transfer have opposite effects on the SPARTACUS cloud albedo simulation. The net effect depends on the cloud vertical extent, the unawareness of which limits the performance of the SPARTACUS solver.

54 ENVIRONMENTAL SCIENCES↗

Enhancing high-fidelity nonlinear solver with reduced order model

Abstract We propose the use of reduced order modeling (ROM) to reduce the computational cost and improve the convergence rate of nonlinear solvers of full order models (FOM) for solving partial differential equations. In this study, a novel ROM-assisted approach is developed to improve the computational efficiency of FOM nonlinear solvers by using ROM’s prediction as an initial guess. We hypothesize that the nonlinear solver will take fewer steps to the converged solutions with an initial guess that is closer to the real solutions. To evaluate our approach, four physical problems with varying degrees of nonlinearity in flow and mechanics have been tested: Richards’ equation of water flow in heterogeneous porous media, a contact problem in a hyperelastic material, two-phase flow in layered porous media, and fracture propagation in a homogeneous material. Overall, our approach maintains the FOM’s accuracy while speeding up nonlinear solver by 18–73% (through suitable ROM-assisted FOMs). More importantly, the proximity of ROM’s prediction to the solution space leads to the improved convergence of FOMs that would have otherwise diverged with default initial guesses. We demonstrate that the ROM’s accuracy can impact the computational efficiency with more accurate ROM solutions, resulting in a better cost reduction. We also illustrate that this approach could be used in many FOM discretizations (e.g., finite volume, finite element, or a combination of those). Since our ROMs are data-driven and non-intrusive, the proposed procedure can easily lend itself to any nonlinear physics-based problem.

97 MATHEMATICS AND COMPUTING↗

A 3D approximate maximum likelihood solver for localization of fish implanted with acoustic transmitters

Better understanding of fish behavior is vital for recovery of many endangered species including salmon. The Juvenile Salmon Acoustic Telemetry System (JSATS) was developed to observe the out-migratory behavior of juvenile salmonids tagged by surgical implantation of acoustic micro-transmitters and to estimate the survival when passing through dams on the Snake and Columbia Rivers. A robust three-dimensional solver was needed to accurately and efficiently estimate the time sequence of locations of fish tagged with JSATS acoustic transmitters, to describe in sufficient detail the information needed to assess the function of dam-passage design alternatives. An approximate maximum likelihood solver was developed using measurements of time difference of arrival from all hydrophones in receiving arrays on which a transmission was detected. Field experiments demonstrated that the developed solver performed significantly better in tracking efficiency and accuracy than other solvers described in the literature.

60 APPLIED LIFE SCIENCES↗

A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments

The computational study of chemical reactions in complex, wet environments is critical for applications in many fields. It is often essential to study chemical reactions in the presence of applied electrochemical potentials, taking into account the non-trivial electrostatic screening coming from the solvent and the electrolytes. As a consequence, the electrostatic potential has to be found by solving the generalized Poisson and the Poisson-Boltzmann equations for neutral and ionic solutions, respectively. In the present work, solvers for both problems have been developed. A preconditioned conjugate gradient method has been implemented for the solution of the generalized Poisson equation and the linear regime of the Poisson-Boltzmann, allowing to solve iteratively the minimization problem with some ten iterations of the ordinary Poisson equation solver. In addition, a self-consistent procedure enables us to solve the non-linear Poisson-Boltzmann problem. Both solvers exhibit very high accuracy and parallel efficiency and allow for the treatment of periodic, free, and slab boundary conditions. The solver has been integrated into the BigDFT and Quantum-ESPRESSO electronic-structure packages and will be released as an independent program, suitable for integration in other codes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A numerical solver for investigating the space charge effect on the electric field in liquid argon time projection chambers

This paper reports the development of a numerical solver aimed to simulate the interaction between the space charge (i.e. ions) distribution and the electric field in liquid argon time projection chamber (LArTPC) detectors. The ion transport equation is solved by a time-accurate, cell-centered finite volume method and the electric potential equation by a continuous finite element method. The electric potential equation updates the electric field which provides the drift velocity to the ion transport equation. The ion transport equation updates the space charge density distribution which appears as the source term in the electric potential equation. The interaction between the space charge distribution and the electric field is numerically simulated within each physical time step. The convective velocity in the ion transport equation can include the background flow velocity in addition to the electric drift velocity. The numerical solver has been parallelized using the Message Passing Interface (MPI) library. Numerical tests show and verify the capability and accuracy of the current numerical solver. It is planned that the developed numerical solver, together with a Computational Fluid Dynamics (CFD) package which provides the flow velocity field, can be used to investigate the space charge effect on the electric field in large-scale particle detectors.

42 ENGINEERING↗

TeaLeaf: A Mini-Application to Enable Design-Space Explorations for Iterative Sparse Linear Solvers

Iterative sparse linear solvers are an important class of algorithm in high performance computing, and form a crucial component of many scientific codes. As intra and inter node parallelism continues to increase rapidly, the design of new, scalable solvers which can target next generation architectures becomes increasingly important. In this work we present TeaLeaf, a recent mini-app constructed to explore design space choices for highly scalable solvers. We then use TeaLeaf to compare the standard CG algorithm with a Chebyshev Polynomially Preconditioned Conjugate Gradient (CPPCG) iterative sparse linear solver. CPPCG is a communication-avoiding algorithm, requiring less global communication than previous approaches. TeaLeaf includes support for many-core processors, such as GPUs and Xeon Phi, and we include strong-scaling results across a range of world-leading Petascale supercomputers, including Titan and Piz Daint.

97 MATHEMATICS AND COMPUTING↗