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 1,135 records · Page 63

Improved multifidelity Monte Carlo estimators based on normalizing flows and dimensionality reduction techniques

Here, we study the problem of multifidelity uncertainty propagation for computationally expensive models. In particular, we consider the general setting where the high-fidelity and low-fidelity models have a dissimilar parameterization both in terms of number of random inputs and their probability distributions, which can be either known in closed form or provided through samples. We derive novel multifidelity Monte Carlo estimators which rely on a shared subspace between the high-fidelity and low-fidelity models where the parameters follow the same probability distribution, i.e., a standard Gaussian. We build the shared space employing normalizing flows to map different probability distributions into a common one, together with linear and nonlinear dimensionality reduction techniques, active subspaces and autoencoders, respectively, which capture the subspaces where the models vary the most. We then compose the existing low-fidelity model with these transformations and construct modified models with an increased correlation with the high-fidelity model, which therefore yield multifidelity estimators with reduced variance. A series of numerical experiments illustrate the properties and advantages of our approaches.

97 MATHEMATICS AND COMPUTING↗

Entropy stable modal discontinuous Galerkin schemes and wall boundary conditions for the compressible Navier-Stokes equations

Entropy stable schemes ensure that physically meaningful numerical solutions also satisfy a semi-discrete entropy inequality under appropriate boundary conditions. Here in this work, we describe a discretization of viscous terms in the compressible Navier-Stokes equations which enables a simple and explicit imposition of entropy stable no-slip and reflective (symmetry) wall boundary conditions for discontinuous Galerkin (DG) discretizations. Specifically, we derive methods for imposing adiabatic no-slip and reflective (symmetry) boundary conditions for modal entropy stable DG formulations which preserve a semi-discrete entropy inequality. Numerical results confirm the robustness and accuracy of the proposed approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A mass conservative, well balanced, tangency preserving and energy decaying method for the shallow water equations on a sphere

Here a fully discrete surface finite element method is proposed for solving the viscous shallow water equations in a bounded Lipschitz domain on the sphere based on a general triangular mesh. The method consists of a modified Crank–Nicolson method in time and a Galerkin surface finite element method in space for the fluid thickness H and the fluid velocity u. A finite element space tangential to the sphere at all finite element nodes is proposed to approximate the fluid velocity u. The proposed method has second-order accuracy in time and first-order accuracy in space, and preserves mass conservation, well balancedness, tangency of velocity to the sphere, and energy decay. Numerical experiments are presented to illustrate the accuracy of the proposed method and the preservation of the physical properties, including mass conservation, well balancedness, and energy decay. A numerical simulation of ocean mesoscale activity on a circular basin with a continental shelf is provided.

97 MATHEMATICS AND COMPUTING↗

Data-driven models of nonautonomous systems

Nonautonomous dynamical systems are characterized by time-dependent inputs, which complicates the discovery of predictive models describing the spatiotemporal evolution of the state variables of quantities of interest from their temporal snapshots. When dynamic mode decomposition (DMD) is used to infer a linear model, this difficulty manifests itself in the need to approximate the time-dependent Koopman operators. Our approach is to approximate the original nonautonomous system with a modified system derived via a local parameterization of the time-dependent inputs. The modified system comprises a sequence of local parametric systems, which are subsequently approximated by a parametric surrogate model using the DRIPS (dimension reduction and interpolation in parameter space) framework. The offline step of DRIPS relies on DMD to build a linear surrogate model, endowed with reduced-order bases for the observables mapped from training data. The online step interpolates on suitable manifolds to construct a sequence of iterative parametric surrogate models; the target/test parameter points on these manifolds are specified by a local parameterization of the test time-dependent inputs. Here, we use numerical experimentation to demonstrate the robustness of our method and compare its performance with that of deep neural networks.

97 MATHEMATICS AND COMPUTING↗

Necessary and sufficient conditions for quadratic stabilizability of switched systems on non-uniform time domains

In this paper, we consider the quadratic stabilizability via state feedback for a particular class of switched systems that evolve on a non-uniform time domain by introducing time scales theory. The system considered switches between a continuous-time subsystem with variable lengths and a discrete-time subsystem with variable discrete step sizes. Necessary and sufficient conditions are derived to guarantee the quadratic stability of this class of switched systems via a switching state feedback law based on the existence of a common positive definite matrix satisfying the quadratic stabilizability condition by considering that the two subsystems are unstable. By state feedback, we mean that the switching among subsystems depends on the system states. Current results for this kind of state switching feedback control are derived only for switched systems evolving on a continuous time domain or a discrete time domain with fixed step’s size. These results are not applicable for the particular class of switched systems where there is a mixing between the continuous and discrete dynamics. This motivates the derivation of a new and more general state feedback control law for switched systems in this work. Here, a numerical example illustrating the results is presented.

42 ENGINEERING↗

On the dual advantage of placing observations through forward sensitivity analysis

The four-dimensional variational data assimilation methodology for assimilating noisy observations into a deterministic model has been the workhorse in forecasting centres for over three decades. While this method provides a computationally efficient framework for dynamic data assimilation, it is largely silent on the important question concerning the minimum number and placement of observations. To answer this question, we demonstrate the dual advantage of placing the observations where the square of the sensitivity of the model solution with respect to the unknown control variables, called forward sensitivities, attains its maximum. By following this approach, we can force the observability Gramian to be of full rank, which in turn guarantees efficient recovery of the optimal values of the control variables, which is the first of the two advantages of this strategy. We further show that the proposed strategy of placing observations has another inherent optimality: the square of the sensitivity of the optimal estimates of the control with respect to the observations (used to obtain these estimates) attains its minimum value, a second advantage that is a direct consequence of the above strategy for placing observations. Our analytical framework and numerical experiments on linear and nonlinear systems confirm the effectiveness of our proposed strategy.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗