Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast algorithm”

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 757 records · Page 42
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A fast Fourier transform-based solver for elastic micropolar composites

This work presents a spectral micromechanical formulation for obtaining the full-field and homogenized response of elastic micropolar composites. The algorithm relies on a coupled set of convolution integral equations for the micropolar strains, where periodic Green’s operators associated with a linear homogeneous reference medium are convolved with functions of the Cauchy and couple stress fields that encode the material’s heterogeneity, as well as any potential material nonlinearity. Such convolution integral equations take an algebraic form in the reciprocal Fourier space that can be solved iteratively. In this vein, the fast Fourier transform (FFT) algorithm is leveraged to accelerate the numerical solution, resulting in a mesh-free formulation in which the periodic unit cell representing the heterogeneous material can be discretized by a regular grid of pixels in two dimensions (or voxels in three dimensions). For verification, the numerical solutions obtained with the micropolar FFT solver are compared with analytical solutions for a matrix with a dilute circular inclusion subjected to plane strain loading. The developed computational framework is then used to study length-scale effects and effective (micropolar) moduli of composites with various topological configurations.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1975

A hybrid classifier using the parallelepiped and Bayesian techniques

A versatile classification scheme is developed which uses the best features of the parallelepiped algorithm and the Bayesian maximum likelihood algorithm. The parallelepiped technique has the advantage of being very fast, especially when implemented into a table look-up scheme; its disadvantage is its inability to distinguish and classify spectral signatures which are similar in nature. This disadvantage is eliminated by the Bayesian technique which is capable of distinguishing subtle differences very well. The hybrid algorithm developed reduces computer time by as much as 90%. A two- and n-dimensional description of the hybrid classifier is given.

Addington, J. D.↗
NASA NTRS2022

Effective Uncertainty Quantification for Multi-Angle Polarimetric Aerosol Remote Sensing Over Ocean

Multi-angle polarimetric (MAP) measurements can enable detailed characterization of aerosol microphysical and optical properties and improve atmospheric correction in ocean color remote sensing. Advanced retrieval algorithms have been developed to obtain multiple geophysical parameters in the atmosphere–ocean system. Theoretical pixel-wise retrieval uncertainties based on error propagation have been used to quantify retrieval performance and determine the quality of data products. However, standard error propagation techniques in high-dimensional retrievals may not always represent true retrieval errors well due to issues such as local minima and the nonlinear dependence of the forward model on the retrieved parameters near the solution. In this work, we analyze these theoretical uncertainty estimates and validate them using a flexible Monte Carlo approach. The Fast Multi-Angular Polarimetric Ocean coLor (FastMAPOL) retrieval algorithm, based on efficient neural network forward models, is used to conduct the retrievals and uncertainty quantification on both synthetic HARP2 (Hyper-Angular Rainbow Polarimeter 2) and AirHARP (airborne version of HARP2) datasets. In addition, for practical application of the uncertainty evaluation technique in operational data processing, we use the automatic differentiation method to calculate derivatives analytically based on the neural network models. Both the speed and accuracy associated with uncertainty quantification for MAP retrievals are addressed in this study. Pixel-wise retrieval uncertainties are further evaluated for the real AirHARP field campaign data. The uncertainty quantification methods and results can be used to evaluate the quality of data products, as well as guide MAP algorithm development for current and future satellite systems such as NASA’s Plankton, Aerosol, Cloud, ocean Ecosystem (PACE) mission.

PACE↗
NASA NTRS1988

High-dynamic GPS tracking

The results of comparing four different frequency estimation schemes in the presence of high dynamics and low carrier-to-noise ratios are given. The comparison is based on measured data from a hardware demonstration. The tested algorithms include a digital phase-locked loop, a cross-product automatic frequency tracking loop, and extended Kalman filter, and finally, a fast Fourier transformation-aided cross-product frequency tracking loop. The tracking algorithms are compared on their frequency error performance and their ability to maintain lock during severe maneuvers at various carrier-to-noise ratios. The measured results are shown to agree with simulation results carried out and reported previously.

Hinedi, S.↗
DOE OSTI2020

Performance and Feature Improvements in Parareal-based Power System Dynamic Simulation

In recent years, a novel Parareal-based approach has been developed for fast transient simulations of large power system interconnections. Parareal belongs to the class of Parallel-in-time algorithms for solution of systems of differential-algebraic equations in parallel over an interval of time. The selection of a reasonably fast and accurate coarse solution is crucial to improve the performance of Parareal algorithm. Semi-analytical solution methods are one promising approach to achieve this goal. They have been investigated, and some preliminary results are presented here. In addition, Parareal-based simulator has been expanded to enable co-simulation with OpenDSS, a widely used open-source distribution system simulator. Preserving the parallel nature of the Parareal approach and taking advantage of the parallel capabilities of the latest versions of OpenDSS, each distribution system can be solved in their entirety on different processors in parallel within the main Parareal simulator. This paper also presents the structure of the transmission and distribution co-simulation and some results with different dynamic models of inverter-based resources in the distribution systems.

Park, Byungkwon↗
NASA NTRS2000

Real-Time Visualization of Tissue Ischemia

A real-time display of tissue ischemia which comprises three CCD video cameras, each with a narrow bandwidth filter at the correct wavelength is discussed. The cameras simultaneously view an area of tissue suspected of having ischemic areas through beamsplitters. The output from each camera is adjusted to give the correct signal intensity for combining with, the others into an image for display. If necessary a digital signal processor (DSP) can implement algorithms for image enhancement prior to display. Current DSP engines are fast enough to give real-time display. Measurement at three, wavelengths, combined into a real-time Red-Green-Blue (RGB) video display with a digital signal processing (DSP) board to implement image algorithms, provides direct visualization of ischemic areas.

Bearman, Gregory H.↗
NASA NTRS1989

Analysis of whisker-toughened ceramic components - A design engineer's viewpoint

The analysis of components fabricated from whisker-toughened ceramic matrix composites requires a departure from the 'factor-of-safety' design philosophy prevalent in the design of metallic structural component, which are more tolerant of flaws. A public-domain computer algorithm has been developed which, in conjunction with a general-purposed FEM program, can predict the fast-fracture reliability of a structural component under multiaxial loading conditions. The present version of the algorithm, designated 'Toughened Ceramics Analysis and Reliability Evaluation of Structures', accounts for material symmetry imposed by whisker orientation; the processes of crack deflection and crack pinning are also addressed.

Duffy, Stephen F.↗
NASA NTRS1978

A fast complex integer convolution using a hybrid transform

It is shown that the Winograd transform can be combined with a complex integer transform over the Galois field GF(q-squared) to yield a new algorithm for computing the discrete cyclic convolution of complex number points. By this means a fast method for accurately computing the cyclic convolution of a sequence of complex numbers for long convolution lengths can be obtained. This new hybrid algorithm requires fewer multiplications than previous algorithms.

Reed, I. S.↗
DOE OSTI2024

A Solution Method for the Filtered Lifting Line Theory

The filtered lifting line theory presents a continuous form of the inviscid momentum equations of flow over a lifting device, such as a wing or rotor blade, using body forces without mathematical singularities. This theory is also consistent with an actuator line representation of a lifting device. In this work, we present a reformulation of the equations in terms of the local flow angle along the line, which allows solving the stand-alone equations using multivariate root-finding algorithms. This approach can be used to obtain a fast, computationally inexpensive solution of the loading distribution along a wing without the need to perform computational fluid dynamic simulations. We study the requirements in terms of resolution in the spanwise direction and establish the criteria for spacing and minimum amount of points required along the blade to obtain converged solutions. The solutions are compared to results from large-eddy simulations, and we observed excellent agreement with less than a percent difference in quantities along the blade between the methods.

17 WIND ENERGY↗
NASA NTRS1992

Parallel solver for trajectory optimization search directions

A key algorithmic element of a real-time trajectory optimization hardware/software implementation is presented, the search step solver. This is one piece of an algorithm whose overall goal is to make nonlinear trajectory optimization fast enough to provide real-time commands during guidance of a vehicle such as an aeromaneuvering orbiter or the National Aerospace Plane. Many methods of nonlinear programming require the solution of a quadratic program (QP) at each iteration to determine the search step. In the trajectory optimization case, the QP has a special dynamic programming structure. The algorithm exploits this special structure with a divide- and conquer type of parallel implementation. The algorithm solves a (p.N)-stage problem on N processors in O(p + log2 N) operations. The algorithm yields a factor of 8 speed-up over the fastest known serial algorithm when solving a 1024-stage test problem on 32 processors.

Psiaki, M. L.↗
DOE OSTI2024

Multiparticle cumulant mapping for Coulomb explosion imaging: Calculations and algorithm

We present a versatile cumulant mapping algorithm for analyzing correlated particle emission, offering insights into complex electronic and nuclear dynamics. Recently, we have demonstrated the use of cumulant mapping to extract information-rich correlations between the momenta of multiple fragments produced in Coulomb explosion imaging experiments [C. Cheng et al., Phys. Rev. Lett. 130, 093001 (2023)]. We define cumulant mapping in terms of histograms, enabling fast computation of linear (additive) observables. However, applying the same algorithm to nonlinear (nonadditive) observables poses challenges, as the computation time of conventional estimators scales nonlinearly with data size. To overcome this, we develop estimators and an accompanying algorithm to enable computationally efficient estimation of the cumulant of interest. Comparisons of computation times and signal-to-noise ratios reveal the superior performance of our approach. This method is demonstrated on the (D+, D+, C+, O+) dissociation channel of CD 2 ⁢O 4+ produced in a strong-field ionization experiment. Additionally, Poisson statistics are used to simulate the two methods and provide insights into the efficiency of our algorithm. The proposed methodology unlocks efficient computation of cumulant mapping for a broader range of complex systems and observables, such as the laser pulse dependence of ionization dynamics.

74 ATOMIC AND MOLECULAR PHYSICS↗
NASA NTRS1978

Reduction of matrix wavefront for NASTRAN

The three grid point resequencing algorithms most often run by NASTRAN users are compared for their ability to reduce matrix root-mean-square (rms) wavefront, which is the most critical parameter in determining matrix decomposition time in NASTRAN. The three algorithms are Cuthill-McKee (CM), Gibbs-Poole-Stockmeyer (GPS), and Levy. The first two (CM and GPS) are in the BANDIT program, and the Levy algorithm is in WAVEFRONT. Results are presented for a diversified collection of 30 test problems ranging in size from 59 to 2680 nodes. It is concluded that GPS is exceptionally fast and, for the conditions under which the test was made, the algorithm best able to reduce rms wavefront consistently well.

Everstine, G. C.↗
NASA NTRS2011

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗
DOE OSTI2022

Developing a Consistent Travel-Time Framework for Comparing Three-Dimensional Velocity Models for Seismic Location Accuracy

Abstract Location algorithms have historically relied on simple, one-dimensional (1D) velocity models for fast seismic event locations. 1D models are generally used as travel-time lookup tables, one for each seismic phase, with travel-times pre-calculated for event distance and depth. These travel-time lookup tables are extremely fast to use and this fast computational speed makes them the preferred type of velocity model for operational needs. Higher-dimensional (i.e., three-dimensional—3D) seismic velocity models are becoming readily available and provide more accurate event locations over 1D models. The computational requirements of these 3D models tend to make their operational use prohibitive. Additionally, comparing location accuracy for 3D seismic velocity models tends to be problematic, as each model is determined using different ray-tracing algorithms. Attempting to use a different algorithm than the one used to develop a model usually results in poor travel-time prediction. We demonstrate and test a framework to create first-P and first-S 3D travel-time correction surfaces using an open-source framework ( PCalc + GeoTess , https://www.sandia.gov/salsa3d/software/geotess ) that easily stores 3D travel-time and uncertainty data. This framework produces fast travel-time and uncertainty predictions and overcomes the ray-tracing algorithm hurdle because the lookup tables can be generated using the exact ray-tracing algorithm that is preferred for a model.

3D velocity models↗
DOE OSTI2026

A Pulsar-Inspired Timing Framework for Power System: Optimization and Performance Evaluation

Due to their excellent stability, neutron pulsar stars are considered promising candidate timing sources for power system applications. However, the complexity of pulsar signals necessitates advanced processing algorithms to provide accurate timing references. This paper presents the foundational framework for pulsar signal processing, serving as the basis for further optimization. To enhance the timing accuracy and computation efficiency in pulsar period searches, three algorithms are proposed as the initial optimization step: wavelet de-noising, fast folding, and cross-correlation for profile evaluation. Wavelet de-noising improves signal-to-noise ratio (SNR) by 36%–70%. Fast folding reduces computation time from hundreds of seconds to mere milliseconds. Cross-correlation works better than traditional SNR-based methods by effectively identifying the optimal period. The performance of the proposed algorithms is evaluated using observation data from telescopes. Together, these algorithms significantly improve pulsar timing performance, reducing the error of the Pulse Per Second (PPS) signal from hundreds to tens of microseconds.

Wu, Ori [ORNL] (ORCID:0000000326723410)↗
NASA NTRS1990

A star pattern recognition algorithm for autonomous attitude determination

The star-pattern recognition algorithm presented allows the advanced Full-sky Autonomous Star Tracker (FAST) device, such as the projected ASTROS II system of the Mariner Mark II planetary spacecraft, to reliably ascertain attitude about all three axes. An ASTROS II-based FAST, possessing an 11.5 x 11.5 deg field of view and 8-arcsec accuracy, can when integrated with an all-sky data base of 4100 guide stars determine its attitude in about 1 sec, with a success rate close to 100 percent. The present recognition algorithm can also be used for automating the acquisition of celestial targets by astronomy telescopes, autonomously updating the attitude of gyro-based attitude control systems, and automating ground-based attitude reconstruction.

Van Bezooijen, R. W. H.↗
DOE OSTI2020

Computational thermomechanics for crystalline rock. Part II: Chemo-damage-plasticity and healing in strongly anisotropic polycrystals

We present a thermal–mechanical–chemical-phase field model that captures the multi-physical coupling effects of precipitation creeping, crystal plasticity, anisotropic fracture, and crack healing in polycrystalline rock at various temperature and strain-rate regimes. This model is solved via a fast Fourier transfer solver with an operator-split algorithm to update displacement, temperature and phase field, and chemical concentration incrementally. In nuclear waste disposal in salt formation, brine inside the crystal salt may migrate along the grain boundary and cracks due to the gradient of interfacial energy and pressure. This migration has a significant implication on the permeability evolution, creep deformation, and crack healing within rock salt but is difficult to incorporate implicitly via effective medium theories compared with computational homogenization. As such, we introduce a thermodynamic framework and a corresponding computational implementation that explicitly captures the brine diffusion along the grain boundary and crack at the grain scale. Meanwhile, the anisotropic fracture and healing are captured via a high-order phase field that represents the regularized crack region in which a newly derived non-monotonic driving force is used to capture the fracture and healing due to the solution–precipitation. Numerical examples are presented to demonstrate the capacity of the thermodynamic framework to capture the multiphysics material behaviors of rock salt.

42 ENGINEERING↗