Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solve time”

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,801 records · Page 100
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Explicit simulation of the Brownian rotation of arbitrary shaped aerosol particles using quaternions

The shape of an aerosol particle strongly influences its mass and momentum transfer cross-sections, charging properties, and other physical properties. Here, we present an explicit time-stepping procedure to simulate the rotational Brownian motion of arbitrary shaped aerosol particles by solving Euler’s equation of rotation. A Langevin formulation of the rotation equations is used, wherein Brownian motion due to thermal collisions between a particle and background gas molecules is represented using a stochastic fluctuating torque and fluid resistance is included as a drag torque. To avoid singularities associated with describing the orientation of a shape with Euler angles, we employ a quaternion formulation that leads to first-order stochastic differential equations to describe the evolution of the angular position and angular velocity of a rigid body. We perform all the rotational dynamics calculations in the body-fixed frame of reference attached to the rotating shape whose basis vectors are the normalized eigenvectors of the inertia tensor of the particle. Numerical solutions to rotation under torque-free conditions, damped rotation without Brownian motion, and stochastic rotation for arbitrary shapes are presented and discussed. The presented method enables time-resolved simulation of Brownian rotation for direct comparison with experimentally measured trajectories or statistical measures. The second order accuracy of the used time-stepping procedure places a severe restriction on the timestep that can be used for obtaining accurate results. Animations of presented simulations are included for visualizing rotational motion at various gas pressures. To aid implementation, MATLAB ® codes are also provided. Extension to include translation Brownian motion is straightforward.

Roy, Mrittika↗
DOE OSTI2021

Practical CO2—WAG Field Operational Designs Using Hybrid Numerical-Machine-Learning Approaches

Machine-learning technologies have exhibited robust competences in solving many petroleum engineering problems. The accurate predictivity and fast computational speed enable a large volume of time-consuming engineering processes such as history-matching and field development optimization. The Southwest Regional Partnership on Carbon Sequestration (SWP) project desires rigorous history-matching and multi-objective optimization processes, which fits the superiorities of the machine-learning approaches. Although the machine-learning proxy models are trained and validated before imposing to solve practical problems, the error margin would essentially introduce uncertainties to the results. In this paper, a hybrid numerical machine-learning workflow solving various optimization problems is presented. By coupling the expert machine-learning proxies with a global optimizer, the workflow successfully solves the history-matching and CO2 water alternative gas (WAG) design problem with low computational overheads. The history-matching work considers the heterogeneities of multiphase relative characteristics, and the CO2-WAG injection design takes multiple techno-economic objective functions into accounts. This work trained an expert response surface, a support vector machine, and a multi-layer neural network as proxy models to effectively learn the high-dimensional nonlinear data structure. The proposed workflow suggests revisiting the high-fidelity numerical simulator for validation purposes. The experience gained from this work would provide valuable guiding insights to similar CO2 enhanced oil recovery (EOR) projects.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2021

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

$H_0$ Without the Sound Horizon (or Supernovae): A 2% Measurement in DESI DR1

The sound horizon scale $r_s$ is a key source of information for early-time $H_0$ measurements, and is therefore a common target of new physics proposed to solve the Hubble tension. We present a sub-2% measurement of the Hubble constant that is independent of this scale, using data from the first data release of the Dark Energy Spectroscopic Instrument (DESI DR1). Building on previous work, we remove dependency on the sound horizon size using a heuristic rescaling procedure at the power spectrum level. A key innovation is the inclusion of \emph{uncalibrated} (agnostic to $r_s$) post-reconstruction BAO measurements from DESI DR1, as well as using the CMB acoustic scale $θ_*$ as a high-redshift anchor. Uncalibrated type-Ia supernovae are often included as an independent source of $Ω_m$ information; here we demonstrate the robustness of our results by additionally considering two supernova-independent alternative datasets. We find somewhat higher values of $H_0$ relative to our previous work: $69.2^{+1.3}_{-1.4}$, $70.3^{+1.4}_{-1.2}$, and $69.6^{+1.3}_{-1.8}\,{\rm km\,s^{-1}\,Mpc^{-1}}$ respectively when including measurements from i) Planck/ACT CMB lensing $\times$ unWISE galaxies, ii) the DES Year 3 6$\times$2pt analysis, and iii) Planck/ACT CMB lensing + the DES Year 5 supernova analysis. These remarkably consistent constraints achieve better than 2% precision; they are among the most stringent sound horizon-independent measurements from LSS to date, and provide a powerful avenue for probing the origin of the Hubble tension.

Cosmology and Nongalactic Astrophysics (astro-ph.C↗
NASA NTRS1991

Note on unit tangent vector computation for homotopy curve tracking on a hypercube

Probability-one homotopy methods are a class of methods for solving nonlinear systems of equations that are globally convergent from an arbitrary starting point. The essence of all such algorithms is the construction of an appropriate homotopy map and subsequent tracking of some smooth curve in the zero set of the homotopy map. Tracking a homotopy curve involves finding the unit tangent vector at different points along the zero curve, which amounts to calculating the kernel of the n x (n + 1) Jacobian matrix. While computing the tangent vector is just one part of the curve tracking algorithm, it can require a significant percentage of the total tracking time. This note presents computational results showing the performance of several different parallel orthogonal factorization/triangular system solving algorithms for the tangent vector computation on a hypercube.

Chakraborty, A.↗
DOE OSTI2022

MEUMAPPS (C++ Version)

Many materials, metal alloys in particular, have features on the on micrometer or nanometer scale that have a large impact on the properties of the material. These features are known as the microstructure of the material. Understanding why and how the microstructure forms in a material is of fundamental scientific interest as well as of significant technological interest. The capability to predict microstructure evolution in a material allows the intentional design of microstructures and hence the intentional design of material properties. The phase-field method is one of the leading methods for predicting microstructure evolution. One of the most significant problems for phase-field models is their computational expense. Even limited phase-field simulations can easily require thousands of CPU core-hours to complete, which significantly limits their use. This code provides both a general framework for creating scalable, GPU-accelerated phase-field model applications as well as several applications themselves. The code is capable of using hundreds of GPUs efficiently, which greatly reduces the time required to perform simulations. The code is written with an emphasis on performance portability, that is the ability for the code to run efficiently on a number of different computing architectures without modification of the source code. The performance portability of this code is primarily enabled through the use of two libraries, Kokkos (performance portable data structures and execution patterns) and heFFTe (performance portable distributed 3D fast Fourier transforms). The code consists of a core library, applications, and tests. The core library includes shared functionality between applications. This includes interfaces with fast Fourier transform (FFT) libraries such as heFFTe, data structures based on Kokkos, file input and output capabilities, and a solver for infinitesimal strain mechanical equilibrium problems. Five applications are included in the code. The flagship application is the MEUMAPPS-SS application, which implements the Kim-Kim-Suzuki phase-field model for precipitation for an arbitrary number of phases and components in a metal alloy. Five simpler applications are also included that solve the Eshelby inclusion problem, Allen-Cahn equation, the coupled Allen-Cahn and diffusion equations, and the Cahn-Hilliard equation. The code includes two applications to solve the Cahn-Hilliard equation, one with constant-step-size first-order time integration and the second with adaptive high-order time integration.

DeWitt, Stephen [Oak Ridge National Lab. (ORNL), O↗
NASA NTRS1987

Wave envelope technique for multimode wave guide problems

A numerical solution technique for two-dimensional EM waveguide problems is developed analytically and demonstrated. The frequency-domain waveguide problem is transformed to a time-dependent problem and treated following the limiting-amplitude principle; the wave-envelope technique is applied; and the resulting problem is solved numerically using a finite-difference scheme based on a variation of the finite-area method (Baumeister, 1977 and 1984). Results for several sample problems, obtained in 10 min or less of execution time on PCs, are presented in tables.

Hariharan, S. I.↗
DOE OSTI2023

A Secure and Adaptive Hierarchical Multi-Timescale Framework for Resilient Load Restoration Using a Community Microgrid

Distribution system integrated community microgrids (CMGs) can partake in restoring loads during extended duration outages. At such times, the CMGs are challenged with limited resource availability, absence of robust grid support, and heightened demand-supply uncertainty. Here, this paper proposes a secure and adaptive three-stage hierarchical multi-timescale framework for scheduling and real-time (RT) dispatch of CMGs with hybrid PV systems to address these challenges. The framework enables the CMG to dynamically expand its boundary to support the neighboring grid sections and is adaptive to the changing forecast error impacts. The first stage solves a stochastic extended duration scheduling (EDS) problem to obtain referral plans for optimal resource rationing. The intermediate near-real-time (NRT) scheduling stage updates the EDS schedule closer to the dispatch time using new obtained forecasts, followed by the RT dispatch stage. To make the decisions more secure and robust against forecast errors, a novel concept called delayed recourse is designed. The approach is evaluated via numerical simulations on a modified IEEE 123-bus system and validated using OpenDSS and hardware-in-loop simulations. The results show superior performance in maximizing load supply and continuous secure distribution network operation under different operating scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Employment access assessed using the mobility energy productivity (MEP) metric

Transit agencies, local governments, employers, and job-seekers have a shared interest in connecting residents with jobs in an affordable and time efficient manner, with public agencies also caring about energy efficiency and air quality. Employment hubs are an opportunity to solve the spatial mismatch between homes of job-seekers and the locations of desirable jobs. Such is the case in Columbus, Ohio, between Rickenbacker Industrial Park and the Linden neighborhood, which has experienced persistent poverty. Using the mobility energy productivity (MEP) metric to examine travel time, cost, and energy efficiency, we show current transit service is undesirable due to excessive travel time (70 min, MEP = 0), while driving alone (MEP = 0.20) may be less desirable than a hypothetical, fare-free microtransit service (MEP = 0.23). Updating MEP to use locally-derived input data can help identify parameters under which providing microtransit service in a specific place has compelling benefits in terms of vehicle energy efficiency as well as cost and travel time for riders.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

Asynchronous Truncated Multigrid-Reduction-in-Time

In this paper, we present the new “asynchronous truncated multigrid-reduction-in-time” (AT-MGRIT) algorithm for introducing time parallelism to the solution of discretized time-dependent problems. The new algorithm is based on the multigrid-reduction-in-time (MGRIT) approach, which, in certain settings, is equivalent to another common multilevel parallel-in-time method, Parareal. In contrast to Parareal and MGRIT that both consider a global temporal grid over the entire time interval on the coarsest level, the AT-MGRIT algorithm uses truncated local time grids on the coarsest level, each grid covering certain temporal subintervals. Further, these local grids can be solved completely in an independent way from each other, which reduces the sequential part of the algorithm and, thus, increases parallelism in the method. Here, we study the effect of using truncated local coarse grids on the convergence of the algorithm, both theoretically and numerically, and show, using challenging nonlinear problems, that the new algorithm consistently outperforms classical Parareal/MGRIT in terms of time to solution.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1984

Overcoming time-integration errors in SINDA's FWDBCK solution routine

The FWDBCK time step, which is usually chosen intuitively to achieve adequate accuracy at reasonable computational costs, can in fact lead to large errors. NASA observed such errors in solving cryogenic problems on the COBE spacecraft, but a similar error is also demonstrated for a single node radiating to space. An algorithm has been developed for selecting the time step during the course of the simulation. The error incurred when the time derivative is replaced by the FWDBCK time difference can be estimated from the Taylor-Series expression for the temperature. The algorithm selects the time step to keep this error small. The efficacy of the method is demonstrated on the COBE and single-node problems.

Skladany, J. T.↗
DOE OSTI2021

Seismic source characterization of the Arabian Peninsula and Zagros Mountains from regional moment tensor and coda envelopes

Reliable estimates of moment magnitude and source mechanism for seismic events in the Middle East can be challenging due to a small number of openly available stations, the complex tectonic setting, and regions of high attenuation. Access to high-quality waveform data from well-calibrated regional seismic stations is fundamental in producing robust and stable estimates of earthquake source parameters, particularly when measurements of absolute ground motion amplitudes are required. Earthquake source mechanism and moment magnitude are invaluable information in the assessment of seismic hazard, plate motions, and the characterization of faults and regional stress field. The expansion of the Kingdom of Saudi Arabia’s national seismic network in the past several decades provides an opportunity to develop the capabilities of routine focal mechanism and moment magnitude estimations. In this study, we use time-domain full waveform moment tensor inversion and coda envelope–derived amplitude measurements to solve for earthquake source mechanism, moment magnitudes, and their source type. Furthermore, we compared the moment magnitudes calculated from the two methods and publicly available earthquake catalogs and discuss the implications of the obtained source parameters.

58 GEOSCIENCES↗
DOE OSTI2021

Second-Order Invariant Domain Preserving ALE Approximation of Euler Equations

Abstract An invariant domain preserving arbitrary Lagrangian-Eulerian method for solving non-linear hyperbolic systems is developed. The numerical scheme is explicit in time and the approximation in space is done with continuous finite elements. The method is made invariant domain preserving for the Euler equations using convex limiting and is tested on various benchmarks.

Guermond, Jean-Luc↗
DOE OSTI2022

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗
DOE OSTI2025

A discontinuous Galerkin spectral element method for compressible reacting flows

High-order methods have recently been shown to be an effective tool for high-fidelity flow computations like direct numerical simulations and large-eddy simulations because of their strong balance between accuracy and computational cost. In this work, a high-order discontinuous Galerkin spectral element method (DGSEM) is developed to solve the chemically reacting Navier-Stokes equations. To handle the disparate length and time scales associated with these equations, we develop a novel method which combines the spectral accuracy of the SEM with the flexibility of the DG approach. The framework, implemented in the spectral element code Nek5000, is well suited to capture turbulence in smooth regions of the flow, while maintaining numerical stability in the presence of shocks. An entropy-residual based artificial viscosity is added to smooth shocked regions of flow, and a positivity-preserving limiter is implemented to suppress non-physical oscillations. These enhancements support the numerical stability of the hydrodynamic sub-step, which is decoupled from the chemistry integration through a second-order operator splitting method. Here, a series of smooth and discontinuous validation cases are presented in increasing physical and computational complexity for both inviscid and viscous flows. In particular, simulations of canonical one-dimensional and two-dimensional detonations are performed, and the high-order numerical results are validated against available literature data. Additional validation studies are carried out for classical three-dimensional numerical simulations of incompressible and compressible turbulent flows.

Compressible reacting flows↗
DOE OSTI2021

Variational, stable, and self-consistent coupling of 3D electromagnetics to 1D transmission lines in the time domain

This work presents a new multiscale method for coupling the 3D Maxwell's equations to the 1D telegrapher's equations. While Maxwell's equations are appropriate for modeling complex electromagnetics in arbitrary-geometry domains, simulation cost for many applications (e.g. pulsed power) can be dramatically reduced by representing less complex transmission line regions of the domain with a 1D model. By assuming a transverse electromagnetic (TEM) ansatz for the solution in a transmission line region, we reduce the Maxwell's equations to the telegrapher's equations. Here, we propose a self-consistent finite element formulation of the fully coupled system that uses boundary integrals to couple between the 3D and 1D domains and supports arbitrary unstructured 3D meshes. Additionally, by using a Lagrange multiplier to enforce continuity at the coupling interface, we allow for an absorbing boundary condition to also be applied to non-TEM modes on this boundary. We demonstrate that this feature reduces non-physical reflection and ringing of non-TEM modes off of the coupling boundary. By employing implicit time integration, we ensure a stable coupling, and we introduce an efficient method for solving the resulting linear systems. We demonstrate the accuracy of the new method on two verification problems, a transient O-wave in a rectilinear prism and a steady-state problem in a coaxial geometry, and show the efficiency and weak scalability of our implementation on a cold test of the Z-machine MITL and post-hole convolute.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A review of ptychographic techniques for ultrashort pulse measurement

The measurement of optical ultrafast laser pulses is done indirectly because the required bandwidth to measure these pulses exceeds the bandwidth of current electronics. As a result, this measurement problem is often posed as a 1-D phase retrieval problem, which is fraught with ambiguities. The phase retrieval method known as ptychography solves this problem by making it possible to measure ultrafast pulses in either the time domain or the frequency domain. One well known algorithm is the principal components generalized projections algorithm (PCGPA) for extracting pulses from Frequency-Resolved Optical Gating (FROG) measurements. In this work, we discuss the development of the PCPGA and introduce new developments including an operator formalism that allows for the convenient addition of external constraints and the development of more robust algorithms. A close cousin, the ptychographic iterative engine will also be covered and compared to the PCGPA. Additional developments using other algorithmic strategies will also be discussed along with new developments combining optics and high-speed electronics to achieve megahertz measurement rates.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Refine your search to explore more results.