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,315 records · Page 73
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Numerical study of vortical flow over a sideslipping delta wing

The three-dimensional vortical viscous flow past a sideslipping delta wing at a high angle of attack is numerically investigated. A computational method for calculating low-speed viscous flowfields is developed. The time-iterative method uses an implicit upwind-relaxation finite-difference algorithm with a nonsingular eigensystem to solve the preconditioned, three-dimensional, incompressible Navier-Stokes equations in curvilinear coordinates. An algebraic turbulence model is implemented to account for the eddy viscosity. The technique of local time stepping is incorporated to accelerate the rate of convergence to a steady-state solution. Computed results are compared with experimental data.

Hsu, C.-H.↗
NASA NTRS1991

Multi-resolution analysis for ENO schemes

Given an function, u(x), which is represented by its cell-averages in cells which are formed by some unstructured grid, we show how to decompose the function into various scales of variation. This is done by considering a set of nested grids in which the given grid is the finest, and identifying in each locality the coarsest grid in the set from which u(x) can be recovered to a prescribed accuracy. This multi-resolution analysis was applied to essentially non-oscillatory (ENO) schemes in order to advance the solution by one time-step. This is accomplished by decomposing the numerical solution at the beginning of each time-step into levels of resolution, and performing the computation in each locality at the appropriate coarser grid. An efficient algorithm for implementing this program in the 1-D case is presented; this algorithm can be extended to the multi-dimensional case with Cartesian grids.

Harten, Ami↗
NASA NTRS2000

A Low Order and a High Order Solution for a Converging-Diverging Nozzle Problem

The Computational Aeroacoustics Workshops on Benchmark problems are conducted in order to generate solutions with a variety of methods for problems that are chosen both to be representative of significant and relevant acoustic phenomena. It is generally recognized that CAA applications require the resolution in time and in space of solution details over a significantly broader range of scales than typical computational fluid dynamics applications. These requirements are forcing the development of new methodologies for CAA applications. This paper presents numerical results from a third and a seventh order algorithm for the propagation of an acoustic signal through a converging-diverging nozzle. These two algorithms are members of a new family of high accuracy methods that have the same order accuracy in both space and time, and are an extension of previous work for linearized Euler equations to fully nonlinear time dependent problems. The simulations are all with the fully nonlinear quasi-1D Euler equations for the total solution, which includes both the fluid dynamics and the acoustics. The acoustic solution is obtained from the time dependent nonlinear solution by subtracting the steady solution.

Goodrich, John W.↗
NASA NTRS2000

Perspectives on the Future of CFD

This viewgraph presentation gives an overview of the future of computational fluid dynamics (CFD), which in the past has pioneered the field of flow simulation. Over time CFD has progressed as computing power. Numerical methods have been advanced as CPU and memory capacity increases. Complex configurations are routinely computed now and direct numerical simulations (DNS) and large eddy simulations (LES) are used to study turbulence. As the computing resources changed to parallel and distributed platforms, computer science aspects such as scalability (algorithmic and implementation) and portability and transparent codings have advanced. Examples of potential future (or current) challenges include risk assessment, limitations of the heuristic model, and the development of CFD and information technology (IT) tools.

Kwak, Dochan↗
NASA NTRS2004

Evaluation of a Multigrid Scheme for the Incompressible Navier-Stokes Equations

A fast multigrid solver for the steady, incompressible Navier-Stokes equations is presented. The multigrid solver is based upon a factorizable discrete scheme for the velocity-pressure form of the Navier-Stokes equations. This scheme correctly distinguishes between the advection-diffusion and elliptic parts of the operator, allowing efficient smoothers to be constructed. To evaluate the multigrid algorithm, solutions are computed for flow over a flat plate, parabola, and a Karman-Trefftz airfoil. Both nonlifting and lifting airfoil flows are considered, with a Reynolds number range of 200 to 800. Convergence and accuracy of the algorithm are discussed. Using Gauss-Seidel line relaxation in alternating directions, multigrid convergence behavior approaching that of O(N) methods is achieved. The computational efficiency of the numerical scheme is compared with that of Runge-Kutta and implicit upwind based multigrid methods.

Swanson, R. C.↗
NASA NTRS2009

An Optimal Initial Guess Generator for Entry Interface Targeters

If a pure numerical iterative approach is used, targeting entry interface (EI) conditions for nominal and abort return trajectories or for correction maneuvers can be computationally expensive. This paper describes an algorithm to obtain an optimal impulsive maneuver that generates a trajectory satisfying a set of EI targets: inequality constraints on longitude, latitude and azimuth and a fixed flight-path angle. Most of the calculations require no iterations, making it suitable for real-time applications or large trade studies. This algorithm has been used to generate initial guesses for abort trajectories during Earth-Moon transfers.

Senent, Juan S.↗
NASA NTRS2006

Verification of Numerical Solutions for the Deployment of the Highly Nonlinear MARSIS Antenna Boom Lenticular Joints

The MARSIS antenna booms are constructed using lenticular hinges between straight boom segments in a novel design which allows the booms to be extremely lightweight while retaining a high stiffness and well defined structural properties once they are deployed. Lenticular hinges are elegant in form but are complicated to model as they deploy dynamically and require highly specialized nonlinear techniques founded on carefully measured mechanical properties. Results from component level testing were incorporated into a highly specialized ADAMS model which employed an automated damping algorithm to account for the discontinuous boom lengths formed during the deployment. Additional models with more limited capabilities were also developed in both DADS and ABAQUS to verify the ADAMS model computations and to help better define the numerical behavior of the models at the component and system levels. A careful comparison is made between the ADAMS and DADS models in a series of progressive steps in order to verify their numerical results. Different trade studies considered in the model development are outlined to demonstrate a suitable level of model fidelity. Some model sensitivities to various parameters are explored using subscale and full system models. Finally, some full system DADS models are exercised to illustrate the limitations of traditional modeling techniques for variable geometry systems which were overcome in the ADAMS model.

Mars↗
DOE OSTI2018

Computational Errors in the Calculation of Long Radioactive Decay Chains

For safety security of objects utilizing atomic energy, the effect of numerical errors on the calculation of the activity and integrals of the activity in time when using Bateman’s formula and Siewers’ algorithm to calculate radioactive decay chains is investigated. The smallest errors obtain when using Siewers’ algorithm and Bateman’s formula together with long arithmetic. It is shown that the standard calculations of radioactive decay chains according to Bateman’s formula with double precision lead to significant errors. However, these errors have almost no effect on the dose characteristics of mixtures of radionuclides. The analysis is based on data contained in ICRP Publication No. 107.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

HTR-1.3 solver: Predicting electrified combustion using the hypersonic task-based research solver

Here this manuscript presents an updated open-source version of the Hypersonics Task-based Research (HTR) solver. The solver, whose main features are presented in Di Renzo et al. (2020) and Di Renzo & Pirozzoli (2021), is designed for direct numerical simulation of reacting flows at high Reynolds numbers. This new version extends the applications of the HTR solver to turbulent combustion in the presence of external electric fields. In particular, a new distributed Poisson solver compatible with heterogeneous architectures has been incorporated in the algorithm to compute the electric potential distribution in bi-periodic configurations. The drift fluxes of the electrically charged species are now included in the transport equations using a targeted essentially non-oscillatory scheme. A verification of these new features of the solver is provided using one-dimensional burner stabilized flames, whereas a three dimensional turbulent flame is utilized to discuss the scalability of the proposed numerical tool.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1983

Multiple-grid convergence acceleration of viscous and inviscid flow computations

A multiple-grid algorithm for use in efficiently obtaining steady solution to the Euler and Navier-Stokes equations is presented. The convergence of a simple, explicit fine-grid solution procedure is accelerated on a sequence of successively coarser grids by a coarse-grid information propagation method which rapidly eliminates transients from the computational domain. This use of multiple-gridding to increase the convergence rate results in substantially reduced work requirements for the numerical solution of a wide range of flow problems. Computational results are presented for subsonic and transonic inviscid flows and for laminar and turbulent, attached and separated, subsonic viscous flows. Work reduction factors as large as eight, in comparison to the basic fine-grid algorithm, were obtained. Possibilities for further performance improvement are discussed.

Johnson, G. M.↗
NASA NTRS1983

Multiple-grid convergence acceleration of viscous and inviscid flow computations

A multiple-grid algorithm for use in efficiently obtaining steady solution to the Euler and Navier-Stokes equations is presented. The convergence of a simple, explicit fine-grid solution procedure is accelerated on a sequence of successively coarser grids by a coarse-grid information propagation method which rapidly eliminates transients from the computational domain. This use of multiple-gridding to increase the convergence rate results is substantially reduced work requirements for the numerical solution of a wide range of flow problems. Computational results are presented for subsonic and transonic inviscid flows and for laminar and turbulent, attached and separated, subsonic viscous flows. Work reduction factors as large as eight, in comparison to the basic fine-grid algorithm, were obtained. Possibilities for further performance improvement are discussed. Previously announced in STAR as N83-21847

Johnson, G. M.↗
DOE OSTI2018

Convergence of the multigrid reduction in time algorithm for the linear elasticity equations

This paper presents some recent advances for parallel-in-time methods applied to linear elasticity. With recent computer architecture changes leading to stagnant clock speeds, but ever increasing numbers of cores, future speedups will be available through increased concurrency. Thus, sequential algorithms, such as time stepping, will suffer a bottleneck. This paper explores multigrid reduction in time (MGRIT) for an important application area, linear elasticity. Previously, efforts at parallel-in-time for elasticity have experienced difficulties, for example, the beating phenomenon. As a result, practical parallel-in-time algorithms for this application area currently do not exist. This paper proposes some solutions made possible by MGRIT (e.g., slow temporal coarsening and FCF-relaxation) and, more importantly, a different formulation of the problem that is more amenable to parallel-in-time methods. Using a recently developed convergence theory for MGRIT and Parareal, we show that the changed formulation of the problem avoids the instability issues and allows the reduction of the error using two temporal grids. We then extend our approach to the multilevel case, where we demonstrate how slow temporal coarsening improves convergence. Finally, the paper ends with supporting numerical results showing a practical algorithm enjoying speedup benefits over the sequential algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2012

Upstream Measurements of Wind Profiles with Doppler Lidar for Improved Wind Energy Integration

New upstream measurements of wind profiles over the altitude range of wind turbines will be produced using a scanning Doppler lidar. These long range high quality measurements will provide improved wind power forecasts for wind energy integration into the power grid. The main goal of the project is to develop the optimal Doppler lidar operating parameters and data processing algorithms for improved wind energy integration by enhancing the wind power forecasts in the 30 to 60 minute time frame, especially for the large wind power ramps. Currently, there is very little upstream data at large wind farms, especially accurate wind profiles over the full height of the turbine blades. The potential of scanning Doppler lidar will be determined by rigorous computer modeling and evaluation of actual Doppler lidar data from the WindTracer system produced by Lockheed Martin Coherent Technologies, Inc. of Louisville, Colorado. Various data products will be investigated for input into numerical weather prediction models and statistically based nowcasting algorithms. Successful implementation of the proposed research will provide the required information for a full cost benefit analysis of the improved forecasts of wind power for energy integration as well as the added benefit of high quality wind and turbulence information for optimal control of the wind turbines at large wind farms.

17 WIND ENERGY↗
DOE OSTI2021

Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations

In this work, we present a fast and approximate multifrontal solver for large-scale sparse linear systems arising from finite-difference, finite-volume or finite-element discretization of high-frequency wave equations. The proposed solver leverages the butterfly algorithm and its hierarchical matrix extension for compressing and factorizing large frontal matrices via graph-distance guided entry evaluation or randomized matrix-vector multiplication-based schemes. Complexity analysis and numerical experiments demonstrate $\mathcal{O}(N\log^2 N)$ computation and $\mathcal{O}(N)$ memory complexity when applied to an $N\times N$ sparse system arising from 3D high-frequency Helmholtz and Maxwell problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Quantum approximate multi-objective optimization

The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

CONORBIT: constrained optimization by radial basis function interpolation in trust regions

Here, this paper presents CONORBIT (CONstrained Optimization by Radial Basis function Interpolation in Trust regions), a derivative-free algorithm for constrained black-box optimization where the objective and constraint functions are computationally expensive. CONORBIT employs a trust-region framework that uses interpolating radial basis function (RBF) models for the objective and constraint functions, and is an extension of the ORBIT algorithm. It uses a small margin for the RBF constraint models to facilitate the generation of feasible iterates, and extensive numerical tests confirm that such a margin is helpful in improving performance. CONORBIT is compared with other algorithms on 27 test problems, a chemical process optimization problem, and an automotive application. Numerical results show that CONORBIT performs better than COBYLA, a sequential penalty derivative-free method, an augmented Lagrangian method, a direct search method, and another RBF-based algorithm on the test problems and on the automotive application.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Preface for the Sherwood Fusion Theory 2021–2022 special collection

The Sherwood Fusion Theory conference has a 60-year history and has been held nearly annually for at least five decades. With theoretical and computational research directed toward fusion energy as an organizing principle, the typical Sherwood program encompasses a wide range of plasma physics topics pertaining to a variety of confinement concepts along with advancements in algorithms and numerical methods for fusion plasma simulations. Additionally, the typical annual meeting comprises roughly a dozen invited talks plus a small number of plenary speakers and several poster sessions. The program committee presents several awards each year to graduate (or undergraduate) students with outstanding poster presentations. Beginning in 2021, both invited speakers and student poster award winners were asked to submit manuscripts for this special collection, which combines contributions from the 2021 and 2022 Sherwood meetings.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2014

A new scheme of causal viscous hydrodynamics for relativistic heavy-ion collisions: A Riemann solver for quark–gluon plasma

In this article, we present a state-of-the-art algorithm for solving the relativistic viscous hydrodynamics equation with the QCD equation of state. The numerical method is based on the second-order Godunov method and has less numerical dissipation, which is crucial in describing of quark–gluon plasma in high-energy heavy-ion collisions. We apply the algorithm to several numerical test problems such as sound wave propagation, shock tube and blast wave problems. In sound wave propagation, the intrinsic numerical viscosity is measured and its explicit expression is shown, which is the second-order of spatial resolution both in the presence and absence of physical viscosity. The expression of the numerical viscosity can be used to determine the maximum cell size in order to accurately measure the effect of physical viscosity in the numerical simulation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗