SEARCH · Engineering Papers

Results for “Linear 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.

SourceResearch connectionFrom yearThrough year

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

At least 271 records · Page 15

All sources NASA NTRS DOE OSTI

DOE OSTI2023

symPACK: A GPU-Capable Fan-Out Sparse Cholesky Solver

Sparse symmetric positive definite systems of equations are ubiquitous in scientific workloads and applications. Parallel sparse Cholesky factorization is the method of choice for solving such linear systems. Therefore, the development of parallel sparse Cholesky codes that can efficiently run on today’s large-scale heterogeneous distributed-memory platforms is of vital importance. Modern supercomputers offer nodes that contain a mix of CPUs and GPUs. To fully utilize the computing power of these nodes, scientific codes must be adapted to offload expensive computations to GPUs. We present symPACK, a GPU-capable parallel sparse Cholesky solver that uses one-sided communication primitives and remote procedure calls provided by the UPC++ library. We also utilize the UPC++ "memory kinds" feature to enable efficient communication of GPU-resident data. We show that on a number of large problems, symPACK outperforms comparable state-of-the-art GPU-capable Cholesky factorization codes by up to 14x on the NERSC Perlmutter supercomputer.

Bellavita, Julian↗

DOE OSTI2020

GentenMPI: Distributed Memory Sparse Tensor Decomposition

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

A flexible gyro-fluid system of equations

Gyro-fluid equations are velocity space moments of the gyrokinetic equations. Special gyro-Landau-fluid closures have been developed that include the damping due to kinetic resonances by fitting to the collisionless local plasma response functions. This damping allows for accurate linear eigenmodes to be computed with a relatively low number of velocity space moments compared to the number of velocity quadrature points in gyrokinetic codes. However, none of the published gyro-Landau-fluid closure schemes considers the Onsager symmetries of the resulting quasi-linear fluxes as a constraint. Onsager symmetry guarantees that the matrix of diffusivities is positive definite, an important property for the numerical stability of a transport solver. A two-parameter real closure for improving the accuracy of low-resolution gyro-fluid equations, which preserves the Onsager symmetry and allows higher velocity space moments, is presented in this paper. The new linear gyro-fluid system (GFS) is used to extend the TGLF quasi-linear transport model so that it can compute the energy and momentum fluxes due to parallel magnetic fluctuations, completing the transport matrix. The GFS equations do not use a bounce average approximation. The GFS equations are fully electromagnetic with general flux surface magnetic geometry, pitch angle scattering for electron collisions, and subsonic equilibrium toroidal rotation. Using GFS eigenmodes in the quasi-linear TGLF model will be shown to yield a more accurate match to fluxes computed by CGYRO turbulence simulations. In conclusion, prospects for future applications of a quasi-linear theory to new plasma transport regimes and magnetic confinement devices in addition to tokamaks are opened by the flexibility of the GFS eigensolver.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2020

A fast implicit solver for semiconductor models in one space dimension

Several different approaches are proposed for solving fully implicit discretizations of a simplified Boltzmann-Poisson system with a linear relaxation-type collision kernel. This system models the evolution of free electrons in semiconductor devices under a low-density assumption. At each implicit time step, the discretized system is formulated as a fixed-point problem, which can then be solved with a variety of methods. A key algorithmic component in all the approaches considered here is a recently developed sweeping algorithm for Vlasov-Poisson systems. A synthetic acceleration scheme has been implemented to accelerate the convergence of iterative solvers by using the solution to a drift-diffusion equation as a preconditioner. The performance of four iterative solvers and their accelerated variants has been compared on problems modeling semiconductor devices with various electron mean-free-path.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Quantum computing and preconditioners for hydrological linear systems

Modeling hydrological fracture networks is a hallmark challenge in computational earth sciences. Accurately predicting critical features of fracture systems, e.g. percolation, can require solving large linear systems far beyond current or future high performance capabilities. Quantum computers can theoretically bypass the memory and speed constraints faced by classical approaches, however several technical issues must first be addressed. Chief amongst these difficulties is that such systems are often ill-conditioned, i.e. small changes in the system can produce large changes in the solution, which can slow down the performance of linear solving algorithms. We test several existing quantum techniques to improve the condition number, but find they are insufficient. We then introduce the inverse Laplacian preconditioner, which improves the scaling of the condition number of the system from O(N) to O($\sqrt{N}$) and admits a quantum implementation. These results are a critical first step in developing a quantum solver for fracture systems, both advancing the state of hydrological modeling and providing a novel real-world application for quantum linear systems algorithms.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Simulating Hydrodynamics in Cosmology with CRK-HACC

Abstract We introduce CRK-HACC, an extension of the Hardware/Hybrid Accelerated Cosmology Code (HACC), to resolve gas hydrodynamics in large-scale structure formation simulations of the universe. The new framework couples the HACC gravitational N -body solver with a modern smoothed-particle hydrodynamics (SPH) approach called conservative reproducing kernel SPH (CRKSPH). CRKSPH utilizes smoothing functions that exactly interpolate linear fields while manifestly preserving conservation laws (momentum, mass, and energy). The CRKSPH method has been incorporated to accurately model baryonic effects in cosmology simulations—an important addition targeting the generation of precise synthetic sky predictions for upcoming observational surveys. CRK-HACC inherits the codesign strategies of the HACC solver and is built to run on modern GPU-accelerated supercomputers. In this work, we summarize the primary solver components and present a number of standard validation tests to demonstrate code accuracy, including idealized hydrodynamic and cosmological setups, as well as self-similarity measurements.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

High-order partitioned spectral deferred correction solvers for multiphysics problems

We present an arbitrarily high-order, conditionally stable, partitioned spectral deferred correction (SDC) method for solving multiphysics problems using a sequence of pre-existing single-physics solvers. This method extends the work in [1], [2], which used implicit-explicit Runge-Kutta methods (IMEX) to build high-order, partitioned multiphysics solvers. We consider a generic multiphysics problem modeled as a system of coupled ordinary differential equations (ODEs), coupled through coupling terms that can depend on the state of each subsystem; therefore the method applies to both a semi-discretized system of partial differential equations (PDEs) or problems naturally modeled as coupled systems of ODEs. The sufficient conditions to build arbitrarily high-order partitioned SDC schemes are derived. Based on these conditions, various of partitioned SDC schemes are designed. The stability of the first-order partitioned SDC scheme is analyzed in detail on a coupled, linear model problem. We show that the scheme is conditionally stable, and under conditions on the coupling strength, the scheme can be unconditionally stable. We demonstrate the performance of the proposed partitioned solvers on several classes of multiphysics problems with moderate coupling strength. They include a stiff linear system of ODEs, advection-diffusion-reaction systems, and fluid-structure interaction problems with both incompressible and compressible flows, where we verify the design order of the SDC schemes and study various stability properties. We also directly compare the accuracy, stability, and cost of the proposed partitioned SDC solver with the partitioned IMEX method in [1], [2] on this suite of test problems. The results suggest that the high-order partitioned SDC solvers are more robust than the partitioned IMEX solvers for the numerical examples considered in this work, while the IMEX methods require fewer implicit solves.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

FSISPH: An SPH formulation for impacts between dissimilar materials

Here, we present an SPH formulation with several new features designed to better model the fully-compressible interaction of dissimilar materials. We developed the new method to simulate the atmospheric entry and break-up of small celestial bodies in planetary atmospheres. The formulation uses a unity-based, density-energy discretization of the hydrodynamic conservation laws with linear-corrected kernel gradients. To account for variations in compressibility, we use an HLLC approximate Riemann solver to adjust the velocity gradient at material interfaces. To handle large transverse velocity discontinuities, we introduce a simple slip interface model that limits the artificial viscosity at material interfaces. Diffusion is optionally applied through the velocity gradient and this allows the density and specific thermal energy to evolve in a manner more consistent with the first law of thermodynamics in comparison to other more direct diffusion schemes. We also introduce a material-local second-order artificial conduction scheme used to smooth the specific thermal energy field. Material damage fits neatly under this framework by treating the damage front as a material interface. The method has been implemented as a solver, FSISPH, within the code, Spheral++, and is publicly available on github. We test our new solver on a number of classic shock, mixing, and multi-material problem. The components we outline can significantly improve accuracy of SPH for problems with sharp contact discontinuities.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2021

Exponential Time Differencing Schemes for Fuel Depletion and Transport in Molten Salt Reactors: Theory and Implementation

A numerical framework for modeling depletion and mass transport in liquid-fueled molten salt reactions is presented based on exponential time differencing. The solution method involves using the finite volume method to transform the system of partial differential equations (PDEs) into a much larger system of ordinary differential equations. The key part of this method involves solving for the exponential of a matrix. We explore six different algorithms to compute the exponential in a series of progression problems that explore physical transport phenomena in molten salt reactors. This framework shows good results for solving linear parabolic PDEs with each of the six matrix exponential algorithms. For large problems, the series solvers such as Padé and Taylor have large run times, which can be mitigated by using the Krylov subspace.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2022

Failure Probability Constrained AC Optimal Power Flow

Despite cascading failures being the central cause of blackouts in power transmission systems, existing operational and planning decisions are made largely by ignoring their underlying cascade potential. This paper posits a reliability-aware AC Optimal Power Flow formulation that seeks to design a dispatch point which has a low operator-specified likelihood of triggering a cascade starting from any single component outage. By exploiting a recently developed analytical model of the probability of component failure, our Failure Probability-constrained ACOPF (FP-ACOPF) utilizes the system's expected first failure time as a smoothly tunable and interpretable signature of cascade risk. Here, we use techniques from bilevel optimization and numerical linear algebra to efficiently formulate and solve the FP-ACOPF using off-the-shelf solvers. Extensive simulations on the IEEE 118-bus case show that, when compared to the unconstrained and N-1 security-constrained ACOPF, our probability-constrained dispatch points can significantly lower the probabilities of long severe cascades and of large demand losses, while incurring only minor increases in total generation costs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2023

Acoustic Codes in 2D Spherical Coordinate

Finite-difference methods are widely used to simulate infrasound propagation in the atmosphere. Flexibility of finite-difference scheme allows implementation of highly heterogeneous media for sound propagation as well as complex source models for sound generation. While full 3-D finite-difference methods have been utilized for local infrasound propagation with pronounced topography, 2-D modeling approach has been preferred for regional and global propagation as full 3-D methods generally require enormous computational resources. Infrasound propagation is often simulated with a second-order finite difference scheme. This lowest-order finite-difference scheme is robust and straightforward to implement complex boundary conditions, but the solution includes large error with numerical dispersion and dissipation. This large numerical error may make the second-order finite-difference not optimal for long range infrasound propagation modeling as the numerical dispersion degrades the accuracy of the solution unacceptably. Here, we developed a high-order finite-difference solver for long-range infrasound simulation. The high-order scheme is particularly popular for linear wave modeling in aeroacoustics owing to its low-dispersive and low-dissipative behavior. We develop and evaluate a high-order finite difference scheme in 2-D axisymmetric coordinates. The axisymmetry allows to approximate 3-D spherical sound propagation and amplitude attenuation by a 2-D method. AC2Dr is developed to simulate infrasound propagation in realistic atmosphere, but can be used for linear acoustic waves in general materials with background flow. AC2Dr in an axisymmetric coordinates allows for spherical radiation of acoustic waves from compact sources.

Sjogreen, Bjorn↗

DOE OSTI2025

Finite Element Analysis of the TRUST Nonlinear Dynamics Testbed

This paper builds on prior work conducted within the Los Alamos National Laboratory (LANL) Testbeds to Reduce Uncertainty in Simulations and Tests (TRUST) program. Specifically, it builds on finite element (FE) modeling efforts for the TRUST program’s Nonlinear Dynamics (ND) testbed. Historically, the FE model for the ND testbed has exclusively utilized a Lanczos eigensolver that linearly extracts the system’s natural frequencies. This paper investigates the Abaqus 2024’s explicit dynamic solver, which implements a central difference explicit solver. The central difference method used in Abaqus can capture nonlinear material responses in structural dynamic simulations making it suitable for the ND FE model.

42 ENGINEERING↗

DOE OSTI2022

Verification and validation of linear gyrokinetic and kinetic-MHD simulations for internal kink instability in DIII-D tokamak

Here, verification and linear validation of the internal kink instability in tokamak have been performed for both gyrokinetic (GTC) and kinetic-MHD codes (GAM-solver, M3D-C1-K, NOVA, XTOR-K). Using realistic magnetic geometry and plasma profiles from the same equilibrium reconstruction of the DIII-D shot #141216, these codes exhibit excellent agreement for the growth rate and mode structure of the internal kink mode when all kinetic effects are suppressed. The simulated radial mode structures, obtained from linear simulations, are in reasonable agreement with the normalised electron cyclotron emission measurement after adjusting, within the experimental uncertainty, the safety factor q = 1 flux-surface location in the equilibrium reconstruction. Compressible magnetic perturbations strongly destabilize the kink, while poloidal variations of the equilibrium current density reduce the growth rate of the kink. Furthermore, kinetic effects of thermal ions are found to decrease the kink growth rate in kinetic-MHD simulations, but increase the kink growth rate in gyrokinetic simulations, due to the additional drive of the ion temperature gradient and parallel electric field. Kinetic thermal electrons are found to have negligible effects on the internal kink instability.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

A Simple, Scalable Large Deformation Solid Mechanics Implementation in the MOOSE Framework

This article describes a large deformation solid mechanics solver implemented as part of the freely available and open source MOOSE finite element simulation framework. The article documents the choices made in developing the solid mechanics framework and describes novel formulations for the gradient operator and constitutive modeling framework made to simplify implementations of different coordinate systems, stabilized gradient operators, and different constitutive model inputs and outputs. In the process, the article describes a new formulation that casts objective integration of the Cauchy stress as a linear transformation of the small stress rate. Finally, the article presents key implementation details and examines the parallel efficiency of the solid mechanics solver implemented in MOOSE. The implementation retains a good weak scaling efficiency beyond 1,000 parallel processes. The article includes a discussion of the factors limiting the parallel efficiency of implicit, large deformation solid mechanics codes on current high-performance computers, with the main current limitation being the scalability of the algebraic multigrid methods used to solve the linearized equilibrium equations.

Applied computing → Computer-aided design↗

DOE OSTI2025

Towards large-scale quantum optimization solvers with few qubits

Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Lattice Green’s Functions for High-Order Finite Difference Stencils

Lattice Green's Functions (LGFs) are fundamental solutions to discretized linear operators, and as such they are a useful tool for solving discretized elliptic PDEs on domains that are unbounded in one or more directions. The majority of existing numerical solvers that make use of LGFs rely on a second-order discretization and operate on domains with free-space boundary conditions in all directions. Under these conditions, fast expansion methods are available that enable precomputation of 2D or 3D LGFs in linear time, avoiding the need for brute-force multi-dimensional quadrature of numerically unstable integrals. Here we focus on higher-order discretizations of the Laplace operator on domains with more general boundary conditions, by (1) providing an algorithm for fast and accurate evaluation of the LGFs associated with high-order dimension-split centered finite differences on unbounded domains, and (2) deriving closed-form expressions for the LGFs associated with both dimension-split and Mehrstellen discretizations on domains with one unbounded dimension. Through numerical experiments we demonstrate that these techniques provide LGF evaluations with near machine-precision accuracy, and that the resulting LGFs allow for numerically consistent solutions to high-order discretizations of the Poisson's equation on fully or partially unbounded 3D domains.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Fast solvers for tokamak fluid models with PETSc

Multigrid (MG) is widely recognized as a highly effective solver for the model problem, the Laplacian, but textbook MG fails on most problems of interest. MG methods have been applied to complex, real-world applications with careful consideration of the physical model and discretization. In this work we develop the first step in applying MG methods to science and engineering relevant magnetohydrodynamics (MHD) tokamak models in the M3D-C1 (https://m3dc1.pppl.gov) fusion energy science code. The semi-implicit time integrator in M3D-C1 is composed of many linear solves. The implicit advance of the momentum equation is the most challenging and is the focus of this work. The current production solver in M3D-C1 is a block Jacobi (BJ) preconditioner within a Krylov solver, where blocks group degrees of freedom on planes of constant toroidal coordinate. BJ convergence degrades as the number of planes increases due to the spectral properties of the matrix preconditioned with BJ. The partially magnetic field-aligned, regular toroidal grid structure in M3D-C1 is amenable to semi-coarsening geometric MG in the toroidal direction. This paper develops such a solver and demonstrates competitive performance on a runaway electron model of a SPARC (https://cfs.energy/technology/sparc) disruption, and superior robustness on a stellarator model on which the BJ solver fails to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗