Search NASA⌕ Search

SEARCH · Search NASA

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

Oscillatory flow with heat transfer in a square cavity

A computational study is presented for the flow inside an oscillatory cavity. The numerical scheme employs a semiimplicit, time-splitting method to integrate the two-dimensional full Navier-Stokes equations satisfying continuity to machine accuracy. The efficient use of direct solvers for the uncoupled momentum and pressure equations is demonstrated. The oscillatory cavity flow is studied considering the effects of heat transfer, Reynolds number and oscillatory Stokes number.

Danabasoglu, G.↗

A flux-split solution procedure for unsteady flow calculations

The solution of reduced Navier Stokes (RNS) equations is considered using a flux-split procedure. Unsteady flow in a two dimensional engine inlet is computed. The problems of unstart and restart are investigated. A sparse matrix direct solver combined with domain decomposition strategy is used to compute the unsteady flow field at each instant of time. Strong shock-boundary layer interaction, time varying shocks and time varying recirculation regions are efficiently captured.

Pordal, H. S.↗

A review of reduced Navier-Stokes computations for compressible viscous flows

A reduced form of the Navier-Stokes equations, defined by a single composite of the Euler, boundary layer, and triple deck approximations, is considered for the computation of viscous interacting flows. Global pressure or pseudopotential relaxation methods are integrated with coupled sparse matrix direct solvers or coupled strongly implicit ILU algorithms to efficiently capture sharp shocks and regions of recirculation. Solutions are obtained for a variety of 2D and 3D geometries and for Mach numbers (M) spanning the range from incompressible (M = 0) to supersonic (M = 6) flow.

Rubin, S. G.↗

An incremental strategy for calculating consistent discrete CFD sensitivity derivatives

In this preliminary study involving advanced computational fluid dynamic (CFD) codes, an incremental formulation, also known as the 'delta' or 'correction' form, is presented for solving the very large sparse systems of linear equations which are associated with aerodynamic sensitivity analysis. For typical problems in 2D, a direct solution method can be applied to these linear equations which are associated with aerodynamic sensitivity analysis. For typical problems in 2D, a direct solution method can be applied to these linear equations in either the standard or the incremental form, in which case the two are equivalent. Iterative methods appear to be needed for future 3D applications; however, because direct solver methods require much more computer memory than is currently available. Iterative methods for solving these equations in the standard form result in certain difficulties, such as ill-conditioning of the coefficient matrix, which can be overcome when these equations are cast in the incremental form; these and other benefits are discussed. The methodology is successfully implemented and tested in 2D using an upwind, cell-centered, finite volume formulation applied to the thin-layer Navier-Stokes equations. Results are presented for two laminar sample problems: (1) transonic flow through a double-throat nozzle; and (2) flow over an isolated airfoil.

Korivi, Vamshi Mohan↗

Upwind relaxation methods for the Navier-Stokes equations using inner iterations

A subsonic and a supersonic problem are respectively treated by an upwind line-relaxation algorithm for the Navier-Stokes equations using inner iterations to accelerate steady-state solution convergence and thereby minimize CPU time. While the ability of the inner iterative procedure to mimic the quadratic convergence of the direct solver method is attested to in both test problems, some of the nonquadratic inner iterative results are noted to have been more efficient than the quadratic. In the more successful, supersonic test case, inner iteration required only about 65 percent of the line-relaxation method-entailed CPU time.

Taylor, Arthur C., III↗

Complex generalized minimal residual algorithm for iterative solution of quantum-mechanical reactive scattering equations

Complex dense matrices corresponding to the D + H2 and O + HD reactions were solved using a complex generalized minimal residual (GMRes) algorithm described by Saad and Schultz (1986) and Saad (1990). To provide a test case with a different structure, the H + H2 system was also considered. It is shown that the computational effort for solutions with the GMRes algorithm depends on the dimension of the linear system, the total energy of the scattering problem, and the accuracy criterion. In several cases with dimensions in the range 1110-5632, the GMRes algorithm outperformed the LAPACK direct solver, with speedups for the linear equation solution as large as a factor of 23.

Chatfield, David C.↗

A global multilevel atmospheric model using a vector semi-Lagrangian finite-difference scheme. I - Adiabatic formulation

An adiabatic global multilevel primitive equation model using a two time-level, semi-Lagrangian semi-implicit finite-difference integration scheme is presented. A Lorenz grid is used for vertical discretization and a C grid for the horizontal discretization. The momentum equation is discretized in vector form, thus avoiding problems near the poles. The 3D model equations are reduced by a linear transformation to a set of 2D elliptic equations, whose solution is found by means of an efficient direct solver. The model (with minimal physics) is integrated for 10 days starting from an initialized state derived from real data. A resolution of 16 levels in the vertical is used, with various horizontal resolutions. The model is found to be stable and efficient, and to give realistic output fields. Integrations with time steps of 10 min, 30 min, and 1 h are compared, and the differences are found to be acceptable.

Bates, J. R.↗

A three-dimensional pressure flux-split RNS application to sub/supersonic flow in inlets and ducts

The reduced Navier-Stokes (RNS) formulation is combined with a pressure based flux split procedure for the computational analysis of three dimensional flow. Only lowest order diffusion, that is required to satisfy the no-slip boundary condition is retained in this approximation. The governing equations are appropriately differenced such that the physical boundary conditions are closely coupled and combined to form a closed discrete system. No numerical or characteristic type boundary conditions are required. A global pressure relaxation procedure, i.e. multi-sweep PNS, is considered. A sparse matrix direct solver is applied to the crossplane solution. At the outflow boundary only the pressure or pressure gradient is prescribed. The resulting formulation has been applied to the solution of three-dimensional subsonic/supersonic internal flows in inlets and ducts.

Khosla, P. K.↗

STRUMPACK -- STRUctured Matrices PACKage

STRUMPACK - STRUctured Matrices PACKage - is a package for computations with sparse and dense structured matrix, i.e., matrices that exhibit some kind of low-rank property, in particular Hierarchically Semi Separable structure (HSS). Such matrices appear in many applications, e.g., FEM, BEM, Integral equations. etc. Exploiting this structure using certain compression algorithms allow for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. STRUMPACK has presently two main components: a distributed-memory dense matrix computations package and a shared-memory sparse direct solver.

Source record↗

A distributed-memory approximation algorithm for maximum weight perfect bipartite matching

We design and implement an efficient parallel approximation algorithm for the problem of maximum weight perfect matching in bipartite graphs, i.e. the problem of finding a set of non-adjacent edges that covers all vertices and has maximum weight. This problem differs from the maximum weight matching problem, for which scalable approximation algorithms are known. It is primarily motivated by finding good pivots in scalable sparse direct solvers before factorization where sequential implementations of maximum weight perfect matching algorithms, such as those available in MC64, are widely used due to the lack of scalable alternatives. To overcome this limitation, we propose a fully parallel distributed memory algorithm that first generates a perfect matching and then searches for weightaugmenting cycles of length four in parallel and iteratively augments the matching with a vertex disjoint set of such cycles. For most practical problems the weights of the perfect matchings generated by our algorithm are very close to the optimum. An efficient implementation of the algorithm scales up to 256 nodes (17,408 cores) on a Cray XC40 supercomputer and can solve instances that are too large to be handled by a single node using the sequential algorithm.

Azad, Ariful↗

A Three-level BDDC algorithm for saddle point problems

BDDC algorithms have previously been extended to the saddle point problems arising from mixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC algorithms, all iterates are required to be in a benign space, a subspace in which the preconditioned operators are positive definite. This requirement can lead to large coarse problems, which have to be generated and factored by a direct solver at the beginning of the computation and they can ultimately become a bottleneck. An additional level is introduced in this paper to solve the coarse problem approximately and to remove this difficulty. This three-level BDDC algorithm keeps all iterates in the benign space and the conjugate gradient methods can therefore be used to accelerate the convergence. This work is an extension of the three-level BDDC methods for standard finite element discretization of elliptic problems and the same rate of convergence is obtained for the mixed formulation of the same problems. Estimate of the condition number for this three-level BDDC methods is provided and numerical experiments are discussed.

97 MATHEMATICS AND COMPUTING↗

Advances in Application of Fast Semidirect Computational Methods in Transonic Flow

This paper is intended as a review and summary of the advances made in a recently developed approach for rapid numerical solution of the equations of inviscid transonic aerodynamics. The investigation has been limited to two-dimensional, steady, inviscid flow over airfoils in a subsonic free stream, with emphasis on development of a rapid computational technique, rather than on generality of application. The approach uses finite-difference algorithms called "fast direct elliptic solvers" within an iteration scheme. "Direct" means that the entire computation field is solved at once, rather than in successive traverses over the field as in a point- or line-relaxation method. Such an iterative method is referred to as "semidirect." The iterative convergence can be faster than in other relaxation methods because changes are felt simultaneously at all points in each succeeding iteration. Direct elliptic solvers and semidirect methods have restrictions, but these are gradually being removed. Direct solvers were first developed for solving Poisson's equation on a rectangle without interior boundaries. A method to treat first-order systems, a direct Cauchy-Riemann solver has also been developed. Numerical treatment of part of a system of nonlinear equations by a Poisson solver has been reported. Also Poisson solvers in semidirect methods were used for nonseparable elliptic equations. The semidirect method was extended to the solution of a problem of mixed type, where the improved Murman-Cole transonic small-disturbance difference equations were solved. A slightly supercritical flow over a biconvex airfoil was treated successfully, but the iterations did not converge for more strongly supercritical conditions In another work the addition of terms ot both sides of the difference equations stabilized the iteration for supercritical conditions with large supersonic zones. For this, the Cauchy-Riemann solver was revised to incl,ude the needed terms. Most recently, the evaluation of parameters for rapid convergence and comparisons, with Murman's line-relaxation method was described. The method was extended to full second order accuracy in a fully conservative formulation in another work.

Martin, E. Dale↗

Amesos2 and Belos: Direct and Iterative Solvers for Large Sparse Linear Systems

Solvers for large sparse linear systems come in two categories: direct and iterative. Amesos2, a package in the Trilinos software project, provides direct methods, and Belos, another Trilinos package, provides iterative methods. Amesos2 offers a common interface to many different sparse matrix factorization codes, and can handle any implementation of sparse matrices and vectors, via an easy-to-extend C++ traits interface. It can also factor matrices whose entries have arbitrary “Scalar” type, enabling extended-precision and mixed-precision algorithms. Belos includes many different iterative methods for solving large sparse linear systems and least-squares problems. Unlike competing iterative solver libraries, Belos completely decouples the algorithms from the implementations of the underlying linear algebra objects. This lets Belos exploit the latest hardware without changes to the code. Belos favors algorithms that solve higher-level problems, such as multiple simultaneous linear systems and sequences of related linear systems, faster than standard algorithms. The package also supports extended-precision and mixed-precision algorithms. Together, Amesos2 and Belos form a complete suite of sparse linear solvers.

Bavier, Eric↗

Three-Dimensional High-Lift Analysis Using a Parallel Unstructured Multigrid Solver

A directional implicit unstructured agglomeration multigrid solver is ported to shared and distributed memory massively parallel machines using the explicit domain-decomposition and message-passing approach. Because the algorithm operates on local implicit lines in the unstructured mesh, special care is required in partitioning the problem for parallel computing. A weighted partitioning strategy is described which avoids breaking the implicit lines across processor boundaries, while incurring minimal additional communication overhead. Good scalability is demonstrated on a 128 processor SGI Origin 2000 machine and on a 512 processor CRAY T3E machine for reasonably fine grids. The feasibility of performing large-scale unstructured grid calculations with the parallel multigrid algorithm is demonstrated by computing the flow over a partial-span flap wing high-lift geometry on a highly resolved grid of 13.5 million points in approximately 4 hours of wall clock time on the CRAY T3E.

Mavriplis, Dimitri J.↗

Direct E&M Field Solver for a Plane Wave without Sources

A three dimensional direct field solver for the electric and magnetic fields using the Finite Difference Time Domain (FDTD) method is described. Example simulations using periodic and absorbing boundary conditions in a vacuum medium for a plane wave propagating in three dimensions are explored and are compared to theory.

97 MATHEMATICS AND COMPUTING↗

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

Application of the TRANAIR rectangular grid approach to the aerodynamic analysis of complex configurations

A numerical method is described which uses a rectangular grid to solve the nonlinear full potential equation about complex configurations. The grid is locally refined to resolve high velocity gradients arising from leading edge expansions or shock waves. The grid penetrates the boundary (described by networks of quadrilateral panels) and is generated automatically. Discrete operators are constructed using the finite element method. The system of nonlinear discrete equations is solved iteratively using a Krylov subspace method preconditioned by an exterior Poisson solver and a direct sparse solver. The primary emphasis is to provide design engineers with an aerodynamic analysis tool (the TRANAIR code) which is accurate, reliable, economical, and flexible to use. Computational results for many interesting configurations are presented.

Johnson, Forrester T.↗