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 163 records · Page 9

A fast implicit upwind solution algorithm for three-dimensional unstructured dynamic meshes

A fast implicit upwind algorithm for the solution of the time-dependent Euler equations is presented for aerodynamic analysis involving unstructured dynamic meshes. The spatial discretization of the scheme is based on the upwind approach of Roe, referred to as flux-difference splitting (FDS). The FDS approach is naturally dissipative and captures shock waves and contact discontinuities sharply. The temporal discretization of the scheme involves an implicit time-integration using a two-sweep Gauss-Seidel relaxation procedure. The procedure is computationally efficient for either steady or unsteady flow problems. A detailed description is given of the implicit upwind solution algorithm along with results which assess the capability. The results are presented for the NACA 0012 airfoil and for the Boeing 747 aircraft. The 747 geometry includes the fuselage, wing, horizontal and vertical tails, under-wing pylons, and flow-through engine nacelles. Euler solutions for the 747 aircraft on an unstructured tetrahedral mesh containing approximately 100,000 cells were obtained to engineering accuracy in less than one hour CPU time on a Cray-2 computer.

Batina, John T.↗

A fast implicit upwind solution algorithm for three-dimensional unstructured dynamic meshes

A fast implicit upwind algorithm for the solution of the time-dependent Euler equations is presented for aerodynamic analysis involving unstructured dynamic meshes. The spatial discretization of the scheme is based on the upwind approach of Roe, referred to as flux-difference splitting (FDS). The FDS approach is naturally dissipative and captures shock waves and contact discontinuities sharply. The temporal discretization of the scheme involves an implicit time-integration using a two-sweep Gauss-Seidel relaxation procedure. The procedure is computationally efficient for either steady or unsteady flow problems. A detailed description is given of the implicit upwind solution algorithm along with results which assess the capability. The results are presented for the NACA 0012 airfoil and for the Boeing 747 aircraft. The 747 geometry includes the fuselage, wing, horizontal and vertical tails, under-wing pylons, and flow-through engine nacelles. Euler solutions for the 747 aircraft on an unstructured tetrahedral mesh containing approximately 100,000 cells were obtained to engineering accuracy in less than one hour CPU time on a Cray-2 computer.

Batina, John T.↗

AI and Machine Learning with Encrypted Data (CRADA Final Report)

The proposed project aimed to develop faster algorithms for FHE and zk-SNARKs processing. The research team previously developed a fast Number Theoretic Transform (NTT) and other fast arithmetic algorithms. The project team explored using these fast algorithms to enable FHE and zk-SNARKSs acceleration, with specific attention to how the algorithms would need to be integrated into specific FHE and zk-SNARKs software packages to become useful. Existing FHE/zk-SNARKs software packages have been written for CPUs, however this project’s technology targeted FPGAs and GPUs. The team explored how to modify existing CPU software to support FPGAs/GPUs as well as ways they could implement entirely new software stacks that run purely on FPGAs/GPUs.

97 MATHEMATICS AND COMPUTING↗

A Fast and Sensitive New Satellite SO2 Retrieval Algorithm based on Principal Component Analysis: Application to the Ozone Monitoring Instrument

We describe a new algorithm to retrieve SO2 from satellite-measured hyperspectral radiances. We employ the principal component analysis technique in regions with no significant SO2 to capture radiance variability caused by both physical processes (e.g., Rayleigh and Raman scattering and ozone absorption) and measurement artifacts. We use the resulting principal components and SO2 Jacobians calculated with a radiative transfer model to directly estimate SO2 vertical column density in one step. Application to the Ozone Monitoring Instrument (OMI) radiance spectra in 310.5-340 nm demonstrates that this approach can greatly reduce biases in the operational OMI product and decrease the noise by a factor of 2, providing greater sensitivity to anthropogenic emissions. The new algorithm is fast, eliminates the need for instrument-specific radiance correction schemes, and can be easily adapted to other sensors. These attributes make it a promising technique for producing longterm, consistent SO2 records for air quality and climate research.

Principal component analysis↗

A generalizable machine learning-assisted fast Fourier transform algorithm to simulate the large strain phenomena in polycrystalline materials

Machine learning methods have shown initial promise in constitutive modeling for single crystals or homogenized polycrystals, delivering notable computational efficiency. However, existing machine learning-based constitutive models often lack generalizability, limiting their application across diverse boundary value problems. This study introduces a thermodynamics-informed artificial neural network model to accelerate rate-tangent crystal plasticity fast Fourier transform simulations for cross-scale deformation behaviors of polycrystals under complex loading. Our model integrates microstructural variability and local interactions effectively. To address local effects in each grain, we employ K-means clustering to group Gauss points within the microstructure into clusters assumed to be in similar mechanical states. This approach, based on self-clustering analysis, extends model scope from macroscopic stress response to the granular level, capturing mechanical responses and orientation evolution across grains. This reduces the number of nonlinear problems to solve, with cluster responses propagated throughout each group. The thermodynamics-based artificial neural network-extracted features are further processed using local material state clusters to account for history-dependent deformation and evolving microstructures. Additionally, representative volume element simulations with rate-tangent crystal plasticity fast Fourier transform provide reliable datasets for model training. The proposed model demonstrates high efficiency, accuracy, self-consistency, and enhanced generalizability in predicting strain–stress responses and orientation evolution at both individual grain and aggregate scales under complex loading conditions, such as biaxial tension and arbitrary loading scenarios.

36 MATERIALS SCIENCE↗

Fast and accurate algorithm for calculating long-baseline neutrino oscillation probabilities with matter effects

Neutrino oscillation experiments will be entering the precision era in the next decade with the advent of high statistics experiments like DUNE, HK, and JUNO. Correctly estimating the confidence intervals from data for the oscillation parameters requires very large Monte Carlo datasets involving calculating the oscillation probabilities in matter many, many times. In this paper, we leverage past work to present a new, fast, precise technique for calculating neutrino oscillation probabilities in matter optimized for long-baseline neutrino oscillations in the Earth’s crust including both accelerator and reactor experiments. For ease of use by theorists and experimentalists, we provide fast ++ and codes . Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Fast and Scalable Genetic Algorithm-Based Approach for Planning of Microgrids in Distribution Networks

As a result of climate change, extreme weather events are occurring more frequently and with increasing impact. This trend poses a significant challenge for distribution utilities and system operators to ensure that there is uninterrupted power supply to critical loads in their networks; thus, the level of proactive preparation of the distribution system to be able to handle severe impacts of extreme weather events represents the system's resilience. One method that distribution system planners can use to prepare for future extreme events is to plan multiple microgrids which can use local generation as much as possible to supply critical loads. But partitioning an existing distribution system such that multiple feasible islands are planned and which are capable of supporting critical loads is still challenging for distribution systems - first, because of the size of the network graph partitioning problem and, second, because of the difficulty in properly formulating the desired attributes of such islands or microgrids. Therefore, this paper presents a genetic algorithm based approach that facilitates incorporating multiple objectives for grid partitioning by formulating two types of problems - node allocation and edge elimination - and it considers multiple topological and resilience-enhancing objectives. The performance of the proposed genetic algorithm-based approach is numerically evaluated on multiple test systems as well as on a real distribution feeder in Colorado, United States.

genetic algorithm↗

Towards an Optimal Estimation Retrieval of Cirrus Cloud Optical and Microphysical Properties Using Hyperspectral Shortwave Instruments and A Fast Radiative Transfer Algorithm

Cirrus cloud retrieval products (here, cloud optical depth, effective particle size, and cloud top height) are important inputs into numerical weather and climate models. Uncertainties in such retrieval products, as a matter of course, propagate downstream, impacting model calculations. Improvements in high-quality global cirrus cloud optical and microphysical data products from satellite observations are needed to understand and reduce retrieval uncertainties. Hyperspectral shortwave instruments produce high-resolution and information-dense spectra, thus offering the opportunity to reduce uncertainties in retrieval products. We are in the process of developing a retrieval that uses the very fast Principal Component Radiative Transfer Model in the solar spectral region (PCRTM-Solar) in the forward model calculations. This retrieval will use measured reflectances from the NASA Earth Surface Mineral Dust Source Investigation (EMIT) and the forthcoming Climate Absolute Radiance and Refractivity Observatory Pathfinder (CLARREO-Pathfinder) instruments. In this manuscript we present progress towards a reference retrieval employing a widely used, verified, accurate, yet computationally slower radiative transfer modeling technique. The reference retrieval, while too slow for using the complete hyperspectral measurement, will allow us to study the behavior of retrieval products and help us verify results from our in-development fast retrieval. Both retrievals will use the optimal estimation retrieval framework. In this manuscript we present results from an uncertainty analysis considering three uncertainty sources for a cirrus cloud retrieval in the form of error covariance matrices: reflectance uncertainty due to water vapor, the reflectance uncertainty due to ice crystal scattering assumptions, and the instrument measurement uncertainty. Results show that the uncertainty due to habit selection is the largest, while that due to water vapor is at most 0.6% relative to channel reflectance. As a first step, the retrieval is being designed for single layer ice clouds over open ocean water.

Cirrus cloud↗

Towards an Optimal Estimation Retrieval of Cirrus Cloud Optical and Microphysical Properties Using Hyperspectral Shortwave Instruments and A Fast Radiative Transfer Algorithm

Cirrus cloud retrieval products (here, cloud optical depth, effective particle size, and cloud top height) are important inputs into numerical weather and climate models. Uncertainties in such retrieval products, as a matter of course, propagate downstream, impacting model calculations. Improvements in high-quality global cirrus cloud optical and microphysical data products from satellite observations are needed to understand and reduce retrieval uncertainties. Hyperspectral instruments produce high-resolution and information-dense radiance spectra, thus offering the opportunity to reduce uncertainties in retrieval products. An optimal estimation-based cirrus cloud optical and microphysical product retrieval is under development for the NASA Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) and the Earth Surface Mineral Dust Source Investigation (EMIT) instruments, and the forthcoming Climate Absolute Radiance and Refractivity Observatory Pathfinder (CLARREO-Pathfinder). The spectral coverage of all three instruments includes the ultraviolet, visible, and near-infrared. In this study a very fast radiative transfer model, the Principal Component-based Radiative Transfer Model in the solar spectral region (PCRTM-Solar), is used for forward modeling computations. This will reduce the computational burden in the forward radiance and Jacobian calculations as the cost function is minimized, enabling the entire AVIRIS, EMIT, and CLARREO-Pathfinder spectral range to be used in the optimal estimation framework. Using the entire spectrum will maximize the information content, resulting in a more robust and more accurate retrieval. As a first step, the retrieval is being designed for single layer ice clouds over open ocean water. Preliminary results will be shown.

Jeffrey Mast↗

High-Fidelity Models and Fast EMT Simulation Algorithms for Isolated Multi-port Autonomous Reconfigurable Solar power plant (MARS)

The integration of hybrid photovoltaic (PV) and energy storage system (ESS) based plants has become a promising way of solving the intermittency of PV plants and providing frequency support to the power grid. The multi-port autonomous reconfigurable solar power plant (MARS) can integrate the PV systems and ESSs to an ac grid and dc lines. The proposed isolated MARS incorporates an isolated converter that connects to the PV arrays and is based on the dual active bridge (DAB) converter. The high frequency switching in the DAB and the means to control the DAB converter using delays between switching signals lead to the need for a small timestep in simulations. Moreover, several hundreds of modules that include a DAB converter are present in the MARS. The small timestep and the presence of several hundreds of modules lead to a significant rise in the overall simulation time. To address this issue, simulation algorithms like numerical stiffness-based hybrid discretization and the hysteresis relaxation technique are applied to the switched system model of isolated MARS. Additionally, an event-driven interpolating method is introduced to help increase the minimum timestep to simulate the conventional DAB converter model while maintaining high accuracy in the simulation results. The developed model is validated by comparison with its reference model built in the PSCAD/EMTDC and MATLAB software environments using library components.

Xia, Qian↗

A fast hidden line algorithm with contour option

The JonesD algorithm was modified to allow the processing of N-sided elements and implemented in conjunction with a 3-D contour generation algorithm. The total hidden line and contour subsystem is implemented in the MOVIE.BYU Display package, and is compared to the subsystems already existing in the MOVIE.BYU package. The comparison reveals that the modified JonesD hidden line and contour subsystem yields substantial processing time savings, when processing moderate sized models comprised of 1000 elements or less. There are, however, some limitations to the modified JonesD subsystem.

Thue, R. E.↗

Three-dimensional direct particle simulation on the Connection Machine

This paper presents the algorithms necessary for an efficient data parallel implementation of a 3D particle simulation. In particular, a general master/slave algorithm and a fast sorting algorithm are described and the use of these algorithms in a particle simulation is outlined. A particle simulation using these algorithms has been implemented on a 32768 processor Connection Machine that is capable of simulating over 30 million particles at an average rate of 2.4-microsec/particle/step. Results are presented from the simulation of flow over an Aeroassisted Flight Experiment geometry at 100 km altitude.

Dagum, Leonardo↗

Attitude determination using vector observations: A fast optimal matrix algorithm

The attitude matrix minimizing Wahba's loss function is computed directly by a method that is competitive with the fastest known algorithm for finding this optimal estimate. The method also provides an estimate of the attitude error covariance matrix. Analysis of the special case of two vector observations identifies those cases for which the TRIAD or algebraic method minimizes Wahba's loss function.

Markley, F. Landis↗

Attitude determination using vector observations - A fast optimal matrix algorithm

The attitude matrix minimizing Wahba's loss function is computed directly by a method that is competitive with the fastest known algorithm for finding this optimal estimate. The method also provides an estimate of the attitude error covariance matrix. Analysis of the special case of two vector observations identifies those cases for which the TRIAD or algebraic method minimizes Wahba's loss function.

Markley, F. L.↗

A Fast parallel tridiagonal algorithm for a class of CFD applications

The parallel diagonal dominant (PDD) algorithm is an efficient tridiagonal solver. This paper presents for study a variation of the PDD algorithm, the reduced PDD algorithm. The new algorithm maintains the minimum communication provided by the PDD algorithm, but has a reduced operation count. The PDD algorithm also has a smaller operation count than the conventional sequential algorithm for many applications. Accuracy analysis is provided for the reduced PDD algorithm for symmetric Toeplitz tridiagonal (STT) systems. Implementation results on Langley's Intel Paragon and IBM SP2 show that both the PDD and reduced PDD algorithms are efficient and scalable.

Moitra, Stuti↗

Fast spherical search algorithm

This paper describes an algorithm to search a number of spherical points and find the points that are within a given distance to a given point. The described algorithm is not optimal, but is easy to implement. Basically, it utilizes a number of spherical coverings to build the data structure. Results of an implementation are presented.

Liebe, Carl Christian↗