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 775 records · Page 43
All sourcesNASA NTRSDOE OSTI
NASA NTRS1980

Supersonic flow over three-dimensional ablated nosetips using an unsteady implicit numerical procedure

The three-dimensional supersonic flow over passive, that is, nonablating, indented nosetips of reentry vehicles is determined using an unsteady implicit numerical algorithm which solves either the inviscid Euler equations or the 'thin-layer' Navier-Stokes equations. A nonorthogonal independent variable transformation is used to map the distorted physical domain, containing multiple zones of embedded subsonic flow and separated flow regions into a rectangular computational volume at whose boundaries the required permeable or impermeable boundary conditions are simulated. Use of the implicit algorithm results in faster convergence to the steady state because of a larger allowable time step over conventional explicit schemes. The numerical results obtained compare favorably with existing numerical solutions and experimental data for simple spheres which validates the program. Results are also presented for analytically defined indented bodies for both laminar and turbulent flow conditions that demonstrate the program's capability for computing such flows.

Kutler, P.↗
NASA NTRS1991

Adjoint operator approach to shape design for internal incompressible flows

The problem of determining the profile of a channel or duct that provides the maximum static pressure rise is solved. Incompressible, laminar flow governed by the steady state Navier-Stokes equations is assumed. Recent advances in computational resources and algorithms have made it possible to solve the direct problem of determining such a flow through a body of known geometry. It is possible to obtain a set of adjoint equations, the solution to which permits the calculation of the direction and relative magnitude of change in the diffuser profile that leads to a higher pressure rise. The solution to the adjoint problem can be shown to represent an artificially constructed flow. This interpretation provides a means to construct numerical solutions to the adjoint equations that do not compromise the fully viscous nature of the problem. The algorithmic and computational aspects of solving the adjoint equations are addressed. The form of these set of equations is similar but not identical to the Navier-Stokes equations. In particular some issues related to boundary conditions and stability are discussed.

Cabuk, H.↗
NASA NTRS2003

Numerical Simulation of Turbulent MHD Flows Using an Iterative PNS Algorithm

A new parabolized Navier-Stokes (PNS) algorithm has been developed to efficiently compute magnetohydrodynamic (MHD) flows in the low magnetic Reynolds number regime. In this regime, the electrical conductivity is low and the induced magnetic field is negligible compared to the applied magnetic field. The MHD effects are modeled by introducing source terms into the PNS equation which can then be solved in a very efficient manner. To account for upstream (elliptic) effects, the flowfields are computed using multiple streamwise sweeps with an iterated PNS algorithm. Turbulence has been included by modifying the Baldwin-Lomax turbulence model to account for MHD effects. The new algorithm has been used to compute both laminar and turbulent, supersonic, MHD flows over flat plates and supersonic viscous flows in a rectangular MHD accelerator. The present results are in excellent agreement with previous complete Navier-Stokes calculations.

Kato, Hiromasa↗
DOE OSTI2021

A multiresolution adaptive wavelet method for nonlinear partial differential equations

We report the multiscale complexity of modern problems in computational science and engineering can prohibit the use of traditional numerical methods in multi-dimensional simulations. Therefore, novel algorithms are required in these situations to solve partial differential equations (PDEs) with features evolving on a wide range of spatial and temporal scales. To meet these challenges, we present a multiresolution wavelet algorithm to solve PDEs with significant data compression and explicit error control. We discretize in space by projecting fields and spatial derivative operators onto wavelet basis functions. We provide error estimates for the wavelet representation of fields and their derivatives. Then, our estimates are used to construct a sparse multiresolution discretization which guarantees the prescribed accuracy. Additionally, we embed a predictor-corrector procedure within the temporal integration to dynamically adapt the computational grid and maintain the accuracy of the solution of the PDE as it evolves. We present examples to highlight the accuracy and adaptivity of our approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Generalizing global error estimation for ordinary differential equations by using coupled time-stepping methods

Here, this study introduces new time-stepping strategies with built-in global error estimators. The new methods propagate the defect along with the numerical solution much like solving for the correction or Zadunaisky’s procedure; however, the proposed approach allows for overlapped internal computations and, therefore, represents a generalization of the classical numerical schemes for solving differential equations with global error estimation. The resulting algorithms can be effectively represented as general linear methods. Finally, several explicit self-starting schemes akin to Runge–Kutta methods with global error estimation are introduced, and the theoretical considerations are illustrated in several examples.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

Finite-difference algorithms for the time-domain Maxwell's equations - A numerical approach to RCS analysis

The applications of two CFD-based finite-difference methods to computational electromagnetics are investigated. In the first method, the time-domain Maxwell's equations are solved using the explicit Lax-Wendroff scheme and in the second method, the second-order wave equations satisfying the Maxwell's equations are solved using the implicit Crank-Nicolson scheme. The governing equations are transformed to a generalized curvilinear coordinate system and solved on a body-conforming mesh using the scattered-field formulation. The induced surface current and the bistatic radar cross section are computed and the results are validated for several two-dimensional test cases involving perfectly-conducting scatterers submerged in transverse-magnetic plane waves.

Vinh, Hoang↗
NASA NTRS1990

A comparison of time-optimal interception trajectories for the F-8 and F-15

The simulation results of a real time control algorithm for onboard computation of time-optimal intercept trajectories for the F-8 and F-15 aircraft are given. Due to the inherent aerodynamic and propulsion differences in the aircraft, there are major differences in their optimal trajectories. The significant difference in the two aircrafts are their flight envelopes. The F-8's optimal cruise velocity is thrust limited, while the F-15's optimal cruise velocity is at the intersection of the Mach and dynamic pressure constraint boundaries. This inherent difference necessitated the development of a proportional thrust controller for use as the F-15 approaches it's optimal cruise energy. Documented here is the application of singular perturbation theory to the trajectory optimization problem, along with a summary of the control algorithms. Numerical results for the two aircraft are compared to illustrate the performance of the minimum time algorithm, and to compute the resulting flight paths.

Calise, Anthony J.↗
NASA NTRS1993

A ground track control algorithm for the Topographic Mapping Laser Altimeter (TMLA)

The results of an analysis of an algorithm that will provide autonomous onboard orbit control using orbits determined with Global Positioning System (GPS) data. The algorithm uses the GPS data to (1) compute the ground track error relative to a fixed longitude grid, and (2) determine the altitude adjustment required to correct the longitude error. A program was written on a personal computer (PC) to test the concept for numerous altitudes and values of solar flux using a simplified orbit model including only the J sub 2 zonal harmonic and simple orbit decay computations. The algorithm was then implemented in a precision orbit propagation program having a full range of perturbations. The analysis showed that, even with all perturbations (including actual time histories of solar flux variation), the algorithm could effectively control the spacecraft ground track and yield more than 99 percent Earth coverage in the time required to complete one coverage cycle on the fixed grid (220 to 230 days depending on altitude and overlap allowance).

Blaes, V.↗
DOE OSTI2026

Computational capacity in hydrodynamic real-time hybrid simulation applied to simulate the dynamic response of floating offshore wind turbines

Real-time hybrid simulation (RTHS) mitigates similitude distortions in model-scale tests of floating offshore wind turbines (FOWTs) by coupling physical experiments with numerical models in real time. The coupling requires faster-than-real-time numerical computations to satisfy temporal similitude with the physical experiment, presenting a bottleneck for using more complex numerical models in RTHS. This paper presents a hydrodynamic-RTHS (hydro-RTHS) framework for FOWTs that simulates the hydrodynamics physically and the aerodynamics numerically with sensor feedback from the physical testing. The framework adapts the three-loop hardware architecture to leverage greater computational resources and mitigate strict temporal requirements, enabling more computationally demanding numerical analyses in hydro-RTHS. The three-loop hardware architecture integrates multiple machines, each dedicated to either numerical analysis or RTHS controls, with a rate-transition algorithm to synchronize the tasks executed across the different machine processors. Virtual and physical tests verified and validated the hydro-RTHS framework, respectively. The ”virtual” tests, which approximates the physical domain numerically, verified the RTHS framework with respect to a numerical full-scale complete FOWT model simulated in the open-source software, OpenFAST. The virtual tests were able to maintain comparable control signals while enabling greater computational resources for the numerical calculations. Real-world physical tests demonstrated that the hydro-RTHS framework computes aerodynamic forces similar to the complete OpenFAST model, validating the hydro-RTHS framework using the three-loop hardware architecture. Findings show that the hydro-RTHS framework with the three-loop hardware architecture is computationally efficient, with reserve capacity to simulate more complex problems due to the customized software, hardware, and rate-transition algorithm.

17 WIND ENERGY↗
DOE OSTI2013

Transport-constrained extensions of collision and track length estimators for solutions of radiative transport problems

In this paper we develop novel extensions of collision and track length estimators for the complete space-angle solutions of radiative transport problems. We derive the relevant equations, prove that our new estimators are unbiased, and compare their performance with that of more conventional estimators. Such comparisons based on numerical solutions of simple one dimensional slab problems indicate the the potential superiority of the new estimators for a wide variety of more general transport problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

BEYOND MIXING-LENGTH THEORY: A STEP TOWARD 321D

We examine the physical basis for algorithms to replace mixing-length theory (MLT) in stellar evolutionary computations. Our 321D procedure is based on numerical solutions of the Navier–Stokes equations. These implicit large eddy simulations (ILES) are three-dimensional (3D), time-dependent, and turbulent, including the Kolmogorov cascade. We use the Reynolds-averaged Navier–Stokes (RANS) formulation to make concise the 3D simulation data, and use the 3D simulations to give closure for the RANS equations. We further analyze this data set with a simple analytical model, which is non-local and time-dependent, and which contains both MLT and the Lorenz convective roll as particular subsets of solutions. A characteristic length (the damping length) again emerges in the simulations; it is determined by an observed balance between (1) the large-scale driving, and (2) small-scale damping. The nature of mixing and convective boundaries is analyzed, including dynamic, thermal and compositional effects, and compared to a simple model. We find that (1) braking regions (boundary layers in which mixing occurs) automatically appear beyond the edges of convection as defined by the Schwarzschild criterion, (2) dynamic (non-local) terms imply a non-zero turbulent kinetic energy flux (unlike MLT), (3) the effects of composition gradients on flow can be comparable to thermal effects, and (4) convective boundaries in neutrino-cooled stages differ in nature from those in photon-cooled stages (different Péclet numbers). The algorithms are based upon ILES solutions to the Navier–Stokes equations, so that, unlike MLT, they do not require any calibration to astronomical systems in order to predict stellar properties. Implications for solar abundances, helioseismology, asteroseismology, nucleosynthesis yields, supernova progenitors and core collapse are indicated.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

Numerical methods for high-dimensional probability density function equations

In this paper we address the problem of computing the numerical solution to kinetic partial differential equations involving many phase variables. These types of equations arise naturally in many different areas of mathematical physics, e.g., in particle systems (Liouville and Boltzmann equations), stochastic dynamical systems (Fokker–Planck and Dostupov–Pugachev equations), random wave theory (Malakhov–Saichev equations) and coarse-grained stochastic systems (Mori–Zwanzig equations). We propose three different classes of new algorithms addressing high-dimensionality: The first one is based on separated series expansions resulting in a sequence of low-dimensional problems that can be solved recursively and in parallel by using alternating direction methods. The second class of algorithms relies on truncation of interaction in low-orders that resembles the Bogoliubov–Born–Green–Kirkwood–Yvon (BBGKY) framework of kinetic gas theory and it yields a hierarchy of coupled probability density function equations. The third class of algorithms is based on high-dimensional model representations, e.g., the ANOVA method and probabilistic collocation methods. A common feature of all these approaches is that they are reducible to the problem of computing the solution to high-dimensional equations via a sequence of low-dimensional problems. The effectiveness of the new algorithms is demonstrated in numerical examples involving nonlinear stochastic dynamical systems and partial differential equations, with up to 120 variables.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1987

Transient response for interaction of two dynamic bodies

During the launch sequence of any space vehicle complicated boundary interactions occur between the vehicle and the launch stand. At the start of the sequence large forces exist between the two; contact is then broken in a short but finite time which depends on the release mechanism. The resulting vehicle response produces loads which are very high and often form the design case. It is known that the treatment of the launch pad as a second dynamic body is significant for an accurate prediction of launch response. A technique was developed for obtaining loads generated by the launch transient with the effect of pad dynamics included. The method solves uncoupled vehicle and pad equations of motion. The use of uncoupled models allows the simulation of vehicle launch in a single computer run. Modal formulation allows a closed-form solution to be written, eliminating any need for a numerical integration algorithm. When the vehicle is on the pad the uncoupled pad and vehicle equations have to be modified to account for the constraints they impose on each other. This necessitates the use of an iterative procedure to converge to a solution, using Lagrange multipliers to apply the required constraints. As the vehicle lifts off the pad the coupling between the vehicle and the pad is eliminated point by point until the vehicle flies free. Results obtained by this method were shown to be in good agreement with observed loads and other analysis methods. The resulting computer program is general, and was used without modification to solve a variety of contact problems.

Prabhakar, A.↗
DOE OSTI2019

Pseudo-differential representation of the metaplectic transform and its application to fast algorithms

The metaplectic transform (MT), also known as the linear canonical transform, is a unitary integral mapping that is widely used in signal processing and can be viewed as a generalization of the Fourier transform. For a given function $ψ$ on an $N$-dimensional continuous space q , the MT of $ψ$ is parameterized by a rotation (or more generally, a linear symplectic transformation) of the 2$N$-dimensional phase space ( q,p ), where p is the wavevector space dual to q . In this study, we derive a pseudo-differential form of the MT. For small-angle rotations, or near-identity transformations of the phase space, it readily yields asymptotic differential representations of the MT, which are easy to compute numerically. Rotations by larger angles are implemented as successive applications of $K \gg 1$ small-angle MTs. The algorithm complexity scales as $O(KN^3N_p)$ where $N_p$ is the number of grid points. Here, we present a numerical implementation of this algorithm and discuss how to mitigate the associated numerical instabilities.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2012

Xyce TM Parallel Electronic Simulator: Users’ Guide, Version 5.3

This manual describes the use of the Xyce Parallel Electronic Simulator. Xyce has been designed as a SPICE-compatible, high-performance analog circuit simulator, and has been written to support the simulation needs of the Sandia National Laboratories electrical designers. This development has focused on improving capability over the current state-of-the-art in the following areas: ■ Capability to solve extremely large circuit problems by supporting large-scale parallel computing platforms (up to thousands of processors). Note that this includes support for most popular parallel and serial computers. ■ Improved performance for all numerical kernels (e.g., time integrator, nonlinear and linear solvers) through state-of-the-art algorithms and novel techniques. ■ Device models which are specifically tailored to meet Sandia’s needs, including some radiation-aware devices (for Sandia users only). ■ Object-oriented code design and implementation using modern coding practices that ensure that the Xyce Parallel Electronic Simulator will be maintainable and extensible far into the future. Xyce is a parallel code in the most general sense of the phrase - a message passing parallel implementation - which allows it to run efficiently on the widest possible number of computing platforms. These include serial, shared-memory and distributed-memory parallel as well as heterogeneous platforms. Careful attention has been paid to the specific nature of circuit-simulation problems to ensure that optimal parallel efficiency is achieved as the number of processors grows. The development of Xyce provides a platform for computational research and development aimed specifically at the needs of the Laboratory. With Xyce, Sandia has an “in-house” capability with which both new electrical (e.g., device model development) and algorithmic (e.g., faster time-integration methods, parallel solver algorithms) research and development can be performed. As a result, Xyce is a unique electrical simulation capability, designed to meet the unique needs of the laboratory

42 ENGINEERING↗
DOE OSTI2022

Critical points of the random cluster model with Newman–Ziff sampling

Here, we present a method for computing transition points of the random cluster model using a generalization of the Newman–Ziff algorithm, a celebrated technique in numerical percolation, to the random cluster model. The new method is straightforward to implement and works for real cluster weight q > 0. Furthermore, results for an arbitrary number of values of q can be found at once within a single simulation. Because the algorithm used to sweep through bond configurations is identical to that of Newman and Ziff, which was conceived for percolation, the method loses accuracy for large lattices when q > 1. However, by sampling the critical polynomial, accurate estimates of critical points in two dimensions can be found using relatively small lattice sizes, which we demonstrate here by computing critical points for non-integer values of q on the square lattice, to compare with the exact solution, and on the unsolved non-planar square matching lattice. The latter results would be much more difficult to obtain using other techniques.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1975

A parallel Jacobson-Oksman optimization algorithm

A gradient-dependent optimization technique which exploits the vector-streaming or parallel-computing capabilities of some modern computers is presented. The algorithm, derived by assuming that the function to be minimized is homogeneous, is a modification of the Jacobson-Oksman serial minimization method. In addition to describing the algorithm, conditions insuring the convergence of the iterates of the algorithm and the results of numerical experiments on a group of sample test functions are presented. The results of these experiments indicate that this algorithm will solve optimization problems in less computing time than conventional serial methods on machines having vector-streaming or parallel-computing capabilities.

Straeter, T. A.↗