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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Large Scale Tensor Factorization via Parallel Sketches

Tensor factorization methods have recently gained increased popularity. A key feature that renders tensors attractive is the ability to directly model multi-relational data. In this work, we propose ParaSketch, a parallel tensor factorization algorithm that enables massive parallelism, to deal with large tensors. The idea is to compress the large tensor into multiple small tensors, decompose each small tensor in parallel, and combine the results to reconstruct the desired latent factors. Prior art in this direction entails potentially very high complexity in the (Gaussian) compression and final combining stages. Adopting sketching matrices for compression, the proposed method enjoys a dramatic reduction in compression complexity, and features a much lighter combining step. Moreover, theoretical analysis shows that the compressed tensors inherit latent identifiability under mild conditions, hence establishing correctness of the overall approach. Numerical experiments corroborate the theory and demonstrate the effectiveness of the proposed algorithm.

block term decomposition↗
DOE OSTI2020

Low-Memory, Discrete Ordinates, Discontinuous Galerkin Methods for Radiative Transport

The discrete ordinates discontinuous Galerkin (SN-DG) method is a well-established and practical approach for solving the radiative transport equation. In this paper, we study a low-memory variation of the upwind SN-DG method. The proposed method uses a smaller finite element space that is constructed by coupling spatial unknowns across collocation angles, thereby yielding an approximation with fewer degrees of freedom than the standard method. Like the original SN-DG method, the low-memory variation still preserves the asymptotic diffusion limit and maintains the characteristic structure needed for mesh sweeping algorithms. While we observe second-order convergence in the scattering dominated, diffusive regime, the low-memory method is in general only first-order accurate. To address this issue, we use upwind reconstruction to recover second-order accuracy. Finally, for both methods, numerical procedures based on upwind sweeps are proposed to reduce the system dimension in the underlying Krylov solver strategy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Estimating Higher-Order Moments Using Symmetric Tensor Decomposition

In this paper, we consider the problem of decomposing higher-order moment tensors, i.e., the sum of symmetric outer products of data vectors. Such a decomposition can be used to estimate the means in a Gaussian mixture model and for other applications in machine learning. The dth-order empirical moment tensor of a set of p observations of n variables is a symmetric d-way tensor. Our goal is to nd a low-rank tensor approximation comprising r $\ll$ p symmetric outer products. The challenge is that forming the empirical moment tensor costs O(pn d ) operations and O(n d ) storage, which may be prohibitively expensive; additionally, the algorithm to compute the low-rank approximation costs O(n d ) per iteration. Our contribution is avoiding formation of the moment tensor, computing the low-rank tensor approximation of the moment tensor implicitly using O(pnr) operations per iteration and no extra memory. This advance opens the door to more applications of higher-order moments since they can now be efficiently computed. We present numerical evidence of the computational savings and show an example of estimating the means for higher-order moments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Stochastic representation and conditioning of process-based geological model by deep generative and recognition networks

Accurate and realistic geological modeling is the core of oil and gas development and production. In recent years, process-based methods are developed to produce highly realistic geological models by simulating the physical processes that reproduce the sedimentary events and develop the geometry. However, the complex dynamic processes are extremely expensive to simulate, making process-based models difficult to be conditioned to field data. In this work, we propose a comprehensive generative adversarial network framework as a machine-learning-assisted approach for mimicking the outputs of process-based geological models with fast generation. The main objective of our work is to obtain a continuous parametrization of the highly realistic process-based geological models which enables us to calibrate the models and condition the models to data. Numerical results are presented to illustrate the capability of our proposed methodology.

58 GEOSCIENCES↗
DOE OSTI2021

A New MCNP6 Electron-Photon Transport Validation Test: The Lockwood Energy Deposition Experiment (V.1.0)

This memo announces the availability of a new validation test for quantifying the accuracy of the MCNP6 electron-photon transport algorithm for use in energy-deposition calculations. Specifically, energy-deposition results are compared with the Lockwood energy-deposition experiment. The comparison includes energy-deposition profiles in a variety of different single-element materials including beryllium, aluminum, carbon, copper, iron, molybdenum, tantalum, and uranium for pencil beam electron sources with energies including 0.05-, 0.1-, 0.3-, 0.5, and 1-MeV and angles of incidence including normal, 30°, and 60° off-normal. The purpose of this memo is to discuss the contents of the Lockwood validation directory and to outline the procedure for generating the input files, running the tests, processing the results, and comparing results to the experimental and numerical benchmark. Each step is mostly automated by a makefile that executes the necessary perl script.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Software Verification of VARPOW

The VARPOW program is a post-processing utility program for DIF3D, specifically DIF3DVARIANT, and it was developed to provide interface files for the thermal analysis program DASSH. The basic methodology of VARPOW is to take the neutron and gamma flux (moments) calculated by DIF3D (or GAMSOR) and combine them with the heating (coefficient) cross sections to calculate the spatial power distributions using the DIF3DVARIANT spatial basis. VARPOW can use the output from GAMSOR (both steady state neutron and gamma flux calculations) or standard DIF3D/REBUS calculations (neutron flux only). The correct approach for defining the power distribution is to use GAMSOR as its purpose was to properly compute the gamma heating throughout the modeled domain. The power desnities calculated by VARPOW are broken into fuel, cladding and coolant terms for which isotope-wise categorization is needed. VARPOW has built in options the user can select for the isotope categorization or VARPOW can import a file that details the isotope categorization. VARPOW can export the solution in the polynomial basis of DIF3D-VARIANT or the monomial basis of DIF3D-VARIANT. The purpose of this work is to verify the power distribution results calculated by VARPOW from both the GAMSOR and DIF3D input options and verify that the input and output options are consistent with the manual. Hand calculation and independent numerical calculation are used for this verification work.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Convex Optimization with Smart Grid Examples

In this talk, we give an overview of the field of convex optimization and work through four canonical problems that relate to electrical power systems and smart grids. The purpose of these examples is to demonstrate the breadth of applications of convex optimization in energy research and to show that toy versions of these problems can be solved in just a few lines of code, indicating the scale and complexity of problems that can be tackled with a more detailed treatment. We emphasize the cvxpy modeling language as a foundational technology that enables rapid development and prototyping of convex optimization problems, allowing researchers to focus on model development rather than get caught in the weeds of numerical and code implementation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Theoretical and methodological challenges in hierarchical Bayesian inference for model-form uncertainty

This report describes challenges associated with the hierarchical Bayesian approach to inform model-form uncertainty (MFU) representations, which are parameterized modifications to a mathematical models’ governing equations to express uncertainty in form of the equations. To inform model-form uncertainties, hierarchical Bayesian inference is often employed. Here, the MFU parameters are distributed parametrically, and the hyperparameters of the parametric distribution are informed through Bayesian inference, with the aim of determining the MFU parameter distribution that best agrees with calibration data. In practice, however, we have found the hierarchical Bayesian approach falls short of this aim. We discuss theoretical and methodological challenges of the approach, and we present several numerical demonstrations of these challenges. To conclude, we suggest promising alternative approaches for future investigation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Exascale applications: skin in the game

As noted in Wikipedia, skin in the game refers to having ‘incurred risk by being involved in achieving a goal’, where ‘ skin is a synecdoche for the person involved, and game is the metaphor for actions on the field of play under discussion’. For exascale applications under development in the US Department of Energy Exascale Computing Project, nothing could be more apt, with the skin being exascale applications and the game being delivering comprehensive science-based computational applications that effectively exploit exascale high-performance computing technologies to provide breakthrough modelling and simulation and data science solutions. These solutions will yield high-confidence insights and answers to the most critical problems and challenges for the USA in scientific discovery, national security, energy assurance, economic competitiveness and advanced healthcare. This article is part of a discussion meeting issue ‘Numerical algorithms for high-performance computational science’.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Optimal experimental design for prediction based on push-forward probability measures

Incorporating experimental data is essential for increasing the credibility of simulation-aided decision making and design. This paper presents a method which uses a computational model to guide the optimal acquisition of experimental data to produce data-informed predictions of quantities of interest (QoI). Many strategies for optimal experimental design (OED) select data that maximize some utility that measures the reduction in uncertainty of uncertain model parameters, for example the expected information gain between prior and posterior distributions of these parameters. In this paper, we seek to maximize the expected information gained from the pushforward of an initial (prior) density to the push-forward of the updated (posterior) density through the parameter-to-prediction map. The formulation presented is based upon the solution of a specific class of stochastic inverse problems which seeks a probability density that is consistent with the model and the data in the sense that the push-forward of this density through the parameter-to-observable map matches a target density on the observable data. While this stochastic inverse problem forms the mathematical basis for our approach, we develop a one-step algorithm, focused on push-forward probability measures, that leverages inference-for-prediction to bypass constructing the solution to the stochastic inverse problem. A number of numerical results are presented to demonstrate the utility of this optimal experimental design for prediction and facilitate comparison of our approach with traditional OED.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Trust-Based Detection and Mitigation of Cyber Attacks in Distributed Cooperative Control of Islanded AC Microgrids

In this study, we address the challenge of detecting and mitigating cyber attacks in the distributed cooperative control of islanded AC microgrids, with a particular focus on detecting False Data Injection Attacks (FDIAs), a significant threat to the Smart Grid (SG). The SG integrates traditional power systems with communication networks, creating a complex system with numerous vulnerable links, making it a prime target for cyber attacks. These attacks can lead to the disclosure of private data, control network failures, and even blackouts. Unlike machine learning-based approaches that require extensive datasets and mathematical models dependent on accurate system modeling, our method is free from such dependencies. To enhance the microgrid’s resilience against these threats, we propose a resilient control algorithm by introducing a novel trustworthiness parameter into the traditional cooperative control algorithm. Our method evaluates the trustworthiness of distributed energy resources (DERs) based on their voltage measurements and exchanged information, using Kullback-Leibler (KL) divergence to dynamically adjust control actions. We validated our approach through simulations on both the IEEE-34 bus feeder system with eight DERs and a larger microgrid with twenty-two DERs. The results demonstrated a detection accuracy of around 100%, with millisecond range mitigation time, ensuring rapid system recovery. Additionally, our method improved system stability by up to almost 100% under attack scenarios, showcasing its effectiveness in promptly detecting attacks and maintaining system resilience. These findings highlight the potential of our approach to enhance the security and stability of microgrid systems in the face of cyber threats.

Computer Science↗
DOE OSTI2021

SU(n) and Quantum SU(n) Symmetries in Physical Systems [Slides]

Presence of SU(n) or other Lie group symmetry in a physical system is its powerful, usually underutilized property. In many cases it allows for finding analytical solutions to nonlinear differential equations describing this system. Power of the method is presented on diversified examples from mathematical physics: Lie-group symmetries in finding solutions of generalized, multidimensional theory of gravity; analytical Dirac–equation solutions for description of conducting polymers; stability of qubit states in quantum computers; spatial defects in condensed matter; reconstruction of 3D object from its 2D tomographic image; significant improvement of numerical solutions stability for Euler equations. The next question after obtaining such Lie group symmetric solution is: does a generalized solution with appropriate quantum group symmetry exists for the given physical system, and if yes what is the physical meaning of the deformation parameter q introduced by such solution. In many cases it can be identified. Any SU(n) solution is by its nature singular, assuming a perfect symmetry of the physical system discussed. Such solution gives a powerful insight to theoretical physics, yet the assumption may be too demanding for experimental applications. Deformation parameter q from a quantum group symmetry allows for a continuum of solutions, more applicable to experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Sensitivity Analysis for Solutions to Heterogeneous Nonlocal Systems. Theoretical and Numerical Studies

The paper presents a collection of results on continuous dependence for solutions to nonlocal problems under perturbations of data and system parameters. The integral operators appearing in the systems capture interactions via heterogeneous kernels that exhibit different types of weak singularities, space dependence, even regions of zero-interaction. Here, the stability results showcase explicit bounds involving the measure of the domain and of the interaction collar size, nonlocal Poincaré constant, and other parameters. In the nonlinear setting, the bounds quantify in different L p norms the sensitivity of solutions under different nonlinearity profiles. The results are validated by numerical simulations showcasing discontinuous solutions, varying horizons of interactions, and symmetric and heterogeneous kernels.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A coupled multipoint stress–multipoint flux mixed finite element method for the Biot system of poroelasticity

In this work, we present a mixed finite element method for a five-field formulation of the Biot system of poroelasticity that reduces to a cell-centered pressure–displacement system on simplicial and quadrilateral grids. A mixed stress–displacement–rotation formulation for elasticity with weak stress symmetry is coupled with a mixed velocity–pressure Darcy formulation. The spatial discretization is based on combining the multipoint stress mixed finite element (MSMFE) method for elasticity and the multipoint flux mixed finite element (MFMFE) method for Darcy flow. It uses the lowest order Brezzi–Douglas–Marini mixed finite element spaces for the poroelastic stress and Darcy velocity, piecewise constant displacement and pressure, and continuous piecewise linear or bilinear rotation. A vertex quadrature rule is applied to the velocity, stress, and stress–rotation bilinear forms, which block-diagonalizes the corresponding matrices and allows for local velocity, stress, and rotation elimination. This leads to a cell-centered positive-definite system for pressure and displacement at each time step. We perform error analysis for the semidiscrete and fully discrete formulations, establishing first order convergence for all variables in their natural norms. The numerical tests confirm the theoretical convergence rates and illustrate the locking-free property of the method.

42 ENGINEERING↗
DOE OSTI2021

Non-intrusive data-driven model reduction for differential–algebraic equations derived from lifting transformations

In this paper we present a non-intrusive data-driven approach for model reduction of nonlinear systems. The approach considers the particular case of nonlinear partial differential equations (PDEs) that form systems of partial differential–algebraic equations (PDAEs) when lifted to polynomial form. Such systems arise, for example, when the governing equations include Arrhenius reaction terms (e.g., in reacting flow models) and thermodynamic terms (e.g., the Helmholtz free energy terms in a phase-field solidification model). Using the known structured form of the lifted algebraic equations, the approach computes the reduced operators for the algebraic equations explicitly, using straightforward linear algebra operations on the basis matrices. The reduced operators for the differential equations are inferred from lifted snapshot data using operator inference, which solves a linear least squares regression problem. The approach is illustrated for the nonlinear model of solidification of a pure material. The lifting transformations reformulate the solidification PDEs as a system of PDAEs that have cubic structure. The operators of the lifted system for this solidification example have affine dependence on key process parameters, permitting us to learn a parametric reduced model with operator inference. Numerical experiments show the effectiveness of the resulting reduced models in capturing key aspects of the solidification dynamics.

42 ENGINEERING↗
DOE OSTI2022

An efficient high-order numerical solver for diffusion equations with strong anisotropy

In this paper, we present an interior penalty discontinuous Galerkin finite element scheme for solving diffusion problems with strong anisotropy arising in magnetized plasmas for fusion applications. Additionally, we demonstrate the accuracy produced by the high-order scheme and develop an efficient preconditioning technique to solve the corresponding linear system, which is robust to the mesh size and anisotropy of the problem. Several numerical tests are provided to validate the accuracy and efficiency of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

High-Order Mesh r-Adaptivity with Tangential Relaxation and Guaranteed Mesh Validity

High-order meshes are crucial for achieving optimal convergence rates in curvilinear domains, preserving symmetry, and aligning with key flow features in moving mesh simulations [1], but their quality is challenging to control. In prior work, we have developed techniques based on Target-Matrix Optimization Paradigm (TMOP) to adapt a given high-order mesh to the geometry and solution of the partial differential equation (PDE) [2, 3]. Here, we extend this framework to address two key gaps in the literature for highorder mesh 𝑟-adaptivity. First, we introduce tangential relaxation on curved surfaces using solely the discrete mesh representation, eliminating the need for access to underlying geometry (e.g., CAD model). Second, we ensure a continuously positive Jacobian determinant throughout the domain. This determinant positivity is essential for using the high-order mesh resulting from 𝑟-adaptivity with arbitrary quadrature schemes in simulations. The proposed approach is demonstrated to be robust using a variety of numerical experiments.

Mathematics and Computing↗