Search NASA⌕ Search

SEARCH · Search NASA

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Some numerical and physical aspects of unsteady Navier-Stokes computations over airfoils using dynamic meshes

An upwind-biased implicit approximate factorization algorithm is applied to several unsteady flows on dynamic meshes. The thin-layer form of the compressible Navier-Stokes equations is used to solve both laminar and turbulent flows over airfoils pitching about the quarter chord. Numerical aspects of the solutions are investigated, including grid and time step effects. Two methods for determining fluxes - flux-vector splitting and flux-difference splitting - are compared. Flux-difference splitting predicts results more accurately than flux-vector splitting on a coarse mesh, but both methods agree on a fine mesh. Physical aspects of the computations are also examined. An equilibrium turbulent boundary layer model computes generally better unsteady results in comparison with experiment than a nonequilibrium model for the transonic case analyzed. Also, the size and location of the primary shed vortex for an airfoil pitching up at a constant rate is calculated in good agreement with experiment for two pitch rates.

Rumsey, Christopher L.↗
NASA NTRS1989

Optimal Placement Of Multiple Antennas

Computer program based on pair of algorithms selects approximately optimal locations of antennas and approximately optimal number of elements in each antenna of multiple-antenna communication system. Obscuration in field of view at given antenna location taken into account in choice of number of antenna elements mounted there. Directional coverages of combinations of up to four antenna elements computed in search for combination to cover clear portion of field of view. Developed to aid design of antenna system of conceptual space station. Applied to system aboard ship or aircraft, on building in city, or in any location where transmission and reception blocked in some directions from each potential antenna-mounting point.

Shelton, Kyle W.↗
NASA NTRS1988

Parametric study of grid size, time step and turbulence modeling on Navier-Stokes computations over airfoils

An upwind-biased implicit approximate factorization algorithm is applied to several steady and unsteady turbulent flows. The thin layer form of the compressible Navier-Stokes equation is used. Both the flux vector splitting and flux difference splitting methods are used to determine fluxes, and the results are compared. Flux difference splitting predicts results more accurately than flux vector splitting on a given mesh size, but, in its present implementation, is more severely limited by the maximum CFL number for unsteady time accurate flows. Physical aspects of the computations are also examined. An equilibrium turbulent boundary layer model computes generally better steady and unsteady results than a nonequilibrium model when there is little to no boundary layer separation. Conversely, when a significant region of separation exists, the nonequilibrium model performs in better agreement with experiment.

Rumsey, Christopher L.↗
NASA NTRS1989

CAP-TSD: A program for unsteady transonic analysis of realistic aircraft configurations

The development of a new transonic code to predict unsteady flows about realistic aircraft configurations are described. An approximate factorization algorithm for solution of the unsteady transonic small disturbance equation is first described. Because of the superior stability characteristics of the AF algorithm, a new transonic aeroelasticity code was developed which is described in some detail. The new code was very easy to modify to include the additional aircraft components, so in a very short period of time the code was developed to treat complete aircraft configurations. Finally, applications are presented which demonstrate many of the geometry capabilities of the new code.

Batina, John T.↗
NASA NTRS1989

Steady and unsteady transonic small disturbance analysis of realistic aircraft configurations

A transonic unsteady aerodynamic and aeroelastic code called CAP-TSD (Computational Aeroelasticity Program - Transonic Small Disturbance) was developed for application to realistic aircraft configurations. It permits the calculation of steady and unsteady flows about complete aircraft configurations for aeroelastic analysis of the flutter critical transonic speed range. The CAP-TSD code uses a time accurate approximate factorization algorithm for solution of the unsteady transonic small disturbance potential equation. An overview is given of the CAP-TSD code development effort along with recent algorithm modifications which are listed and discussed. Calculations are presented for several configurations including the General Dynamics 1/9th scale F-16C aircraft model to evaluate the algorithm and hence the reliability of the CAP-TSD code in general. Calculations are also presented for a flutter analysis of a 45 deg sweptback wing which agree well with the experimental data. Descriptions are presented of the CAP-TSD code and algorithm details along with results and comparisons which demonstrate the stability, accuracy, efficiency, and utility of CAP-TSD.

Batina, John T.↗
NASA NTRS1989

Iterative methods for design sensitivity analysis

A numerical method is presented for design sensitivity analysis, using an iterative-method reanalysis of the structure generated by a small perturbation in the design variable; a forward-difference scheme is then employed to obtain the approximate sensitivity. Algorithms are developed for displacement and stress sensitivity, as well as for eignevalues and eigenvector sensitivity, and the iterative schemes are modified so that the coefficient matrices are constant and therefore decomposed only once.

Belegundu, A. D.↗
NASA NTRS1988

Three dimensional flow simulation with application to aeroelastic analysis

The three-dimensional flowfield about realistic launch vehicle configurations is simulated using the Reynolds-averaged Navier-Stokes equations. Turbulent mixing is accounted for by means of the two-layer Baldwin and Lomax (1978) algebraic eddy viscosity model. The Beam and Warming (1976) implicit approximate factorization algorithm is used for the solution of the finite difference equations. Applications include the study of the flowfield about a hemisphere-cylinder configuration both in the subsonic and supersonic flight regimes, and about two hammerhead payload configurations at transonic speeds. A method is also described which permits incorporating this flow solver into a complete algorithm to perform time-domain aeroelastic stability analyses. The vehicle is modeled as a free-free beam and modal superposition techniques are used for the structural-dynamic formulation. Aeroelastic analyses were performed for the hammerhead configurations.

Azevedo, Joao Luiz F.↗
NASA NTRS1988

Recent advances in transonic computational aeroelasticity

A transonic unsteady aerodynamic and aeroelasticity code called CAP-TSD was developed for application to realistic aircraft configurations. The code permits the calculation of steady and unsteady flows about complete aircraft configurations for aeroelastic analysis in the flutter critical transonic speed range. The CAP-TSD code uses a time accurate approximate factorization algorithm for solution of the unsteady transonic small disturbance potential equation. An overview is given of the CAP-TSD code development effort and results are presented which demonstrate various capabilities of the code. Calculations are presented for several configurations including the General Dynamics 1/9 scale F-16 aircraft model and the ONERA M6 wing. Calculations are also presented from a flutter analysis of a 45 deg sweptback wing which agrees well with the experimental data. Descriptions are presented of the CAP-TSD code and algorithm details along with results and comparisons which demonstrate these recent developments in transonic computational aeroelasticity.

Batina, John T.↗
NASA NTRS1993

Methodology for sensitivity analysis, approximate analysis, and design optimization in CFD for multidisciplinary applications

In this study involving advanced fluid flow codes, an incremental iterative formulation (also known as the delta or correction form) together with the well-known spatially-split approximate factorization algorithm, is presented for solving the very large sparse systems of linear equations which are associated with aerodynamic sensitivity analysis. For smaller 2D problems, a direct method can be applied to solve these linear equations in either the standard or the incremental form, in which case the two are equivalent. Iterative methods are needed for larger 2D and future 3D applications, however, because direct methods require much more computer memory than is currently available. Iterative methods for solving these equations in the standard form are generally unsatisfactory due to an ill-conditioning of the coefficient matrix; this problem can be overcome when these equations are cast in the incremental form. These and other benefits are discussed. The methodology is successfully implemented and tested in 2D using an upwind, cell-centered, finite volume formulation applied to the thin-layer Navier-Stokes equations. Results are presented for two sample airfoil problems: (1) subsonic low Reynolds number laminar flow; and (2) transonic high Reynolds number turbulent flow.

Taylor, Arthur C., III↗
NASA NTRS1995

Computational analysis of forebody tangential slot blowing on the high alpha research vehicle

A numerical analysis of forebody tangential slot blowing as a means of generating side force and yawing moment is conducted using an aircraft geometry. The Reynolds-averaged, thin-layer, Navier-Stokes equations are solved using a partially flux-split, approximately-factored algorithm. An algebraic turbulence model is used to determine the turbulent eddy viscosity values. Solutions are obtained using both patched and overset grid systems. In the patched grid model, and actuator plane is used to introduce jet variables into the flow field. The overset grid model is used to model the physical slot geometry and facilitate modeling of the full aircraft configuration. A slot optimization study indicates that a short slot located close to the nose of the aircraft provided the most side force and yawing moment per unit blowing coefficient. Comparison of computed surface pressure with that obtained in full-scale wind tunnel tests produce good agreement, indicating the numerical method and grid system used in the study are valid. Full aircraft computations resolve the changes in vortex burst point due to blowing. A time-accurate full-aircraft solution shows the effect of blowing on the changes in the frequency of the aerodynamic loads over the vertical tails. A study of the effects of freestream Mach number and various jet parameters indicates blowing remains effective through the transonic Mach range. An investigation of the force onset time lag associated with forebody blowing shows the lag to be minimal. The knowledge obtained in this study may be applied to the design of a forebody tangential slot blowing system for use on flight aircraft.

Gee, Ken↗
NASA NTRS1996

Methodology for Sensitivity Analysis, Approximate Analysis, and Design Optimization in CFD for Multidisciplinary Applications

An incremental iterative formulation together with the well-known spatially split approximate-factorization algorithm, is presented for solving the large, sparse systems of linear equations that are associated with aerodynamic sensitivity analysis. This formulation is also known as the 'delta' or 'correction' form. For the smaller two dimensional problems, a direct method can be applied to solve these linear equations in either the standard or the incremental form, in which case the two are equivalent. However, iterative methods are needed for larger two-dimensional and three dimensional applications because direct methods require more computer memory than is currently available. Iterative methods for solving these equations in the standard form are generally unsatisfactory due to an ill-conditioned coefficient matrix; this problem is overcome when these equations are cast in the incremental form. The methodology is successfully implemented and tested using an upwind cell-centered finite-volume formulation applied in two dimensions to the thin-layer Navier-Stokes equations for external flow over an airfoil. In three dimensions this methodology is demonstrated with a marching-solution algorithm for the Euler equations to calculate supersonic flow over the High-Speed Civil Transport configuration (HSCT 24E). The sensitivity derivatives obtained with the incremental iterative method from a marching Euler code are used in a design-improvement study of the HSCT configuration that involves thickness. camber, and planform design variables.

Taylor, Arthur C., III↗
NASA NTRS1998

A New Approximate Chimera Donor Cell Search Algorithm

The objectives of this study were to develop chimera-based full potential methodology which is compatible with overflow (Euler/Navier-Stokes) chimera flow solver and to develop a fast donor cell search algorithm that is compatible with the chimera full potential approach. Results of this work included presenting a new donor cell search algorithm suitable for use with a chimera-based full potential solver. This algorithm was found to be extremely fast and simple producing donor cells as fast as 60,000 per second.

Holst, Terry L.↗
NASA NTRS1994

Improving Learning Performance Through Rational Resource Allocation

This article shows how rational analysis can be used to minimize learning cost for a general class of statistical learning problems. We discuss the factors that influence learning cost and show that the problem of efficient learning can be cast as a resource optimization problem. Solutions found in this way can be significantly more efficient than the best solutions that do not account for these factors. We introduce a heuristic learning algorithm that approximately solves this optimization problem and document its performance improvements on synthetic and real-world problems.

resource optimization↗
NASA NTRS2018

XY vs X Mixer in Quantum Alternating Operator Ansatz for Optimization Problems with Constraints

Quantum Approximate Optimization Algorithm, further generalized as Quantum Alternating Operator Ansatz (QAOA), is a family of algorithms for combinatorial optimization problems. It is a leading candidate to run on emerging universal quantum computers to gain insight into quantum heuristics. In constrained optimization, penalties are often introduced so that the ground state of the cost Hamiltonian encodes the solution (a standard practice in quantum annealing). An alternative is to choose a mixing Hamiltonian such that the constraint corresponds to a constant of motion and the quantum evolution stays in the feasible subspace. Better performance of the algorithm is speculated due to a much smaller search space. We consider problems with a constant Hamming weight as the constraint. We also compare different methods of generating the generalized W-state, which serves as a natural initial state for the Hamming-weight constraint. Using graph-coloring as an example, we compare the performance of using XY model as a mixer that preserves the Hamming weight with the performance of adding a penalty term in the cost Hamiltonian.

quantum computing↗
NASA NTRS2019

Exploring Network-Related Optimization Problems Using Quantum Heuristics

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Wang, Zhihui↗
NASA NTRS2019

Study network-related optimization problems using quantum alternating optimization ansatz

Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.

Zhihui Wang↗
NASA NTRSDate not supplied

Dynamical Decoupling of Crosstalk on Superconducting Qubit Devices

Current NISQ devices are prone to errors. In order to be used for practical applications or achieve fault-tolerant thresholds, strategies to suppress error rates will be needed to maximize the potential of noisy devices. Dynamical decoupling (DD) is one such strategy for suppressing — or at least alleviating — the effects of decoherence, in which sequences of pulses are applied to qubits to decouple their interaction with the environment. Through experimental runs performed on several Rigetti quantum computing units (QPUs), we first demonstrate that DD is capable of improving coherence times for isolated qubits, as well as suppressing errors caused by the ZZ coupling between pairs of qubits. Extending this framework to cycles containing2-qubit gates, we show that DD can be inserted to decouple qubits from crosstalk occurring during neighboring 2-qubit gates, and demonstrate the efficacy of this procedure on quantum approximate optimization algorithm (QAOA) circuits. We also explore the usage of tailored DD sequences for the suppression of characterized error channels. We are grateful for support from the NASA Ames Research Center and from the DARPA ONISQ program under interagency agreement IAA 8839,Annex 114. HYH is supported by the USRA Feynman QuantumAcademy funded by the NAMS R&D Student Program and a UCHellman Fellowship. JS, ZGI and ZW are supported by USRA NASAAcademic Mission Service (NNA16BD14C).

Dynamical decoupling↗
DOE OSTI2024

QFw: A Quantum Framework for Large-scale HPC Ecosystems

This work extends Quantum Framework (QFw) by integrating it with Northwest Quantum Simulator (NWQ-Sim) and by introducing a lightweight python library that allows multiple frontends (e.g., Qiskit) to interact with QFw. This extension enables QFw to flexibly decouple frontends from backends (e.g., NWQ-Sim). We demonstrate this capability by executing a Greenberger-Horne-Zeilinger (GHZ) circuit using Qiskit and Pennylane with NWQ-Sim and Tensor-Network Quantum Virtual-Machine (TN-QVM). QFw enables easy scaling to multiple nodes. We showcase this with scaling tests using GHZ with up to 32 qubits for different number of nodes on the Frontier supercomputer. And, to demonstrate the use of QFw for real world problems, we solve a metamaterial optimization problem, using a Quantum Approximate Optimization Algorithm (QAOA). We observe that QFw over NWQ-Sim marginally improves Qiskit-aer’s accuracy in reaching the lowest energy state. These additions to QFw prepare it to run hybrid applications in a hybrid resource environment since it treats actual quantum hardware and simulators alike.

Chundury, Srikar↗