Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer 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 865 records · Page 48
All sourcesNASA NTRSDOE OSTI
NASA NTRS1979

On the distribution of computation for sequential decoding using the stack algorithm

A method is developed for estimating the computational distribution for the stack algorithm for sequential decoding, that is, the probability that the computation required to decode the first branch of the tree is greater than or equal to N, for small N. The analysis relies heavily on the theory of multitype branching processes. A step in the analysis is the determination of the distribution of the minimum of the cumulative metrics along the transmitted path in the code tree. This is used to obtain the distribution of the number of computations made by the decoder in order to decode the first branch in the tree, and this random variable serves as an approximation of the average number of computations per decoded branch. At information rates below the cutoff rate, the calculated computational performance is virtually identical to that obtained by time-consuming simulations.

Johannesson, R.↗
NASA NTRS1988

Element-by-element and implicit-explicit finite element formulations for computational fluid dynamics

Preconditioner algorithms to reduce the computational effort in FEM analyses of large-scale fluid-dynamics problems are presented. A general model problem is constructed on the basis of the convection-diffusion equation and the two-dimensional vorticity/stream-function formulation of the Navier-Stokes equations; this problem is then analyzed using element-by-element, implicit-explicit, and adaptive implicit-explicit approximation schemes. Numerical results for the two-dimensional advection and rigid-body rotation of a cosine hill, flow past a circular cylinder, and driven cavity flow are presented in extensive graphs and shown to be in good agreement with those obtained using implicit methods.

Tezduyar, T. E.↗
NASA NTRS1993

Path planning using optically computed potential fields

An algorithm for the optical computation of potential field maps suitable for mobile robot navigation is described and experimentally produced maps and paths are presented. The parallel analog optical computation employs a two-dimensional spatial light modulator on which an image of the potential field map is generated. Optically calculated fields contain no local minima, tend to produce paths centered in gaps between obstacles, and produce paths which give preference to wide gaps. Calculation of 128 x 128 pixel fields at a few hertz are possible with current technology, and calculation time vs. map size scales favorably in comparison to digital electronic computation.

Reid, Max B.↗
NASA NTRS1992

Towards a fast implementation of spectral nested dissection

We describe the spectral nested dissection (SND) algorithm, a new algorithm for computing orderings appropriate for parallel factorization of sparse, symmetric matrices. The algorithm makes use of spectral properties of the Laplacian matrix associated with the given matrix to compute separators. We evaluate the quality of the spectral orderings with respect to several measures: fill, elimination tree height, height and weight balances of elimination trees, and clique tree heights. We use some very large structural analysis problems as test cases and demonstrate on these real applications (such as the Space Shuttle Solid Rocket Booster) that spectral orderings compare quite favorably with commonly used orderings, outperforming them by a wide margin for some of these measures. The only disadvantage of SND is its relatively long execution time. We will present some recent efforts to improve the execution time using both a multilevel and a hybrid approach. We use SND in computing a multifrontal numerical factorization with the different orderings on an eight processor Cray Y-MP and show its effectiveness. We believe that spectral nested dissection is a major breakthrough in terms of generating efficient sparse orderings for parallel machines.

Pothen, Alex↗
NASA NTRS1992

A fuzzy clustering algorithm to detect planar and quadric shapes

In this paper, we introduce a new fuzzy clustering algorithm to detect an unknown number of planar and quadric shapes in noisy data. The proposed algorithm is computationally and implementationally simple, and it overcomes many of the drawbacks of the existing algorithms that have been proposed for similar tasks. Since the clustering is performed in the original image space, and since no features need to be computed, this approach is particularly suited for sparse data. The algorithm may also be used in pattern recognition applications.

Krishnapuram, Raghu↗
NASA NTRS1991

Conjugate Gradient Algorithms For Manipulator Simulation

Report discusses applicability of conjugate-gradient algorithms to computation of forward dynamics of robotic manipulators. Rapid computation of forward dynamics essential to teleoperation and other advanced robotic applications. Part of continuing effort to find algorithms meeting requirements for increased computational efficiency and speed. Method used for iterative solution of systems of linear equations.

Fijany, Amir↗
DOE OSTI2020

Energy Storage Sizing and Operation of an Integrated Utility-Scale PV+ESS Power Plant

Integration of an energy storage system (ESS) into a large-scale grid-connected photovoltaic (PV) power plant is highly desirable to improve performance of the system and overcome the stochastic nature of PV power generation. Algorithms to size ESS within an integrated PV and ESS ( PV+ESS) power plant, conventionally, require a large number of high-resolution samples of PV generation. These algorithms are computationally expensive. In this paper, a two-day optimization algorithm that utilizes n-step constant power output dispatch every day from the PV+ESS power plant is proposed to size the ESS. Additionally, an n-step power dispatch every day through the one-year timeframe based optimization of the size of ESS is also performed. The proposed methods are computationally cheaper and provide acceptable accuracy with respect to the conventional sizing methods. The economics identified from the proposed methods are compared with the typical day-ahead hourly dispatch-based power production from the PV+ESS power plant. This comparison has shown similar economic performance showcasing the accuracy of the proposed methods in sizing the ESS. It also shows the potential for operating PV+ESS power plant in n-step constant power generation mode.

Xia, Qian↗
NASA NTRS2000

Experience with a Genetic Algorithm Implemented on a Multiprocessor Computer

Numerical experiments were conducted to find out the extent to which a Genetic Algorithm (GA) may benefit from a multiprocessor implementation, considering, on one hand, that analyses of individual designs in a population are independent of each other so that they may be executed concurrently on separate processors, and, on the other hand, that there are some operations in a GA that cannot be so distributed. The algorithm experimented with was based on a gaussian distribution rather than bit exchange in the GA reproductive mechanism, and the test case was a hub frame structure of up to 1080 design variables. The experimentation engaging up to 128 processors confirmed expectations of radical elapsed time reductions comparing to a conventional single processor implementation. It also demonstrated that the time spent in the non-distributable parts of the algorithm and the attendant cross-processor communication may have a very detrimental effect on the efficient utilization of the multiprocessor machine and on the number of processors that can be used effectively in a concurrent manner. Three techniques were devised and tested to mitigate that effect, resulting in efficiency increasing to exceed 99 percent.

Plassman, Gerald E.↗
NASA NTRS2000

Experience with a Genetic Algorithm Implemented on a Multiprocessor Computer

Numerical experiments were conducted to find out the extent to which a Genetic Algorithm (GA) may benefit from a multiprocessor implementation, considering, on one hand, that analyses of individual designs in a population are independent of each other so that they may be executed concurrently on separate processors, and, on the other hand, that there are some operations in a GA that cannot be so distributed. The algorithm experimented with was based on a gaussian distribution rather than bit exchange in the GA reproductive mechanism, and the test case was a hub frame structure of up to 1080 design variables. The experimentation engaging up to 128 processors confirmed expectations of radical elapsed time reductions comparing to a conventional single processor implementation. It also demonstrated that the time spent in the non-distributable parts of the algorithm and the attendant cross-processor communication may have a very detrimental effect on the efficient utilization of the multiprocessor machine and on the number of processors that can be used effectively in a concurrent manner. Three techniques were devised and tested to mitigate that effect, resulting in efficiency increasing to exceed 99 percent.

Plassman, Gerald E.↗
NASA NTRS1992

Adaptive defuzzification for fuzzy systems modeling

We propose a new parameterized method for the defuzzification process based on the simple M-SLIDE transformation. We develop a computationally efficient algorithm for learning the relevant parameter as well as providing a computationally simple scheme for doing the defuzzification step in the fuzzy logic controllers. The M-SLIDE method results in a particularly simple linear form of the algorithm for learning the parameter which can be used both off- and on-line.

Yager, Ronald R.↗
DOE OSTI2024

Multistage Stochastic optimization for mid-term integrated generation and maintenance scheduling of cascaded hydroelectric system with renewable energy uncertainty

The uncertainties resulting from the escalating penetration of renewable energy resources pose severe challenges to the efficient operation of modern power systems. Hydroelectricity is characterized by its flexibility, controllability, and reliability, and thus becomes one of the most ideal energy resources to hedge against such uncertainties. This paper studies the mid-term integrated generation and maintenance scheduling of a cascaded hydroelectric system (CHS) consisting of multiple cascaded reservoirs and hydroelectric units. To precisely describe the mid-term water regulation policies, the hydraulic coupling relationship and water-energy nexus of CHS are incorporated into the proposed optimization model. The uncertainties of natural water inflow and the power outputs of wind/solar energy generation are taken into consideration and captured via a stochastic process modeled by a scenario tree. A multistage stochastic optimization (MSO) approach is developed to coordinate the complementary operations of multiple energy resources, by optimizing the mid-term water resource management, generation scheduling, and maintenance scheduling of CHS. The proposed MSO model is formulated as a large-scale mixed-integer linear program that presents significant computational intractability. To address this issue, a tailored Benders decomposition algorithm is developed. Two real-world case studies are conducted to demonstrate the capability and characteristics of the proposed model and algorithm. The computational results show that the proposed MSO model can exploit the flexibility of hydroelectricity to efficiently respond to variable wind and solar power, and reserve water resources for the generation in peak months to reduce the consumption of fossil fuel. Furthermore, the proposed solution approach also exhibits promising computational efficiency when handling large-scale models.

13 HYDRO ENERGY↗
DOE OSTI2020

Quantum Accurate Prediction of Plutonium–Plutonium Dihydride Phase Equilibrium Using a Lattice Gas Model

Plutonium-based materials are vital for use as nuclear fuels and as portable power sources for space vehicles. However, elucidating their sensitivity to hydriding corrosion represents an extreme challenge because of the toxicity of Pu as well as their anomalous magnetic properties. In this work, we develop a lattice gas model of plutonium–plutonium dihydride (Pu–PuH 2 ) phase equilibrium that retains the accuracy of density functional theory, while yielding many orders of magnitude improvement in computational efficiency. Using Monte Carlo and free-energy sampling algorithms, we compute a number of Pu–PuH 2 equilibrium properties that are difficult to probe experimentally, including equilibrium pressures and phase compositions and the PuH 2 heat of formation. In conclusion, our method will have particular impact on these types of materials studies, where there is a strong need for computationally efficient approaches to bridge time and length scale gaps between quantum calculations and experiments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Gate-Based Quantum Simulation of Gaussian Bosonic Circuits on Exponentially Many Modes

We introduce a framework for simulating, on an ( n + 1 )-qubit quantum computer, the action of a Gaussian bosonic (GB) circuit on a state over 2 n modes. Specifically, we encode the initial bosonic state’s expectation values over quadrature operators (and their covariance matrix) as an input qubit state. This is then evolved by a quantum circuit that effectively implements the symplectic propagators induced by the GB gates. We find families of GB circuits and initial states leading to efficient quantum simulations. For this purpose, we introduce a dictionary that maps between GB and qubit gates such that particle- (non-particle-) preserving GB gates lead to real- (imaginary-) time evolutions at the qubit level. For the special case of particle-preserving circuits, we present a bounded-error-quantum-polynomial time (BQP)-complete GB decision problem, indicating that GB evolutions of Gaussian states on exponentially many modes are as powerful as universal quantum computers. We also perform numerical simulations of an interferometer on ∼ 8 × 10 9 modes, illustrating the power of our framework. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Fault-Tolerant Decentralized Control for Large-Scale Inverter-Based Resources for Active Power Tracking

Integration of inverter-based resources (IBRs) which lack the intrinsic characteristics such as the inertial response of the traditional synchronous-generator (SG)-based sources presents a new challenge in the form of analyzing the grid stability under their presence. While the dynamic composition of IBRs differs from that of the SGs, the control objective remains similar in terms of tracking the desired active power. This letter presents a decentralized primal-dual-based fault-tolerant control framework for the power allocation in IBRs. Overall, a hierarchical control algorithm is developed with a lower level addressing the current control and the parameter estimation for the IBRs and the higher level acting as the reference power generator to the low level based on the desired active power profile. The decentralized network-based algorithm adaptively splits the desired power between the IBRs taking into consideration the health of the IBRs transmission lines. The proposed framework is tested through a simulation on the network of IBRs and the high-level controller performance is compared against the existing framework in the literature. The proposed algorithm shows significant performance improvement in the magnitude of power deviation and settling time to the nominal value under faulty conditions as compared to the algorithm in the literature.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1991

Planning The Route Of A Robotic Land Vehicle

Algorithm enables experimental robotic land vehicle to follow automatically route computed on basis of terrain-height-map data. Computer executing algorithm merges coarser global topographical data with finer local topographical data obtained through stereoscopic video system as vehicle moves along, then smoothes merged elevation map, interpolates map to evenly-horizontally-spaced grid points, and differentiates map to produce data on slopes and roughness for use in calculations of traversability and optimum route(s). Distance traveled minimized to extent possible consistent with avoidance of obstacles.

Gennery, Donald B.↗
NASA NTRS1992

A 3D finite element multigrid solver for the Euler equations

A low storage, computationally efficient algorithm for the solution of the compressible Euler equations on unstructured tetrahedral meshes is developed. The algorithm takes the form of a centered scheme with the explicit addition of a high accuracy artificial viscosity and the solution is advanced to steady state by means of a multistage timestepping method. The side-based data structure which is employed enables a clear connection to be established between the proposed algorithm and upwind cell vertex schemes for unstructured meshes. The computational efficiency of the procedure is improved by incorporating an unstructured multigrid acceleration procedure. A number of flows of practical interest are analyzed to demonstrate the numerical performance of the proposed approach.

Peraire, J.↗
NASA NTRS1991

Low-dispersion finite difference methods for acoustic waves in a pipe

A new algorithm for computing one-dimensional acoustic waves in a pipe is demonstrated by solving the acoustic equations as an initial-boundary-value problem. Conventional dissipation-free second-order finite difference methods suffer severe phase distortion for grids with less that about ten mesh points per wavelength. Using the signal generation by a piston in a duct as an example, transient acoustic computations are presented using a new compact three-point algorithm which allows about 60 percent fewer mesh points per wavelength. Both pulse and harmonic excitation are considered. Coupling of the acoustic signal with the pipe resonant modes is shown to generate a complex transient wave with rich harmonic content.

Davis, Sanford↗