Search NASA⌕ Search

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.

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

At least 343 records · Page 19

A natural partitioning scheme for parallel simulation of multibody systems

A parallel partitioning scheme based on physical-co-ordinate variables is presented to systematically eliminate system constraint forces and yield the equations of motion of multibody dynamics systems in terms of their independent coordinates. Key features of the present scheme include an explicit determination of the independent coordinates, a parallel construction of the null space matrix of the constraint Jacobian matrix, an easy incorporation of the previously developed two-stage staggered solution procedure and a Schur complement based parallel preconditioned conjugate gradient numerical algorithm.

Chiou, J. C.↗

Three-dimensional unstructured grid Euler computations using a fully-implicit, upwind method

A method has been developed to solve the Euler equations on a three-dimensional unstructured grid composed of tetrahedra. The method uses an upwind flow solver with a linearized, backward-Euler time integration scheme. Each time step results in a sparse linear system of equations which is solved by an iterative, sparse matrix solver. Local-time stepping, switched evolution relaxation (SER), preconditioning and reuse of the Jacobian are employed to accelerate the convergence rate. Implicit boundary conditions were found to be extremely important for fast convergence. Numerical experiments have shown that convergence rates comparable to that of a multigrid, central-difference scheme are achievable on the same mesh. Results are presented for several grids about an ONERA M6 wing.

Whitaker, David L.↗

On solving the compressible Navier-Stokes equations for unsteady flows at very low Mach numbers

The properties of a preconditioned, coupled, strongly implicit finite-difference scheme for solving the compressible Navier-Stokes equations in primitive variables are investigated for two unsteady flows at low speeds, namely the impulsively started driven cavity and the startup of pipe flow. For the shear-driven cavity flow, the computational effort was observed to be nearly independent of Mach number, especially at the low end of the range considered. This Mach number independence was also observed for steady pipe flow calculations; however, rather different conclusions were drawn for the unsteady calculations. In the pressure-driven pipe startup problem, the compressibility of the fluid began to significantly influence the physics of the flow development at quite low Mach numbers. The present scheme was observed to produce the expected characteristics of completely incompressible flow when the Mach number was set at very low values. Good agreement with incompressible results available in the literature was observed.

Pletcher, R. H.↗

Nonrecursive formulations of multibody dynamics and concurrent multiprocessing

Since the late 1980's, research in recursive formulations of multibody dynamics has flourished. Historically, much of this research can be traced to applications of low dimensionality in mechanism and vehicle dynamics. Indeed, there is little doubt that recursive order N methods are the method of choice for this class of systems. This approach has the advantage that a minimal number of coordinates are utilized, parallelism can be induced for certain system topologies, and the method is of order N computational cost for systems of N rigid bodies. Despite the fact that many authors have dismissed redundant coordinate formulations as being of order N(exp 3), and hence less attractive than recursive formulations, we present recent research that demonstrates that at least three distinct classes of redundant, nonrecursive multibody formulations consistently achieve order N computational cost for systems of rigid and/or flexible bodies. These formulations are as follows: (1) the preconditioned range space formulation; (2) penalty methods; and (3) augmented Lagrangian methods for nonlinear multibody dynamics. The first method can be traced to its foundation in equality constrained quadratic optimization, while the last two methods have been studied extensively in the context of coercive variational boundary value problems in computational mechanics. Until recently, however, they have not been investigated in the context of multibody simulation, and present theoretical questions unique to nonlinear dynamics. All of these nonrecursive methods have additional advantages with respect to recursive order N methods: (1) the formalisms retain the highly desirable order N computational cost; (2) the techniques are amenable to concurrent simulation strategies; (3) the approaches do not depend upon system topology to induce concurrency; and (4) the methods can be derived to balance the computational load automatically on concurrent multiprocessors. In addition to the presentation of the fundamental formulations, this paper presents new theoretical results regarding the rate of convergence of order N constraint stabilization schemes associated with the newly introduced class of methods.

Kurdila, Andrew J.↗

Removal of carbonaceous contaminants from silica aerogel

Capture of micrometeorite material from low Earth orbit or dust grains around active comets for return to terrestrial laboratories, capable of practicing the most up to date techniques of chemical isotopic and mineralogical analysis, will greatly enhance our knowledge of primitive material in the solar system. The next generation of space launched cosmic dust collectors will undoubtedly include extremely low density target materials such as silica aerogel as the decelerating and arresting medium. This material has been found to be clean from the point of view of inorganic elements and is thus acceptable for the purpose of harvesting grains to be studied by, for example PIXE, INAA, or SXRF. However, the process used in making aerogel leaves substantial carbon and hydrogen containing residues which would negate their suitability for collection and subsequent investigation of the very important CHON particles. Attempts to precondition aerogel by solvent extraction or heating at 500 C and 750 C in air for 24 hours or under a vacuum of 2(7)(exp -7) torr at 260 C were largely ineffective except that pyrolysis did reduce volatile species. In this investigation we have examined the use of supercritical fluids for the purpose of extracting organic residues. The logic of the new approach is that beyond the supercritical point a substance has the solvating properties of a liquid but the viscosity characteristics of a gas. For example carbon dioxide becomes supercritical at a pressure of 73 atmospheres and a temperature of 31 C; in consequence it can transform to a very powerful and ultraclean solvent. It can dissolve organic matter from low molecular weight up to molecules containing 90 carbon atoms. On release of pressure the fluid reverts to a gas which can easily be pumped away and removed from the substrate being extracted.

Huang, Hui-Ping↗

On solving the compressible Navier-Stokes equations for unsteady flows at very low Mach numbers

The properties of a preconditioned, coupled, strongly implicit finite difference scheme for solving the compressible Navier-Stokes equations in primitive variables are investigated for two unsteady flows at low speeds, namely the impulsively started driven cavity and the startup of pipe flow. For the shear-driven cavity flow, the computational effort was observed to be nearly independent of Mach number, especially at the low end of the range considered. This Mach number independence was also observed for steady pipe flow calculations; however, rather different conclusions were drawn for the unsteady calculations. In the pressure-driven pipe startup problem, the compressibility of the fluid began to significantly influence the physics of the flow development at quite low Mach numbers. The present scheme was observed to produce the expected characteristics of completely incompressible flow when the Mach number was set at very low values. Good agreement with incompressible results available in the literature was observed.

Pletcher, R. H.↗

Efficiency and reliability enhancements in propulsion flowfield modeling

The implementation of traditional CFD algorithms in practical propulsion related flowfields often leads to dramatic reductions in efficiency and/or robustness. The present research is directed at understanding the reasons for this deterioration and finding methods to circumvent it. Work to date has focussed on low Mach number regions, viscous dominated regions, and high grid aspect ratios. Time derivative preconditioning, improved definition of the local time stepping, and appropriate application of boundary conditions are employed to decrease the required time to obtain a solution, while maintaining accuracy. A number of cases having features typical of rocket engine flowfields are computed to demonstrate the improvement over conventional methods. These cases include laminar and turbulent high Reynolds number flat plate boundary layers, flow over a backward-facing step, a diffusion flame, and wall heat-flux calculations in a turbulent converging-diverging nozzle. Results from these cases show convergence that is virtually independent of the local Mach number and the grid aspect ratio, which translates to a convergence speed-up of up to several orders of magnitude over conventional algorithms. Current emphasis is in extending these results to three-dimensional flows with highly stretched grids.

Buelow, Philip E. O.↗

Computation of propulsion-related flowfields using unstructured adaptive meshes

In this paper, we describe a computational fluid dynamics (CFD) technique based on unstructured triangular/tetrahedral meshes. A finite-volume scheme is used in conjunction with a multi-stage Runge-Kutta algorithm. Convergence enhancements in the form of dual time-stepping and time-derivative preconditioning are used to overcome the limitations of conventional multi-stage schemes. The method is applied to propulsion-related flows and shown to perform satisfactorily.

Weiss, Jonathan M.↗

Extending substructure based iterative solvers to multiple load and repeated analyses

Direct solvers currently dominate commercial finite element structural software, but do not scale well in the fine granularity regime targeted by emerging parallel processors. Substructure based iterative solvers--often called also domain decomposition algorithms--lend themselves better to parallel processing, but must overcome several obstacles before earning their place in general purpose structural analysis programs. One such obstacle is the solution of systems with many or repeated right hand sides. Such systems arise, for example, in multiple load static analyses and in implicit linear dynamics computations. Direct solvers are well-suited for these problems because after the system matrix has been factored, the multiple or repeated solutions can be obtained through relatively inexpensive forward and backward substitutions. On the other hand, iterative solvers in general are ill-suited for these problems because they often must restart from scratch for every different right hand side. In this paper, we present a methodology for extending the range of applications of domain decomposition methods to problems with multiple or repeated right hand sides. Basically, we formulate the overall problem as a series of minimization problems over K-orthogonal and supplementary subspaces, and tailor the preconditioned conjugate gradient algorithm to solve them efficiently. The resulting solution method is scalable, whereas direct factorization schemes and forward and backward substitution algorithms are not. We illustrate the proposed methodology with the solution of static and dynamic structural problems, and highlight its potential to outperform forward and backward substitutions on parallel computers. As an example, we show that for a linear structural dynamics problem with 11640 degrees of freedom, every time-step beyond time-step 15 is solved in a single iteration and consumes 1.0 second on a 32 processor iPSC-860 system; for the same problem and the same parallel processor, a pair of forward/backward substitutions at each step consumes 15.0 seconds.

Farhat, Charbel↗

An implicit numerical scheme for the simulation of internal viscous flows on unstructured grids

The Navier-Stokes equations are solved numerically for two-dimensional steady viscous laminar flows. The grids are generated based on the method of Delaunay triangulation. A finite-volume approach is used to discretize the conservation law form of the compressible flow equations written in terms of primitive variables. A preconditioning matrix is added to the equations so that low Mach number flows can be solved economically. The equations are time marched using either an implicit Gauss-Seidel iterative procedure or a solver based on a conjugate gradient like method. A four color scheme is employed to vectorize the block Gauss-Seidel relaxation procedure. This increases the memory requirements minimally and decreases the computer time spent solving the resulting system of equations substantially. A factor of 7.6 speed up in the matrix solver is typical for the viscous equations. Numerical results are obtained for inviscid flow over a bump in a channel at subsonic and transonic conditions for validation with structured solvers. Viscous results are computed for developing flow in a channel, a symmetric sudden expansion, periodic tandem cylinders in a cross-flow, and a four-port valve. Comparisons are made with available results obtained by other investigators.

Jorgenson, Philip C. E.↗

Relaxation schemes for Chebyshev spectral multigrid methods

Two relaxation schemes for Chebyshev spectral multigrid methods are presented for elliptic equations with Dirichlet boundary conditions. The first scheme is a pointwise-preconditioned Richardson relaxation scheme and the second is a line relaxation scheme. The line relaxation scheme provides an efficient and relatively simple approach for solving two-dimensional spectral equations. Numerical examples and comparisons with other methods are given.

Kang, Yimin↗

Discrete sensitivity derivatives of the Navier-Stokes equations with a parallel Krylov solver

This paper solves an 'incremental' form of the sensitivity equations derived by differentiating the discretized thin-layer Navier Stokes equations with respect to certain design variables of interest. The equations are solved with a parallel, preconditioned Generalized Minimal RESidual (GMRES) solver on a distributed-memory architecture. The 'serial' sensitivity analysis code is parallelized by using the Single Program Multiple Data (SPMD) programming model, domain decomposition techniques, and message-passing tools. Sensitivity derivatives are computed for low and high Reynolds number flows over a NACA 1406 airfoil on a 32-processor Intel Hypercube, and found to be identical to those computed on a single-processor Cray Y-MP. It is estimated that the parallel sensitivity analysis code has to be run on 40-50 processors of the Intel Hypercube in order to match the single-processor processing time of a Cray Y-MP.

Ajmani, Kumud↗

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on an MIMD (multiple instruction/multiple data stream) parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed, one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the iPSC/860.

Venkatakrishnan, V.↗

CFD analyses for advanced pump design

As one of the activities of the NASA/MSFC Pump Stage Technology Team, the present effort was focused on using CFD in the design and analysis of high performance rocket engine pumps. Under this effort, a three-dimensional Navier-Stokes code was used for various inducer and impeller flow field calculations. An existing algebraic grid generation procedure was-extended to allow for nonzero blade thickness, splitter blades, and hub/shroud cavities upstream or downstream of the (main) blades. This resulted in a fast, robust inducer/impeller geometry/grid generation package. Problems associated with running a compressible flow code to simulate an incompressible flow were resolved; related aspects of the numerical algorithm (viz., the matrix preconditioning, the artificial dissipation, and the treatment of low Mach number flows) were addressed. As shown by the calculations performed under the present effort, the resulting code, in conjunction with the grid generation package, is an effective tool for the rapid solution of three-dimensional viscous inducer and impeller flows.

Dejong, F. J.↗

Process modelling for materials preparation experiments

The main goals of the research under this grant consist of the development of mathematical tools and measurement techniques for transport properties necessary for high fidelity modelling of crystal growth from the melt and solution. Of the tasks described in detail in the original proposal, two remain to be worked on: development of a spectral code for moving boundary problems, and development of an expedient diffusivity measurement technique for concentrated and supersaturated solutions. We have focused on developing a code to solve for interface shape, heat and species transport during directional solidification. The work involved the computation of heat, mass and momentum transfer during Bridgman-Stockbarger solidification of compound semiconductors. Domain decomposition techniques and preconditioning methods were used in conjunction with Chebyshev spectral methods to accelerate convergence while retaining the high-order spectral accuracy. During the report period we have further improved our experimental setup. These improvements include: temperature control of the measurement cell to 0.1 C between 10 and 60 C; enclosure of the optical measurement path outside the ZYGO interferometer in a metal housing that is temperature controlled to the same temperature setting as the measurement cell; simultaneous dispensing and partial removal of the lower concentration (lighter) solution above the higher concentration (heavier) solution through independently motor-driven syringes; three-fold increase in data resolution by orientation of the interferometer with respect to diffusion direction; and increase of the optical path length in the solution cell to 12 mm.

Rosenberger, Franz↗

Thermal and hydraulic considerations regarding the fate of water discharged by the outflow channels to the Martian northern plains

The identification of possible shorelines in the Martian northern plains suggests that the water discharged by the circum-Chryse outflow channels may have led to the formation of transient seas, or possibly even an ocean, covering as much as one-third of the planet. Speculations regarding the possible fate of this water have included local ponding and reinfiltration into the crust; freezing, sublimation, and eventual cold-trapping at higher latitudes; or the in situ survival of this now frozen water to the present day -- perhaps aided by burial beneath a protective cover of eolian sediment or lavas. Although neither cold-trapping at higher latitudes nor the subsequent freezing and burial of flood waters can be ruled out, thermal and hydraulic considerations effectively eliminate the possibility that any significant reassimilation of this water by local infiltration has occurred given climatic conditions resembling those of today. The arguments against the local infiltration of flood water into the northern plains are two-fold. First, given the climatic and geothermal conditions that are thought to have prevailed on Mars during the Late Hesperian (the period of peak outflow channel activity in the northern plains), the thickness of the cryosphere in Chryse Planitia is likely to have exceeded 1 km. A necessary precondition for the widespread occurrence of groundwater is that the thermodynamic sink represented by the cryosphere must already be saturated with ice. For this reason, the ice-saturated cryosphere acts as an impermeable barrier that effectively precludes the local resupply of subpermafrost groundwater by the infiltration of water discharged to the surface by catastraphic floods. Note that the problem of local infiltration is not significantly improved even if the cryosphere were initially dry, for as water attempts to infiltrate the cold, dry crust, it will quickly freeze, creating a seal that prevents any further infiltration from the ponded water above. The second argument against the local infiltration of flood water in the northern plains is based on hydraulic considerations. Repeated impacts have likely brecciated the Martian crust down to a depth of roughly 10 km. Given a value of permeability no greater than that inferred for the top 10 km of the Earth's crust (approximately 10(exp -2) darcies), a timescale as much as a billion years or more for the Martian groundwater system to achieve hydrostatic equilibrium, and the approximately 2-4 km elevation difference between the outflow channel source regions and the northern plains, the water confined beneath the frozen crust of the northern plains should have been under a significant hydraulic head. Thus, the existence of a hydraulic pathway between the ponded flood waters above the northern plains and the confined aquifer lying beneath it would not have led to the infiltration of flood water back into the crust, but rather the additional expulsion of groundwater onto the surface.

Clifford, S. M.↗

The least-squares finite element method for low-mach-number compressible viscous flows

The present paper reports the development of the Least-Squares Finite Element Method (LSFEM) for simulating compressible viscous flows at low Mach numbers in which the incompressible flows pose as an extreme. Conventional approach requires special treatments for low-speed flows calculations: finite difference and finite volume methods are based on the use of the staggered grid or the preconditioning technique; and, finite element methods rely on the mixed method and the operator-splitting method. In this paper, however, we show that such difficulty does not exist for the LSFEM and no special treatment is needed. The LSFEM always leads to a symmetric, positive-definite matrix through which the compressible flow equations can be effectively solved. Two numerical examples are included to demonstrate the method: first, driven cavity flows at various Reynolds numbers; and, buoyancy-driven flows with significant density variation. Both examples are calculated by using full compressible flow equations.

Yu, Sheng-Tao↗

Multigrid one shot methods for optimal control problems: Infinite dimensional control

The multigrid one shot method for optimal control problems, governed by elliptic systems, is introduced for the infinite dimensional control space. ln this case, the control variable is a function whose discrete representation involves_an increasing number of variables with grid refinement. The minimization algorithm uses Lagrange multipliers to calculate sensitivity gradients. A preconditioned gradient descent algorithm is accelerated by a set of coarse grids. It optimizes for different scales in the representation of the control variable on different discretization levels. An analysis which reduces the problem to the boundary is introduced. It is used to approximate the two level asymptotic convergence rate, to determine the amplitude of the minimization steps, and the choice of a high pass filter to be used when necessary. The effectiveness of the method is demonstrated on a series of test problems. The new method enables the solutions of optimal control problems at the same cost of solving the corresponding analysis problems just a few times.

Arian, Eyal↗