Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “high order”

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 685 records · Page 38

Efficient and Robust Dynamic Simulation of Power Systems With Holomorphic Embedding

Dynamic simulation is vitally important in power system analysis, but traditional approaches based on numerical integration over small time steps are time-consuming. Also, the Newton-Raphson method suffers from difficulty in convergence when solving nonlinear algebraic equations. In this paper, we propose a novel dynamic simulation approach based on holomorphic embedding. By obtaining a high-order approximation of system dynamics, it achieves a much larger time step and thus enhances the computational efficiency significantly. In addition, the new approach avoids non-convergence issues in solving algebraic equations, which improves robustness. The approach includes flexible modeling of synchronous generators and controllers, and we propose a method for modeling generator coordinate transformations. The approach is tested on the IEEE 39-bus, 10-generator system and a Polish 2383-bus, 327-generator system. The results demonstrate promising computational efficiency and satisfactory numerical robustness for the analysis of large-scale power systems.

42 ENGINEERING↗

Resilience Evaluation and Enhancement for Island City Integrated Energy Systems

Extreme natural hazards, such as hurricanes or earthquakes, have a high probability of threatening energy supply security and causing high-order contingencies to island city-integrated energy systems (IC-IESs). To better evaluate and enhance resilience, a novel approach is proposed in this work for IC-IESs. The resilience of an IC-IES is analyzed from both the system level and the component level. At the system level, the impacts of extreme natural disasters are quantified. At the component level, the importance of individual components is analyzed through pre-failure and post-failure indices. The pre-failure index identifies the system’s weak links before an energy interruption, and the post-failure index determines the optimal repair strategy to restore the service. The proposed indices are solved by the impact increment method (IIM), which significantly improves computational efficiency without much affecting result accuracy. Numerical simulation studies are conducted on the modified Barry Island IES and IES E123-G48-H32 test systems. Furthermore, the results validate the effectiveness of the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Investigating the Origins of Cyclic Variability in Internal Combustion Engines Using Wall-Resolved Large Eddy Simulations

Modern internal combustion engines (ICE) operate at the ragged edge of stable operation characterized by high cycle-to-cycle variations (CCV). A key scientific challenge for ICE is the understanding, modeling, and control of CCV in engine performance, which can contribute to partial burns, misfire, and knock. The objective of this study is to use high-fidelity numerical simulations to improve the understanding of the causes of CCV. Nek5000, a leading high-order spectral element, open source code, is used to simulate the turbulent flow in the engine combustion chamber. Multicycle, wall-resolved large-eddy simulations (LESs) are performed for the General Motors (GM), Transparent Combustion Chamber (TCC-III) optical engine under motored operating conditions. The mean and root-mean-square (rms) of the in-cylinder flow fields at various piston positions are validated using particle image velocimetry (PIV) measurements during the intake and compression strokes. The large-scale flow structures, including the swirl and tumble flow patterns, are analyzed in detail and the causes for cyclic variabilities in these flow features are explained. The energy distribution across the different scales of the flow are quantified using one-dimensional (1D) energy spectra, and the effect of the tumble breakdown process on the energy distribution is examined. Finally, the insights from this study can help us develop improved engine designs with reduced cyclic variabilities in the in-cylinder flow leading to enhanced engine performance.

33 ADVANCED PROPULSION SYSTEMS↗

Assessment of Machine Learning Wall Modeling Approaches for Large Eddy Simulation of Gas Turbine Film Cooling Flows: An a Priori Study

Here, in this work, a priori analysis of machine learning (ML) strategies is carried out with the goal of data-driven wall modeling for large eddy simulation (LES) of gas turbine film cooling flows. High-fidelity flow datasets are extracted from wall-resolved LES (WRLES) of flow over a flat plate interacting with the coolant flow supplied by a single row of 7-7-7 shaped cooling holes inclined at 30 degrees with the flat plate at different blowing ratios (BR). The WRLES are performed using the high-order Nek5000 spectral element computational fluid dynamics (CFD) solver. Light gradient boosting machine (LightGBM) is employed as the ML algorithm for the data-driven wall model. Parametric tests are conducted to systematically assess the influence of a wide range of input flow features (velocity components, velocity gradients, pressure gradients, and fluid properties) on the accuracy of ML wall model with respect to prediction of wall shear stress. In addition, the use of spatial stencil and time delay is also explored within the ML wall modeling framework. It is shown that features associated with gradients of the streamwise and spanwise velocity components have a major impact on the prediction fidelity of wall model, while the effect of gradients of wall-normal velocity component is found to be negligible. Moreover, adding flow feature information from an x-y-z spatial stencil significantly improves the ML model accuracy and generalizability compared to just using local flow features from the matching location. Overall, highest prediction accuracy is achieved when both spatial stencil and time delay features are incorporated within the data-driven wall modeling paradigm.

33 ADVANCED PROPULSION SYSTEMS↗

Universal interferometric signatures of a black hole’s photon ring

The Event Horizon Telescope image of the supermassive black hole in the galaxy M87 is dominated by a bright, unresolved ring. General relativity predicts that embedded within this image lies a thin “photon ring,” which is composed of an infinite sequence of self-similar subrings that are indexed by the number of photon orbits around the black hole. The subrings approach the edge of the black hole “shadow,” becoming exponentially narrower but weaker with increasing orbit number, with seemingly negligible contributions from high-order subrings. Here, we show that these subrings produce strong and universal signatures on long interferometric baselines. These signatures offer the possibility of precise measurements of black hole mass and spin, as well as tests of general relativity, using only a sparse interferometric array.

79 ASTRONOMY AND ASTROPHYSICS↗

Coupling morphological and magnetic anisotropy for assembling tetragonal colloidal crystals

Morphological and magnetic anisotropy can be combined in colloidal assembly to create unconventional secondary structures. We show here that magnetite nanorods interact along a critical angle, depending on their aspect ratios and assemble into body-centered tetragonal colloidal crystals. Under a magnetic field, size-dependent attractive and repulsive domains develop on the ends and center of the nanorods, respectively. Our joint experiment-computational multiscale study demonstrates the presence of a critical angle in the attractive domain, which defines the equilibrium bonding states of interacting rods and leads to the formation of non–close-packed yet hard-contact tetragonal crystals. Small-angle x-ray scattering measurement attributes the perfect tetragonal phase to the slow assembly kinetics. The crystals exhibit brilliant structural colors, which can be actively tuned by changing the magnetic field direction. These highly ordered frameworks and well-defined three-dimensional nanochannels may offer new opportunities for manipulating nanoscale chemical transformation, mass transportation, and wave propagation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Time-resolving state-specific molecular dissociation with XUV broadband absorption spectroscopy

The electronic and nuclear dynamics inside molecules are essential for chemical reactions, where different pathways typically unfold on ultrafast timescales. Extreme ultraviolet (XUV) light pulses generated by free-electron lasers (FELs) allow atomic-site and electronic-state selectivity, triggering specific molecular dynamics while providing femtosecond resolution. Yet, time-resolved experiments are either blind to neutral fragments or limited by the spectral bandwidth of FEL pulses. Here, we combine a broadband XUV probe pulse from high-order harmonic generation with an FEL pump pulse to observe dissociation pathways leading to fragments in different quantum states. We temporally resolve the dissociation of a specific O 2 + state into two competing channels by measuring the resonances of ionic and neutral fragments. This scheme can be applied to investigate convoluted dynamics in larger molecules relevant to diverse science fields.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Attention to quantum complexity

The imminent era of error-corrected quantum computing demands robust methods to characterize quantum state complexity from limited, noisy measurements. We introduce the Quantum Attention Network (QuAN), a classical artificial intelligence (AI) framework leveraging attention mechanisms tailored for learning quantum complexity. Inspired by large language models, QuAN treats measurement snapshots as tokens while respecting permutation invariance. Combined with our parameter-efficient miniset self-attention block, this enables QuAN to access high-order moments of bit-string distributions and preferentially attend to less noisy snapshots. We test QuAN across three quantum simulation settings: driven hard-core Bose-Hubbard model, random quantum circuits, and toric code under coherent and incoherent noise. QuAN directly learns entanglement and state complexity growth from experimental computational basis measurements, including complexity growth in random circuits from noisy data. In regimes inaccessible to existing theory, QuAN unveils the complete phase diagram for noisy toric code data as a function of both noise types, highlighting AI’s transformative potential for assisting quantum hardware.

Kim, Hyejin [Cornell Univ., Ithaca, NY (United Sta↗

Asymptotically Compatible Reproducing Kernel Collocation and Meshfree Integration for Nonlocal Diffusion

Reproducing kernel (RK) approximations are meshfree methods that construct shape functions from sets of scattered data. We present an asymptotically compatible (AC) RK collocation method for nonlocal diffusion models with Dirichlet boundary condition. The numerical scheme is shown to be convergent to both nonlocal diffusion and its corresponding local limit as nonlocal interaction vanishes. The analysis is carried out on a special family of rectilinear Cartesian grids for a linear RK method with designed kernel support. The key idea for the stability of the RK collocation scheme is to compare the collocation scheme with the standard Galerkin scheme, which is stable. In addition, assembling the stiffness matrix of the nonlocal problem requires costly computational resources because high-order Gaussian quadrature is necessary to evaluate the integral. We thus provide a remedy to the problem by introducing a quasi-discrete nonlocal diffusion operator for which no numerical quadrature is further needed after applying the RK collocation scheme. The quasi-discrete nonlocal diffusion operator combined with RK collocation is shown to be convergent to the correct local diffusion problem by taking the limits of nonlocal interaction and spatial resolution simultaneously. The theoretical results are then validated with numerical experiments. We additionally illustrate a connection between the proposed technique and an existing optimization based approach based on generalized moving least squares.

97 MATHEMATICS AND COMPUTING↗

Implicit-Explicit Multirate Infinitesimal GARK Methods

This work focuses on the development of a new class of high-order accurate methods for multirate time integration of systems of ordinary differential equations. Unlike other recent work in this area, the proposed methods support mixed implicit-explicit (IMEX) treatment of the slow time scale. In addition to allowing this slow time scale flexibility, the proposed methods utilize a so-called infinitesimal formulation for the fast time scale through definition of a sequence of modified “fast" initial-value problems that may be solved using any viable algorithm. We name the proposed class as implicit-explicit multirate infinitesimal generalized-structure additive Runge--Kutta (IMEX-MRI-GARK) methods. In addition to defining these methods, we prove that they may be viewed as specific instances of GARK methods and derive a set of order conditions on the IMEX-MRI-GARK coefficients to guarantee both third and fourth order accuracy for the overall multirate method. Additionally, we provide three specific IMEX-MRI-GARK methods, two of order three and one of order four. We conclude with numerical simulations on two multirate test problems, demonstrating the methods' predicted convergence rates and comparing their efficiency against both legacy IMEX multirate schemes and recent third and fourth order implicit MRI-GARK methods.

97 MATHEMATICS AND COMPUTING↗

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part II: Nonlinearities and DAEs

Fully implicit Runge--Kutta (IRK) methods have many desirable accuracy and stability properties as time integration schemes, but high-order IRK methods are not commonly used in practice with large-scale numerical PDEs because of the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic framework for solving the nonlinear equations that arise from IRK methods (and discontinuous Galerkin discretizations in time) applied to nonlinear numerical PDEs, including PDEs with algebraic constraints. Several new linearizations of the nonlinear IRK equations are developed, offering faster and more robust convergence than the often-considered simplified Newton, as well as an effective preconditioner for the true Jacobian if exact Newton iterations are desired. Inverting these linearizations requires solving a set of block 2 x 2 systems. Under quite general assumptions, it is proven that the preconditioned 2 x 2 operator's condition number is bounded by a small constant close to one, independent of the spatial discretization, spatial mesh, and time step, and with only weak dependence on the number of stages or integration accuracy. Moreover, the new method is built using the same preconditioners needed for backward Euler-type time stepping schemes, so can be readily added to existing codes. The new methods are applied to several challenging fluid flow problems, including the compressible Euler and Navier--Stokes equations, and the vorticity-streamfunction formulation of the incompressible Euler and Navier--Stokes equations. Up to 10th-order accuracy is demonstrated using Gauss IRK, while in all cases fourth-order Gauss IRK requires roughly half the number of preconditioner applications as required by standard Singly diagonally implicit Runge--Kutta methods.

97 MATHEMATICS AND COMPUTING↗

Parallel Algorithms for Computing the Tensor-Train Decomposition

The tensor-train (TT) decomposition expresses a tensor in a data-sparse format used in molecular simulations, high-order correlation functions, and optimization. In this paper, we propose four parallelizable algorithms that compute the TT format from various tensor inputs: (1) Parallel-TTSVD for traditional format, (2) PSTT and its variants for streaming data, (3) Tucker2TT for Tucker format, and (4) TT-fADI for solutions of Sylvester tensor equations. We provide theoretical guarantees of accuracy, parallelization methods, scaling analysis, and numerical results. For example, for a d-dimension tensor in $\mathbb{R}$ $n\times∙∙∙$$\times$$n$ a two-sided sketching algorithm PSTT2 is shown to have a memory complexity of $O(n^{[d/2]})$, improving upon $O(n^{d—1})$ from previous algorithms.

97 MATHEMATICS AND COMPUTING↗

Parallel-in-Time Solution of Scalar Nonlinear Conservation Laws

Here, we consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.

97 MATHEMATICS AND COMPUTING↗

The Bloch equation for spin dynamics in electron storage rings: Computational and theoretical aspects

In this paper, we describe our work on spin polarization in high-energy electron storage rings which we base on the Full Bloch equation (FBE) for the polarization density and which aims towards the [Formula: see text] option of the proposed Future Circular Collider (FCC-ee) and the proposed Circular Electron Positron Collider (CEPC). The FBE takes into account non spin-flip and spin-flip effects due to synchrotron radiation including the spin-diffusion effects and the Sokolov–Ternov effect with its Baier–Katkov generalization as well as the kinetic-polarization effect. This mathematical model is an alternative to the standard mathematical model based on the Derbenev–Kondratenko formulas. For our numerical and analytical studies of the FBE, we develop an approximation to the latter to obtain an effective FBE. This is accomplished by finding a third mathematical model based on a system of stochastic differential equations (SDEs) underlying the FBE and by approximating that system via the method of averaging from perturbative ODE theory. We also give an overview of our algorithm for numerically integrating the effective FBE. This discretizes the phase space using spectral methods and discretizes time via the additive Runge–Kutta (ARK) method which is a high-order semi-implicit method. We also discuss the relevance of the third mathematical model for spin tracking.

Physics↗

Performance portability study of epistasis detection using SYCL on NVIDIA GPU

We describe the experience of converting a CUDA implementation of a high-order epistasis detection algorithm to SYCL. The goals are for our work to be useful to application and compiler developers with a detailed description of migration paths between CUDA and SYCL. Evaluating the CUDA and SYCL applications on an NVIDIA V100 GPU, we find that the optimization of loop unrolling needs to be applied manually to the SYCL kernel for obtaining comparable performance. The performance of the SYCL group reduce function, an alternative to the CUDA warp-based reduction, depends on the problem and work group sizes. The 64-bit popcount operation implemented with tree of adders is slightly faster than the built-in popcount operation. When the number of OpenMP threads is four, the highest performance of the SYCL and CUDA applications are comparable.

Jin, Zheming↗

iRF v2.0

A predictive, stable, and interpretable machine learning tool: the iterative random forest algorithm (iRF). iRF discovers high-order interactions among variables with the same order of computational cost as random forests (RF). We have demonstrated the utility of iRF in several applications in the biological and environmental sciences. It is a general purpose machine learning framework for building "explainable" predictive engines.

Brown, JamesB.↗

FIERRO V.X

FIERRO is a modern C++ code intended to simulate quasi-static solid mechanics problems and transient, compressible material dynamic problems with Lagrangian methods, which have meshes with constant mass elements that move with the material. FIERRO is designed to aid a) material model research that has historically been done using commercial implicit and explicit finite element codes, b) numerical methods research, and c) computer science research. FIERRO supports user developed material models that adhere to several industry standard formats by using a C++ to Fortran interface to couple the model to the numerical solvers. FIERRO is built on the ELEMENTS library that supports a diverse suite of element types, including high-order elements, and quadrature rules. The mesh class within the ELEMENTS library is designed for efficient calculations on unstructured meshes and to minimize memory usage. FIERRO is designed to readily accommodate a range of numerical methods including continuous finite element, finite volume, and discontinuous Galerkin methods. FIERRO is designed to support explicit and implicit time integration methods. FIERRO only supports a single material in an element. No physical data exists within the code.

Morgan, Nathaniel↗

GL Visualization

GLVis is a lightweight tool for accurate and flexible finite element visualization. GLVis uses OpenGL with interactive refinement to accurately represent curved high-order meshes and a wide variety of finite element grid functions defined on them.

Yee, BenC.↗