SEARCH · Engineering Papers

Results for “numerical mathematics”

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 847 records · Page 47

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Large-Scale Inference of Multivariate Regression for Heavy-Tailed and Asymmetric Data

Large-scale multivariate regression is a fundamental statistical tool with a wide range of applications. Here, this study considers the problem of simultaneously testing a large number of general linear hypotheses, encompassing covariate-effect analysis, analysis of variance, and model comparisons. The challenge that accompanies a large number of tests is the ubiquitous presence of heavy-tailed and/or highly skewed measurement noise, which is the main reason for the failure of conventional least squares-based methods. For large-scale multivariate regression, we develop a set of robust inference methods to explore data features such as heavy tailedness and skewness, which are not visible to least squares methods. The new testing procedure is based on the data-adaptive Huber regression and a new covariance estimator of regression estimates. Under mild conditions, we show that our methods produce consistent estimates of the false discovery proportion. Extensive numerical experiments and an empirical study on quantitative linguistics demonstrate the advantage of the proposed method over many state-of-the-art methods when the data are generated from heavy-tailed and/or skewed distributions.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Proof-of-Concept for Sensor Modeling in MOOSE for the Design of Autonomous Nuclear Reactor Control

Autonomous operation is essential for the deployment of microreactors and fission batteries, both in terrestrial and space applications. For this reason, recent studies have investigated autonomous control by using adaptive model predictive control and multi-objective optimization for heat pipe–cooled microreactors under normal and heat pipe failure conditions. However, prototypes of microreactors and fission batteries do not exist yet, and even the design space has not been narrowed down conclusively, making the instrumentation and control system design difficult. For this reason, there is a need for flexible computational capabilities to create a numerical stand-in of potential microreactor and fission battery designs. The latter can be used to design and test control strategies to support autonomous operations. In this poster, we describe the initial implementation of a pluggable sensor system for the easy implementation of realistic sensor models in the multiphysics object-oriented simulation environment (MOOSE) framework. This new capability will enable MOOSE users to create a numerical stand-in of microreactors and fission batteries, ultimately allowing them to easily test new control algorithms, and instrumentation strategies for advanced systems in the design phase.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2020

A mathematical model of asynchronous data flow in parallel computers *

Abstract We present a simplified model of data flow on processors in a high-performance computing framework involving computations necessitating inter-processor communications. From this ordinary differential model, we take its asymptotic limit, resulting in a model which treats the computer as a continuum of processors and data flow as an Eulerian fluid governed by a conservation law. We derive a Hamilton–Jacobi equation associated with this conservation law for which the existence and uniqueness of solutions can be proven. We then present the results of numerical experiments for both discrete and continuum models; these show a qualitative agreement between the two and the effect of variations in the computing environment’s processing capabilities on the progress of the modelled computation.

Barnard, Richard C.↗

DOE OSTI2021

Numerical analyses of exponential time-differencing schemes for the solution of atmospheric models

In high-resolution numerical weather prediction models, fast-moving acoustic waves must be treated in a stable manner. Among the implicit–explicit (IMEX) schemes used for the solution of these models, horizontally explicit, vertically implicit (HEVI) methods show good stability and scalability on massively parallel machines. In this work, we present two classes of exponential time-differencing (ETD) methods for atmospheric models that use a HEVI splitting strategy, one being a three-stage method with the addition of artificial diffusion, the second based on a Strang splitting approach. Overall, the stability properties of the methods are analyzed and numerical examples are provided, which compare time-step restrictions and cost-to-accuracy ratios of the new methods with those for existing approaches.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2023

Exponential Runge-Kutta Parareal for non-diffusive equations

Parareal is a well-known parallel-in-time algorithm that combines a coarse and fine propagator within a parallel iteration. It allows for large-scale parallelism that leads to significantly reduced computational time compared to serial time-stepping methods. However, like many parallel-in-time methods it can fail to converge when applied to non-diffusive equations such as hyperbolic systems or dispersive nonlinear wave equations. Here, this paper explores the use of exponential integrators within the Parareal iteration. Exponential integrators are particularly interesting candidates for Parareal because of their ability to resolve fast-moving waves, even at the large stepsizes used by coarse propagators. This work begins with an introduction to exponential Parareal integrators followed by several motivating numerical experiments involving the nonlinear Schrödinger equation. These experiments are then analyzed using linear analysis that approximates the stability and convergence properties of the exponential Parareal iteration on nonlinear problems. The paper concludes with two additional numerical experiments involving the dispersive Kadomtsev-Petviashvili equation and the hyperbolic Vlasov-Poisson equation. These experiments demonstrate that exponential Parareal methods offer improved time-to-solution compared to serial exponential integrators when solving certain non-diffusive equations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Low-synch Gram–Schmidt with delayed reorthogonalization for Krylov solvers

The parallel strong-scaling of iterative methods is often determined by the number of global reductions at each iteration. Low-synch Gram-Schmidt algorithms are applied here to the Arnoldi algorithm to reduce the number of global reductions and therefore to improve the parallel strong-scaling of iterative solvers for nonsymmetric matrices such as the GMRES and the Krylov-Schur iterative methods. In the Arnoldi context, the factorization is "left-looking" and processes one column at a time. Among the methods for generating an orthogonal basis for the Arnoldi algorithm, the classical Gram-Schmidt algorithm, with reorthogonalization (CGS2) requires three global reductions per iteration. A new variant of CGS2 that requires only one reduction per iteration is presented and applied to the Arnoldi algorithm. Delayed CGS2 (DCGS2) employs the minimum number of global reductions per iteration (one) for a one-column at-a-time algorithm. The main idea behind the new algorithm is to group global reductions by rearranging the order of operations. DCGS2 must be carefully integrated into an Arnoldi expansion or a GMRES solver. Numerical stability experiments assess robustness for Krylov-Schur eigenvalue computations. Performance experiments on the ORNL Summit supercomputer then establish the superiority of DCGS2 over CGS2.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Orthogonal Polynomials Defined by Self-Similar Measures with Overlaps

Here, we study orthogonal polynomials with respect to self-similar measures, focusing on the class of infinite Bernoulli convolutions, which are defined by iterated function systems with overlaps, especially those defined by the Pisot, Garsia, and Salem numbers. By using an algorithm of Mantica, we obtain graphs of the coefficients of the 3-term recursion relation defining the orthogonal polynomials. We use these graphs to predict whether the singular infinite Bernoulli convolutions belong to the Nevai class. Based on our numerical results, we conjecture that all infinite Bernoulli convolutions with contraction ratios greater than or equal to 1/2 belong to Nevai’s class, regardless of the probability weights assigned to the self-similar measures.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Rank-Limiting Strategies for Optimizing Tensor-Train Finite-Difference Time-Domain Simulations

We introduce rank-limiting strategies to optimize tensor-train decompositions for three-dimensional finite-difference time-domain simulations using the relationship between the tensors and their specific dimensionality. These include the use of hard caps on the inner ranks of the tensor train decomposition and the use of a group rounding algorithm taking into account all field components simultaneously. Here, several numerical examples are considered to verify the efficacy of the proposed optimization strategies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2023

Numerical and Visual Representations of Uncertainty Lead to Different Patterns of Decision Making

Although visualizations are a useful tool for helping people to understand information, they can also have unintended effects on human cognition. This is especially true for uncertain information, which is difficult for people to understand. Prior work has found that different methods of visualizing uncertain information can produce different patterns of decision making from users. However, uncertainty can also be represented via text or numerical information, and few studies have systematically compared these types of representations to visualizations of uncertainty. We present two experiments that compared visual representations of risk (icon arrays) to numerical representations (natural frequencies) in a wildfire evacuation task. Like prior studies, we found that different types of visual cues led to different patterns of decision making. In addition, our comparison of visual and numerical representations of risk found that people were more likely to evacuate when they saw visualizations than when they saw numerical representations. These experiments reinforce the idea that design choices are not neutral: seemingly minor differences in how information is represented can have important impacts on human risk perception and decision making.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

SNS: A Solution-Based Nonlinear Subspace Method for Time-Dependent Model Order Reduction

Several reduced order models have been successfully developed for nonlinear dynamical systems. To achieve a considerable speed-up, a hyper-reduction step is needed to reduce the computational complexity due to nonlinear terms. Many hyper-reduction techniques require the construction of nonlinear term basis, which introduces a computationally expensive offline phase. A novel way of constructing nonlinear term basis within the hyper-reduction process is introduced. In contrast to the traditional hyper-reduction techniques where the collection of nonlinear term snapshots is required, the SNS method avoids collecting the nonlinear term snapshots. Instead, it uses the solution snapshots that are used for building a solution basis, which enables avoiding an extra data compression of nonlinear term snapshots. As a result, the SNS method provides a more efficient offline strategy than the traditional model order reduction techniques, such as the DEIM, GNAT, and ST-GNAT methods. The SNS method is theoretically justified by the conforming subspace condition and the subspace inclusion relation. It is useful for model order reduction of large-scale nonlinear dynamical problems to reduce the offline cost. It is especially useful for ST-GNAT that has shown promising results, such as a good accuracy with a considerable online speed-up for hyperbolic problems in a recent paper by Choi and Carlberg [SIAM J. Sci. Comput., 41 (2019), pp. A26--A58], because ST-GNAT involves an expensive offline cost related to collecting nonlinear term snapshots. Error analysis for the SNS method is presented. Numerical results support that the accuracy of the solution from the SNS method is comparable to the traditional methods and a considerable speed-up (i.e., a factor of two to a hundred) is achieved in the offline phase.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Low-Order Preconditioning for the High-Order Finite Element de Rham Complex

Here, we present a unified framework for constructing spectrally equivalent low-order-refined discretizations for the high-order finite element de Rham complex. This theory covers diffusion problems in H 1 , H(curl), and H(div) and is based on combining a low-order discretization posed on a refined mesh with a high-order basis for Nédélec and Raviart–Thomas elements that makes use of the concept of polynomial histopolation (polynomial fitting using prescribed mean values over certain regions). This spectral equivalence, coupled with algebraic multigrid methods constructed using the low-order discretization, results in highly scalable matrix-free preconditioners for high-order finite element problems in the full de Rham complex. Additionally, a new lowest-order (piecewise constant) preconditioner is developed for high-order interior penalty discontinuous Galerkin (DG) discretizations, for which spectral equivalence results and convergence proofs for algebraic multigrid methods are provided. In all cases, the spectral equivalence results are independent of polynomial degree and mesh size; for DG methods, they are also independent of the penalty parameter. These new solvers are flexible and easy to use; any “black-box” preconditioner for low-order problems can be used to create an effective and efficient preconditioner for the corresponding high-order problem. A number of numerical experiments are presented, based on an implementation in the finite element library MFEM. A range of challenging three-dimensional problems are used to corroborate the theoretical properties and demonstrate the flexibility and scalability of the method.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Scalability of high-performance PDE solvers

Performance tests and analyses are critical to effective high-performance computing software development and are central components in the design and implementation of computational algorithms for achieving faster simulations on existing and future computing architectures for large-scale application problems. In this article, we explore performance and space-time trade-offs for important compute-intensive kernels of large-scale numerical solvers for partial differential equations (PDEs) that govern a wide range of physical applications. We consider a sequence of PDE-motivated bake-off problems designed to establish best practices for efficient high-order simulations across a variety of codes and platforms. We measure peak performance (degrees of freedom per second) on a fixed number of nodes and identify effective code optimization strategies for each architecture. In addition to peak performance, we identify the minimum time to solution at 80% parallel efficiency. The performance analysis is based on spectral and p-type finite elements but is equally applicable to a broad spectrum of numerical PDE discretizations, including finite difference, finite volume, and h-type finite elements.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Subcritical Multiplication with a Fixed Source

In a subcritical, multiplying medium, the system multiplication describes the expected total number of neutrons created by a single source neutron. Subcriticality plays a large role in criticality safety and thus it is vital for the subcritical multiplication factor be accurate, especially as a system approaches criticality. This work examines the accuracy of calculating the system multiplication using the MCNP6.2 ® k-eigenvalue power iteration (KCODE) method when a fixed-point source is present in a multiplying medium, for near critical systems. This work compares the standard approach for calculating system multiplication, using the fixed-source calculational approach, to a new, single k-eigenvalue power iteration approach that incorporates a fixed-source component and a fission-source component into a single calculation. For the remainder of this paper, some theoretical background and numerical results for an approximate k eigenvalue approach, an accurate fixed-source approach and a new and more accurate k-eigenvalue approach to computing system multiplication are provided.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2021

Black-Box Neural System Identification and Differentiable Programming to Improve Earth System Model Predictions February

Focal Area(s): Focal Area 2: AI for predictive modeling, including AI-derived model components, and AI-enabled applications including parameter optimization, data assimilation, and uncertainty quantification. Focal Area 1: AI-assisted data assimilation using numerical Earth system models. Science Challenge: Earth system models have structural biases that lead to uncertain predictions, and their complexity and expense makes it difficult constraining the models with data or improved physical understanding.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2022

Numerical Modeling of the Effects of Coating Plates on Terminal Ballistic Performance

This report deals with the development and evaluation of a numerical model to examine applied coating to a metal substrate subjected to a ballistic impact. The numerical model will be used to examine the benefit of the coating in resisting penetration due to the impact. For a detailed examination the Retch-Ipson curve is used as a metric. The numerical data is plotted and then fit to the Retch-Ipson curve and error calculations are used to compare the difference between the numerical output and the experimental data. This initial study is an examination of a few shortcomings of the standard material models used, and demonstrate the future work that is needed to understand the ballistic behavior of materials.

36 MATERIALS SCIENCE↗

DOE OSTI2024

Building spatial symmetries into parameterized quantum circuits for faster training

Practical success of quantum learning models hinges on having a suitable structure for the parameterized quantum circuit. Such structure is defined both by the types of gates employed and by the correlations of their parameters. While much research has been devoted to devising adequate gate-sets, typically respecting some symmetries of the problem, very little is known about how their parameters should be structured. In this work, we show that an ideal parameter structure naturally emerges when carefully considering spatial symmetries (i.e. the symmetries that are permutations of parts of the system under study). Namely, we consider the automorphism group of the problem Hamiltonian, leading us to develop a circuit construction that is equivariant under this symmetry group. The benefits of our novel circuitstructure, called ORB, are numerically probed in several ground-state problems. We find a consistent improvement (in terms of circuit depth, number of parameters required, and gradient magnitudes) compared to literature circuit constructions.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Parallelization techniques for quantum simulation of fermionic systems

Mapping fermionic operators to qubit operators is an essential step for simulating fermionic systems on a quantum computer. We investigate how the choice of such a mapping interacts with the underlying qubit connectivity of the quantum processor to enable (or impede) parallelization of the resulting Hamiltonian-simulation algorithm. It is shown that this problem can be mapped to a path coloring problem on a graph constructed from the particular choice of encoding fermions onto qubits and the fermionic interactions onto paths. The basic version of this problem is called the weak coloring problem. Taking into account the fine-grained details of the mapping yields what is called the strong coloring problem, which leads to improved parallelization performance. A variety of illustrative analytical and numerical examples are presented to demonstrate the amount of improvement for both weak and strong coloring-based parallelizations. Our results are particularly important for implementation on near-term quantum processors where minimizing circuit depth is necessary for algorithmic feasibility.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Computational Methods for Multi-Physics Simulation of Melting in Steelmaking

Iron and steel production accounts for approximately 8% of global carbon dioxide (CO) emissions. Pathways to decarbonize include replacing fossil fuels in iron ore reduction and electrifying other steelmaking processes. Iron pellets produced by hydrogen, called Hydrogen Direct Reduced Iron (HDRI), have property differences from those produced using conventional DRI processes. These differences may impact melting in electric arc furnaces (EAF) and other downstream processes. The physical properties of iron pellets vary significantly with temperature during heating, complicating predictions of their behavior. In this project, we seek to develop an integrated simulation, including the fluid flow and convective thermal transport around the pellet particle. We also examine conduction and phase changes within the particle as they impact the melting process. We use adaptive mesh refinement (AMR) to resolve both the changing size of the particle and the complex physics of the interaction between the pellet and the surrounding fluid. We base our simulations on the AMReX-incflo module, which allows large-scale Navier-Stokes simulation while resolving the changing particle size during melting. As we advance our numerical tools, we anticipate an improved understanding of the dynamics of HDRI melting, which will, in turn, accelerate the adoption of low-carbon technologies in the steelmaking industry.

AMReX↗