Engineering Papers⌕ Search

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.

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

At least 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Comparison of Some RANS Solvers

We will take a look at solving the Reynolds-averaged Navier-Stokes (RANS) equations that are encountered in the context of wind farm performance simulations and optimizations. We will compare some of the more popular ways to solve these equations with a focus on using iterative solvers for the linear solve. We will compare their performance and reliability to a direct solve as we scale the problem both by adding more and parallel resources and by increasing the size of the domain, both in two and three dimensions. There are many strategies that can be applied to solving the RANS equations, some are very efficient, while others are very insensitive to, for example, the Reynolds number. The first contender we will consider is the Pressure-Convection-Diffusion (PCD) preconditioner. Early results suggest that PCD is indeed a very efficient solver, in particular in two dimensions, as long as the Reynold's number remains small. Next we will try to reorder our degrees of freedom such that we can use GMRES with ILU for our linear solve. Another popular choice we will consider for solving the RANS equations is SIMPLE (and its derivatives). For all of our implementations we make use of either FEniCS or Firedrake, basing our work on both existing implementations of some of these solvers while also writing new extensions for others.

CFD↗
DOE OSTI2021

Alpha particle driven Alfvénic instabilities in ITER post-disruption plasmas

Fusion-born alpha particles in ITER disruption simulations are investigated as a possible drive of Alfvénic instabilities. The ability of these waves to expel runaway electron (RE) seed particles is explored in the pursuit of a passive, inherent RE mitigation scenario. The spatiotemporal evolution of the alpha particle distribution during the disruption is calculated using the linearized Fokker–Planck solver CODION coupled to a fluid disruption simulation. These simulations are done in the limit of no alpha particle transport during the thermal quench, which can be seen as a most pessimistic situation where there is also no RE seed transport. Under these assumptions, the radial anisotropy of the resulting alpha population provides free energy to drive Alfvénic modes during the quench phase of the disruption. We use the linear gyrokinetic magnetohydrodynamic code LIGKA to calculate the Alfvén spectrum and find that the equilibrium is capable of sustaining a wide range of modes. The self-consistent evolution of the mode amplitudes and the alpha distribution is calculated utilizing the wave-particle interaction tool HAGIS. Intermediate mode number (n = 7–15, 22–26) toroidal Alfvén eigenmodes are shown to saturate at an amplitude of up to δB/B ≈ 0.1% in the spatial regimes crucial for RE seed formation. We find that the mode amplitudes are predicted to be sufficiently large to permit the possibility of significant radial transport of REs.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

Uncertainty quantification in density estimation from background-oriented Schlieren measurements

In this paper, we present an uncertainty quantification methodology for density estimation from background-oriented Schlieren (BOS) measurements, in order to provide local, instantaneous, a posteriori uncertainty bounds on each density measurement in the field of view. Displacement uncertainty quantification algorithms from cross-correlation-based particle image velocimetry are used to estimate the uncertainty in the dot pattern displacements obtained from cross-correlation for BOSs and assess their feasibility. In order to propagate the displacement uncertainty through the density integration procedure, we also develop a novel methodology via the Poisson solver using sparse linear operators. Testing the method using synthetic images of a Gaussian density field showed agreement between the propagated density uncertainties and the true uncertainty. Subsequently, the methodology is experimentally demonstrated for supersonic flow over a wedge, showing that regions with sharp changes in density lead to an increase in density uncertainty throughout the field of view, even in regions without these sharp changes. Lastly, the uncertainty propagation is influenced by the density integration scheme, and for the Poisson solver the density uncertainty on average increases on moving away from the regions where the Dirichlet boundary conditions are specified.

47 OTHER INSTRUMENTATION↗
DOE OSTI2026

Linear complexity

We present factorization and solution phases for a new linear complexity direct solver designed for concurrent batch operations on fine-grained parallel architectures, for matrices amenable to hierarchical representation. We focus on the strong-admissibility-based $\mathscr{H}^{2}$ format, where strong recursive skeletonization factorization compresses remote interactions. We build upon previous implementations of $\mathscr{H}^{2}$ matrix construction for efficient factorization and solution algorithm design, which are illustrated graphically in stepwise detail. The algorithms are ‘blackbox’ in the sense that the only inputs are the matrix and right-hand side, without analytical or geometrical information about the origin of the system. We demonstrate linear complexity scaling in both time and memory on four representative families of dense matrices up to one million in size. Parallel scaling up to 16 threads is enabled by a multi-level matrix graph coloring and avoidance of dynamic memory allocations thanks to prefix-sum memory management. An experimental backward error analysis is included. We break down the timings of different phases, identify phases that are memory-bandwidth limited, and discuss alternatives for phases that may be sensitive to the trend to employ lower precisions for performance.

Boukaram, Wajih↗
DOE OSTI2025

A scalable multidimensional fully implicit solver for Hall magnetohydrodynamics

We propose an optimally performant fully implicit algorithm for the Hall magnetohydrodynamics (HMHD) equations based on multigrid-preconditioned Jacobian-free Newton-Krylov methods. HMHD is a challenging system to solve numerically because it supports stiff fast dispersive waves. The preconditioner is formulated using an operator-split approximate block factorization (Schur complement), informed by physics insight. We use a vector-potential formulation (instead of a magnetic field one) to allow a clean segregation of the problematic $\nabla$ x $\nabla$ x operator in the electron Ohm's law subsystem. This segregation allows the formulation of an effective damped block-Jacobi smoother for multigrid. We demonstrate by analysis that our proposed block-Jacobi iteration is convergent and has the smoothing property. The resulting HMHD solver is verified linearly with wave propagation examples, and nonlinearly with the GEM challenge reconnection problem by comparison against another HMHD code. We demonstrate the excellent algorithmic and parallel performance of the algorithm up to 16384 MPI tasks in two dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Redesigning large-scale multimodal transit networks with shared autonomous mobility services

Here, this study addresses a large-scale multimodal transit network design problem, with Shared Autonomous Mobility Services (SAMS) as both transit feeders and an origin-to-destination mode. The framework captures spatial demand and modal characteristics, considers intermodal transfers and express services, determines transit infrastructure investment and path flows, and generates transit routes. A system-optimal multimodal transit network is designed with minimum total door-to-door generalized costs of users and operators, satisfying transit origin-destination demand within a pre-set infrastructure budget. Firstly, the geography, demand, and modes in each zone are characterized with continuous approximation. The decisions of network link investment and multimodal path flows in zonal connection optimization are formulated as a minimum-cost multi-commodity network flow (MCNF) problem and solved efficiently with a mixed-integer linear programming (MILP) solver. Subsequently, the route generation problem is solved by expanding the MCNF formulation to minimize intramodal transfers. The model is illustrated through a set of experiments with the Chicago network comprised of 50 zones and seven modes, under three scenarios. The computational results present savings in traveler journey time and operator cost demonstrating the potential benefits of collaboration between multimodal transit systems and SAMS.

Autonomous vehicles↗
DOE OSTI2024

SAM: A Modern System Code for Advanced Non-LWR Safety Analysis

The System Analysis Module (SAM), developed at Argonne National Laboratory and by collaborators at other organizations, is for advanced non–light water reactor safety analysis. SAM aims to provide fast-running, modest-fidelity, whole-plant transient analysis capabilities that are essential for fast-turnaround design scoping and engineering analyses of advanced reactor concepts. To facilitate code development, SAM utilizes the MOOSE object-oriented application framework, its underlying finite element library, and linear and nonlinear solvers to leverage modern advanced software environments and numerical methods. SAM aims to solve tightly coupled physical phenomena, including fission reaction, heat transfer, fluid dynamics, and thermal-mechanical responses in advanced reactor structures, systems, and components with high accuracy and efficiency. Finally, this paper gives an overview of the SAM code development, including goals and functional requirements, physical models, current capabilities, verification and validation, software quality assurance, and examples of simulations for advanced nuclear reactor applications.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Delayed Neutron Precursor Group Parameter and Spectra Generation from Fast Fission of 235U in SCALE

Delayed neutron precursor (DNP) group data are important for modeling reactor dynamics. Although the data for individual DNPs have been developed over time, the DNP group data present in the Evaluated Nuclear Data Files (ENDF) have not been updated in the past 20 years. In this work, we use SCALE to recreate the Godiva experiment that was used to generate the original DNP group structure for fast fission of 235U. However, each DNP is modeled using up-to-date data, and the results are then converted into a newly updated group structure. This conversion uses an iterative linear least squares solver to minimize chi-squared. The approaches used in this work also enable energy spectrum generation and uncertainty tracking. The method used in this paper for fast 235U fission DNP group structure updating can be applied to different energies and fissile nuclides. Demonstration of the uncertainty tracking in reactor kinetics and dynamics simulations is shown using point reactor kinetics simulations. Results show that there are data discrepancies between the International Atomic Energy Agency database and data used in ORIGEN, which are currently being fixed. Results also show that the proposed method for group spectra generation performs well.

Seifert, Luke [University of Illinois]↗
DOE OSTI2024

Impact of Reordering on the LU Factorization Performance of Bordered Block-Diagonal Sparse Matrix

Power engineers rely on computer-based simulation tools to assess grid performance and ensure security. At the core of these tools are solvers for sparse linear equations. When transformed into a bordered block-diagonal (BBD) structure, part of the sparse linear equation solving can be parallelized. This work focuses on using the Schur-complement-based method for LU factorization on BBD matrices, specifically, Jacobian matrices from large-scale systems. Our findings show that the natural ordering method outperforms the default ordering method in computational performance for each block of the BBD matrix. This observation is validated using synthetic 25k-bus and 70k-bus cases, showing a speedup of up to 38% when using natural ordering without permutation. Additionally, the impact of the number of partitions is studied, and the result shows that computational performance improves with more, smaller partitions in the BBD matrices.

BBD matrix↗
DOE OSTI2021

GDSA PFLOTRAN Development (FY2021)

The Spent Fuel & Waste Science and Technology (SFWST) Campaign of the U.S. Department of Energy (DOE) Office of Nuclear Energy (NE), Office of Spent Fuel & Waste Disposition (SFWD) is conducting research and development (R&D) on geologic disposal of spent nuclear fuel (SNF) and high-level nuclear waste (HLW). A high priority for SFWST disposal R&D is to develop a disposal system modeling and analysis capability for evaluating disposal system performance for nuclear waste in geologic media. This report describes fiscal year (FY) 2021 advances of the PFLOTRAN Development group of the SFWST Campaign. The mission of this group is to develop a geologic disposal system modeling capability for nuclear waste that can be used to probabilistically assess the performance of generic disposal concepts. In FY 2021, development proceeded along three main thrusts: software infrastructure, code performance, and process model advancement. Software infrastructure improvements included implementing an Agile software development framework and making improvements to the QA Test Suite. Code performance improvements included development of advanced linear and nonlinear solvers as well as design of flexible smoothing algorithms for capillary pressure functions. Process modeling advancements included the addition of flexible thermal conductivity function definitions and refinement of multi-continuum reactive transport to support Sandia’s participation in DECOVALEX

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2023

PFLOTRAN Development FY2021

The Spent Fuel & Waste Science and Technology (SFWST) Campaign of the U.S. Department of Energy (DOE) Office of Nuclear Energy (NE), Office of Spent Fuel & Waste Disposition (SFWD) is conducting research and development (R&D) on geologic disposal of spent nuclear fuel (SNF) and high-level nuclear waste (HLW). A high priority for SFWST disposal R&D is to develop a disposal system modeling and analysis capability for valuating disposal system performance for nuclear waste in geologic media. This report describes fiscal year (FY) 2021 advances of the PFLOTRAN Development group of the SFWST Campaign. The mission of this group is to develop a geologic disposal system modeling capability for nuclear waste that can be used to probabilistically assess the performance of generic disposal concepts. In FY 2021, development proceeded along three main thrusts: software infrastructure, code performance, and process model advancement. Software infrastructure improvements included implementing an Agile software development framework and making improvements to the QA Test Suite. Code performance improvements included development of advanced linear and nonlinear solvers as well as design of flexible smoothing algorithms for capillary pressure functions. Process modeling advancements included the addition of flexible thermal conductivity function definitions and refinement of multi-continuum reactive transport to support Sandia’s participation in DECOVALEX. This report fulfills the GDSA PFLOTRAN Development Work Package Level 3 Milestone – PFLOTRAN Development, FY2021, M3SF-21SN010304072.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2021

The Effect of the Flux Separability Approximation on Multigroup Neutron Transport

The angular dependence of flux-weighted multigroup cross sections is commonly neglected when generating multigroup libraries. The error of this flux separability approximation is typically not isolated from other error sources due to a lack of availability of library generation and corresponding solvers that cannot relax this approximation. These errors can now be isolated and quantified with the availability of a multigroup Monte Carlo transport and multigroup library-generation capability in the OpenMC Monte Carlo transport code. This work will discuss relevant details of the OpenMC implementation, provide an example case useful for detailing the type of errors one can expect from making the flux separability approximation, and end with more realistic problems which show the impact of the approximation and highlight how it can strongly arise from an energy-dependent resonance absorption effect. Since the angle-dependence is intrinsically linked to the energy group structure, these examples also show that relaxing the flux separability approximation with angle-dependent cross sections could be used to reduce either the fine-tuning required to set a multigroup energy structure for a specific reactor type or the number of energy groups required to obtain a desired level of accuracy for a given problem. This trade-off could increase the costs of generating multigroup cross sections, and has the potential to require more memory for storing the multigroup library during the transport calculations, but it can significantly reduce the computational time required since the runtime of a discrete ordinates or method of characteristics neutron transport solver scales roughly linearly with the number of groups.

42 ENGINEERING↗
DOE OSTI2022

MAPPRAISER: A massively parallel map-making framework for multi-kilo pixel CMB experiments

Forthcoming cosmic microwave background (CMB) polarized anisotropy experiments have the potential to revolutionize our understanding of the Universe and fundamental physics. The sought-after, tale-telling signatures will be however distributed over voluminous data sets which these experiments will collect. These data sets will need to be efficiently processed and unwanted contributions due to astrophysical, environmental, and instrumental effects characterized and efficiently mitigated in order to uncover the signatures. This poses a significant challenge to data analysis methods, techniques, and software tools which will not only have to be able to cope with huge volumes of data but to do so with unprecedented precision driven by the demanding science goals posed for the new experiments. A keystone of efficient CMB data analysis is solvers of very large linear systems of equations. Such systems appear in very diverse contexts throughout CMB data analysis pipelines, however they typically display similar algebraic structures and can therefore be solved using similar numerical techniques. Linear systems arising in the so-called map-making problem are one of the most prominent and common ones. In this work we present a massively parallel, flexible and extensible framework, comprised of a numerical library, MIDAPACK, and a high level code, MAPPRAISER, which provide tools for solving efficiently such systems. Here, the framework implements iterative solvers based on conjugate gradient techniques: enlarged and preconditioned using different preconditioners. We demonstrate the framework on simulated examples reflecting basic characteristics of the forthcoming data sets issued by ground-based and satellite-borne instruments, executing it on as many as 16,384 compute cores. The software is developed as an open source project freely available to the community at: https://github.com/B3Dcmb/midapack.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Enhancements to Overset Methods for Achieving Higher Accuracy and Solution Convergence: Preprint

Overset methods, when utilized within a multi-solver framework, provide a very flexible and powerful toolset for analyzing moving body problem. However, many overset framework suffer from several deficiencies such as (1) convergence degradation of the non-linear iterative schemes (2) difficulty in achieving higher-order accuracy and (3) high computational costs over long simulation times. In this work, we explore approaches that mitigate these deficiencies and provide a pathway for improved accuracy and fidelity of overset methods. A high-order, discontinuous Galerkin solver is integrated into an existing overset framework and applied to an unsteady ROBIN fuselage case. For convergence acceleration, an Overset-GMRES linear solver with a timestep controller is applied to a DLR-F6 aircraft steady simulation and an unsteady, notional rotor-fuselage. Finally the same rotor-fuselage case as well as the JVX rotor/wing case is simulated using a reduced-order aerodynamic model.

aerospace↗
DOE OSTI2024

A High-Performance Discrete-Element Framework for Simulating Flow and Jamming of Moisture Bearing Biomass Feedstocks

We developed and verified a high-performance open-source discrete element method (DEM) solver with simultaneously-supported feedstock-specific interaction models, including bonded-sphere, liquid bridge, cohesion, and non-linear contact models. Our solver uses parallel data structures on hybrid central and graphics processing unit (CPU/GPU) architectures, with favorable strong scaling performance observed for large problem sizes comprised of (100 M particles), and 4X single-node GPU speedup. The particles for corn stover feedstock were conceptualized and calibrated based on experimental measurements and results. Sensitivity analyses demonstrate that the mass flow rate from a wedge hopper is governed primarily by moisture content, friction coefficient, and cohesion energy density. The model is used to reproduce experimentally observed hopper jamming results, highlighting that the experimental no-flow trends can only be achieved by using non-spherical particles, liquid bridge and cohesion models, highlighting the importance of using concurrent feedstock specialized models for the effective representation of biomass material handling problems.

bioenergy↗
DOE OSTI2022

Compressed basis GMRES on high-performance graphics processing units

Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in current computer architectures, motivating the investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures). This article leverages Ginkgo’s memory accessor in order to integrate a communication-reduction strategy into the (Krylov) GMRES solver that decouples the storage format (i.e., the data representation in memory) of the orthogonal basis from the arithmetic precision that is employed during the operations with that basis. Given that the execution time of the GMRES solver is largely determined by the memory accesses, the cost of the datatype transforms can be mostly hidden, resulting in the acceleration of the iterative step via a decrease in the volume of bits being retrieved from memory. Together with the special properties of the orthonormal basis (whose elements are all bounded by 1), this paves the road toward the aggressive customization of the storage format, which includes some floating-point as well as fixed-point formats with mild impact on the convergence of the iterative process. We develop a high-performance implementation of the “compressed basis GMRES” solver in the Ginkgo sparse linear algebra library using a large set of test problems from the SuiteSparse Matrix Collection. We demonstrate robustness and performance advantages on a modern NVIDIA V100 graphics processing unit (GPU) of up to 50% over the standard GMRES solver that stores all data in IEEE double-precision.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

or-topas: Operations Research Toolkit for Pyomo Alternative Solutions

SAND2026-16702O OR-TOPAS: Operations Research Toolkit for Pyomo Alternative Solutions is a tool that enhances optimization applications defined by the Pyomo modeling library. It offers functions to generate optimal or near-optimal solutions, operating independently of Pyomo’s solver interface. Users can configure these functions with specific solver names and options, resulting in a custom solution object that returns a list of solutions. The OR-TOPAS library includes methods tailored to the properties of the model, such as binary integer programs versus linear programs, and specific solver interfaces like Gurobi. It does not provide models for specific applications, but it is applicable to a wide range of Pyomo optimization models. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Siirola, John [Sandia National Lab. (SNL-CA), Live↗