Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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,639 records · Page 91

Multigrid Reduction in Time for Chaotic Dynamical Systems

As CPU clock speeds have stagnated and high performance computers continue to have ever higher core counts, increased parallelism is needed to take advantage of these new architectures. Traditional serial time-marching schemes can be a significant bottleneck, as many types of simulations require large numbers of time-steps which must be computed sequentially. Parallel-in-time schemes, such as the Multigrid Reduction in Time (MGRIT) method, remedy this by parallelizing across time-steps and have shown promising results for parabolic problems. However, chaotic problems have proved more difficult, since chaotic initial value problems (IVPs) are inherently ill-conditioned. MGRIT relies on a hierarchy of successively coarser time-grids to iteratively correct the solution on the finest time-grid, but due to the nature of chaotic systems, small inaccuracies on the coarser levels can be greatly magnified and lead to poor coarse-grid corrections. Here we introduce a modified MGRIT algorithm based on an existing quadratically converging nonlinear extension to the multigrid Full Approximation Scheme (FAS), as well as a novel time-coarsening scheme. Together, these approaches better capture long-term chaotic behavior on coarse-grids and greatly improve convergence of MGRIT for chaotic IVPs. Further, we introduce a novel low-memory variant of the algorithm for solving chaotic PDEs with MGRIT which not only solves the IVP, but also provides estimates for the unstable Lyapunov vectors of the system. Finally, we provide supporting numerical results for the Lorenz system and demonstrate parallel speedup for the chaotic Kuramoto–Sivashinsky PDE over a significantly longer time-domain than in previous works.

97 MATHEMATICS AND COMPUTING↗

Algorithm for Computation of Electromagnetic Fields of An Accelerated Short Bunch Inside a Rectangular Chamber

We discuss the feasibility of an application of an implicit finite-difference approximation to calculate the fields of a relativistic bunch moving with no restriction inside a vacuum chamber. We assume that a bunch trajectory is not straight but is inside a vacuum chamber or its branch. The bunch can be deflected by the fields of bending magnets. The bunch can be short enough to produce coherent synchrotron radiation (CSR). Accelerator physicists believe that electromagnetic phenomena of charged beams are governed by Maxwell's equations together with Newton's equations for particle dynamics. To understand the behavior of the beams and radiated fields we just need to find a solution to these equations for the case, which can fully describe the real accelerator environment. So, at first we make a model, which contains all the necessary components, but at the same time can be easily 'inserts' into the equations. Sometimes, it is possible to find analytical solutions, but usually they are only work for one-dimensional cases and rarer for two-dimension cases. To find a solution in general we may transform the equations into a equivalent finite-difference form and solve them using computers. We can find a lot of finite-difference schemes, which approximate Maxwell's equations since the first one that was published in 1966. Most of them are so called explicit schemes. That means that the value of the field at the new time step is calculated only by the field values at the previous time step. Stability conditions for these schemes do not allow a time step to be greater than or equal to a space (mesh) step. This limitation brings an additional troublesome effect for short wavelengths compared a mesh step. We state that this effect works like a frequency dispersion media, which is 'hidden' in the finite-difference equation.

43 PARTICLE ACCELERATORS↗

On a finite element CFD algorithm for compressible, viscous and turbulent aerodynamic flows

This paper develops and analyses individual construction aspects of an efficient and accurate finite element algorithm for prediction of viscous and turbulent flow fields of impact in aerodynamics. The theoretical construction employs a Taylor weak statement (TWS) for coincident embedding of stability mechanisms within a classic Galerkin finite element formulation of semidiscrete approximation error orthogonalization. A wide variety of the stabilizing mechanisms of independently derived CFD algorithms are contained within the TWS theory. An implicit construction that meets the requirement of efficient convergence to steady state is developed. The theoretical asymptotic error estimates of the TWS finite element algorithm for supersonic and viscous boundary layer flows are verified. Application to a three-dimensional turbulent flow is cited.

Baker, A. J.↗

SeaWiFS technical report series. Volume 4: An analysis of GAC sampling algorithms. A case study

The Sea-viewing Wide Field-of-view Sensor (SeaWiFS) instrument will sample at approximately a 1 km resolution at nadir which will be broadcast for reception by realtime ground stations. However, the global data set will be comprised of coarser four kilometer data which will be recorded and broadcast to the SeaWiFS Project for processing. Several algorithms for degrading the one kilometer data to four kilometer data are examined using imagery from the Coastal Zone Color Scanner (CZCS) in an effort to determine which algorithm would best preserve the statistical characteristics of the derived products generated from the one kilometer data. Of the algorithms tested, subsampling based on a fixed pixel within a 4 x 4 pixel array is judged to yield the most consistent results when compared to the one kilometer data products.

Yeh, Eueng-Nan↗

Model-based and Model-free Designs for an Extended Continuous-time LQR with Exogenous Inputs

We present an extended linear quadratic regulator (LQR) design for continuous-time linear time-invariant (LTI) systems in the presence of exogenous inputs. We first propose a model-based solution with cost minimization guarantees for states and inputs using dynamic programming (DP). The control law consists of a combination of the optimal state feedback and an additional optimal term dependent on the exogenous inputs. The control gains for the two components are obtained by solving a set of matrix differential equations. We provide these solutions for both finite horizons and steady-state cases. In the second part of the paper, we formulate a reinforcement learning (RL) based algorithm which does not need any model information except the input matrix, and can compute an approximate steady-state LQR gain using measurements of the states, the control inputs, and the exogenous inputs. Both model-based and data-driven optimal control algorithms are tested with a numerical example under different exogenous inputs showcasing the effectiveness of the designs.

Mukherjee, Sayak↗

Stacking sequence optimization of simply supported laminates with stability and strain constraints

An integer programming formulation for the design of symmetric and balanced rectangular composite laminates with simply supported boundary conditions subject to buckling and strain constraints is presented. The design variables that define the stacking sequence of the laminate are ply-identity zero-one integers. The buckling constraint is linear in terms of the ply-identity design variables, but strains are nonlinear functions of these variables. A linear approximation is developed for the strain constraints so that the problem can be solved by sequential linearization using the branch and bound algorithm. Examples of graphite-epoxy plates under biaxial compression are presented. Optimum stacking sequences obtained using the linear approximation are compared with global optimum designs obtained using a genetic search procedure.

Nagendra, S.↗

Approximate estimation for systems with quantized data.

Estimation of the state of a nonlinear discrete-time system using quantized data is considered. An exact solution for the maximum likelihood estimate is expressed as the solution of a nonlinear two-point boundary-value problem. Approximate recursive solutions for both the maximum likelihood and the conditional-mean estimates are obtained. The results of Monte-Carlo simulations are presented in which the performance of these two algorithms is compared with that of a Kalman filter in which the quantization error is approximated by white noise.-

Clements, K. A.↗

Performance of biologically inspired algorithms tuned on TiO 2 nanoparticle benchmark system

Biologically inspired optimization algorithms (BIOA), such as particle swarm optimization (PSO) and differential evolution (DE), are often applied to a specific problem with the tacit assumptions that each algorithm will have a unique set of “ideal” tuning parameters that provide “best” performance, and that, once tuned, two different optimization algorithms ought to exhibit distinct performance. This work tests those assumptions by systematically comparing PSO and DE applied to identify stable and metastable configurations of a benchmark system, a titania dimer Ti 2 O 4 , whose energy is described by a modified Matsui-Akaogi pairwise potential. The hypotheses (H) are formally expressed as: (H1) for both PSO and DE there exists a unique, optimal set of tuning parameters that maximize its performance on a given problem; (H2) when running two different BIOAs, one algorithm must demonstrate superior performance over the other. By identifying and studying an approximate Pareto-optimal set of tuning parameters for DE and PSO, H1 is shown to be strictly false for DE, and tentatively false for PSO, while H2 is shown to be false with respect to certain statistics. Here, we further investigate the correlations between key tuning parameters and algorithm performance. Our conclusion may be implemented to further optimize and develop BIOAs applied to materials systems.

36 MATERIALS SCIENCE↗

TU-G-204-09: The Effects of Reduced- Dose Lung Cancer Screening CT On Lung Nodule Detection Using a CAD Algorithm

Purpose: While Lung Cancer Screening CT is being performed at low doses, the purpose of this study was to investigate the effects of further reducing dose on the performance of a CAD nodule-detection algorithm. Methods: We selected 50 cases from our local database of National Lung Screening Trial (NLST) patients for which we had both the image series and the raw CT data from the original scans. All scans were acquired with fixed mAs (25 for standard-sized patients, 40 for large patients) on a 64-slice scanner (Sensation 64, Siemens Healthcare). All images were reconstructed with 1-mm slice thickness, B50 kernel. 10 of the cases had at least one nodule reported on the NLST reader forms. Based on a previously-published technique, we added noise to the raw data to simulate reduced-dose versions of each case at 50% and 25% of the original NLST dose (i.e. approximately 1.0 and 0.5 mGy CTDIvol). For each case at each dose level, the CAD detection algorithm was run and nodules greater than 4 mm in diameter were reported. These CAD results were compared to “truth”, defined as the approximate nodule centroids from the NLST reports. Subject-level mean sensitivities and false-positive rates were calculated for each dose level. Results: The mean sensitivities of the CAD algorithm were 35% at the original dose, 20% at 50% dose, and 42.5% at 25% dose. The false-positive rates, in decreasing-dose order, were 3.7, 2.9, and 10 per case. In certain cases, particularly in larger patients, there were severe photon-starvation artifacts, especially in the apical region due to the high-attenuating shoulders. Conclusion: The detection task was challenging for the CAD algorithm at all dose levels, including the original NLST dose. However, the false-positive rate at 25% dose approximately tripled, suggesting a loss of CAD robustness somewhere between 0.5 and 1.0 mGy. NCI grant U01 CA181156 (Quantitative Imaging Network); Tobacco Related Disease Research Project grant 22RT-0131.

60 APPLIED LIFE SCIENCES↗

Automatic Calibration and Health Monitoring of Infrastructure Sensors

Smart transportation infrastructure relies on networks of heterogeneous sensors - cameras, radars, and lidars - continuously monitoring traffic conditions. However, executing the initial spatial calibration of multiple sensors and the subsequent health monitoring presents significant operational challenges. Environmental factors, mechanical vibrations, and gradual drift cause spatial misalignment, degrading fusion performance and tracking accuracy. Traditional calibration approaches require manual intervention with specialized targets or survey equipment, resulting in service interruptions and high maintenance costs. This work presents an automated framework for initial calibration and continuous health monitoring without human intervention or service disruption. Our approach addresses two critical problems: (1) detecting when sensors become miscalibrated during operation, and (2) automatically re-establishing spatial alignment using only operational traffic data. The health monitoring component analyzes measurement innovations - differences between sensor observations and predicted object states - to detect systematic biases indicative of calibration drift. By computing bias magnitude, directional consistency, and rejection rates, the system identifies miscalibrations as small as 0.5 meters. Unlike traditional methods requiring known calibration targets, our diagnostic operates continuously on live traffic observations, enabling early detection before fusion quality degrades. The automatic recalibration algorithm leverages overlapping sensor fields-of-view and temporal correlation of vehicle observations. Using graph-based optimization, the system automatically discovers which sensor pairs observe common regions, estimates pairwise spatial transformations using RANSAC-based robust estimation, and jointly optimizes all sensor poses through bundle adjustment. The framework handles practical deployment challenges, including different sensor sampling rates (1-10 Hz), varying installation positions, unknown orientations, and limited overlap regions (>10%). When approximate sensor positions are available from installation surveys (+/-1m accuracy), the algorithm additionally estimates sensor orientations, refining both position and rotation to sub-meter and sub-degree accuracy. We validate the framework on multi-hour traffic datasets from six heterogeneous sensors with sampling rates ranging from 1 Hz to 10 Hz. Results demonstrate successful calibration even with sparse overlap (<20%) and automatic detection of miscalibrations exceeding 0.8 meters. This work enables a "deploy-and-forget" sensor infrastructure that maintains calibration autonomously, reducing maintenance costs while improving tracking accuracy. The techniques generalize beyond transportation to any multi-sensor monitoring application requiring robust spatial alignment, including smart cities, industrial monitoring, and surveillance systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimization performance, fidelity, and cost: SIAM VQE

This dataset contains files storing results from classically-simulated quantum subroutines within a dynamical mean-field theory workflow, and jupyter notebooks processing the data in these files to generate plots. The files store: (1) Results from variational quantum eigensolver (VQE) simulations searching for optimal parameters allowing parametrized quantum circuits to prepare approximations to ground states of different Anderson impurity models (AIMs) (2) Results from simulations of a quantum Lanczos algorithm (QLA) estimating the Lanczos coefficients defining the continued-fraction representation of an (AIM) Green’s function Description: Any file named vqe_gs_results* stores approximations to the ground state and energy of a given AIM estimated using three different methods: (1) Numerical diagonalization (2) Ideal VQE simulation (3) VQE simulation with sampling noise For each VQE simulations metadata about the optimization (optimization results plus number of quantum circuits that would have been executed on real hardware) is also stored. Any file named qla_dos_results* estimations for the Lanczos coefficients defining the Green’s function of an AIM. The stored estimations are achieved using different methods: (1) Numerical Lanczos algorithm from initial states obtained from numerical diagonalization (2) Simulated quantum Lanczos algorithm from initial states prepared from parametrized quantum circuits yielded by corresponding ideal and noisy VQE subroutines. The dataset is used and described in M. Karabin et al., "Quantum solver for single-impurity Anderson models with particle-hole symmetry", Phys. Rev. Research 8, 033066 (2026). DOI: https://doi.org/10.1103/7ys3-tl4l

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Relative entropy minimization over Hilbert spaces via Robbins-Monro

One way of getting insight into non-Gaussian measures is to first obtain good Gaussian approximations. These best fit Gaussians can then provide a sense of the mean and variance of the distribution of interest. They can also be used to accelerate sampling algorithms. This begs the question of how one should measure optimality, and how to then obtain this optimal approximation. Here, we consider the problem of minimizing the distance between a family of Gaussians and the target measure with respect to relative entropy, or Kullback-Leibler divergence. As we are interested in applications in the infinite dimensional setting, it is desirable to have convergent algorithms that are well posed on abstract Hilbert spaces. We examine this minimization problem by seeking roots of the first variation of relative entropy, taken with respect to the mean of the Gaussian, leaving the covariance fixed. We prove the convergence of Robbins-Monro type root finding algorithms in this context, highlighting the assumptions necessary for convergence to relative entropy minimizers. Numerical examples are included to illustrate the algorithms.

97 MATHEMATICS AND COMPUTING↗

Formulation and implementation of nonstationary adaptive estimation algorithm with applications to air-data reconstruction

The dynamics model and data sources used to perform air-data reconstruction are discussed, as well as the Kalman filter. The need for adaptive determination of the noise statistics of the process is indicated. The filter innovations are presented as a means of developing the adaptive criterion, which is based on the true mean and covariance of the filter innovations. A method for the numerical approximation of the mean and covariance of the filter innovations is presented. The algorithm as developed is applied to air-data reconstruction for the space shuttle, and data obtained from the third landing are presented. To verify the performance of the adaptive algorithm, the reconstruction is also performed using a constant covariance Kalman filter. The results of the reconstructions are compared, and the adaptive algorithm exhibits better performance.

Whitmore, S. A.↗

Formulation and implementation of nonstationary adaptive estimation algorithm with applications to air-data reconstruction

The dynamics model and data sources used to perform air-data reconstruction are discussed, as well as the Kalman filter. The need for adaptive determination of the noise statistics of the process is indicated. The filter innovations are presented as a means of developing the adaptive criterion, which is based on the true mean and covariance of the filter innovations. A method for the numerical approximation of the mean and covariance of the filter innovations is presented. The algorithm as developed is applied to air-data reconstruction for the Space Shuttle, and data obtained from the third landing are presented. To verify the performance of the adaptive algorithm, the reconstruction is also performed using a constant covariance Kalman filter. The results of the reconstructions are compared, and the adaptive algorithm exhibits better performance.

Whitmore, S. A.↗

Small bimetallic clusters Agn-1M (M = Au, Co, Cu, Ni, Pd, Pt; n = 3, 9, 15): Density functional theory and genetic algorithm

We investigated the effect of size and composition on the properties of bimetallic nanoclusters. The geometric structures, stabilities, and electronic properties of size-selected Ag n-1 M (M = Au, Co, Cu, Ni, Pd, Pt; n = 3, 9, 15) bimetallic nanoclusters are systematically analyzed using spin-polarized density functional theory (DFT) within the generalized gradient approximation (GGA). We determine the most stable geometries for these clusters using a genetic algorithm (GA) in combination with DFT. Our results show that doping pure silver clusters with an M atom (transition metal), referred to as a “guest atom”, increases the stability as compared to pure Ag n (n = 3, 9, 15) clusters. The results for various properties including formation energy per atom, electronic structure, magnetic moments, and vibrational density of states (VDOS) are evaluated as a function of both size and composition of the system. The adsorption of selected bimetallic clusters on hydroxylated alumina substrate shows weak binding and minor changes in geometric properties except for Ag 8 Pt.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Effect of grid aspect ratio on convergence

The effects of high-aspect-ratio grids on algorithm convergence are considered by means of vector stability theory and computational experiments. The results indicate that approximately factored implicit schemes experience convergence deterioration because of nonoptimum local time-stepping procedures and increased need for viscous preconditioning. Based on this insight, an enhanced algorithm is devised using improved selection of the local time step, appropriate definition of the viscous preconditioning matrix, and proper implementation of the boundary conditions. The new algorithm provides uniformly efficient convergence at all aspect ratios for both Euler and Navier-Stokes computations for a variety of test problems.

Buelow, P. E. O.↗

nu-Anomica: A Fast Support Vector Based Novelty Detection Technique

In this paper we propose nu-Anomica, a novel anomaly detection technique that can be trained on huge data sets with much reduced running time compared to the benchmark one-class Support Vector Machines algorithm. In -Anomica, the idea is to train the machine such that it can provide a close approximation to the exact decision plane using fewer training points and without losing much of the generalization performance of the classical approach. We have tested the proposed algorithm on a variety of continuous data sets under different conditions. We show that under all test conditions the developed procedure closely preserves the accuracy of standard one-class Support Vector Machines while reducing both the training time and the test time by 5 - 20 times.

Das, Santanu↗

GOES-17 Magnetometer On-Orbit Calibration Design and Results

The Geostationary Operational Environmental Satellite-R (GOES-R) is a series of four NOAA weather satellites. Each spacecraft flies a Magnetometer instrument which includes two boom mounted fluxgate sensors located 6.3 and 8.5 meters from the spacecraft. Sensor readings are corrupted by both internal (bias and scale factor) and external (spacecraft emitted fields and misalignments) error sources. In order to estimate the bias, an on-orbit calibration is performed, slewing the spacecraft about multiple axes and then performing a fit of the data to determine zero offset and misalignment terms. The first satellite in the series, GOES-16 was launched in November 2016. Its magnetometer calibration maneuver was found to be inadequate providing insufficient rotation about orthogonal axes. The uncertainty in the estimated biases was found to be in the 3-5 nanotesla range, exceeding the magnetometer accuracy requirement of 1.0 nanotesla. Based on lessons learned, the maneuver was redesigned to provide multiple 360 degree rotations about two orthogonal axes, providing optimal visibility into bias and misalignment. Varying ambient fields over the duration of the calibration maneuvers, corrupts the ability to accurately determine parameters of interest. To address this issue, rather than assuming a constant field for the duration of the maneuver, a non-linear least squares filter was employed that uses a series of spline functions to better fit the ambient field. The number of splines can be varied to minimize the least squares filter residuals. Simulations were performed using 360 days of GOES-16 data to bound the uncertainty in the biases for given residuals of the fit to the ambient field. Following the launch of the second satellite in the series, GOES-17 in March 2018, the new calibration maneuver and enhanced bias estimation algorithm were exercised twice. Based on the residuals of the fit, the uncertainty of the estimated zero offset was reduced by an order of magnitude from 3-5 nanotesla to approximately 0.4 nanotesla per axis. This paper provides details of the maneuver design and the innovative algorithm used to estimate the GOES-17 biases and misalignments.

GOES-17↗