Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solver”

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 397 records · Page 22

A vectorized Poisson solver over a spherical shell and its application to the quasi-geostrophic omega-equation

The quasi-geostrophic omega-equation in flux form is developed as an example of a Poisson problem over a spherical shell. Solutions of this equation are obtained by applying a two-parameter Chebyshev solver in vector layout for CDC 200 series computers. The performance of this vectorized algorithm greatly exceeds the performance of its scalar analog. The algorithm generates solutions of the omega-equation which are compared with the omega fields calculated with the aid of the mass continuity equation.

Mullenmeister, Paul↗

A Navier-Stokes solver for cascade flows

A computer code for solving the Reynolds averaged full Navier-Stokes equations has been developed and applied using sheared H-type grids. The Baldwin-Lomax eddy-viscosity model is used for turbulence closure. The integration in time is based on an explicit four-stage Runge-Kutta scheme. Local time stepping, variable coefficient implicit residual smoothing, and a full multigrid method have been implemented to accelerate steady state calculations. Comparisons with experimental data show that the code is an accurate viscous solver and can give very good blade-to-blade predictions for engineering applications in less than 100 multigrid cycles on the finest mesh.

Arnone, A.↗

Calculations of transonic flows with shocks using Newton's method and direct solver. II - Solution of Euler equations

Transonic flows with shocks are simulated using steady Euler equations and by simultaneously solving the resulting nonlinear algebraic equations using Newton's method. At each iteration, a direct solver computes the corrections and the process is repeated until convergence is achieved. The corrections and errors are reduced quadratically with the present method, allowing solutions of machine accuracy to be obtained in a few steps. Nonunique inviscid solutions and nonunique solutions of the Navier Stokes equations for quasi-one-dimensional flows in nozzles are presented. Calculations are also presented for steady two-dimensional inviscid flows around a cylinder in the transonic regime.

Hafez, M.↗

The use of direct solvers for compressible flow computations

The feasibility of using a vectorized direct solver for the compressible Euler and Navier-Stokes equations is examined for both single-grid and multi-grid strategies. A procedure is developed for comparing the computational effort required for the direct method with that of the vertical line Gauss-Seidel iteration scheme in order to provide a criteria for choosing between the two techniques. The direct method is shown to have a relatively wide range of application on a vector processor with large memory. Results for both inviscid and viscous test problems in two-dimensions are examined.

Riggins, David↗

A Navier-Stokes solver using the LU-SSOR TVD algorithm

A new Navier-Stokes solver is developed by combining the efficiency of the LU-SSOR scheme and the accuracy of the flux-limited dissipation scheme. Application to laminar and turbulent flows and hypersonic flows proves the reliability of the new algorithm.

Yoon, Seokkwan↗

Computational validation of a parabolized Navier-Stokes solver on a sharp-nose cone at hypersonic speeds

Perfect gas computational results from a newly-developed upwind, parabolized Navier-Stokes (PNS) solver are compared with an existing set of experimental laminar results for a 10-deg half-angle circular cone at freestream Mach number of 7.95. Comparisons were performed with surface pressure and heat transfer data, as well as with flowfield pitot measurements. The PNS code predicted the surface quantities accurately up through 20-deg angle-of-attack, including crossflow separation, and correctly defined the location of the bow shock and the edge of the boundary layer. The importance of cell Reynolds number, grid density, and thermal boundary conditions to the accurate prediction of the flowfield are examined through numerical emamples.

Huebner, Lawrence D.↗

Hierarchically partitioned nonlinear equation solvers

By partitioning solution space into a number of subspaces, a new multiply constrained partitioned Newton-Raphson nonlinear equation solver is developed. Specifically, for a given iteration, each of the various separate partitions are individually and simultaneously controlled. Due to the generality of the scheme, a hierarchy of partition levels can be employed. For finite-element-type applications, this includes the possibility of degree-of-freedom, nodal, elemental, geometric substructural, material and kinematically nonlinear group controls. It is noted that such partitioning can be continuously updated, depending on solution conditioning. In this context, convergence is ascertained at the individual partition level.

Padovan, Joseph↗

Input-output-controlled nonlinear equation solvers

To upgrade the efficiency and stability of the successive substitution (SS) and Newton-Raphson (NR) schemes, the concept of input-output-controlled solvers (IOCS) is introduced. By employing the formal properties of the constrained version of the SS and NR schemes, the IOCS algorithm can handle indefiniteness of the system Jacobian, can maintain iterate monotonicity, and provide for separate control of load incrementation and iterate excursions, as well as having other features. To illustrate the algorithmic properties, the results for several benchmark examples are presented. These define the associated numerical efficiency and stability of the IOCS.

Padovan, Joseph↗

A simplified analysis of the multigrid V-cycle as a fast elliptic solver

For special model problems, Fourier analysis gives exact convergence rates for the two-grid multigrid cycle and, for more general problems, provides estimates of the two-grid convergence rates via local mode analysis. A method is presented for obtaining mutigrid convergence rate estimates for cycles involving more than two grids (using essentially the same analysis as for the two-grid cycle). For the simple cast of the V-cycle used as a fast Laplace solver on the unit square, the k-grid convergence rate bounds obtained by this method are sharper than the bounds predicted by the variational theory. Both theoretical justification and experimental evidence are presented.

Decker, Naomi H.↗

Euler solvers for transonic applications

The 1980s may well be called the Euler era of applied aerodynamics. Computer codes based on discrete approximations of the Euler equations are now routinely used to obtain solutions of transonic flow problems in which the effects of entropy and vorticity production are significant. Such codes can even predict separation from a sharp edge, owing to the inclusion of artificial dissipation, intended to lend numerical stability to the calculation but at the same time enforcing the Kutta condition. One effect not correctly predictable by Euler codes is the separation from a smooth surface, and neither is viscous drag; for these some form of the Navier-Stokes equation is needed. It, therefore, comes as no surprise to observe that the Navier-Stokes has already begun before Euler solutions were fully exploited. Moreover, most numerical developments for the Euler equations are now constrained by the requirement that the techniques introduced, notably artificial dissipation, must not interfere with the new physics added when going from an Euler to a full Navier-Stokes approximation. In order to appreciate the contributions of Euler solvers to the understanding of transonic aerodynamics, it is useful to review the components of these computational tools. Space discretization, time- or pseudo-time marching and boundary procedures, the essential constituents are discussed. The subject of grid generation and grid adaptation to the solution are touched upon only where relevant. A list of unanswered questions and an outlook for the future are covered.

Vanleer, Bram↗

Incremental planning to control a blackboard-based problem solver

To control problem solving activity, a planner must resolve uncertainty about which specific long-term goals (solutions) to pursue and about which sequences of actions will best achieve those goals. A planner is described that abstracts the problem solving state to recognize possible competing and compatible solutions and to roughly predict the importance and expense of developing these solutions. With this information, the planner plans sequences of problem solving activities that most efficiently resolve its uncertainty about which of the possible solutions to work toward. The planner only details actions for the near future because the results of these actions will influence how (and whether) a plan should be pursued. As problem solving proceeds, the planner adds new details to the plan incrementally, and monitors and repairs the plan to insure it achieves its goals whenever possible. Through experiments, researchers illustrate how these new mechanisms significantly improve problem solving decisions and reduce overall computation. They briefly discuss current research directions, including how these mechanisms can improve a problem solver's real-time response and can enhance cooperation in a distributed problem solving network.

Durfee, E. H.↗

An adaptive finite element solver for transient problems with moving bodies

The combination of adaptive remeshing techniques, flow solvers for transient problems with moving grids, and integrators for rigid body motion is presented. The resulting scheme allows the economic simulation of fully coupled fluid-rigid body interaction problems of arbitrary geometric complexity. Several results are given to demonstrate the capabilities developed.

Lohner, Rainald↗

A package for unstructured grid generation and finite element flow solvers

A set of programs for unstructured mesh construction, fluid flow calculation and flow field visualization in two and three dimensions is described. The grid generators are based on the advancing front concept. The flow solvers use the finite element methods with Flux Corrected Transport techniques to solve several sets of equations including the Euler and Burger's equations. Several examples show the flexibility and accuracy of the methods.

Gumbert, Clyde↗

On unstructured grids and solvers

The fundamentals and the state-of-the-art technology for unstructured grids and solvers are highlighted. Algorithms and techniques pertinent to mesh generation are discussed. It is shown that grid generation and grid manipulation schemes rely on fast multidimensional searching. Flow solution techniques for the Euler equations, which can be derived from the integral form of the equations are discussed. Sample calculations are also provided.

Barth, T. J.↗

Linear iterative solvers for implicit ODE methods

The numerical solution of stiff initial value problems, which lead to the problem of solving large systems of mildly nonlinear equations are considered. For many problems derived from engineering and science, a solution is possible only with methods derived from iterative linear equation solvers. A common approach to solving the nonlinear equations is to employ an approximate solution obtained from an explicit method. The error is examined to determine how it is distributed among the stiff and non-stiff components, which bears on the choice of an iterative method. The conclusion is that error is (roughly) uniformly distributed, a fact that suggests the Chebyshev method (and the accompanying Manteuffel adaptive parameter algorithm). This method is described, also commenting on Richardson's method and its advantages for large problems. Richardson's method and the Chebyshev method with the Mantueffel algorithm are applied to the solution of the nonlinear equations by Newton's method.

Saylor, Paul E.↗

Generic task problem solvers in Soar

Two trends can be discerned in research in problem solving architectures in the last few years. On one hand, interest in task-specific architectures has grown, wherein types of problems of general utility are identified, and special architectures that support the development of problem solving systems for those types of problems are proposed. These architectures help in the acquisition and specification of knowledge by providing inference methods that are appropriate for the type of problem. However, knowledge based systems which use only one type of problem solving method are very brittle, and adding more types of methods requires a principled approach to integrating them in a flexible way. Contrasting with this trend is the proposal for a flexible, general architecture contained in the work on Soar. Soar has features which make it attractive for flexible use of all potentially relevant knowledge or methods. But as the theory Soar does not make commitments to specific types of problem solvers or provide guidance for their construction. It was investigated how task-specific architectures can be constructed in Soar to retain as many of the advantages as possible of both approaches. Examples were used from the Generic Task approach for building knowledge based systems. Though this approach was developed and applied for a number of problems, the ideas are applicable to other task-specific approaches as well.

Johnson, Todd R.↗

Finite element solvers for incompressible fluid flows and heat transfer

Two different finite-element solvers for incompressible viscous flow, i.e., the mixed interpolation method and the SIMPLE-type iterative method, are compared and tested with some benchmark problems. The advantages of the SIMPLE-type iterative method are the decoupling of the governing equations and the use of equal-order interpolation functions for both velocity and pressure. Even though there is a significant difference between the two methods in terms of the pressure field, similar solutions are obtained for the velocity field.

Sohn, Jeong L.↗

Some fast elliptic solvers on parallel architectures and their complexities

The discretization of separable elliptic partial differential equations leads to linear systems with special block tridiagonal matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconstant coefficients. A method was recently proposed to parallelize and vectorize BCR. In this paper, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational compelxity lower than that of parallel BCR.

Gallopoulos, E.↗