Gradient methods in control theory. Part 5 - Sequential gradient-restoration algorithm, additional numerical examples
Numerical examples for sequential gradient restoration algorithm
Damoulakis, J. N.↗
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.
Computational Aeroacoustic Analysis System Development
Many industrial and commercial products operate in a dynamic flow environment and the aerodynamically generated noise has become a very important factor in the design of these products. In light of the importance in characterizing this dynamic environment, Rocketdyne has initiated a multiyear effort to develop an advanced general-purpose Computational Aeroacoustic Analysis System (CAAS) to address these issues. This system will provide a high fidelity predictive capability for aeroacoustic design and analysis. The numerical platform is able to provide high temporal and spatial accuracy that is required for aeroacoustic calculations through the development of a high order spectral element numerical algorithm. The analysis system is integrated with well-established CAE tools, such as a graphical user interface (GUI) through PATRAN, to provide cost-effective access to all of the necessary tools. These include preprocessing (geometry import, grid generation and boundary condition specification), code set up (problem specification, user parameter definition, etc.), and postprocessing. The purpose of the present paper is to assess the feasibility of such a system and to demonstrate the efficiency and accuracy of the numerical algorithm through numerical examples. Computations of vortex shedding noise were carried out in the context of a two-dimensional low Mach number turbulent flow past a square cylinder. The computational aeroacoustic approach that is used in CAAS relies on coupling a base flow solver to the acoustic solver throughout a computational cycle. The unsteady fluid motion, which is responsible for both the generation and propagation of acoustic waves, is calculated using a high order flow solver. The results of the flow field are then passed to the acoustic solver through an interpolator to map the field values into the acoustic grid. The acoustic field, which is governed by the linearized Euler equations, is then calculated using the flow results computed from the flow solver.
Hadid, A.↗
A simple time-accurate turbomachinery algorithm with numerical solutions of an uneven blade count configuration
The present computer algorithm for the time-accurate flow analysis of rotating turbomachines is based on the finite-volume method and employs a high-resolution approximate Riemann solver for interface flux definitions and an implicit numerical scheme that possesses apparent unconditional stability. Block-block interfaces, including dynamic ones, are treated in such a way as to mimic interior block communication. The turbomachine configurations treated by way of illustration are 8-8-bladed and 11-9-bladed versions of a contrarotating unducted fan engine.
Janus, J. Mark↗
Numerical Generation of Asymmetric Flows about Slender Bodies of Revolution at Extreme Incidence
It is well known that slender bodies of revolution will develop an asymmetric, unsteady flow pattern in experimental tests, if the angle of incidence to the oncoming stream is above a critical value. It has been suggested that the origin of these asymmetric flows may stem from geometric imperfections of the model being tested, or from disturbances in the oncoming stream. In numerical simulations, it is possible to generate bodies of revolution which are perfectly symmetric about their longitudinal axis, and to impose uniform flow conditions which are free from disturbances. The current work presents numerical simulations of the flow about an ogive-cylinder configuration at 40 and 60 degree angle of incidence. These simulations. were performed using numerical algorithms which are also symmetric about the lateral plane of the cylinder body. The flowfields at 40 degree angle of attack were seen to remain symmetric to the round-off accuracy of the computer. At 60 degree angle of attack, a lateral force coefficient developed of O(1) which progressed to an alternate vortex shedding in time. The nature of this lateral force generation and vortex shedding was dependent on the choice of numerical algorithm. The origin of the asymmetries observed in the 60 degree angle of attack computations were traced to round-off errors in the implicit block-matrix inverter. A means of inverting the implicit operator matrices, which maintains the symmetry of the overall numerical algorithm was implemented.
Murman, Scott M.↗
The application of generalized, cyclic, and modified numerical integration algorithms to problems of satellite orbit computation
Generalized, cyclic, and modified multistep numerical integration methods are developed and evaluated for application to problems of satellite orbit computation. Generalized methods are compared with the presently utilized Cowell methods; new cyclic methods are developed for special second-order differential equations; and several modified methods are developed and applied to orbit computation problems. Special computer programs were written to generate coefficients for these methods, and subroutines were written which allow use of these methods with NASA's GEOSTAR computer program.
Chesler, L.↗
The computation of pi to 29,360,000 decimal digits using Borweins' quartically convergent algorithm
The quartically convergent numerical algorithm developed by Borwein and Borwein (1987) for 1/pi is implemented via a prime-modulus-transform multiprecision technique on the NASA Ames Cray-2 supercomputer to compute the first 2.936 x 10 to the 7th digits of the decimal expansion of pi. The history of pi computations is briefly recalled; the most recent algorithms are characterized; the implementation procedures are described; and samples of the output listing are presented. Statistical analyses show that the present decimal expansion is completely random, with only acceptable numbers of long repeating strings and single-digit runs.
Bailey, David H.↗
Transonic Navier-Stokes solutions of three-dimensional afterbody flows
The performance of a three-dimensional Navier-Stokes solution technique in predicting the transonic flow past a nonaxisymmetric nozzle was investigated. The investigation was conducted at free-stream Mach numbers ranging from 0.60 to 0.94 and an angle of attack of 0 degrees. The numerical solution procedure employs the three-dimensional, unsteady, Reynolds-averaged Navier-Stokes equations written in strong conservation form, a thin layer assumption, and the Baldwin-Lomax turbulence model. The equations are solved by using the finite-volume principle in conjunction with an approximately factored upwind-biased numerical algorithm. In the numerical procedure, the jet exhaust is represented by a solid sting. Wind-tunnel data with the jet exhaust simulated by high pressure air were also obtained to compare with the numerical calculations.
Compton, William B., III↗
From differential to difference equations for first order ODEs
When constructing an algorithm for the numerical integration of a differential equation, one should first convert the known ordinary differential equation (ODE) into an ordinary difference equation. Given this difference equation, one can develop an appropriate numerical algorithm. This technical note describes the derivation of two such ordinary difference equations applicable to a first order ODE. The implicit ordinary difference equation has the same asymptotic expansion as the ODE itself, whereas the explicit ordinary difference equation has an asymptotic that is similar in structure but different in value when compared with that of the ODE.
Freed, Alan D.↗
Iterative algorithms and numerical problems of the theory of plates and shells
Digital computer approach to elasticity theory problems using program based on iterative algorithms
ITERATIVE SOLUTION↗
Algorithms for the Fractional Calculus: A Selection of Numerical Methods
Many recently developed models in areas like viscoelasticity, electrochemistry, diffusion processes, etc. are formulated in terms of derivatives (and integrals) of fractional (non-integer) order. In this paper we present a collection of numerical algorithms for the solution of the various problems arising in this context. We believe that this will give the engineer the necessary tools required to work with fractional models in an efficient way.
Diethelm, K.↗
Toward Immersed Boundary Simulation of High Reynolds Number Flows
In the immersed boundary (IB) method, the surface of an object is reconstructed with forcing terms in the underlying flow field equations. The surface may split a computational cell removing the constraint of the near wall gridlines to be aligned with the surface. This feature greatly simplifies the grid generation process which is cumbersome and expensive in particular for structured grids and complex geometries. The IB method is ideally suited for Cartesian flow solvers. The flow equations written in Cartesian coordinates appear in a very simple form and several numerical algorithms can be used for an efficient solution of the equations. In addition, the accuracy of numerical algorithms is dependent on the underlying grid and it usually deteriorates when the grid deviates from a Cartesian mesh. The challenge for the IB method lies in the representation of the wall boundaries and in providing an adequate near wall flow field resolution. The issue of enforcing no-slip boundary conditions at the immersed surface has been addressed by several authors by imposing a local reconstruction of the solution. Initial work by Verzicco et al. was based on a simple linear, one-dimensional operator and this approach proved to be accurate for boundaries largely aligned with the grid lines. Majumdar et al. used various multidimensional and high order polynomial interpolations schemes. These high order schemes, however, are keen to introduce wiggles and spurious extrema. Iaccarino & Verzicco and Kalitzin & Iaccarino proposed a tri-linear reconstruction for the velocity components and the turbulent scalars. A modified implementation that has proven to be more robust is reported in this paper. The issue of adequate near wall resolution in a Cartesian framework can initially be addressed by using a non-uniform mesh which is stretched near the surface. In this paper, we investigate an unstructured approach for local grid refinement that utilizes Cartesian mesh features. The computation of high Reynolds number wall bounded flows is particularly challenging as it requires the consideration of thin turbulent boundary layers, i.e. near wall regions with large gradients of the flow field variables. For such flows, the representation of the wall boundary has a large impact on the accuracy of the computation. It is also critical for the robustness and convergence of the flow solver.
Kalitzin, Georgi↗
Parallel language constructs for tensor product computations on loosely coupled architectures
A set of language primitives designed to allow the specification of parallel numerical algorithms at a higher level is described. The authors focus on tensor product array computations, a simple but important class of numerical algorithms. They consider first the problem of programming one-dimensional kernel routines, such as parallel tridiagonal solvers, and then look at how such parallel kernels can be combined to form parallel tensor product algorithms.
Mehrotra, Piyush↗
Parallel language constructs for tensor product computations on loosely coupled architectures
Distributed memory architectures offer high levels of performance and flexibility, but have proven awkard to program. Current languages for nonshared memory architectures provide a relatively low level programming environment, and are poorly suited to modular programming, and to the construction of libraries. A set of language primitives designed to allow the specification of parallel numerical algorithms at a higher level is described. Tensor product array computations are focused on along with a simple but important class of numerical algorithms. The problem of programming 1-D kernal routines is focused on first, such as parallel tridiagonal solvers, and then how such parallel kernels can be combined to form parallel tensor product algorithms is examined.
Mehrotra, Piyush↗
Numerical advection algorithms and their role in atmospheric transport and chemistry models
During the last 35 years, well over 100 algorithms for modeling advection processes have been described and tested. This review summarizes the development and improvements that have taken place. The nature of the errors caused by numerical approximation to the advection equation are highlighted. Then the particular devices that have been proposed to remedy these errors are discussed. The extensive literature comparing transport algorithms is reviewed. Although there is no clear cut 'best' algorithm, several conclusions can be made. Spectral and pseudospectral techniques consistently provide the highest degree of accuracy, but expense and difficulties assuring positive mixing ratios are serious drawbacks. Schemes which consider fluid slabs bounded by grid points (volume schemes), rather than the simple specification of constituent values at the grid points, provide accurate positive definite results.
Rood, Richard B.↗
A conservative implicit finite difference algorithm for the unsteady transonic full potential equation
An implicit finite difference procedure is developed to solve the unsteady full potential equation in conservation law form. Computational efficiency is maintained by use of approximate factorization techniques. The numerical algorithm is first order in time and second order in space. A circulation model and difference equations are developed for lifting airfoils in unsteady flow; however, thin airfoil body boundary conditions have been used with stretching functions to simplify the development of the numerical algorithm.
Steger, J. L.↗
Numerically efficient algorithm for model development of high-order systems
A technique for estimating transfer functions in partial fraction expansion form from frequency response data for a high-order system is presented. The problem formulation avoids many of the numerical difficulties associated with high-order polynomials and has the advantage of having the option to fix the camping and frequency of a mode, if known, during the estimation process. The resulting transfer function(s) may be converted to Jordan-Form time domain equations directly. During the implementation of this technique, a frequency and amplitude normalizing window was developed that maximized the efficiency of the optimization algorithm. The combination of estimating the transfer function in factored form, the ability to fix preciously determined parameters and the effectiveness of the normalizing window led to a progressive approach to synthesizing transfer functions from frequency response data for high-order systems.
Parada, L. O.↗
On the Solution of the Three-Dimensional Flowfield About a Flow-Through Nacelle
The solution of the three dimensional flow field for a flow through nacelle was studied. Both inviscid and viscous inviscid interacting solutions were examined. Inviscid solutions were obtained with two different computational procedures for solving the three dimensional Euler equations. The first procedure employs an alternating direction implicit numerical algorithm, and required the development of a complete computational model for the nacelle problem. The second computational technique employs a fourth order Runge-Kutta numerical algorithm which was modified to fit the nacelle problem. Viscous effects on the flow field were evaluated with a viscous inviscid interacting computational model. This model was constructed by coupling the explicit Euler solution procedure with a flag entrainment boundary layer solution procedure in a global iteration scheme. The computational techniques were used to compute the flow field for a long duct turbofan engine nacelle at free stream Mach numbers of 0.80 and 0.94 and angles of attack of 0 and 4 deg.
Compton, William Bernard↗
Algorithms for numerically stable scattering amplitudes
The numerically stable evaluation of scattering matrix elements near the infrared limit of gauge theories is of great importance for the success of collider physics experiments. We present a novel algorithm that utilizes double-precision arithmetic and reaches higher precision than a naive quadruple-precision implementation at smaller computational cost. The method is based on physics-driven modifications to propagators, vertices, and external polarizations. Published by the American Physical Society 2024
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗