Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algebraic methods”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Solar system dynamics

The rotational dynamics of irregularly shaped satellites and the origin of Kirkwood Gaps are discussed. The chaotic tumbling of Hyperion and the anomalously low eccentricity of Deimos are examined. The Digital Orrery is used to explore the phase space of the ellipic restricted three body problem near the principal commensurabilities (2/1, 5/2, 3/1, and 3/2). The results for the 3/1 commensurability are in close agreement with those found earlier with the algebraic mapping method. Large chaotic zones are associated with the 3/1, 2/1 and 5/2 resonances, where there are gaps in the distribution of asteroids. The region near the 3/2 resonance, where the Hilda group of asteroids is located, is largely devoid of chaotic behavior. Thus, there is a qualitative agreement between the character of the motion and the distribution of asteroids.

Wisdom, Jack↗
NASA NTRS1987

Numerical analysis of flow through scramjet engine inlets

A set of computer programs has been developed to analyze flow through supersonic combustion ramjet (scramjet) inlets. These programs solve either the two- or three-dimensional Euler/Navier-Stokes equations in full conservation form by MacCormack's explicit or explicit-implicit method. An algebraic two-layer eddy viscosity model is used for turbulent flow calculations. The programs are operational on Control Data CYBER-200 series vector-processing computer system and have been optimized to take maximum advantage of the vector processing capability of the system. Since their development, the programs have been extensively verified and used to analyze a number of very complex inlet configurations. In this paper, results are presented from two-dimensional, quasi-three-dimensional, and three-dimensional analyses of the inlet flow field to illustrate the use of the programs.

Kumar, Ajay↗
NASA NTRS1987

Numerical analysis of flow through scramjet engine inlets

A set of computer programs was developed to analyze flow through supersonic combustion ramjet (scramjet) inlets. These programs solve either the two or three dimensional Euler/Navier-Stokes equations in full conservation form by MacCormack's explicit or explicit-implicit method. An algebraic two-layer eddy viscosity model is used for turbulent flow calculations. The programs are operational in Control Data CYBER-200 series vector-processing computer system and were optimized to take maximum advantage of the vector processing capability of the system. Since their development, the programs were extensively verified and used to analyze a number of very complex inlet configurations. Results are presented from two-dimensional, quasi-three-dimensional, and three-dimensional analyses of the inlet flow field to illustrate the use of the program.

Kumar, Ajay↗
NASA NTRS1987

Navier-Stokes computations for circulation control airfoils

Navier-Stokes computations of subsonic to transonic flow past airfoils with augmented lift due to rearward jet blowing over a curved trailing edge are presented. The approach uses a spiral grid topology. Solutions are obtained using a Navier-Stokes code which employs an implicit finite difference method, an algebraic turbulence model, and developments which improve stability, convergence, and accuracy. Results are compared against experiments for no jet blowing and moderate jet pressures and demonstrate the capability to compute these complicated flows.

Pulliam, Thomas H.↗
NASA NTRS1987

Calculation of wall and free turbulent-shear flows at supersonic speeds

Supersonic turbulent flows are simulated numerically by solving the Reynolds-averaged full Navier-Stokes equations by an implicit finite-volume method. This flux-vector-split upwind scheme uses approximate factorization followed by line-Gauss-Seidel relaxations. The effects of turbulence are modeled by two eddy viscosity models. High-Reynolds-number form of the k-epsilon model is coupled with a wall-function to avoid excessive refinement of the grid in the low-Reynolds number regions. The k-epsilon equations are solved by the explicit-implicit MacCormack method. The algebraic Baldwin-Lomax model is also being used as an inexpensive alternative for the cases which do not experience massive separation. Several examples of two-dimensional solutions are given to illustrate both wall and free turbulent shear flows which include fluid dynamic phenomena, such as shocks, boundary layers, shear layers, wakes, separations and recirculations. The results compared with experimental data show good agreeent.

Baysal, O.↗
NASA NTRS1989

Numerical simulation of flow through a two-strut scramjet inlet

A three-dimensional, Reynolds-averaged Navier-Stokes code has been used to numerically analyze flow through a two-strut, supersonic combustion ramjet (scramjet) inlet configuration. It solves the governing equations in full conservation form using either a fully explicit or explicit-implicit method. An algebraic, two-layer eddy-viscosity model is used for turbulent flow calculations. The analysis allows inclusion of end effects that are caused by the aft placement of the cowl on the underside of the inlet. A special grid has been developed to accommodate the struts embedded in the inlet flowfield. Detailed numerical results are presented here for the two-strut configuration, and a comparison is made with the available experimental results.

Kumar, Ajay↗
NASA NTRS1988

Multiple-block grid adaption for an airplane geometry

Grid-adaption methods are developed with the capability of moving grid points in accordance with several variables for a three-dimensional multiple-block grid system. These methods are algebraic, and they are implemented for the computation of high-speed flow over an airplane configuration.

Abolhassani, Jamshid Samareh↗
NASA NTRS1990

The role of secondary resonances in the orbital history of Miranda

A simple 'perturbed pendulum' model is developed in order to ascertain the origin and dynamics of the secondary resonances in the tidal evolution of Miranda and Umbriel through the 1:3 mean motion commensurability. Long-term evolution is addressed on the basis of the computation-accelerating method of algebraic mappings. It is found that the present 4.34-deg value of Miranda's orbital inclination is probably a result of capture into the primary resonance, as well as subsequent capture into the 3/1 secondary resonance. The damping of an eccentricity as high as 0.035 by tidal dissipation in the satellite may account for the surface features of Miranda.

Malhotra, Renu↗
NASA NTRS1994

Program Generates Two-Dimensional Computational Grids

TDIGG is fast and versatile computer program for generating two-dimensional computational grids for use in programs solving equations of flow by finite-difference methods. Both algebraic and elliptic grid-generation systems included. Enables user to view results of each iteration. Written in FORTRAN 77.

Vu, Bruce T.↗
NASA NTRS1995

Multigrid techniques for unstructured meshes

An overview of current multigrid techniques for unstructured meshes is given. The basic principles of the multigrid approach are first outlined. Application of these principles to unstructured mesh problems is then described, illustrating various different approaches, and giving examples of practical applications. Advanced multigrid topics, such as the use of algebraic multigrid methods, and the combination of multigrid techniques with adaptive meshing strategies are dealt with in subsequent sections. These represent current areas of research, and the unresolved issues are discussed. The presentation is organized in an educational manner, for readers familiar with computational fluid dynamics, wishing to learn more about current unstructured mesh techniques.

Mavriplis, D. J.↗
NASA NTRS2018

Analytic Expressions for Derivatives from Series Solutions to the Three Body Problem

This paper presents a notation system to facilitate to solution of differential equations via Taylor series expansions and applies it to solve the circular restricted three body problem. Unlike previous Taylor series methods in the astrodynamics literature, computer algebra solvers are not used. Instead the notation system allows one to solve a system of differential equations analytically “by hand” without resorting to computer algebra software. This method produces recurrence relations explicitly in terms of a sequence of derivatives of the state with respect to time for the coefficients of Taylor Series solutions that can be evaluated numerically or manipulated further to investigate properties of the solution. For example, additional derivatives with respect to other parameters may also be found, including those that describe the dependence of the solution on initial conditions.

Strange, Nathan↗
DOE OSTI2024

An Efficient Numerical Algorithm for Solving Coupled Time-Dependent Ginzburg-Landau Equation for Superconductivity and Elasticity

A decoupled finite element algorithm is developed for simulating the vortex dynamics on an elastic superconductor which couples the time-dependent Ginzburg- Landau equation with the complex-valued superconducting order parameter and the vector-valued magnetic potential, and the elasticity equation. We present an iterative algorithm for the decoupled system arising from the time and spatial discretization using a combination of preconditioner, algebraic multigrid method (AMG) and preconditioned conjugate gradient method (PCG). The iterative algorithm allows us to perform large-scale three-dimensional simulations of mesoscale pattern formation during superconducting phase transitions with arbitrary elastic boundary conditions. Here, the performance and efficiency of the algorithm are numerically verified by several benchmark problems, exhibiting up to two orders of magnitude improvement depending on the scale of discrete system compared to the exact solver.

Efficiency↗
DOE OSTI2024

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

Some Aspects of Multigrid Methods on Non-Structured Meshes

To solve a given fine mesh problem, the design of a multigrid method requires the definition of coarse levels, associated coarse grid operators and inter-grid transfer operators. For non-structured simplified meshes, these definitions can rely on the use of non-nested triangulations. These definitions can also be founded on agglomeration/aggregation techniques in a purely algebraic manner. This paper analyzes these two options, shows the connections of the volume-agglomeration method with algebraic methods and proposes a new definition of prolongation operator suitable for the application of the volume-agglomeration method to elliptic problems.

Guillard, H.↗
DOE OSTI2021

Using computational singular perturbation as a diagnostic tool in ODE and DAE systems: a case study in heterogeneous catalysis

We have extended the computational singular perturbation (CSP) method to differential algebraic equation (DAE) systems and demonstrated its application in a heterogeneous-catalysis problem. The extended method obtains the CSP basis vectors for DAEs from a reduced Jacobian matrix that takes the algebraic constraints into account. Here we use a canonical problem in heterogeneous catalysis, the transient continuous stirred tank reactor (T-CSTR), for illustration. The T-CSTR problem is modelled fundamentally as an ordinary differential equation (ODE) system, but it can be transformed to a DAE system if one approximates typically fast surface processes using algebraic constraints for the surface species. We demonstrate the application of CSP analysis for both ODE and DAE constructions of a T-CSTR problem, illustrating the dynamical response of the system in each case. We also highlight the utility of the analysis in commenting on the quality of any particular DAE approximation built using the quasi-steady state approximation (QSSA), relative to the ODE reference case.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1983

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problems preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗
NASA NTRS1986

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problem preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗