Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical algorithms”

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,477 records · Page 82

DNS of ignition and flame stabilization in a simplified gas turbine premixer

With the increasing need for fuel flexibility, mitigation of auto-ignition (AI) inside gas turbine (GT) premixers becomes crucial. They must be designed to yield a sufficiently homogeneous fuel-air mixture to achieve low emissions while at the same time avoiding the occurrence of AI and subsequent flame stabilization. This challenge requires a detailed understanding of turbulent mixing and chemistry interactions. In the present work, a direct numerical simulation (DNS) of an array of jets in crossflow (JICF), representative of an industrial GT premixer, is reported to shed light on these complex phenomena. It is found that AI kernels form in the aft part of the premixer and coalesce into a flame front that then propagates upstream, mainly through the boundary layer, and successively engulfs the jets. This, therefore, suggests a significant role of the jet array pattern on the flame stabilization. It is noted that AI kernels continue to form independently during the whole time of the simulation. To clarify the contribution of AI and diffusion in the ignition kernels and the main flame, chemical explosive mode analysis (CEMA) is employed jointly with a kernel tracking algorithm. It is found that during the initial formation of the flame, many ignition kernels form in mixtures with low scalar dissipation rate and large contribution from AI mode. As they quickly grow, they merge into a single flame front that becomes increasingly more diffusion-assisted over time, balancing the AI mode. Turbulence is shown to have a significant enhancing effect in lean premixed flames, but further analysis is required to fully characterize it. These findings are relevant for the industrial premixer studied, and also for novel micromix concepts that may be used in the next generation of GT combustion systems.

ADVANCED PROPULSION SYSTEMS↗

Counting topological interface modes using simplicial characteristic classes

A computational approach for predicting the number of topological interface modes (TIMs) in hermitian systems using the spectral flow—monopole correspondence is presented. The number of TIMs is determined by calculating the Chern number of a complex line bundle of local polarisation vectors over a phase space sphere surrounding a Weyl point. The Chern number is computed by constructing the simplicial first Chern class of a discrete vector bundle on a simplicial mesh. This approach is gauge invariant, derivative free, structure preserving, and robust to noise. The algorithm is shown to reproduce the expected number of TIMs for the case of equatorial fluid waves and the topological Langmuir cyclotron wave. The possibility of using this algorithm to analyse experimental measurements of bulk wave polarisations and predict the associated number of TIMs is explored in a synthetic example.

discrete vector bundles↗

A physics-constrained neural network for multiphase flows

The present study develops a physics-constrained neural network (PCNN) to predict sequential patterns and motions of multiphase flows (MPFs), which includes strong interactions among various fluid phases. To predict the order parameters, which locate individual phases in the future time, a neural network (NN) is applied to quickly infer the dynamics of the phases by encoding observations. The multiphase consistent and conservative boundedness mapping algorithm (MCBOM) is next implemented to correct the predicted order parameters. This enforces the predicted order parameters to strictly satisfy the mass conservation, the summation of the volume fractions of the phases to be unity, the consistency of reduction, and the boundedness of the order parameters. Then, the density of the fluid mixture is updated from the corrected order parameters. Finally, the velocity in the future time is predicted by another NN with the same network structure, but the conservation of momentum is included in the loss function to shrink the parameter space. The proposed PCNN for MPFs sequentially performs (NN)-(MCBOM)-(NN), which avoids nonphysical behaviors of the order parameters, accelerates the convergence, and requires fewer data to make predictions. Numerical experiments demonstrate that the proposed PCNN is capable of predicting MPFs effectively.

Mechanics↗

Precision Reconstruction of Rational Conformal Field Theory from Exact Fixed-Point Tensor Network

The novel concept of entanglement renormalization and its corresponding tensor network renormalization technique have been highly successful in developing a controlled real-space renormalization group (RG) scheme. Numerically approximate fixed-point (FP) tensors are widely used to extract the conformal data of the underlying conformal field theory (CFT) describing critical phenomena. In this paper, we present an explicit analytical construction of the FP tensor for 2D rational CFT. We define it as a correlation function between the “boundary-changing operators” (BCO) on triangles. Our construction fully captures all the real-space RG conditions. We also provide concrete examples, such as Ising, Yang-Lee, and tricritical Ising models, to compute the scaling dimensions explicitly based on the corresponding FP tensor. The BCO descendants turn out to be an optimal basis such that truncation in bond dimensions naturally produces comparable accuracies with the leading existing FP algorithms. Interestingly, our construction of FP tensors is closely related to a strange correlator, where the holographic picture naturally emerges. Our results also open a new door toward understanding CFT in higher dimensions. Published by the American Physical Society 2025

Cheng, Gong (ORCID:0009000891587404)↗

GSoFa: Scalable Sparse Symbolic LU Factorization on GPUs

Decomposing a matrix $\mathbf {A}$ into a lower matrix $\mathbf {L}$ and an upper matrix $\mathbf {U}$, which is also known as LU decomposition, is an essential operation in numerical linear algebra. For a sparse matrix, LU decomposition often introduces more nonzero entries in the $\mathbf {L}$ and $\mathbf {U}$ factors than in the original matrix. A symbolic factorization step is needed to identify the nonzero structures of $\mathbf {L}$ and $\mathbf {U}$ matrices. Attracted by the enormous potentials of the Graphics Processing Units (GPUs), an array of efforts have surged to deploy various LU factorization steps except for the symbolic factorization, to the best of our knowledge, on GPUs. This article introduces gSoFa, the first GPU-based symbolic factorization design with the following three optimizations to enable scalable LU symbolic factorization for nonsymmetric pattern sparse matrices on GPUs. First, here we introduce a novel fine-grained parallel symbolic factorization algorithm that is well suited for the Single Instruction Multiple Thread (SIMT) architecture of GPUs. Second, we tailor supernode detection into a SIMT friendly process and strive to balance the workload, minimize the communication and saturate the GPU computing resources during supernode detection. Third, we introduce a three-pronged optimization to reduce the excessive space consumption problem faced by multi-source concurrent symbolic factorization. Taken together, gSoFa achieves up to 31× speedup from 1 to 44 Summit nodes (6 to 264 GPUs) and outperforms the state-of-the-art CPU project, on average, by 5×. Notably, gSoFa also achieves up to 47 percent of the peak memory throughput of a V100 GPU in the Summit Supercomputer.

97 MATHEMATICS AND COMPUTING↗

Implementation of High Temperature and Pressure fluid property interpolation tables

This document describes the use of module property_interpolate by John Doherty (Doherty,2006). The document “Fast Lookup of CO 2 Properties” describes the numerical details associated with lookup table. Rajeh Pawar modified property_interpolate for easier implementation in the FEHM code. George Zyvoloski modified the package to produce tables for water and air at very high temperatures and pressures. He also modified the auxiliary codes(drivers) to use newer datasets from the National Institute of Standards and Technology. We note here that within the files associated with FEHM there three property_interpolate modules. They are interpolate_2a.f90 (water), interpolate_2b.f90 (air) , and interpolate_2c.f90(CO 2 ). The interpolate_2c module is different than the earlier module produced by Rajeh Pawar in that it includes high temperature and pressure data. While FEHM has a number of fluid physics modules, this document will describe only the software and algorithms associated with water, water vapor, and heat (WH).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?

Variational Quantum Algorithms (VQAs) are often viewed as the best hope for near-term quantum advantage. However, recent studies have shown that noise can severely limit the trainability of VQAs, e.g., by exponentially flattening the cost landscape and suppressing the magnitudes of cost gradients. Error Mitigation (EM) shows promise in reducing the impact of noise on near-term devices. Thus, it is natural to ask whether EM can improve the trainability of VQAs. In this work, we first show that, for a broad class of EM strategies, exponential cost concentration cannot be resolved without committing exponential resources elsewhere. This class of strategies includes as special cases Zero Noise Extrapolation, Virtual Distillation, Probabilistic Error Cancellation, and Clifford Data Regression. Second, we perform analytical and numerical analysis of these EM protocols, and we find that some of them (e.g., Virtual Distillation) can make it harder to resolve cost function values compared to running no EM at all. As a positive result, we do find numerical evidence that Clifford Data Regression (CDR) can aid the training process in certain settings where cost concentration is not too severe. Our results show that care should be taken in applying EM protocols as they can either worsen or not improve trainability. On the other hand, our positive results for CDR highlight the possibility of engineering error mitigation methods to improve trainability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient kinetic thermal inverse modeling for organic material decomposition

The prevalent use of organic materials in manufacturing is a fire safety concern, and motivates the need for predictive thermal decomposition models. A critical component of predictive modeling is numerical inference of kinetic parameters from bench scale data. Currently, an active area of computational pyrolysis research focuses on identifying efficient, robust methods for optimization. This paper demonstrates that kinetic parameter calibration problems can successfully be solved using classical gradient-based optimization. We explore calibration examples that exhibit characteristics of concern: high nonlinearity, high dimensionality, complicated schemes, overlapping reactions, noisy data, and poor initial guesses. The examples demonstrate that a simple, non-invasive change to the problem formulation can simultaneously avoid local minima, avoid computation of derivative matrices, achieve a computational efficiency speedup of 10x, and make optimization robust to perturbations of parameter components. Techniques from the mathematical optimization and inverse problem communities are employed. By re-examining gradient-based algorithms, we highlight opportunities to develop kinetic parameter calibration methods that should outperform current methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fidelity Analysis of Complex Large-Scale Simulation Models of PEs (MARS) in Future Power Grids

With the proliferation of power electronic (PE)-based resources in the electric grid, there have been numerous different kinds of simulation models developed and studied to understand their dynamic behavior. Study of PE-based resources using each simulation model has its own distinct advantages and disadvantages. Therefore it is very important to carefully select the appropriate model for the evaluation of the PE-based resources. In this paper, one such effort is made to analyze the different types of models in the case of a multi-port autonomous reconfigurable solar power plant (MARS). The MARS integrates a hybrid photovoltaic (PV)-energy storage system (ESS) plant to high-voltage direct current (HVdc) system and transmission alternating current (ac) grid. The dynamic models are evaluated under different test cases varying the short-circuit ratio (SCR) and control algorithms. Recommendations are provided on the equipment study needs based on the analysis completed.

Marthi, Phani Ratna Vanamali↗

Physics‐based iterative reconstruction for dual‐source and flying focal spot computed tomography

Purpose For single‐source helical Computed Tomography (CT), both Filtered‐Back Projection (FBP) and statistical iterative reconstruction have been investigated. However, for dual‐source CT with flying focal spot (DS‐FFS CT), a statistical iterative reconstruction that accurately models the scanner geometry and acquisition physics remains unknown to researchers. Therefore, our purpose is to present a novel physics‐based iterative reconstruction method for DS‐FFS CT and assess its image quality. Methods Our algorithm uses precise physics models to reconstruct from the native cone‐beam geometry and interleaved dual‐source helical trajectory of a DS‐FFS CT. To do so, we construct a noise physics model to represent data acquisition noise and a prior image model to represent image noise and texture. In addition, we design forward system models to compute the locations of deflected focal spots, the dimension, and sensitivity of voxels and detector units, as well as the length of intersection between x‐rays and voxels. The forward system models further represent the coordinated movement between the dual sources by computing their x‐ray coverage gaps and overlaps at an arbitrary helical pitch. With the above models, we reconstruct images by an advanced Consensus Equilibrium (CE) numerical method to compute the maximum a posteriori estimate to a joint optimization problem that simultaneously fits all models. Results We compared our reconstruction with Siemens ADMIRE, which is the clinical standard hybrid iterative reconstruction (IR) method for DS‐FFS CT, in terms of spatial resolution, noise profile, and image artifacts through both phantoms and clinical scan datasets. Experiments show that our reconstruction has a higher spatial resolution, with a Task‐Based Modulation Transfer Function (MTF task ) consistently higher than the clinical standard hybrid IR. In addition, our reconstruction shows a reduced magnitude of image undersampling artifacts than the clinical standard. Conclusions By modeling a precise geometry and avoiding data rebinning or interpolation, our physics‐based reconstruction achieves a higher spatial resolution and fewer image artifacts with smaller magnitude than the clinical standard hybrid IR.

Wang, Xiao↗

Topological analysis of X-ray CT data for the recognition and trending of subtle changes in microstructure under material aging

X-ray computed tomography (CT) is an established non-destructive tool for 3D imaging of multiphasic composites. Numerous applications of X-ray CT in medical diagnosis and materials characterization have been reported, many involving field-specific innovations in the imaging technology itself. Yet, quantitative summarization to link image features to properties of interest has been rare. Here we address this issue by employing state-of-the-art technics in scalar field topology for the summarization of X-ray CT images of an example biphasic system. By varying processing-parameters we create different microstructures, evolve them through accelerated thermal aging, CT-image them pre- and post-aged, and demonstrate the ability of our image summarization method to systematically track process- and age-related changes, which can often be very subtle. A novel aspect of the algorithm involves recognition over multiple resolution levels, which provides deeper insight into the pattern relationship between grain-like features and their neighbors. The method is general, adaptable to diverse image reconstruction methods and materials systems, and particularly useful in applications where practical constraints on the sample-size limits the reliable use of more complex models, e.g., convolutional neural networks.

36 MATERIALS SCIENCE↗

Direct Estimation of Parameters in ODE Models Using WENDy: Weak-Form Estimation of Nonlinear Dynamics

Abstract We introduce the Weak-form Estimation of Nonlinear Dynamics (WENDy) method for estimating model parameters for non-linear systems of ODEs. Without relying on any numerical differential equation solvers, WENDy computes accurate estimates and is robust to large (biologically relevant) levels of measurement noise. For low dimensional systems with modest amounts of data, WENDy is competitive with conventional forward solver-based nonlinear least squares methods in terms of speed and accuracy. For both higher dimensional systems and stiff systems, WENDy is typically both faster (often by orders of magnitude) and more accurate than forward solver-based approaches. The core mathematical idea involves an efficient conversion of the strong form representation of a model to its weak form, and then solving a regression problem to perform parameter inference. The core statistical idea rests on the Errors-In-Variables framework, which necessitates the use of the iteratively reweighted least squares algorithm. Further improvements are obtained by using orthonormal test functions, created from a set of $$C^{\infty }$$ C ∞ bump functions of varying support sizes.We demonstrate the high robustness and computational efficiency by applying WENDy to estimate parameters in some common models from population biology, neuroscience, and biochemistry, including logistic growth, Lotka-Volterra, FitzHugh-Nagumo, Hindmarsh-Rose, and a Protein Transduction Benchmark model. Software and code for reproducing the examples is available at https://github.com/MathBioCU/WENDy .

97 MATHEMATICS AND COMPUTING↗

Data-Driven Compositional Optimization in Misspecified Regimes

With a manifold growth in the scale and intricacy of systems, the challenges of parametric misspecification become pronounced. These concerns are further exacerbated in compositional settings, which emerge in problems complicated by modeling risk and robustness. In “Data-Driven Compositional Optimization in Misspecified Regimes,” the authors consider the resolution of compositional stochastic optimization problems, plagued by parametric misspecification. In considering settings where such misspecification may be resolved via a parallel learning process, the authors develop schemes that can contend with diverse forms of risk, dynamics, and nonconvexity. They provide asymptotic and rate guarantees for unaccelerated and accelerated schemes for convex, strongly convex, and nonconvex problems in a two-level regime with extensions to the multilevel setting. Surprisingly, the nonasymptotic rate guarantees show no degradation from the rate statements obtained in a correctly specified regime and the schemes achieve optimal (or near-optimal) sample complexities for general T-level strongly convex and nonconvex compositional problems.

Business & Economics↗

Hierarchical Bayesian Modeling for Cosmology: Can NPE reliably replace MCMC?

Hierarchical neural posterior estimation has its place Hierarchical Bayesian Modeling (HBM) combined with MCMC algorithms has been shown to provide more robust and accurate inference for real-world phenomena in which nature takes a nested form. However, MCMC-based inference can be computationally expensive, and its performance often suffers for complex posterior geometries. These costs are especially pertinent for HBM. Studies have recently demonstrated the potential for a flexible, expressive, and amortized hierarchical neural posterior estimator (HNPE) built on Normalizing Flows. These studies have mostly been performed on simple datasets, or they focus on a single parameter from each level of the hierarchy. A systematic study analyzing how both hierarchical methods compare for more complex and realistic datasets is necessary before applying HNPE for scientific measurements. Here, we re-explore the theory behind HNPE and conduct comparative numerical experiments of HNPE and MCMC-based HBM methods on real and synthetic data, including strong gravitational lensing simulations. In particular, we use a suite of diagnostics to show trade-offs in terms of accuracy, precision, time to train or sample, reproducibility, and the need for expert domain knowledge. Especially for higher dimensional and complex posteriors, HNPE is expected to drastically improve on time for inference, accuracy, and precision with an upfront training time cost.

Hur, Rachel [Chicago U.] (ORCID:000900089890445X)↗

Optimization and Prediction of Spectral Response of Metasurfaces Using Artificial Intelligence

Hot-electron generation has been a topic of intense research for decades for numerous applications ranging from photodetection and photochemistry to biosensing. Recently, the technique of hot-electron generation using non-radiative decay of surface plasmons excited by metallic nanoantennas, or meta-atoms, in a metasurface has attracted attention. These metasurfaces can be designed with thicknesses on the order of the hot-electron diffusion length. The plasmonic resonances of these ultrathin metasurfaces can be tailored by changing the shape and size of the meta-atoms. One of the fundamental mechanisms leading to generation of hot-electrons in such systems is optical absorption, therefore, optimization of absorption is a key step in enhancing the performance of any metasurface based hot-electron device. Here we utilized an artificial intelligence-based approach, the genetic algorithm, to optimize absorption spectra of plasmonic metasurfaces. Using genetic algorithm optimization strategies, we designed a polarization insensitive plasmonic metasurface with 90% absorption at 1550 nm that does not require an optically thick ground plane. We fabricated and optically characterized the metasurface and our experimental results agree with simulations. Finally, we present a convolutional neural network that can predict the absorption spectra of metasurfaces never seen by the network, thereby eliminating the need for computationally expensive simulations. Our results suggest a new direction for optimizing hot-electron based photodetectors and sensors.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Mild hybridisation of turboprop engine with high-power-density integrated electric drives

Here this paper shares with the aerospace community a case study of turboprop mild hybridisation using a recently developed integrated drive system in the University of Nottingham, UK, within the ACHIEVE project under EU H2020 CleanSky 2 program (project No. 737814). The developed drive system enables green taxiing of a turboprop aircraft while on the ground with its engine off, and as an electrical generator when the turboprop is in the air. The entire system is designed to be able to integrate within the power auxiliary gear box (PAGB) of a turboprop aircraft. Some of the key features of the developed system include a high-speed permanent magnet machine (up to 14,200rpm) with dual three-phase design, SiC-based high power density (11.8kW/L for the power converter, 35.3kW/L and 7.2kW/kg for the machine active parts), integrated cooling design for high-temperature operation (>130°C ambient temperature), fault tolerance consideration with dual channel operation capabilities and sensorless control for entire operational conditions. This paper is giving an overview of the design process of the electrical machine, power converters, and its cooling of the entire drive. Numerical analysis (FEM and CFD) and some experimental results are presented to demonstrate the effectiveness and the desired performance of the developed integrated drive system.

42 ENGINEERING↗

Nonlinear sparse Bayesian learning for physics-based models

This paper addresses the issue of overfitting while calibrating unknown parameters of over-parameterized physics-based models with noisy and incomplete observations. Here, a semi-analytical Bayesian framework of nonlinear sparse Bayesian learning (NSBL) is proposed to identify sparsity among model parameters during Bayesian inversion. NSBL offers significant advantages over machine learning algorithm of sparse Bayesian learning (SBL) for physics-based models, such as 1) the likelihood function or the posterior parameter distribution is not required to be Gaussian, and 2) prior parameter knowledge is incorporated into sparse learning (i.e. not all parameters are treated as questionable). NSBL employs the concept of automatic relevance determination (ARD) to facilitate sparsity among questionable parameters through parameterized prior distributions. The analytical tractability of NSBL is enabled by employing Gaussian ARD priors and by building a Gaussian mixture-model approximation of the posterior parameter distribution that excludes the contribution of ARD priors. Subsequently, type-II maximum likelihood is executed using Newton's method whereby the evidence and its gradient and Hessian information are computed in a semi-analytical fashion. We show numerically and analytically that SBL is a special case of NSBL for linear regression models. Subsequently, a linear regression example involving multimodality in both parameter posterior pdf and model evidence is considered to demonstrate the performance of NSBL in cases where SBL is inapplicable. Next, NSBL is applied to identify sparsity among the damping coefficients of a mass-spring-damper model of a shear building frame. These numerical studies demonstrate the robustness and efficiency of NSBL in alleviating overfitting during Bayesian inversion of nonlinear physics-based models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simultaneously improving accuracy and computational cost under parametric constraints in materials property prediction tasks

Abstract Modern data mining techniques using machine learning (ML) and deep learning (DL) algorithms have been shown to excel in the regression-based task of materials property prediction using various materials representations. In an attempt to improve the predictive performance of the deep neural network model, researchers have tried to add more layers as well as develop new architectural components to create sophisticated and deep neural network models that can aid in the training process and improve the predictive ability of the final model. However, usually, these modifications require a lot of computational resources, thereby further increasing the already large model training time, which is often not feasible, thereby limiting usage for most researchers. In this paper, we study and propose a deep neural network framework for regression-based problems comprising of fully connected layers that can work with any numerical vector-based materials representations as model input. We present a novel deep regression neural network, iBRNet, with branched skip connections and multiple schedulers, which can reduce the number of parameters used to construct the model, improve the accuracy, and decrease the training time of the predictive model. We perform the model training using composition-based numerical vectors representing the elemental fractions of the respective materials and compare their performance against other traditional ML and several known DL architectures. Using multiple datasets with varying data sizes for training and testing, We show that the proposed iBRNet models outperform the state-of-the-art ML and DL models for all data sizes. We also show that the branched structure and usage of multiple schedulers lead to fewer parameters and faster model training time with better convergence than other neural networks. Scientific contribution: The combination of multiple callback functions in deep neural networks minimizes training time and maximizes accuracy in a controlled computational environment with parametric constraints for the task of materials property prediction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗