Search NASA⌕ Search

SEARCH · Search NASA

Results for “numerical algorithm computing”

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 1,423 records · Page 79
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

The effects of various implicit operators on a flux vector splitting method

Three different implicit operators in a numerical method for solving the two-dimensional steady Euler equations using flux vector splitting are investigated. These include the implementation of the true Jacobian matrices in the implicit part, the use of their splitting approximate form, and a modification of the implicit part of the scheme that uses the scalar form of the implicit part based on the spectral radii of the split Jacobian matrices. The three versions of the basic algorithm are compared with the results given by two common numerical methods using several two-dimensional test cases. Special attention is paid to the quality of results as well as computational efficiency and convergence properties.

Von Lavante, E.↗
NASA NTRS1992

Robust tuning of robot control systems

The computed torque control problem is examined for a robot arm with flexible, geared, joint drive systems which are typical in many industrial robots. The standard computed torque algorithm is not directly applicable to this class of manipulators because of the dynamics introduced by the joint drive system. The proposed approach to computed torque control combines a computed torque algorithm with torque controller at each joint. Three such control schemes are proposed. The first scheme uses the joint torque control system currently implemented on the robot arm and a novel form of the computed torque algorithm. The other two use the standard computed torque algorithm and a novel model following torque control system based on model following techniques. Standard tasks and performance indices are used to evaluate the performance of the controllers. Both numerical simulations and experiments are used in evaluation. The study shows that all three proposed systems lead to improved tracking performance over a conventional PD controller.

Minis, I.↗
NASA NTRS1992

Analysis of hypersonic nozzles including vibrational nonequilibrium and intermolecular force effects

A computational fluid dynamics algorithm is developed for the study of high-pressure axisymmetric hypersonic nozzle flows. The effects of intermolecular forces and vibrational nonequilibrium are included in the analysis. The numerical simulation of gases with an arbitrary equation of state is discussed. Simulations for a high pressure nozzle (p(0) = 138 MPa) demonstrate that both intermolecular forces and vibrational nonequilibrium have a significant affect on the flow. These nonideal effects tend to increase the Mach number at the nozzle exit plane. Thus, they must be included in the design and analysis of high pressure hypersonic nozzles.

Canupp, Patrick W.↗
NASA NTRS1998

Real Gas Computation Using an Energy Relaxation Method and High-Order WENO Schemes

In this paper, we use a recently developed energy relaxation theory by Coquel and Perthame and high order weighted essentially non-oscillatory (WENO) schemes to simulate the Euler equations of real gas. The main idea is an energy decomposition into two parts: one part is associated with a simpler pressure law and the other part (the nonlinear deviation) is convected with the flow. A relaxation process is performed for each time step to ensure that the original pressure law is satisfied. The necessary characteristic decomposition for the high order WENO schemes is performed on the characteristic fields based on the first part. The algorithm only calls for the original pressure law once per grid point per time step, without the need to compute its derivatives or any Riemann solvers. Both one and two dimensional numerical examples are shown to illustrate the effectiveness of this approach.

Montarnal, Philippe↗
NASA NTRS1998

Efficient Jitter Analysis for Spacecraft

Typically in space missions, the science instruments require a specific degree of pointing accuracy as well as dynamical quietness. This dynamical quietness, which is needed to allow the instruments to make measurements (remote sensing applications) or perform other functions, is usually characterized in terms of jitter and stability specifications. In order to insure that the spacecraft meets the requirements of its instruments, several jitter analyses are performed throughout the design phase of the spacecraft and beyond as the models of the spacecraft, its components, and disturbances mature. Each such analysis involves the simulation of the spacecraft and instrument dynamical response to all known disturbance scenarios, followed by the computation of jitter values for each instrument based on the specified jitter time windows. The direct approach for computing jitter values by sweeping maxima and minima throughout the time history may be costly in the computational sense as the size and number of the time histories involved could be quite large. Keeping in mind that typical spacecraft simulation time histories may easily involve hundreds of thousands or millions of points, it is imperative that a jitter analysis algorithm be developed which is more efficient than the direct approach. This paper presents a vectorized algorithm for efficient computation of spacecraft jitter values. The algorithm identifies the extreme points in the time history, which are the points that may dominate the jitter values depending on the location of the jitter window along the time history. The span of influence of each extremum is then computed by the algorithm and used in an efficient and vectorized fashion to obtain the jitter values. The algorithm deals with the multiple jitter windows 2 sequentially, first computing jitter values for the smallest time window, then looping over the remaining time windows until all jitter values are computed. A numerical example is carried out to demonstrate the efficiency and feasibility of the proposed jitter analysis technique.

Maghami, Peiman G.↗
NASA NTRS1993

Numerical experiments with model monophyletic and paraphyletic taxa

The problem of how accurately paraphyletic taxa versus monophyletic (i.e., holophyletic) groups (clades) capture underlying species patterns of diversity and extinction is explored with Monte Carlo simulations. Phylogenies are modeled as stochastic trees. Paraphyletic taxa are defined in an arbitrary manner by randomly choosing progenitors and clustering all descendants not belonging to other taxa. These taxa are then examined to determine which are clades, and the remaining paraphyletic groups are dissected to discover monophyletic subgroups. Comparisons of diversity patterns and extinction rates between modeled taxa and lineages indicate that paraphyletic groups can adequately capture lineage information under a variety of conditions of diversification and mass extinction. This suggests that these groups constitute more than mere "taxonomic noise" in this context. But, strictly monophyletic groups perform somewhat better, especially with regard to mass extinctions. However, when low levels of paleontologic sampling are simulated, the veracity of clades deteriorates, especially with respect to diversity, and modeled paraphyletic taxa often capture more information about underlying lineages. Thus, for studies of diversity and taxic evolution in the fossil record, traditional paleontologic genera and families need not be rejected in favor of cladistically-defined taxa.

Non-NASA Center↗
NASA NTRS2011

Sensitivity of Spaceborne and Ground Radar Comparison Results to Data Analysis Methods and Constraints

With the availability of active weather radar observations from space from the Precipitation Radar (PR) on board the Tropical Rainfall Measuring Mission (TR.MM) satellite, numerous studies have been performed comparing PR reflectivity and derived rain rates to similar observations from ground-based weather radars (GR). These studies have used a variety of algorithms to compute matching PR and GR volumes for comparison. Most studies have used a fixed 3-dimensional Cartesian grid centered on the ground radar, onto which the PR and GR data are interpolated using a proprietary approach and/or commonly available GR analysis software (e.g., SPRINT, REORDER). Other studies have focused on the intersection of the PR and GR viewing geometries either explicitly or using a hybrid of the fixed grid and PR/GR common fields of view. For the Dual-Frequency Precipitation Radar (DPR) of the upcoming Global Precipitation Measurement (GPM) mission, a prototype DPR/GR comparison algorithm based on similar TRMM PR data has been developed that defines the common volumes in terms of the geometric intersection of PR and GR rays, where smoothing of the PR and GR data are minimized and no interpolation is performed. The PR and GR volume-averaged reflectivity values of each sample volume are accompanied by descriptive metadata, for attributes including the variability and maximum of the reflectivity within the sample volume, and the fraction of range gates in the sample average having reflectivity values above an adjustable detection threshold (typically taken to be 18 dBZ for the PR). Sample volumes are further characterized by rain type (Stratiform or Convective), proximity to the melting layer, underlying surface (land/water/mixed), and the time difference between the PR and GR observations. The mean reflectivity differences between the PR and GR can differ between data sets produced by the different analysis methods; and for the GPM prototype, by the type of constraints and categorization applied to the data. In this paper, we will show results comparing the 3-D gridded analysis "black box" approach to the GPM prototype volume-matching approach, using matching TRMM PR and WSR-88D ground radar data. The affects of applying data constraints and data categorizations on the volume-matched data to the results will be shown, and explanations of the differences in terms of data and analysis algorithm characteristics will be presented. Implications of the differences to the determination of PR/DPR calibration differences and use of ground radar data to evaluate the PR and DPR attenuation correction algorithms will be discussed.

Morris, Kenneth R.↗
NASA NTRSDate not supplied

Vision 2030 Aircraft Propulsion Grand Challenge Problem: Full-engine CFD Simulations with High Geometric Fidelity and Physics Accuracy

In 2014 NASA published the outcome of the 2030 CFD Vision study: “CFD Vision 2030: A path to Revolutionary Computational Aerosciences” (Slotnick et al., 2014). The study provided a comprehensive review of the state of the art of CFD in 2014 for aerospace applications including, but not limited to, numerical algorithms, physics models, MDAO and HPC hardware. The study also proposed four conceptual ideas of Grand Challenge problems that would benefit from advances outlined in the roadmap including “off-design turbofan engine transient simulation”. The proposed challenges served as a starting point for more detailed problem descriptions that would benefit from advances in simulation. The objective of this paper is to build upon the NASA 2030 CFD Vision study and provide a detailed overview of what needs to take place to enable accurate and efficient simulation of flow through an aircraft engine at off-design condition for transient operation . Execution of the proposed roadmap would significantly advance aircraft engine development by reducing program cost, reducing program development timelines and enabling design objectives associated with Specific Fuel Consumption (SFC), noise, weight and durability.

compressor↗
DOE OSTI2020

On the Solution of ℓ 0 -Constrained Sparse Inverse Covariance Estimation Problems

The sparse inverse covariance matrix is used to model conditional dependencies between variables in a graphical model to fit a multivariate Gaussian distribution. Estimating the matrix from data are well known to be computationally expensive for large-scale problems. Sparsity is employed to handle noise in the data and to promote interpretability of a learning model. Although the use of a convex ℓ 1 regularizer to encourage sparsity is common practice, the combinatorial ℓ 0 penalty often has more favorable statistical properties. In this paper, we directly constrain sparsity by specifying a maximally allowable number of nonzeros, in other words, by imposing an ℓ 0 constraint. Here, we introduce an efficient approximate Newton algorithm using warm starts for solving the nonconvex ℓ 0 -constrained inverse covariance learning problem. Numerical experiments on standard data sets show that the performance of the proposed algorithm is competitive with state-of-the-art methods.

$\ell_0$-Constrained↗
DOE OSTI2011

Energy-Charge-conserving, Implicit, Electrostatic Particle-in-Cell Algorithm

This paper discusses a novel fully implicit formulation for a one-dimensional electrostatic particle-in-cell (PIC) plasma simulation approach. Unlike earlier implicit electrostatic PIC approaches (which are based on a linearized Vlasov-Poisson formulation), ours is based on a nonlinearly converged Vlasov-Ampere (VA) model. By iterating particles and fields to a tight nonlinear convergence tolerance, the approach features superior stability and accuracy properties, avoiding most of the accuracy pitfalls in earlier implicit PIC implementations. In particular, the formulation is stable against temporal (Courant-Friedrichs-Lewy) and spatial (aliasing) instabilities. It is charge- and energy-conserving to numerical round-off for arbitrary implicit time steps (unlike the earlier ''energy-conserving'' explicit PIC formulation, which only conserves energy in the limit of arbitrarily small time steps). While momentum is not exactly conserved, errors are kept small by an adaptive particle sub-stepping orbit integrator, which is instrumental to prevent particle tunneling (a deleterious effect for long-term accuracy). The VA model is orbit-averaged along particle orbits to enforce an energy conservation theorem with particle sub-stepping. As a result, very large time steps, constrained only by the dynamical time scale of interest, are possible without accuracy loss. Algorithmically, the approach features a Jacobian-free Newton-Krylov solver. A main development in this study is the nonlinear elimination of the new-time particle variables (positions and velocities). Such nonlinear elimination, which we term particle enslavement, results in a nonlinear formulation with memory requirements comparable to those of a fluid computation, and affords us substantial freedom in regards to the particle orbit integrator. Numerical examples are presented that demonstrate the advertised properties of the scheme. In particular, long-time ion acoustic wave simulations show that numerical accuracy does not degrade even with very large implicit time steps, and that significant CPU gains are possible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Modeling Rare Events in High Dimensional Stochastics Systems

The main issue addressed in this note is the study of an algorithm to accelerate the computation of kinetic rates in the context of molecular dynamics(MD). It is based on parallel simulations of short-time trajectories and its main components are: a decomposition of phase space into macrostates or cells, a resampling procedure that ensures that the number of parallel replicas (MD simulations) in each macro-state remains constant, the use of multiple populations (colored replicas) to compute multiple rates (e.g., forward and backward rates) in one simulation. The method leads to enhancing the sampling of macro-states associated to the transition states, since in traditional MD these are likely to be depleted even after short-time simulations. By allowing parallel replicas to carry different probabilistic weights, the number of replicas within each macro-state can be maintained constant without introducing any bias. The empirical variance of the estimated reaction rate, defined as a probability flux, is expectedly diminished. This note is a first attempt towards a better mathematical and numerical understanding of this method. It provides first a mathematical formalization of the notion of colors. Then, the link between this algorithm and a set of closely related methods having been proposed in the literature within the past few years is discussed. Lastly, numerical results are provided that illustrate the efficiency of the method.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

First Principles Nonadiabatic Excited-State Molecular Dynamics in NWChem

Computational simulation of non-adiabatic molecular dynamics is an indispensable tool for understanding complex photoinduced processes such as internal conversion, energy transfer, charge separation, and spatial localization of excitons, to name a few. Here, we report an implementation of the fewest-switches surface hopping algorithm in the NWChem computational chemistry program. Here the surface hopping method is combined with linear-response time-dependent density functional theory calculations of adiabatic excited state potential energy surfaces. To treat quantum transitions between arbitrary electronic Born{Oppenheimer states, we have implemented both numerical and analytical differentiation schemes for derivative non-adiabatic couplings. A numerical approach for the time-derivative non-adiabatic couplings together with an analytical method for calculating non-adiabatic coupling vectors is an efficient combination for surface hopping approaches. Additionally, electronic decoherence schemes and a state reassigned unavoided crossings algorithm are also implemented to improve the accuracy of the simulated dynamics and to handle trivial unavoided crossings. We apply our code to study the ultrafast decay of photoexcited benzene, including a detailed analysis of the potential energy surface, population decay time scales, and vibrational coordinates coupled to the excitation dynamics. The development presented in this work is a baseline for future implementations of more sophisticated frameworks for simulating of non-adiabatic molecular dynamics in NWChem.

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

Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in computer science to study the effectiveness of computing models and hardware platforms. In this regard, it is also heavily used as a vehicle to study the feasibility of the quantum computing paradigm for this class of problems. In this paper, we tackle the TSP using the quantum approximate optimization algorithm (QAOA) approach by formulating it as an optimization problem. By adopting an improved qubit encoding strategy and a layer-wise learning optimization protocol, we present numerical results obtained from the gate-based digital quantum simulator, specifically targeting TSP instances with 3, 4, and 5 cities. We focus on the evaluations of three distinctive QAOA mixer designs, considering their performances in terms of numerical accuracy and optimization cost. Notably, we find that a well-balanced QAOA mixer design exhibits more promising potential for gate-based simulators and realistic quantum devices in the long run, an observation further supported by our noise model simulations. Furthermore, we investigate the sensitivity of the simulations to the TSP graph. Overall, our simulation results show that the digital quantum simulation of problem-inspired ansatz is a successful candidate for finding optimal TSP solutions.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2004

Unstructured Unsteady Flow Solver Applicable to MSU TURBO and Computational Design

This paper presents numerical simulations for a high-speed transonic compressor rotor, NASA Rotor 35, using an unstructured grid flow solver U2NCLE. It solves Reynolds averaged Navier-Stokes equations using an arbitrary Mach number solution algorithm. Experiments were conducted at the NASA Glen Research Center to investigate compressor stability enhancement using steady and discrete tip injections. The mass injection upstream of the tip of a high- speed axial compressor rotor has shown effectiveness in suppressing stall in tip-critical rotors. This work presents numerical simulations of a high-speed compressor rotor with and without tip injections. Methods to model the flow injection are described. Numerical simulations are conducted at 80 and 100 percent of the design speed. Results show that numerical solutions are consistent with the experimental trends.

Newman, James C., III↗
DOE OSTI2016

Direct single-shot phase retrieval from the diffraction pattern of separated objects

The non-crystallographic phase problem arises in numerous scientific and technological fields. An important application is coherent diffractive imaging. Recent advances in X-ray free-electron lasers allow capturing of the diffraction pattern from a single nanoparticle before it disintegrates, in so-called ‘diffraction before destruction’ experiments. Presently, the phase is reconstructed by iterative algorithms, imposing a non-convex computational challenge, or by Fourier holography, requiring a well-characterized reference field. Here we present a convex scheme for single-shot phase retrieval for two (or more) sufficiently separated objects, demonstrated in two dimensions. In our approach, the objects serve as unknown references to one another, reducing the phase problem to a solvable set of linear equations. We establish our method numerically and experimentally in the optical domain and demonstrate a proof-of-principle single-shot coherent diffractive imaging using X-ray free-electron lasers pulses. Lastly, our scheme alleviates several limitations of current methods, offering a new pathway towards direct reconstruction of complex objects.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs

The quantum approximate optimization algorithm (QAOA) is a near-term combinatorial optimization algorithm suitable for noisy quantum devices. However, little is known about performance guarantees for p > 2. A recent work computing MaxCut performance guarantees for 3-regular graphs conjectures that any d-regular graph evaluated at particular fixed angles has an approximation ratio greater than some worst-case guarantee. In this work, we provide numerical evidence for this fixed angle conjecture for p < 12. We compute and provide these angles via numerical optimization and tensor networks. These fixed angles serve for an optimization-free version of QAOA and have universally good performance on any 3-regular graph. Heuristic evidence is presented for the fixed angle conjecture on graph ensembles, which suggests that these fixed angles are "close" to global optimum. Under the fixed angle conjecture, QAOA has a larger performance guarantee than the Goemans Williamson algorithm on 3-regular graphs for p >= 11.

Wurtz, Jonathan↗