SEARCH · Search NASA

Results for “preconditioning”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 253 records · Page 14

All sources NASA NTRS DOE OSTI

NASA NTRS1984

The numerical solution of the Helmholtz equation for wave propagation problems in underwater acoustics

The Helmholtz Equation (-delta-K(2)n(2))u=0 with a variable index of refraction, n, and a suitable radiation condition at infinity serves as a model for a wide variety of wave propagation problems. A numerical algorithm was developed and a computer code implemented that can effectively solve this equation in the intermediate frequency range. The equation is discretized using the finite element method, thus allowing for the modeling of complicated geometrices (including interfaces) and complicated boundary conditions. A global radiation boundary condition is imposed at the far field boundary that is exact for an arbitrary number of propagating modes. The resulting large, non-selfadjoint system of linear equations with indefinite symmetric part is solved using the preconditioned conjugate gradient method applied to the normal equations. A new preconditioner is developed based on the multigrid method. This preconditioner is vectorizable and is extremely effective over a wide range of frequencies provided the number of grid levels is reduced for large frequencies. A heuristic argument is given that indicates the superior convergence properties of this preconditioner.

Bayliss, A.↗

NASA NTRS1984

Boundary conditions in Chebyshev and Legendre methods

Two different ways of treating non-Dirichlet boundary conditions in Chebyshev and Legendre collocation methods are discussed for second order differential problems. An error analysis is provided. The effect of preconditioning the corresponding spectral operators by finite difference matrices is also investigated.

Canuto, C.↗

NASA NTRS1984

OTV fluid mangement systems

Design, performance, and technology issues associated with reduced gravity propellant management for orbital transfer vehicles (OTV's) are reviewed. The in-space cryogenic management state-of-technology significantly affects the overall confidence level associated with a resupply mission and propulsion performance. Cryogen resupply sequences, timelines, controls, and associated crew involvement are all affected by the technology state. Additionally, OTV propellant tankage configurations, tankage thermodynamic conditions, acceleration environment, propulsion interfaces, and instrumentation are significant factors. Basic propellant transfer phases examined that drive orbital servicing requirements include: (1) tankage preconditioning; (2) tankage chilldown; and (3) propellant fill. Propellant management support of the OTV propulsion phases includes engine restart requirements and orbital coast between engine burns. Technology activities in support of identified technology issues are reviewed.

Hastings, L.↗

NASA NTRS1985

Newton-like minimal residual methods applied to transonic flow calculations

A computational technique for the solution of the full potential equation is presented. The method consists of outer and inner iterations. The outer iterate is based on a Newton like algorithm, and a preconditioned Minimal Residual method is used to seek an approximate solution of the system of linear equations arising at each inner iterate. The present iterative scheme is formulated so that the uncertainties and difficulties associated with many iterative techniques, namely the requirements of acceleration parameters and the treatment of additional boundary conditions for the intermediate variables, are eliminated. Numerical experiments based on the new method for transonic potential flows around the NACA 0012 airfoil at different Mach numbers and different angles of attack are presented, and these results are compared with those obtained by the Approximate Factorization technique. Extention to three dimensional flow calculations and application in finite element methods for fluid dynamics problems by the present method are also discussed. The Inexact Newton like method produces a smoother reduction in the residual norm, and the number of supersonic points and circulations are rapidly established as the number of iterations is increased.

Wong, Y. S.↗

NASA NTRS1985

Simultaneous analysis and design

Optimization techniques are increasingly being used for performing nonlinear structural analysis. The development of element by element (EBE) preconditioned conjugate gradient (CG) techniques is expected to extend this trend to linear analysis. Under these circumstances the structural design problem can be viewed as a nested optimization problem. There are computational benefits to treating this nested problem as a large single optimization problem. The response variables (such as displacements) and the structural parameters are all treated as design variables in a unified formulation which performs simultaneously the design and analysis. Two examples are used for demonstration. A seventy-two bar truss is optimized subject to linear stress constraints and a wing box structure is optimized subject to nonlinear collapse constraints. Both examples show substantial computational savings with the unified approach as compared to the traditional nested approach.

Haftka, R. T.↗

NASA NTRS1985

Sensitivity calculations for iteratively solved problems

The calculation of sensitivity derivatives of solutions of iteratively solved systems of algebraic equations is investigated. A modified finite difference procedure is presented which improves the accuracy of the calculated derivatives. The procedure is demonstrated for a simple algebraic example as well as an element-by-element preconditioned conjugate gradient iterative solution technique applied to truss examples.

Haftka, R. T.↗

NASA NTRS1985

Numerical Techniques for Scattering from Submerged Objects

To represent the final results in terms of matrices, one expands all appropriate physical quantities in terms of partial wave basis states. This includes expansions for the incident and scattered fields and the surface quantities. The method then utilizes the Huygen-Poincare integral representation for both the exterior and interior solutions, leading to the required matrix equations. One thus deals with matrix equations, the complexity of which depends on the nature of the problem. It is shown that in general a transition matrix T can be obtained relating the incident field A with the scattered field f having the form T = PQ(-1), where f = TA. The structure of Q can be quite complicated and can itself be composed of other matrix inversions such as arise from layered objects. Recent improvements in this method appropriate for a variety of physical problems are focused on, and on their implementation. Results are outlined from scattering simulations for very elongated submerged objects and resonance scattering from elastic solids and shells. The final improvement concerns eigenfunction expansions of surface terms, arising from solution of the interior problem, obtained via a preconditioning technique. This effectively reduces the problem to that of obtaining eigenvalues of a Hermitian operator. This formalism is reviewed for scattering from targets that are rigid, sound-soft, acoustic, elastic solids, elastic shells, and elastic layered objects. Two sets of the more interesting results are presented. The first concerns scattering from elongated objects, and the second to thin elastic spheroids.

Werby, M. F.↗

NASA NTRS1986

Multi-color incomplete Cholesky conjugate gradient methods for vector computers

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Poole, E. L.↗

NASA NTRS1985

A spectral collocation method for the Navier-Stokes equations

A Fourier-Chebyshev spectral method for the incompressible Navier-Stokes equations is described. It is applicable to a variety of problems including some with fluid properties which vary strongly both in the normal direction and in time. In this fully spectral algorithm, a preconditioned iterative technique is used for solving the implicit equations arising from semi-implicit treatment of pressure, mean advection and vertical diffusion terms. The algorithm is tested by applying it to hydrodynamic stability problems in channel flow and in external boundary layers with both constant and variable viscosity.

Malik, M. R.↗

NASA NTRS1986

A theoretical study of the production and decay of localized electron density enhancements in the polar ionosphere

Uniform convection patterns were introduced into a high latitude time-dependent F region model (HLTD) to study if soft auroral particle precipitation is a necessary precondition to blob formation in the ionosphere. Attention was limited to the conditions leading to the formation of parent blobs (dimensions of at least 10 km) due to plasma instabilities. Consideration was given to the effects of discrete auroral structures and to different O(+) precipitation ionization rate profiles during solar maximum conditions in the thermosphere. Blobs were assumed to be produced on the dayside due to ionization caused by sun-aligned arcs. The simulations indicated that parent blobs would form whenever plasma flux tubes in the ionosphere were exposed to soft particle precipitation lasting more than 10 min. The blobs cease to exist when convected to a region with a high particle production rate where the background particle density exceeds that of the blobs. Conditions wherein either hard or soft particle production can produce blobs are outlined.

Sojka, J. J.↗

NASA NTRS1985

Iterative methods for mixed finite element equations

Iterative strategies for the solution of indefinite system of equations arising from the mixed finite element method are investigated in this paper with application to linear and nonlinear problems in solid and structural mechanics. The augmented Hu-Washizu form is derived, which is then utilized to construct a family of iterative algorithms using the displacement method as the preconditioner. Two types of iterative algorithms are implemented. Those are: constant metric iterations which does not involve the update of preconditioner; variable metric iterations, in which the inverse of the preconditioning matrix is updated. A series of numerical experiments is conducted to evaluate the numerical performance with application to linear and nonlinear model problems.

Nakazawa, S.↗

NASA NTRS1986

Grain processes in massive star formation

Observational evidence suggests that stars greater than 100 M(solar) exist in the Galaxy and Large Magellanic Cloud (LMC), however classical star formation theory predicts stellar mass limits of only approx. 60 M(solar). A protostellar accretion flow consists of inflowing gas and dust. Grains are destroyed as they are near the central protostar creating a dust shell or cocoon. Radiation pressure acting on the grain can halt the inflow of material thereby limiting the amount of mass accumulated by the protostar. We first consider rather general constraints on the initial grain to gas ratio and mass accretion rates that permit inflow. We further constrain these results by constructing a numerical model. Radiative deceleration of grains and grain destruction processes are explicitly accounted for in an iterative solution of the radiation-hydrodynamic equations. Findings seem to suggest that star formation by spherical accretion requires rather extreme preconditioning of the grain and gas environment.

Wolfire, M. G.↗

NASA NTRS1986

Iterative methods for elliptic finite element equations on general meshes

Iterative methods for arbitrary mesh discretizations of elliptic partial differential equations are surveyed. The methods discussed are preconditioned conjugate gradients, algebraic multigrid, deflated conjugate gradients, an element-by-element techniques, and domain decomposition. Computational results are included.

Nicolaides, R. A.↗

NASA NTRS1987

A strategy for automatically generating programs in the lucid programming language

A strategy for automatically generating and verifying simple computer programs is described. The programs are specified by a precondition and a postcondition in predicate calculus. The programs generated are in the Lucid programming language, a high-level, data-flow language known for its attractive mathematical properties and ease of program verification. The Lucid programming is described, and the automatic program generation strategy is described and applied to several example problems.

Johnson, Sally C.↗

NASA NTRS1986

Research on Computational Fluid Dynamics and Turbulence

Preconditioning matrices for Chebyshev derivative operators in several space dimensions; the Jacobi matrix technique in computational fluid dynamics; and Chebyshev techniques for periodic problems are discussed.

Source record↗

NASA NTRS1987

Galerkin/Runge-Kutta discretizations for parabolic equations with time dependent coefficients

A new class of fully discrete Galerkin/Runge-Kutta methods is constructed and analyzed for linear parabolic initial boundary value problems with time dependent coefficients. Unlike any classical counterpart, this class offers arbitrarily high order convergence while significantly avoiding what has been called order reduction. In support of this claim, error estimates are proved, and computational results are presented. Additionally, since the time stepping equations involve coefficient matrices changing at each time step, a preconditioned iterative technique is used to solve the linear systems only approximately. Nevertheless, the resulting algorithm is shown to preserve the original convergence rate while using only the order of work required by the base scheme applied to a linear parabolic problem with time independent coefficients. Furthermore, it is noted that special Runge-Kutta methods allow computations to be performed in parallel so that the final execution time can be reduced to that of a low order method.

Keeling, Stephen L.↗

NASA NTRS1986

An exterior Poisson solver using fast direct methods and boundary integral equations with applications to nonlinear potential flow

A general method is developed combining fast direct methods and boundary integral equation methods to solve Poisson's equation on irregular exterior regions. The method requires O(N log N) operations where N is the number of grid points. Error estimates are given that hold for regions with corners and other boundary irregularities. Computational results are given in the context of computational aerodynamics for a two-dimensional lifting airfoil. Solutions of boundary integral equations for lifting and nonlifting aerodynamic configurations using preconditioned conjugate gradient are examined for varying degrees of thinness.

Young, D. P.↗

NASA NTRS1987

TRANAIR - A computer code for transonic analyses of arbitrary configurations

Attention is given to a new approach to solving full potential equations about arbitrary configurations. Numerical algorithms from such fields as finite elements, preconditioned Krylov subspace methods, discrete Fourier analysis, and integral equations are combined to take advantage of the size and speed of current and emerging supercomputers. On the basis of this appraoch, a robust, efficient and easy to use computer code referred to as TRANAIR has been developed for transonic analysis of complex geometries.

Samant, S. S.↗