Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “direct 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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS2007

Improve Problem Solving Skills through Adapting Programming Tools

There are numerous ways for engineers and students to become better problem-solvers. The use of command line and visual programming tools can help to model a problem and formulate a solution through visualization. The analysis of problem attributes and constraints provide insight into the scope and complexity of the problem. The visualization aspect of the problem-solving approach tends to make students and engineers more systematic in their thought process and help them catch errors before proceeding too far in the wrong direction. The problem-solver identifies and defines important terms, variables, rules, and procedures required for solving a problem. Every step required to construct the problem solution can be defined in program commands that produce intermediate output. This paper advocates improved problem solving skills through using a programming tool. MatLab created by MathWorks, is an interactive numerical computing environment and programming language. It is a matrix-based system that easily lends itself to matrix manipulation, and plotting of functions and data. MatLab can be used as an interactive command line or a sequence of commands that can be saved in a file as a script or named functions. Prior programming experience is not required to use MatLab commands. The GNU Octave, part of the GNU project, a free computer program for performing numerical computations, is comparable to MatLab. MatLab visual and command programming are presented here.

Shaykhian, Linda H.↗
NASA NTRS1999

TLNS3D/CDISC Multipoint Design of the TCA Concept

This paper presents the work done to date by the authors on developing an efficient approach to multipoint design and applying it to the design of the HSR TCA (High Speed Research Technology Concept Aircraft) configuration. While the title indicates that this exploratory study has been performed using the TLNS3DMB flow solver and the CDISC (Constrained Direct Iterative Surface Curvature) design method, the CDISC method could have been used with any flow solver, and the multipoint design approach does not require the use of CDISC. The goal of the study was to develop a multipoint design method that could achieve a design in about the same time as 10 analysis runs.

Campbell, Richard L.↗
NASA NTRS1974

Rapid finite-difference computation of subsonic and transonic aerodynamic flows

Rapid iterative (or semidirect) computation methods are developed for the finite-difference solution of the nonlinear equations of subsonic and transonic aerodynamics. At each iteration, a fast, direct elliptic algorithm solves the entire computation field. In an application to subsonic flow over a lifting airfoil, the full nonlinear stream-function equation is solved. Finally, a direct Cauchy-Riemann solver is used for the nonlinear transonic small-disturbance equations for a biconvex airfoil. At M = 0.7, t/c = 0.1 (subcritical), three iterations on a 39 x 32 mesh (totaling 2.45 sec on an IBM 360/67 computer) obtain convergence within 0.1%. A slightly supercritical case requires seven iterations (6.75 sec) for convergence within 1%.

Martin, E. D.↗
NASA NTRS1974

A generalized-capacity-matrix technique for computing aerodynamic flows

A numerical generalized-capacity-matrix technique is developed for application to aerodynamic flow computations. This technique allows the very fast direct (noniterative) numerical elliptic solvers to be used in problems with arbitrary internal boundaries and with a wide class of boundary conditions, including numerical application of the Kutta condition on an airfoil without iteration. Accuracy, speed, and usefulness of the technique are demonstrated with linear problems for potential flows over airfoil shapes. The method's main advantages, however, can be exploited within iterative procedures for a variety of complex flow problems governed by systems of equations not necessarily elliptic or linear.

Martin, E. D.↗
NASA NTRS1978

Semidirect calculation of steady two- and three-dimensional flows

This paper describes a semidirect method for rapidly solving steady-state viscous flows described by the complete Navier-Stokes equations. The current results are for two-dimensional incompressible flows in general channels at arbitrary Reynolds numbers, but work in progress on compressible and three-dimensional flows is also described. The basic concept of semidirect methods is to use the recently developed fast (direct, or noniterative) linear solvers to solve linearized equations, which are then iterated to solve the nonlinearity. The method used here is an extension of the Split NOS method (Roache, 1975)

Roache, P. J.↗
NASA NTRS1988

Transient two-dimensional heat transfer through a composite body with application to deicing of aircraft components

Nine different numerical methods are examined for their ability to model the process of the melting and removal of ice from an airfoil using electrothermal heaters. A technique is presented for modeling the phase change which assumes a phase for each node. The technique allows solvers such as Alternating Direction Implicit, Alternating Direction Explicit, and Strongly Implicit Procedure to find a solution which can then be iterated to find the correct phase of each node. Comparisons made for a standard deicer pad comprised of five layers showed the ADI method to be superior to the other methods considered.

Wright, W. B.↗
NASA NTRS1992

Software issues in three dimensional continuum shape optimization employing boundary formulations

The paper addresses the issue of how individual computational techniques for the accurate and economical calculation of information required for large-scale 3D continuum structural shape optimization via boundary element analysis (BEA) formulations can be prudently selected and incorporated in large-scale BEA programs, employing either direct or iterative equation solvers. A series of techniques that allows for the incorporation of economical shape design sensitivity analysis capability with a minimal amount of software development is described. The use of reanalysis is shown to be the key ingredient associated with each of these techniques. It is concluded that, from a software engineering perspective, capabilities that facilitate 3D shape optimization can be implemented in BEA programs with only modest investments in program development.

Kane, James H.↗
NASA NTRS1993

Fast structural design and analysis via hybrid domain decomposition on massively parallel processors

A hybrid domain decomposition framework for static, transient and eigen finite element analyses of structural mechanics problems is presented. Its basic ingredients include physical substructuring and /or automatic mesh partitioning, mapping algorithms, 'gluing' approximations for fast design modifications and evaluations, and fast direct and preconditioned iterative solvers for local and interface subproblems. The overall methodology is illustrated with the structural design of a solar viewing payload that is scheduled to fly in March 1993. This payload has been entirely designed and validated by a group of undergraduate students at the University of Colorado using the proposed hybrid domain decomposition approach on a massively parallel processor. Performance results are reported on the CRAY Y-MP/8 and the iPSC-860/64 Touchstone systems, which represent both extreme parallel architectures. The hybrid domain decomposition methodology is shown to outperform leading solution algorithms and to exhibit an excellent parallel scalability.

Farhat, Charbel↗
NASA NTRS1994

Optimization of Wing-Body Configurations by the Euler Equations

This paper describes a new wing-body design procedure which is based on the Euler equations and a constrained numerical optimization technique. The geometry modification is based on a set of fundamental modes defined on the unit interval. A design example involving a generic wing-body model is presented to demonstrate the usefulness of the design program. It is shown that the use of an Euler solver coupled with a direct numerical optimization procedure is affordable on the current generation of supercomputers.

Chang, I.-Chung↗
NASA NTRS1996

RANS-MP: A Portable Parallel Navier-Stokes Solver

RANS-MP, a new implementation of a single-grid Navier-Stokes solver using the diagonalized Beam-Warming approximate-factorization scheme, is presented. This first release of the completely rewritten solver employs the following optimizations: (1) Bi-directional multi-partition method for the ADI solver part; this improves granularity and load balance; (2) Improved cache usage through elimination of non-unit-stride array access (possible in part due to multi-partitioning); (3) Preprocessing of communicating boundary conditions to streamline logic during time stepping; (4) Truly parallel, high-performance I/O using the newly-developed MPI-IO library; (5) Elimination of large amounts of redundant operations through efficient use of workspace. Results of some realistic wing computations on the IBM SP2 computer will be presented. We will demonstrate that excellent absolute performance and scalability are obtained with RANS-MP, even for relatively small grid sizes. Besides high performance, an outstanding feature of RANS-MP is its true portability, due to the use of the portable message passing and I/O libraries MPI and MPI-IO.

VanderWijngaart, Rob F.↗
NASA NTRS2005

Parallel Domain Decomposition Formulation and Software for Large-Scale Sparse Symmetrical/Unsymmetrical Aeroacoustic Applications

The overall objectives of this research work are to formulate and validate efficient parallel algorithms, and to efficiently design/implement computer software for solving large-scale acoustic problems, arised from the unified frameworks of the finite element procedures. The adopted parallel Finite Element (FE) Domain Decomposition (DD) procedures should fully take advantages of multiple processing capabilities offered by most modern high performance computing platforms for efficient parallel computation. To achieve this objective. the formulation needs to integrate efficient sparse (and dense) assembly techniques, hybrid (or mixed) direct and iterative equation solvers, proper pre-conditioned strategies, unrolling strategies, and effective processors' communicating schemes. Finally, the numerical performance of the developed parallel finite element procedures will be evaluated by solving series of structural, and acoustic (symmetrical and un-symmetrical) problems (in different computing platforms). Comparisons with existing "commercialized" and/or "public domain" software are also included, whenever possible.

Nguyen, D. T.↗
NASA NTRS2005

Parallel Finite Element Domain Decomposition for Structural/Acoustic Analysis

A domain decomposition (DD) formulation for solving sparse linear systems of equations resulting from finite element analysis is presented. The formulation incorporates mixed direct and iterative equation solving strategics and other novel algorithmic ideas that are optimized to take advantage of sparsity and exploit modern computer architecture, such as memory and parallel computing. The most time consuming part of the formulation is identified and the critical roles of direct sparse and iterative solvers within the framework of the formulation are discussed. Experiments on several computer platforms using several complex test matrices are conducted using software based on the formulation. Small-scale structural examples are used to validate thc steps in the formulation and large-scale (l,000,000+ unknowns) duct acoustic examples are used to evaluate the ORIGIN 2000 processors, and a duster of 6 PCs (running under the Windows environment). Statistics show that the formulation is efficient in both sequential and parallel computing environmental and that the formulation is significantly faster and consumes less memory than that based on one of the best available commercialized parallel sparse solvers.

Nguyen, Duc T.↗
NASA NTRS2002

Numerical Simulations for Landing Gear Noise Generation and Radiation

Aerodynamic noise from a landing gear in a uniform flow is computed using the Ffowcs Williams -Hawkings (FW-H) equation. The time accurate flow data on the surface is obtained using a finite volume flow solver on an unstructured and. The Ffowcs Williams-Hawkings equation is solved using surface integrals over the landing gear surface and over a permeable surface away from the landing gear. Two geometric configurations are tested in order to assess the impact of two lateral struts on the sound level and directivity in the far-field. Predictions from the Ffowcs Williams-Hawkings code are compared with direct calculations by the flow solver at several observer locations inside the computational domain. The permeable Ffowcs Williams-Hawkings surface predictions match those of the flow solver in the near-field. Far-field noise calculations coincide for both integration surfaces. The increase in drag observed between the two landing gear configurations is reflected in the sound pressure level and directivity mainly in the streamwise direction.

Morris, Philip J.↗
NASA NTRS1994

An Adaptively-Refined, Cartesian, Cell-Based Scheme for the Euler and Navier-Stokes Equations

A Cartesian, cell-based scheme for solving the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal 'cut' cells are created. The geometry of the cut cells is computed using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded, with a limited linear reconstruction of the primitive variables used to provide input states to an approximate Riemann solver for computing the fluxes between neighboring cells. A multi-stage time-stepping scheme is used to reach a steady-state solution. Validation of the Euler solver with benchmark numerical and exact solutions is presented. An assessment of the accuracy of the approach is made by uniform and adaptive grid refinements for a steady, transonic, exact solution to the Euler equations. The error of the approach is directly compared to a structured solver formulation. A non smooth flow is also assessed for grid convergence, comparing uniform and adaptively refined results. Several formulations of the viscous terms are assessed analytically, both for accuracy and positivity. The two best formulations are used to compute adaptively refined solutions of the Navier-Stokes equations. These solutions are compared to each other, to experimental results and/or theory for a series of low and moderate Reynolds numbers flow fields. The most suitable viscous discretization is demonstrated for geometrically-complicated internal flows. For flows at high Reynolds numbers, both an altered grid-generation procedure and a different formulation of the viscous terms are shown to be necessary. A hybrid Cartesian/body-fitted grid generation approach is demonstrated. In addition, a grid-generation procedure based on body-aligned cell cutting coupled with a viscous stensil-construction procedure based on quadratic programming is presented.

Coirier, William John↗
NASA NTRS1989

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 triangular 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 nonconsistant coefficients. A method was recently proposed to parallelize and vectorize BCR. Here, 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 complexity lower than that of parallel BCR.

Gallopoulos, E.↗
NASA NTRS1989

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.↗
NASA NTRS1989

On the role of artificial viscosity in Navier-Stokes solvers

A method is proposed to determine directly the amount of artificial viscosity needed for stability using an eigenvalue analysis for a finite difference representation of the Navier-Stokes equations. The stability and growth of small perturbations about a steady flow over the airfoils are analyzed for various amounts of artificial viscosity. The eigenvalues were determined for a small perturbation about a steady inviscid flow over a NACA 0012 airfoil at a Mach number of 0.8 and angle of attack of 0 degrees. The movement of the eigenvalue constellation with respect to the amount of artificial viscosity is studied. The stability boundries as a function of the amount of artificial viscosity from both the eigenvalue analysis and the time marching scheme are also presented. This procedure not only allows for determining the effect of varying amounts of artificial viscosity, but also for the effects of different forms of terms for artificial viscosity.

Mahajan, Aparajit J.↗
NASA NTRS1991

Role of artificial viscosity in Euler and Navier-Stokes solvers

A method is proposed to determine directly the amount of artificial viscosity needed for stability using an eigenvalue analysis for a finite difference representation of the Navier-Stokes equations. The stability and growth of small perturbations about a steady flow over airfoils are analyzed for various amounts of artificial viscosity. The eigenvalues were determined for a small time-dependent perturbation about a steady inviscid flow over an NACA 0012 airfoil at a Mach number of 0.8 and angle of attack of 0 deg. The method has been applied to inviscid flows here, but as discussed is also applicable to viscous flows. The movement of the eigenvalue constellation with respect to the amount of artificial viscosity is studied. The stability boundaries as a function of the amount of artificial viscosity from both the eigenvalue analysis and the time-marching scheme are also presented. The eigenvalue procedure not only allows for determining the effect of varying amounts of artificial viscosity, but also for the effects of different forms of artificial viscosity.

Mahajan, Aparajit J.↗