Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational efficiency”

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 811 records · Page 45

Benefits of Sparse Tableau Over Nodal Admittance Formulation for Power-Flow Studies

Assembly of power-flow equations has traditionally begun from a nodal analysis formulation of the underlying transmission circuit's behavior. Most power-flow formulations encapsulate network constraints in the bus admittance matrix, Y bus . From a circuit perspective, this admittance representation restricts the network elements to be voltage controlled; resulting drawbacks treating zero-impedance branches in such applications as state estimation have long been recognized. This paper explores the advantages of the alternatives to Y bus -based formulations in power flow. It proposes a sparse tableau formulation (STF), and it demonstrates its computational efficiency, robustness, and generality in detailed comparison to traditional Y bus -based solution algorithms. In the examples of power networks ranging from 1888 to 82 000 buses, computational case studies indicate that STF provides comparable computational speed, while allowing simple treatment of zero-impedance branches and more reliably converging to solutions in many cases for which Y bus -based Newton algorithms diverge.

42 ENGINEERING↗

Towards feasible and effective predictive wavefront control for adaptive optics

We have recently proposed Predictive Fourier Control, a computationally efficient and adaptive algorithm for predictive wavefront control that assumes frozen flow turbulence. We summarize refinements to the state-space model that allow operation with arbitrary computational delays and reduce the computational cost of solving for new control. We present initial atmospheric characterization using observations with Gemini North's Altair AO system. These observations, taken over 1 year, indicate that frozen flow is exists, contains substantial power, and is strongly detected 94% of the time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Fast Algorithm for the Convolution of Functions with Compact Support Using Fourier Extensions

In this paper, we present a new algorithm for computing the convolution of two compactly supported functions. The algorithm approximates the functions to be convolved using Fourier extensions and then uses the fast Fourier transform to efficiently compute Fourier extension approximations to the pieces of the result. Finally, the complexity of the algorithm is O(N(log N) 2 ), where N is the number of degrees of freedom used in each of the Fourier extensions.

97 MATHEMATICS AND COMPUTING↗

Mesoscale Modeling Framework Design: Subcontract Report

This subcontract is aimed at developing the mesoscale computational capability to help ensure success of the project “Multiscale Capability for Exploring Transport Phenomena in Battery” at the Lawrence Livermore National Laboratory (LLNL). We develop an efficient computer code that implements the smoothed boundary method for simulating charge transport and coupled microstructure evolution in battery electrode architectures.

25 ENERGY STORAGE↗

High-Accuracy Module Emulators from Physically-Constrained AI Algorithms

Focal Area(s): How do we use AI tools to integrate observations, simulated data and physical and chemical fundamentals (Focal Area 3) into model components (Focal Area 2) that have high accuracy and stability and low computational burden to improve Earth System Predictability? Science Challenge: Earth system modeling of the hydrological cycle involves compute-intensive modules representing complex chemical and physical process. Recently, AI tools that are far less compute intensive have been developed that emulate these modules, but many of these efforts are not yet sufficiently accurate or even stable. We know a lot about the physics and chemistry of earth system processes. The Science Challenge is developing AI tools that not only incorporate observations and simulated data, but also incorporate the physics and chemistry of the process, while still maintaining the compute efficiency.

54 ENVIRONMENTAL SCIENCES↗

2HOT: An improved parallel hashed oct-tree N-body algorithm for cosmological simulation

Here we report on improvements made over the past two decades to our adaptive treecode N-body method (HOT). A mathematical and computational approach to the cosmological N-body problem is described, with performance and scalability measured up to 256k (218) processors. We present error analysis and scientific application results from a series of more than ten 69 billion (40963) particle cosmological simulations, accounting for 4×1020 floating point operations. These results include the first simulations using the new constraints on the standard model of cosmology from the Planck satellite. Our simulations set a new standard for accuracy and scientific throughput, while meeting or exceeding the computational efficiency of the latest generation of hybrid TreePM N-body methods.

97 MATHEMATICS AND COMPUTING↗

A Fully Explicit Integrator for Modeling Astrophysical Reactive Flows

Simulating complex astrophysical reacting flows is computationally expensive—reactions are stiff and typically require implicit integration methods. The reaction update is often the most expensive part of a simulation, which motivates the exploration of more economical methods. In this research note, we investigate how the explicit Runge–Kutta–Chebyshev (RKC) method performs compared to an implicit method when applied to astrophysical reactive flows. These integrators are applied to simulations of X-ray bursts arising from unstable thermonuclear burning of accreted fuel on the surface of neutron stars. We show that the RKC method performs with similar accuracy to our traditional implicit integrator, but is more computationally efficient when run on CPUs.

GPU computing↗

Unsaturated Groundwater and Heat Transport Model

TOUGH2-MP is a massive parallel version of the TOUGH2 Code, designed for computationally efficient parallel simulation of isothermal and nonisothermal flows of multicomponent, multiphase fluids in one, two, and three-dimensional porous and fractured media. The code runs on computers with parallel architecture or clusters and can be used for applications, such as radioactive waste disposal, CO2 geological sequestration, environmental assessment and remediation, reservoir engineering, and groundwater hydrology. The parallel simulator has achieved orders-of-the-magnitude improvement in computational time and/or modeling problem size. The parallel simulator uses fully implicit time differencing and solves large, sparse linear systems arising from discretization of the partial differential equations for mass and energy balance. A domain decomposition approach is adopted for multiphase flow simulations with coarse- granularity parallel computation. Current version of TOUGH2-MP includes following modules: EOS1, EOS2, EOS3, EOS4, EOS5, EOS7, EOS7R, E0S8, EOS9, ECO2N, EWASG, and T2R3D.

Zhang, Keni↗

A Comparative Study of Physics‐Informed and Data‐Driven Neural Networks for Compound Flood Simulation at River‐Ocean Interfaces: A Case Study of Hurricane Irene

Simulating compound flooding (CF) at the river-ocean interface within large-scale Earth System Models (ESMs) presents significant challenges due to complex interactions between river discharge, storm surge, and tides. This study assesses the comparative advantages of physics-informed and data-driven machine learning (ML) approaches for enhancing local ESM performance. We systematically compare data-driven neural network models (i.e., CNNs, U-Net, Long Short-Term Memory (LSTM), Gated Recurrent Unit), and physics-informed neural network (PINN) models, including vanilla PINN and a finite-difference-based PINN (FD-PINN). Specifically, FD-PINN is introduced to enhance computational efficiency, accelerating vanilla PINNs by ∼6.5 times while improving accuracy. To enhance data-driven model training, a new data-generation approach is developed to sample historical fluvial and coastal flood events, which ensures a robust data set for extreme event prediction. The models are evaluated using a realistic one-dimensional river domain extracted from an ESM's river mesh and the Hurricane Irene event as an independent test case. Results show that FD-PINN achieves accurate predictions with significantly reduced computational costs relative to vanilla PINNs. Among data-driven models, the best overall performance is achieved by a CNN-LSTM hybrid, which balances accuracy and efficiency. While a fully connected CNN (CNN-FC) provides the best accuracy, it incurs high computational cost. Architectures lacking strong temporal modeling tend to underperform on unseen events. These findings highlight the importance of sequence-aware designs for robust generalization. This study reveals the trade-offs between physics-informed and data-driven models and proposes an adaptive hybrid framework for integrating ML into ESMs to enhance local flood simulations.

Earth Systems Modeling↗

Accelerating Radiation Computations for Dynamical Models With Targeted Machine Learning and Code Optimization

Abstract Atmospheric radiation is the main driver of weather and climate, yet due to a complicated absorption spectrum, the precise treatment of radiative transfer in numerical weather and climate models is computationally unfeasible. Radiation parameterizations need to maximize computational efficiency as well as accuracy, and for predicting the future climate many greenhouse gases need to be included. In this work, neural networks (NNs) were developed to replace the gas optics computations in a modern radiation scheme (RTE+RRTMGP) by using carefully constructed models and training data. The NNs, implemented in Fortran and utilizing BLAS for batched inference, are faster by a factor of 1–6, depending on the software and hardware platforms. We combined the accelerated gas optics with a refactored radiative transfer solver, resulting in clear‐sky longwave (shortwave) fluxes being 3.5 (1.8) faster to compute on an Intel platform. The accuracy, evaluated with benchmark line‐by‐line computations across a large range of atmospheric conditions, is very similar to the original scheme with errors in heating rates and top‐of‐atmosphere radiative forcings typically below 0.1 K day −1 and 0.5 W m −2 , respectively. These results show that targeted machine learning, code restructuring techniques, and the use of numerical libraries can yield material gains in efficiency while retaining accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Monte Carlo solution methods in a moment-based scale-bridging algorithm for thermal radiative transfer problems: Comparison with Fleck and Cummings

We have developed a moment-based scale-bridging algorithm for thermal radiative transfer problems. The algorithm takes the form of well-known nonlinear-diffusion acceleration which utilizes a low-order (LO) continuum problem to accelerate the solution of a high-order (HO) kinetic problem. The coupled nonlinear equations that form the LO problem are efficiently solved using a preconditioned Jacobian-free Newton-Krylov method. This work demonstrates the applicability of the scale-bridging algorithm with a Monte Carlo HO solver and reports the computational efficiency of the algorithm in comparison to the well-known Fleck-Cummings algorithm. (authors)

97 MATHEMATICS AND COMPUTING↗

Glassoformer: A Query-Sparse Transformer for Post-Fault Power Grid Voltage Prediction

Here, we propose GLassoformer, a novel and efficient transformer architecture leveraging group Lasso regularization to reduce the number of queries of the standard self-attention mechanism. Due to the sparsified queries, GLassoformer is more computationally efficient than the standard transformers. On the power grid post-fault voltage prediction task, GLasso-former shows remarkably better prediction than many existing benchmark algorithms in terms of accuracy and stability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An Optimization-Based Coupling of Reduced Order Models with an Efficient Reduced Adjoint Basis Generation Approach

Optimization-based coupling (OBC) is an attractive alternative to traditional Lagrange multiplier approaches in multiple modeling and simulation contexts. However, application of OBC to time-dependent problems has been hindered by the computational cost of finding the stationary points of the associated Lagrangian, which requires primal and adjoint solves. This issue can be mitigated by using OBC in conjunction with computationally efficient reduced order models (ROMs). To demonstrate the potential of this combination, in this paper, we develop an optimization-based ROM-ROM coupling for a transient advection-diffusion transmission problem. We pursue the “optimize-then-reduce” path toward solving the minimization problem at each time step and solve reduced space adjoint system of equations, where the main challenge in this formulation is the generation of adjoint snapshots and reduced bases for the adjoint systems required by the optimizer. One of the main contributions of the paper is a new technique for an efficient adjoint snapshot collection for gradient-based optimizers in the context of optimization-based ROM-ROM couplings. In conclusion, we present numerical studies demonstrating the accuracy of the approach along with comparison between various approaches for selecting a reduced order basis for the adjoint systems, including decay of snapshot energy, average iteration counts, and timings.

coupled problems↗

Quantum Computing for Biomedical Computational and Data Sciences: A Joint DOE-NIH Roundtable

The overlap of quantum computing and biomedical research, while less explored, presents significant near-term opportunities. The Department of Energy (DOE) and the National Institutes of Health (NIH) are interested in exploiting the DOE community’s capabilities and expertise in quantum computing to potentially advance biomedical research, targeting fundamental studies of biological and molecular structures, understanding of human health as well as mental and physical disorders and diseases, and deriving insights from clinical data. NIH’s approach to quantum computing is guided by its Strategic Plan for Data Science, emphasizing the importance of findable, accessible, interoperable, and reusable (FAIR) data assets, security and privacy of data, and efficient computing and storage. DOE’s Office of Science (SC), and more specifically the Advanced Scientific Computing Research (ASCR) program, supports quantum information science (QIS) research, contributing to a unique portfolio of quantum computing and communications expertise. This roundtable was assembled to consider the opportunities and challenges in the near-, medium-, and long-term at the intersection of quantum computing, data science, and biomedical research and how these could be addressed through inter-agency collaboration and multi-disciplinary partnerships.

59 BASIC BIOLOGICAL SCIENCES↗

MultiPEM Toolbox: User Manual [Rev. 2]

This document explains use of the Multi-Phenomenology Explosion Monitoring (Multi PEM) Toolbox, a collection of R scripts for estimating the unknown device parameters of a new event with uncertainty quantification. The methodology and application used for illustration in this user manual are fully documented in a Los Alamos National Laboratory technical report hereafter designated “WPA” for reference. Additional details on the application are found in a recent journal article. Two assessment types are available: rapid and complete. Rapid assessments are conducted in two stages, as described in Section 2. In the first stage, calibration data are used to estimate forward and error model parameters (WPA, §5.1) and (if relevant) errors-in-variables yield values for calibration sources (WPA, §3, Equation (3)). In the second stage, new event data are used to estimate the unknown new event device parameters (WPA, §5.2) with uncertainty quantification. Two options for treating the inferred first stage parameters in second stage Bayesian analysis are available: fixing them at their maximum likelihood estimate (default), or multiple imputation. Multiple imputation involves utilizing several posterior samples (imputations) of the first stage parameters as fixed values in the second stage posterior sampling of the new event device parameters. Second stage sampling is conducted across imputations in parallel to improve computational efficiency. This method produces improved uncertainty quantification of the new event device parameters compared with the default treatment of the first stage parameters, at the expense of additional computation. Complete assessments are conducted in a single stage, as described in Section 3. Calibration and (if relevant) new event data are used simultaneously to estimate all forward model, error model, and (if relevant) new event device parameters with uncertainty quantification on the latter. As the name suggests, rapid assessments generally run substantially faster than complete assessments (even with multiple imputation), because the results of first stage analysis can be stored and incorporated into estimating a relatively low-dimensional space of new event device parameters whenever relevant new event data becomes available. On the other hand, complete assessments must be run on the full set of model and device parameters with calibration and new event data every time the latter becomes available.

97 MATHEMATICS AND COMPUTING↗

CPOPT : optimization for fitting CANDECOMP/PARAFAC models.

Tensor decompositions (e.g., higher-order analogues of matrix decompositions) are powerful tools for data analysis. In particular, the CANDECOMP/PARAFAC (CP) model has proved useful in many applications such chemometrics, signal processing, and web analysis; see for details. The problem of computing the CP decomposition is typically solved using an alternating least squares (ALS) approach. We discuss the use of optimization-based algorithms for CP, including how to efficiently compute the derivatives necessary for the optimization methods. Numerical studies highlight the positive features of our CPOPT algorithms, as compared with ALS and Gauss-Newton approaches.

99 GENERAL AND MISCELLANEOUS↗

The Method of Finite Averages: A rigorous upscaling methodology for heterogeneous porous media

Rigorous upscaling techniques offer accurate and computationally-efficient strategies for modeling the average behaviors of multi-physical, multiscale phenomena in geological porous media. However, such techniques often rely on a variety of methodological assumptions that prohibit their rigorous application to practical systems (e.g., systems involving heterogeneous porous media, system-scale boundary conditions, and fine-scale dynamics that are not diffusion-dominant). In this work, we aim to formulate an upscaling methodology with few methodological assumptions to provide high levels of model generality and foster the utilization of rigorously-derived upscaled models in practice. In particular, we introduce the Method of Finite Averages (MoFA), a novel upscaling methodology for rigorously modeling heterogeneous porous media and system-scale boundary conditions. We then detail MoFA’s implementation for the advective–diffusive transport of a single species and compare the methodology with classic numerical techniques, as well as other rigorous upscaling techniques, to highlight MoFA’s unique combination of rigor and generality. We then validate the derived model while demonstrating its benefits in three numerical experiments. The results suggest that (1.) the applicability and a priori error guarantees of MoFA models do not directly depend on system geometry, (2.) a model’s applicability and error guarantees can be can arbitrarily expanded and reduced, respectively, with further computational expense, and (3.) downscaling with MoFA provides an efficient strategy for generating accurate pore-scale solutions from upscaled results. Ultimately, the results evidence that upscaled models can be rigorously derived for heterogeneous porous media systems and resolved in a fraction of the time it takes to perform the equivalent pore-scale simulations.

58 GEOSCIENCES↗