Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative triangular solvers”

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.

6 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Optimal parallel solution of sparse triangular systems

A method for the parallel solution of triangular sets of equations is described that is appropriate when there are many right-handed sides. By preprocessing, the method can reduce the number of parallel steps required to solve Lx = b compared to parallel forward or backsolve. Applications are to iterative solvers with triangular preconditioners, to structural analysis, or to power systems applications, where there may be many right-handed sides (not all available a priori). The inverse of L is represented as a product of sparse triangular factors. The problem is to find a factored representation of this inverse of L with the smallest number of factors (or partitions), subject to the requirement that no new nonzero elements be created in the formation of these inverse factors. A method from an earlier reference is shown to solve this problem. This method is improved upon by constructing a permutation of the rows and columns of L that preserves triangularity and allow for the best possible such partition. A number of practical examples and algorithmic details are presented. The parallelism attainable is illustrated by means of elimination trees and clique trees.

Alvarado, Fernando L.↗
NASA NTRS1982

Profiles of electrified drops and bubbles

Axisymmetric equilibrium shapes of conducting drops and bubbles, (1) pendant or sessile on one face of a circular parallel-plate capacitor or (2) free and surface-charged, are found by solving simultaneously the free boundary problem consisting of the augmented Young-Laplace equation for surface shape and the Laplace equation for electrostatic field, given the surface potential. The problem is nonlinear and the method is a finite element algorithm employing Newton iteration, a modified frontal solver, and triangular as well as quadrilateral tessellations of the domain exterior to the drop in order to facilitate refined analysis of sharply curved drop tips seen in experiments. The stability limit predicted by this computer-aided theoretical analysis agrees well with experiments.

Basaran, O. A.↗
NASA NTRS2020

Face- and Cell-Averaged Nodal-Gradient Approach to Cell-Centered Finite-Volume Method on Mixed Grids

In this paper, the averaged nodal-gradient approach previously developed for triangular grids is extended to mixed triangular-quadrilateral grids. It is shown that the face- averaged approach leads to deteriorated iterative convergence on quadrilateral grids. To develop a convergent solver, we consider cell-averaging instead of face-averaging for quadri- lateral cells. We show that the cell-averaged approach leads to a convergent solver and can be efficiently combined with the face-averaged approach on mixed grids. The method is demonstrated for various inviscid and viscous problems from low to high Mach numbers on two-dimensional mixed grids.

Nishikawa, Hiroaki↗
NASA NTRS2015

High-Order Hyperbolic Residual-Distribution Schemes on Arbitrary Triangular Grids

In this paper, we construct high-order hyperbolic residual-distribution schemes for general advection-diffusion problems on arbitrary triangular grids. We demonstrate that the second-order accuracy of the hyperbolic schemes can be greatly improved by requiring the scheme to preserve exact quadratic solutions. We also show that the improved second-order scheme can be easily extended to third-order by further requiring the exactness for cubic solutions. We construct these schemes based on the LDA and the SUPG methodology formulated in the framework of the residual-distribution method. For both second- and third-order-schemes, we construct a fully implicit solver by the exact residual Jacobian of the second-order scheme, and demonstrate rapid convergence of 10-15 iterations to reduce the residuals by 10 orders of magnitude. We demonstrate also that these schemes can be constructed based on a separate treatment of the advective and diffusive terms, which paves the way for the construction of hyperbolic residual-distribution schemes for the compressible Navier-Stokes equations. Numerical results show that these schemes produce exceptionally accurate and smooth solution gradients on highly skewed and anisotropic triangular grids, including curved boundary problems, using linear elements. We also present Fourier analysis performed on the constructed linear system and show that an under-relaxation parameter is needed for stabilization of Gauss-Seidel relaxation.

Mazaheri, Alireza↗
NASA NTRS1994

Parallel Preconditioning for CFD Problems on the CM-5

Up to today, preconditioning methods on massively parallel systems have faced a major difficulty. The most successful preconditioning methods in terms of accelerating the convergence of the iterative solver such as incomplete LU factorizations are notoriously difficult to implement on parallel machines for two reasons: (1) the actual computation of the preconditioner is not very floating-point intensive, but requires a large amount of unstructured communication, and (2) the application of the preconditioning matrix in the iteration phase (i.e. triangular solves) are difficult to parallelize because of the recursive nature of the computation. Here we present a new approach to preconditioning for very large, sparse, unsymmetric, linear systems, which avoids both difficulties. We explicitly compute an approximate inverse to our original matrix. This new preconditioning matrix can be applied most efficiently for iterative methods on massively parallel machines, since the preconditioning phase involves only a matrix-vector multiplication, with possibly a dense matrix. Furthermore the actual computation of the preconditioning matrix has natural parallelism. For a problem of size n, the preconditioning matrix can be computed by solving n independent small least squares problems. The algorithm and its implementation on the Connection Machine CM-5 are discussed in detail and supported by extensive timings obtained from real problem data.

Simon, Horst D.↗
NASA NTRSDate not supplied

A Simplified FANG Cell-Centered Finite-Volume Method and Comparison with Other Methods for Trouble-Prone Grids

We propose a simplication of the face-averaged nodal-gradient (FANG) method for a cell-centered finite-volume Euler/Navier-Stokes solver on arbitrary grids, and compare it with other gradient methods for trouble-prone grids in two dimensions. The implementation of the FANG method is simplified by adding the face-neighbor cells of the cells around a node to a least-squares gradient stencil. The resulting method is stable for both triangular and quadrilateral grids. Although it increases the residual stencil for triangular grids, it allows the solver to work seamlessly for mixed grids and greatly simplifies the implementation, especially in three dimensions. For comparison, only explicit weighted/unweighted least-squares cell-centered and nodal gradient methods are considered. These gradients are used in both inviscid and viscous schemes, and we investigate their impact on the iterative convergence of an implicit defect-correction solver on difficult grids such as highly-curved-and-thin grids and highly distorted anisotropic grids. Finally, we will also consider a face-stencil-based limiter and compare it with a conventional cell-stencil-based limiter.

Hiroaki Nishikawa↗