Engineering Papers⌕ Search

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.

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

At least 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
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 OSTI2020

A parallel hierarchical blocked adaptive cross approximation algorithm

This article presents a low-rank decomposition algorithm based on subsampling of matrix entries. The proposed algorithm first computes rank-revealing decompositions of submatrices with a blocked adaptive cross approximation (BACA) algorithm, and then applies a hierarchical merge operation via truncated singular value decompositions (H-BACA). The proposed algorithm significantly improves the convergence of the baseline ACA algorithm and achieves reduced computational complexity compared to the traditional decompositions such as rank-revealing QR. Numerical results demonstrate the efficiency, accuracy, and parallel scalability of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Analysis of the Challenges in Developing Sample-Based Multi-fidelity Estimators for Non-deterministic Models

Multifidelity (MF) uncertainty quantification (UQ) seeks to leverage and fuse information from a collection of models to achieve greater statistical accuracy with respect to a single-fidelity counterpart, while maintaining an efficient use of computational resources. Despite many recent advancements in MF UQ, several challenges remain and these often limit its practical impact in certain application areas. In this manuscript, we focus on the challenges introduced by nondeterministic models to sampling MF UQ estimators. Nondeterministic models produce different responses for the same inputs, which means their outputs are effectively noisy. MF UQ is complicated by this noise since many state-of-the-art approaches rely on statistics, e.g., the correlation among models, to optimally fuse information and allocate computational resources. Here, we demonstrate how the statistics of the quantities of interest, which impact the design, effectiveness, and use of existing MF UQ techniques, change as functions of the noise. With this in hand, we extend the unifying approximate control variate framework to account for nondeterminism, providing for the first time a rigorous means of comparing the effect of nondeterminism on different multifidelity estimators and analyzing their performance with respect to one another. Numerical examples are presented throughout the manuscript to illustrate and discuss the consequences of the presented theoretical results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

PAGOSA Theory Manual

PAGOSA is a computational fluid dynamics program developed at LANL for the study of high-speed compressible flow and high-rate material deformation. PAGOSA is a three-dimensional Eulerian finite-difference code, solving problems with a wide variety of EOS, material strength, and explosive modeling options. This document presents the finite difference equations that are used in the PAGOSA continuum mechanics computer code. This program is especially intended to be used for the numerical simulation of the interactions of gases, fluids, and solids.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Development and Implementation of a CTF Code Verification Suite.

CTF is a thermal hydraulic subchannel code developed to predict light water reactor (LWR) core behavior. It is a version of Coolant Boiling in Rod Arrays (COBRA) developed by Oak Ridge National Laboratory (ORNL) and North Carolina State University (NCSU) and used in the Consortium for the Advanced Simulation of LWRs (CASL). Here, the existing CTF code verification matrix is expanded, which ensures that the code is a faithful representation of the underlying mathematical model. The suite of code verification tests are mapped to the underlying conservation equations of CTF and significant gaps are addressed. As such, five new problems are incorporated: isokinetic advection, conduction, pressure drop, convection, and pipe boiling. Convergence behavior and numerical errors are quantified for each of the tests and all tests converge at the correct rate to their corresponding analytic solution. A new verification utility that generalizes the code verification process is used to incorporate these problems into the CTF automated test suite.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

Calibration of parallel bond parameters in bonded particle models via physics-informed adaptive moment optimisation

This study proposes an automated calibration procedure for bond parameters in bonded discrete element modelling. By exploring the underlying physical correlations between microscopic parameters of bonds and macroscopic strength parameters of the continuum to be modelled, the microscopic shear strength and tensile strength are identified as independent variables for calibration purpose. Then a physics-informed iterative scheme is proposed to automatically approximate the bond parameters by viewing the micro-macro relation as an implicitly defined mathematical mapping function. As a result of highly non-convex features of this implicit mapping, the adaptive moment estimation (Adam), which is especially suitable for problems with noisy gradients, is adopted as the basic iterative scheme, in conjunction with other numerical techniques to approximately evaluate the partial derivatives involved. The whole procedure offers a simple and effective framework for bond parameter calibration. Finally, a numerical example of SiC ceramic is provided for validation. By compared with some existing calibration methods, the proposed method shows significant advantages in terms of calibration efficiency and accuracy.

42 ENGINEERING↗
DOE OSTI2023

Code for the manuscript titled "Blackout Diffusion: Generative Diffusion Models in Discrete-State Spaces"

We would like to disclose two scripts, written in Jupyter notebook, in which we implement the "Blackout Diffusion Process" described in the manuscript "Blackout Diffusion: Generative Diffusion Models in Discrete-State Spaces" (LA-UR-23-20509), to be submitted to the International Conference of Machine Learning (ICML). The abstract of the manuscript is append below. == Typical generative diffusion models rely on a Gaussian diffusion process for training the backward transformations, which can then be used generate samples from Gaussian noise. However, real world data often takes place in discrete-state spaces, which occur in many scientific applications. Here, we develop a theoretical formulation for arbitrary discrete-state Markov processes in the forward diffusion process. We relate the theory to the existing continuous-state Gaussian diffusion and identify the corresponding reverse-time stochastic process and score function in the continuous-time setting, and the reverse-time mapping in the discrete-time setting. As an example of this framework, we introduce "Blackout Diffusion", which learns to produce samples from an empty image instead of from noise. Numerical experiments on the CIFAR-10 dataset confirm the feasibility of generative diffusion modeling in a discrete space. Generalizing from specific (Gaussian) forward processes to a more general framework also sheds light on how to interpret generative diffusion models and their mathematical structure, which we comment on.

Lin, Yen Ting↗
DOE OSTI2020

Optimal Equilibrium Selection of Price-Maker Agents in Performance-Based Regulation Market

This paper analyzes the oligopolistic equilibrium of multiple price-maker agents in performance-based regulation (PBR) markets. In these markets, there are price-maker agents representing some frequency regulation (FR) providers and a number of independent price-taker FR providers. An equilibrium problem with equilibrium constraints (EPEC) model is employed in this paper to study the equilibria of a PBR market in the presence of price-maker agents and pricetaker FR providers. Due to the incorporation of the FR providers' dynamics, the proposed model is reformulated as a mixed-integer linear programming (MILP) problem over innovative mathematical techniques. An optimal equilibrium point is also selected for the market, where none of the agents is unique deviator and the dynamic performance of power system is improved simultaneously. The effectiveness of proposed optimal equilibrium point is evaluated in the numerical results section by comparing the outputs with conventional optimal dispatches of the FR providers.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2020

Inverse point source location with the Helmholtz equation on a bounded domain

The problem of recovering acoustic sources, more specifically monopoles, from point-wise measurements of the corresponding acoustic pressure at a limited number of frequencies is addressed. To this purpose, a family of sparse optimization problems in measure space in combination with the Helmholtz equation on a bounded domain is considered in this study. A weighted norm with unbounded weight near the observation points is incorporated into the formulation. Optimality conditions and conditions for recovery in the small noise case are discussed, which motivates concrete choices of the weight. The numerical realization is based on an accelerated conditional gradient method in measure space and a finite element discretization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

An efficient method to integrate polynomials over polytopes and curved solids

Here in this paper, we present an efficient approach to compute the integral of monomials and polynomials over polyhedra and regions defined by parametric curved boundary surfaces. We use Euler's theorem for homogeneous functions in combination with Stokes's theorem to reduce the integration of a monomial over a three-dimensional solid to its boundary. If the solid is a polytope, through a recursive application of these theorems, the integral is further reduced to just the evaluation of the monomial and its derivatives at the vertices of the polytope. The present approach is simpler than existing techniques that rely on repeated use of the divergence theorem, which require the antiderivative of the monomials and the projection of these functions onto hyperplanes. For convex and nonconvex polytopes, our approach does not introduce any approximation for the integration of monomials. For curved solid regions bounded by surfaces that admit a parameterization, the same approach yields simplified formulas to compute the integral of any homogeneous function, including monomials. For surfaces parameterized by polynomial surfaces (such as Bezier surface triangles and B-spline patches), the method yields machine-precision accuracy for the volumetric integration of monomials with an appropriate quadrature rule. Numerical examples over regions bounded by polynomial surfaces and rational surfaces are presented to establish the accuracy and efficiency of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An optimization-based approach to parameter learning for fractional type nonlocal models

Nonlocal operators of fractional type are a popular modeling choice for applications that do not adhere to classical diffusive behavior; however, one major challenge in nonlocal simulations is the selection of model parameters. In this study we propose an optimization-based approach to parameter identification for fractional models with an optional truncation radius. We formulate the inference problem as an optimal control problem where the objective is to minimize the discrepancy between observed data and an approximate solution of the model, and the control variables are the fractional order and the truncation length. For the numerical solution of the minimization problem we propose a gradient-based approach, where we enhance the numerical performance by an approximation of the bilinear form of the state equation and its derivative with respect to the fractional order. Several numerical tests in one and two dimensions illustrate the theoretical results and show the robustness and applicability of our method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Scalable DPG multigrid solver for Helmholtz problems: A study on convergence

This paper presents a scalable multigrid preconditioner targeting large-scale systems arising from discontinuous Petrov–Galerkin (DPG) discretizations of high-frequency wave operators. This work is built on previously developed multigrid preconditioning techniques of Petrides and Demkowicz (Comput. Math. Appl. 87 (2021) pp. 12–26) and extends the convergence results from $\mathscr{O}$(10 7 ) degrees of freedom (DOFs) to $\mathscr{O}$(10 9 ) DOFs using a new scalable parallel MPI/OpenMP implementation. Novel contributions of this paper include an alternative definition of coarse-grid systems based on restriction of fine-grid operators, yielding superior convergence results. In the uniform refinement setting, a detailed convergence study is provided, demonstrating h and p robust convergence and linear scaling with respect to the wave frequency. Finally, the paper concludes with numerical results on hp -adaptive simulations including a large-scale seismic modeling benchmark problem with high material contrast.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

SIDIS-RC EvGen: A Monte-Carlo event generator of semi-inclusive deep inelastic scattering with the lowest-order QED radiative corrections

SIDIS-RC EvGen is a C++ standalone Monte-Carlo event generator for studies of semi-inclusive deep inelastic scattering (SIDIS) processes at medium to high lepton beam energies. In particular, the generator contains binary and library components for generating SIDIS events and calculating cross sections for unpolarized or longitudinally polarized beam and unpolarized, longitudinally or transversely polarized target. The structure of the generator incorporates transverse momentum-dependent parton distribution and fragmentation functions, whereby we obtain multi-dimensional binned simulation results, which will facilitate the extraction of important information about the three-dimensional nucleon structure from SIDIS measurements. In order to build this software, we have used recent elaborate QED calculations of the lowest-order radiative effects, applied to the leading order Born cross section in SIDIS. Here, in this paper, we provide details on the theoretical formalism as well as the construction and operation of SIDIS-RC EvGen, e.g., how we handle the event generation process and perform multi-dimensional integration. We also provide example programs, flowcharts, and numerical results on azimuthal transverse single-spin asymmetries.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Reduced order modeling for flow and transport problems with Barlow Twins self-supervised learning

Abstract We propose a unified data-driven reduced order model (ROM) that bridges the performance gap between linear and nonlinear manifold approaches. Deep learning ROM (DL-ROM) using deep-convolutional autoencoders (DC–AE) has been shown to capture nonlinear solution manifolds but fails to perform adequately when linear subspace approaches such as proper orthogonal decomposition (POD) would be optimal. Besides, most DL-ROM models rely on convolutional layers, which might limit its application to only a structured mesh. The proposed framework in this study relies on the combination of an autoencoder (AE) and Barlow Twins (BT) self-supervised learning, where BT maximizes the information content of the embedding with the latent space through a joint embedding architecture. Through a series of benchmark problems of natural convection in porous media, BT–AE performs better than the previous DL-ROM framework by providing comparable results to POD-based approaches for problems where the solution lies within a linear subspace as well as DL-ROM autoencoder-based techniques where the solution lies on a nonlinear manifold; consequently, bridges the gap between linear and nonlinear reduced manifolds. We illustrate that a proficient construction of the latent space is key to achieving these results, enabling us to map these latent spaces using regression models. The proposed framework achieves a relative error of 2% on average and 12% in the worst-case scenario (i.e., the training data is small, but the parameter space is large.). We also show that our framework provides a speed-up of $$7 \times 10^{6}$$ 7 × 10 6 times, in the best case, and $$7 \times 10^{3}$$ 7 × 10 3 times on average compared to a finite element solver. Furthermore, this BT–AE framework can operate on unstructured meshes, which provides flexibility in its application to standard numerical solvers, on-site measurements, experimental data, or a combination of these sources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Data transfers for full core heterogeneous reactor high- fidelity multiphysics studies

Multiphysics simulations for nuclear reactor analysis are usually performed by resorting to operator splitting and fixed point iterations between single-physics solvers. This enables the separate solution of each physics, such as neutronics, fuel performance, and thermal hydraulics, on meshes tailored to the requirements of the respective numerical discretizations of the equations. As the equations are coupled, several fields must be transferred between single-physics solves. Projecting fields between meshes while preserving order of accuracy, conservation properties, and mapping non-overlapping geometries is a complex endeavor. This conference paper will present the transfers as implemented in MOOSE, which can handle arbitrary meshes, arbitrary mappings, conservation of integral quantities, and are made to scale with distributed simulations on both ends of the transfers. Their adequacy for advanced nuclear reactor multiphysics coupling is shown through examples and numerical studies.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

High order explicit local time stepping methods for hyperbolic conservation laws

In this paper we present and analyze a general framework for constructing high order explicit local time stepping (LTS) methods for hyperbolic conservation laws. In particular, we consider the model problem discretized by Runge-Kutta discontinuous Galerkin (RK-DG) methods and design LTS algorithms based on the strong stability preserving Runge-Kutta (SSP-RK) schemes, that allow spatially variable time step sizes to be used for time integration in different regions of the computational domain. The proposed algorithms are of predictor-corrector type, in which the interface information along the time direction is first predicted based on the SSP-RK approximations and Taylor expansions, and then the fluxes over the region of the interface are corrected to conserve mass exactly at each time step. Following the proposed framework, we detail the corresponding LTS schemes with accuracy up to the fourth order, and prove their conservation property and nonlinear stability for the scalar conservation laws. Numerical experiments are also presented to demonstrate excellent performance of the proposed LTS algorithms.

58 GEOSCIENCES↗
DOE OSTI2026

Existence of a robust optimal control process for efficient measurements in a two-qubit system

The verification of quantum entanglement is essential for quality control in quantum communication. In this work we propose an efficient protocol to directly verify the two-qubit entanglement of a known target state through a single-expectation-value measurement. Our method provides exact entanglement quantification using the concurrence measure without performing quantum state tomography. We prove the existence of a unitary transformation that drives a known initial state of a two-qubit system to a designated final state, where the trace over a chosen observable directly yields the concurrence of the initial state. Furthermore, we implement an optimal control process of that transformation and demonstrate its effectiveness through numerical simulations. We also show that this process is robust to environmental noise. Our approach offers advantages in directly verifying entanglement with low circuit depth, making it suitable for industrial-scale quality control of entanglement generation. Our results presented here provide mathematical justification for our earlier computational experiments.

Rodriguez, Ricardo [McPherson Coll.] (ORCID:000000↗
DOE OSTI2024

Adaptive Online Model Update Algorithm for Predictive Control in Networked Systems

In this article, we introduce an adaptive on-line model update algorithm designed for predictive control applications in networked systems, particularly focusing on power distribution systems. Unlike traditional methods that depend on historical data for offline model identification, our approach utilizes real-time data for continuous model updates. This method integrates seamlessly with existing online control and optimization algorithms and provides timely updates in response to real-time changes. This methodology offers significant advantages, including a reduction in the communication network bandwidth requirements by minimizing the data exchanged at each iteration and enabling the model to adapt after disturbances. Furthermore, our algorithm is tailored for non-linear convex models, enhancing its applicability to practical scenarios. The efficacy of the proposed method is validated through a numerical study, demonstrating improved control performance using a synthetic IEEE test case.

data-driven model predictive control↗