Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical 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 811 records · Page 45
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Newton algorithm for fitting transfer functions to frequency response measurements

In this paper the problem of synthesizing transfer functions from frequency response measurements is considered. Given a complex vector representing the measured frequency response of a physical system, a transfer function of specified order is determined that minimizes the sum of the magnitude-squared of the frequency response errors. This nonlinear least squares minimization problem is solved by an iterative global descent algorithm of the Newton type that converges quadratically near the minimum. The unknown transfer function is expressed as a sum of second-order rational polynomials, a parameterization that facilitates a numerically robust computer implementation. The algorithm is developed for single-input, single-output, causal, stable transfer functions. Two numerical examples demonstrate the effectiveness of the algorithm.

Spanos, J. T.↗
NASA NTRS1990

Experiments in cooperative-arm object manipulation with a two-armed free-flying robot

Developing computed-torque controllers for complex manipulator systems using current techniques and tools is difficult because they address the issues pertinent to simulation, as opposed to control. A new formulation of computed-torque (CT) control that leads to an automated computer-torque robot controller program is presented. This automated tool is used for simulations and experimental demonstrations of endpoint and object control from a free-flying robot. A new computed-torque formulation states the multibody control problem in an elegant, homogeneous, and practical form. A recursive dynamics algorithm is presented that numerically evaluates kinematics and dynamics terms for multibody systems given a topological description. Manipulators may be free-flying, and may have closed-chain constraints. With the exception of object squeeze-force control, the algorithm does not deal with actuator redundancy. The algorithm is used to implement an automated 2D computed-torque dynamics and control package that allows joint, endpoint, orientation, momentum, and object squeeze-force control. This package obviates the need for hand-derivation of kinematics and dynamics, and is used for both simulation and experimental control. Endpoint control experiments are performed on a laboratory robot that has two arms to manipulate payloads, and uses an air bearing to achieve very-low drag characteristics. Simulations and experimental data for endpoint and object controllers are presented for the experimental robot - a complex dynamic system. There is a certain rather wide set of conditions under which CT endpoint controllers can neglect robot base accelerations (but not motions) and achieve comparable performance including base accelerations in the model. The regime over which this simplification holds is explored by simulation and experiment.

Koningstein, Ross↗
NASA NTRS1993

Numerical model for the Programmable Multirole Furnace (PMZF)

The present account of the Programmable Multizone Furnace numerical model uses various examples to illustrate the ways in which the model serves as an optimization, test, prediction, and visualization tool; a numerical PID-control algorithm obtains the desired sample temperature distributions and allows the model to solve an inverse heat transfer problem where the desired sample temperature profile is the input and the required heater power distribution is the output of numerical simulations. Parametric studies show how the total power consumption of the furnace is affected by such design variables as the conductivity.

Kassemi, M.↗
NASA NTRS2008

Precipitating Snow Retrievals from Combined Airborne Cloud Radar and Millimeter-Wave Radiometer Observations

An algorithm for retrieving snow over oceans from combined cloud radar and millimeter-wave radiometer observations is developed. The algorithm involves the use of physical models to simulate cloud radar and millimeter-wave radiometer observations from basic atmospheric variables such as hydrometeor content, temperature, and relative humidity profiles and is based on an optimal estimation technique to retrieve these variables from actual observations. A high-resolution simulation of a lake-effect snowstorm by a cloud-resolving model is used to test the algorithm. That is, synthetic observations are generated from the output of the cloud numerical model, and the retrieval algorithm is applied to the synthetic data. The algorithm performance is assessed by comparing the retrievals with the reference variables used in synthesizing the observations. The synthetic observation experiment indicates good performance of the retrieval algorithm. The algorithm is also applied to real observations from the Wakasa Bay field experiment that took place over the Sea of Japan in January and February 2003. The application of the retrieval algorithm to data from the field experiment yields snow estimates that are consistent with both the cloud radar and radiometer observations.

Grecu, Mircea↗
NASA NTRS2002

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum exitation gap, gmin = O(n2(sup -n/2)), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, Vadius↗
NASA NTRS2002

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum excitation gap. g min, = O(n 2(exp -n/2), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to 'the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, V. N.↗
NASA NTRS1997

Application of a Chimera Full Potential Algorithm for Solving Aerodynamic Problems

A numerical scheme utilizing a chimera zonal grid approach for solving the three dimensional full potential equation is described. Special emphasis is placed on describing the spatial differencing algorithm around the chimera interface. Results from two spatial discretization variations are presented; one using a hybrid first-order/second-order-accurate scheme and the second using a fully second-order-accurate scheme. The presentation is highlighted with a number of transonic wing flow field computations.

Holst, Terry L.↗
DOE OSTI2025

Toward Higher-order Accuracy in Self-gravitating Hydrodynamics

High-order algorithms have emerged in numerical astrophysics as a promising avenue to reduce truncation error (proportional to a power of the linear resolution Δ x ) with only a moderate increase to computational expense. Significant effort has been placed in the development of finite-volume algorithms for (magneto)hydrodynamics; however, state-of-the-art astrophysical simulations tightly couple a plenitude of physics, additionally including gravity, photon transport, cosmic-ray transport, chemistry, and/or diffusion, to name a few. Algorithms frequently operator-split this additional physics (often a first-order error in time) and/or adopt a model wherein their evaluation is limited to second-order accuracy in space. In this work, we present a fourth-order-accurate finite-volume scheme for self-gravitating hydrodynamics on a uniform Cartesian grid. The method supplies source terms for the gravitational acceleration ( ρ g ) and gravitational energy release ( ρ v · g ) associated with fourth-order-accurate solutions to the Poisson equation. Our scheme (1) guarantees the conservation of total linear momentum while (2) decreasing (in proportion to Δ x 4 ) the effects of spurious heating and/or cooling associated with truncation error in the gravity. We demonstrate expected convergence rates for the algorithm by measuring errors in test problems evolving self-gravity modified linear waves and 3D polytropic equilibria. We test robustness of the algorithm by integrating an induced “inside-out” adiabatic collapse. We also discuss a method to smoothly downgrade the solution to second-order spatial accuracy to avoid spurious overshoots near steep density and/or pressure gradients.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Solar-Tracker Diffuse-Response Algorithm for Balancing Energy Gain and Mechanical Wear in Photovoltaic Systems

Single-axis solar tracking maximizes photovoltaic energy production under clear-sky conditions; however, its effectiveness decreases under cloudy and overcast skies, where diffuse irradiance dominates and the optimal module orientation changes. Conventional tracking algorithms either neglect sky conditions or rely on simplified diffuse-response strategies that may trigger frequent tracker repositioning under variable cloud cover, leading to increased mechanical wear with marginal energy gains. This work proposes an enhanced diffuse-response tracking algorithm that explicitly accounts for both the intensity and temporal persistence of cloudiness. By requiring overcast conditions to persist for a minimum duration before reorienting the tracker to a diffuse-stow position, the proposed approach reduces unnecessary movements while preserving the benefits of diffuse-response operation. The algorithm is evaluated through numerical simulations based on historical meteorological data and validated using field measurements on monofacial and bifacial photovoltaic strings. The results show that the proposed strategy reduces excess tracker movement from 114% to 0.16% while maintaining nearly the same energy yield. Compared to a conventional diffuse-response algorithm, the associated energy reduction is minimal (≈0.17%) relative to the ≈0.37% yield gain observed at the studied location. These findings demonstrate that incorporating cloudiness duration enables a practical compromise between energy performance and tracker durability, particularly for monofacial photovoltaic systems.

14 SOLAR ENERGY↗
NASA NTRS1999

Real Time Optima Tracking Using Harvesting Models of the Genetic Algorithm

Tracking optima in real time propulsion control, particularly for non-stationary optimization problems is a challenging task. Several approaches have been put forward for such a study including the numerical method called the genetic algorithm. In brief, this approach is built upon Darwinian-style competition between numerical alternatives displayed in the form of binary strings, or by analogy to 'pseudogenes'. Breeding of improved solution is an often cited parallel to natural selection in.evolutionary or soft computing. In this report we present our results of applying a novel model of a genetic algorithm for tracking optima in propulsion engineering and in real time control. We specialize the algorithm to mission profiling and planning optimizations, both to select reduced propulsion needs through trajectory planning and to explore time or fuel conservation strategies.

Baskaran, Subbiah↗
NASA NTRS1999

Unsupervised classification of Space Acceleration Measurement System (SAMS) data using ART2-A

The Space Acceleration Measurement System (SAMS) has been developed by NASA to monitor the microgravity acceleration environment aboard the space shuttle. The amount of data collected by a SAMS unit during a shuttle mission is in the several gigabytes range. Adaptive Resonance Theory 2-A (ART2-A), an unsupervised neural network, has been used to cluster these data and to develop cause and effect relationships among disturbances and the acceleration environment. Using input patterns formed on the basis of power spectral densities (psd), data collected from two missions, STS-050 and STS-057, have been clustered.

STS-57 Shuttle Project↗
NASA NTRS1990

Dynamical approach study of spurious steady-state numerical solutions of nonlinear differential equations. Part 1: The ODE connection and its implications for algorithm development in computational fluid dynamics

Spurious stable as well as unstable steady state numerical solutions, spurious asymptotic numerical solutions of higher period, and even stable chaotic behavior can occur when finite difference methods are used to solve nonlinear differential equations (DE) numerically. The occurrence of spurious asymptotes is independent of whether the DE possesses a unique steady state or has additional periodic solutions and/or exhibits chaotic phenomena. The form of the nonlinear DEs and the type of numerical schemes are the determining factor. In addition, the occurrence of spurious steady states is not restricted to the time steps that are beyond the linearized stability limit of the scheme. In many instances, it can occur below the linearized stability limit. Therefore, it is essential for practitioners in computational sciences to be knowledgeable about the dynamical behavior of finite difference methods for nonlinear scalar DEs before the actual application of these methods to practical computations. It is also important to change the traditional way of thinking and practices when dealing with genuinely nonlinear problems. In the past, spurious asymptotes were observed in numerical computations but tended to be ignored because they all were assumed to lie beyond the linearized stability limits of the time step parameter delta t. As can be seen from the study, bifurcations to and from spurious asymptotic solutions and transitions to computational instability not only are highly scheme dependent and problem dependent, but also initial data and boundary condition dependent, and not limited to time steps that are beyond the linearized stability limit.

Yee, H. C.↗
DOE OSTI2024

Distributionally Robust Variational Quantum Algorithms With Shifted Noise

Given their potential to demonstrate near-term quantum advantage, variational quantum algorithms (VQAs) have been extensively studied. Although numerous techniques have been developed for VQA parameter optimization, it remains a significant challenge. A practical issue is the high sensitivity of quantum noise to environmental changes, and its propensity to shift in real time. This presents a critical problem as an optimized VQA ansatz may not perform effectively under a different noise environment. For the first time, we explore how to optimize VQA parameters to be robust against unknown shifted noise. We model the noise level as a random variable with an unknown probability density function (PDF), and we assume that the PDF may shift within an uncertainty set. This assumption guides us to formulate a distributionally robust optimization problem, with the goal of finding parameters that maintain effectiveness under shifted noise. We utilize a distributionally robust Bayesian optimization solver for our proposed formulation. This provides numerical evidence in both the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) with hardware-efficient ansatz, indicating that we can identify parameters that perform more robustly under shifted noise. We regard this work as the first step towards improving the reliability of VQAs influenced by real-time noise.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2011

Preprocessing Inconsistent Linear System for a Meaningful Least Squares Solution

Mathematical models of many physical/statistical problems are systems of linear equations. Due to measurement and possible human errors/mistakes in modeling/data, as well as due to certain assumptions to reduce complexity, inconsistency (contradiction) is injected into the model, viz. the linear system. While any inconsistent system irrespective of the degree of inconsistency has always a least-squares solution, one needs to check whether an equation is too much inconsistent or, equivalently too much contradictory. Such an equation will affect/distort the least-squares solution to such an extent that renders it unacceptable/unfit to be used in a real-world application. We propose an algorithm which (i) prunes numerically redundant linear equations from the system as these do not add any new information to the model, (ii) detects contradictory linear equations along with their degree of contradiction (inconsistency index), (iii) removes those equations presumed to be too contradictory, and then (iv) obtain the minimum norm least-squares solution of the acceptably inconsistent reduced linear system. The algorithm presented in Matlab reduces the computational and storage complexities and also improves the accuracy of the solution. It also provides the necessary warning about the existence of too much contradiction in the model. In addition, we suggest a thorough relook into the mathematical modeling to determine the reason why unacceptable contradiction has occurred thus prompting us to make necessary corrections/modifications to the models - both mathematical and, if necessary, physical.

Sen, Syamal K.↗
NASA NTRS2011

Preprocessing in Matlab Inconsistent Linear System for a Meaningful Least Squares Solution

Mathematical models of many physical/statistical problems are systems of linear equations~ Due to measurement and possible human errors/mistakes in modeling/data, as well as due to certain assumptions to reduce complexity, inconsistency (contradiction) is injected into the model, viz. the linear system. While any inconsistent system irrespective of the degree of inconsistency has always a least-squares solution, one needs to check whether an equation is too much inconsistent or, equivalently too much contradictory. Such an equation will affect/distort the least-squares solution to such an extent that renders it unacceptable/unfit to be used in a real-world application. We propose an algorithm which (i) prunes numerically redundant linear equations from the system as these do not add any new information to the model, (ii) detects contradictory linear equations along with their degree of contradiction (inconsistency index), (iii) removes those equations presumed to be too contradictory, and then (iv) obtain the . minimum norm least-squares solution of the acceptably inconsistent reduced linear system. The algorithm presented in Matlab reduces the computational and storage complexities and also improves the accuracy of the solution. It also provides the necessary warning about the existence of too much contradiction in the model. In addition, we suggest a thorough relook into the mathematical modeling to determine the reason why unacceptable contradiction has occurred thus prompting us to make necessary corrections/modifications to the models - both mathematical and, if necessary, physical.

Sen, Symal K.↗