SEARCH · Search NASA

Results for “iterative 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.

SourceResearch connectionFrom yearThrough year

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

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

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 NTRS2011

Efficient Kriging Algorithms

More efficient versions of an interpolation method, called kriging, have been introduced in order to reduce its traditionally high computational cost. Written in C++, these approaches were tested on both synthetic and real data. Kriging is a best unbiased linear estimator and suitable for interpolation of scattered data points. Kriging has long been used in the geostatistic and mining communities, but is now being researched for use in the image fusion of remotely sensed data. This allows a combination of data from various locations to be used to fill in any missing data from any single location. To arrive at the faster algorithms, sparse SYMMLQ iterative solver, covariance tapering, Fast Multipole Methods (FMM), and nearest neighbor searching techniques were used. These implementations were used when the coefficient matrix in the linear system is symmetric, but not necessarily positive-definite.

Memarsadeghi, Nargess↗

NASA NTRS2014

Propulsion System Simulation Using the Toolbox for the Modeling and Analysis of Thermodynamic System T-MATS

A simulation toolbox has been developed for the creation of both steady-state and dynamic thermodynamic software models. This paper describes the Toolbox for the Modeling and Analysis of Thermodynamic Systems (T-MATS), which combines generic thermodynamic and controls modeling libraries with a numerical iterative solver to create a framework for the development of thermodynamic system simulations, such as gas turbine engines. The objective of this paper is to present an overview of T-MATS, the theory used in the creation of the module sets, and a possible propulsion simulation architecture. A model comparison was conducted by matching steady-state performance results from a T-MATS developed gas turbine simulation to a well-documented steady-state simulation. Transient modeling capabilities are then demonstrated when the steady-state T-MATS model is updated to run dynamically.

gas path dynamics↗

NASA NTRS2014

T-MATS Toolbox for the Modeling and Analysis of Thermodynamic Systems

The Toolbox for the Modeling and Analysis of Thermodynamic Systems (T-MATS) is a MATLABSimulink (The MathWorks Inc.) plug-in for creating and simulating thermodynamic systems and controls. The package contains generic parameterized components that can be combined with a variable input iterative solver and optimization algorithm to create complex system models, such as gas turbines.

system modeling↗

NASA NTRS2014

Propulsion System Simulation Using the Toolbox for the Modeling and Analysis of Thermodynamic System (T-MATS)

A simulation toolbox has been developed for the creation of both steady-state and dynamic thermodynamic software models. This presentation describes the Toolbox for the Modeling and Analysis of Thermodynamic Systems (T-MATS), which combines generic thermodynamic and controls modeling libraries with a numerical iterative solver to create a framework for the development of thermodynamic system simulations, such as gas turbine engines. The objective of this presentation is to present an overview of T-MATS, the theory used in the creation of the module sets, and a possible propulsion simulation architecture.

aerothermodynamics↗

NASA NTRS2014

Propulsion System Simulation Using the Toolbox for the Modeling and Analysis of Thermodynamic Systems (T-MATS)

aerothermodynamics↗

NASA NTRS2011

Efficient Solution of Three-Dimensional Problems of Acoustic and Electromagnetic Scattering by Open Surfaces

We present a computational methodology (a novel Nystrom approach based on use of a non-overlapping patch technique and Chebyshev discretizations) for efficient solution of problems of acoustic and electromagnetic scattering by open surfaces. Our integral equation formulations (1) Incorporate, as ansatz, the singular nature of open-surface integral-equation solutions, and (2) For the Electric Field Integral Equation (EFIE), use analytical regularizes that effectively reduce the number of iterations required by iterative linear-algebra solution based on Krylov-subspace iterative solvers.

sound-soft acoustic scattering↗

NASA NTRS2021

Evaluation of Higher-order Quadrature Schemes in Improving Computational Efficiency for Orientation-averaged Single-Scattering Properties of Nonspherical Ice Particles

We evaluate several high-order quadrature schemes for accuracy and efficacy in obtaining orientation-averaged single-scattering properties (SSPs). We use the highly efficient MIDAS to perform electromagnetic scattering calculations to evaluate the gain in efficiency from these schemes. MIDAS is shown to be superior to DDSCAT, a popular discrete dipole approximation (DDA) method. This study is motivated by the fact that quality physical precipitation retrievals rely on using accurate orientation-averaged SSPs derived from realistic hydrometeors as input to radiative transfer Models (RTMs). The DDA has been a popular choice for single-scattering calculations, due to its versatility with respect to target geometry. However, being iterative-solver-based (ISB), the most used DDA codes, e.g. DDSCAT and ADDA, must solve the scattering problem for each orientation of the target separately. As the size parameter and geometric anisotropy of the hydrometeor increase, the number of orientations needed to obtain accurate orientation-averages can increase drastically and so does the computation cost incurred by the ISB-DDA methods. MIDAS is a Direct-Solver-Based (DSB) code, its decomposition of the original large matrix with a high rank into multiple more manageable smaller matrices of lower ranks makes it much more computationally efficient while maintaining excellent accuracy. In addition, direct solvers consider all requested orientations at once, giving MIDAS further advantage over popular ISB-DDA methods. MIDAS, when combined with high-order quadrature for orientation averaging, can be greater than three orders of magnitude more efficient in obtaining RTM-ready SSPs of complex-shaped hydrometeors than existing ISB-DDA methods, with the native quadrature schemes they offer.

Ines Fenni↗

NASA NTRSDate not supplied

Performance Optimization Methods for a Memory-Bound, Unstructured-Grid CFD Application on Massively Parallel GPU Platforms

Computational performance of the FUN3D unstructured-grid computational fluid dynamics (CFD) application on massively parallel GPU environments is memory-bound and highly dependent upon efficient reads from and atomic updates to the irregular cell-, edge-, and node-based data structures. In this talk, we present recent efforts into optimizing select performance-critical kernels on NVIDIA Tesla V100 and A100 GPUs and AMD CDNA MI100 GPUs. A novel use of L2 cache residency controls and asynchronous loads into on-chip shared memory are explored on the A100 GPU for the sparse iterative solver, which is dominated by mixed-precision, sparse matrix vector multiplication. Demonstrations show that these methods improve global memory bandwidth utilization by 13.5% on the A100 GPU. Several techniques are also presented that use registers and/or shared memory to facilitate array transposition and aggregation which combine to reduce the frequency and increase the cache efficiency of floating-point atomic updates to the irregular data structures. These methods are demonstrated to improve the kernel throughput by nearly 500% on select kernels on the AMD MI100 over atomic updates directly to global memory. Overall, both V100 and A100 GPUs outperformed the MI100 GPU on kernels dominated by double-precision atomic updates; however, the techniques demonstrated here reduced the performance gap and improved the MI100 performance.

GPU CPU unstructured CFD memory↗

DOE OSTI2017

Xyce

The Xyce Parallel Electronic Simulator simulates electronic circuit behavior in DC, AC, HB, MPDE and transient mode using standard analog (DAE) and/or device (PDE) device models including several age and radiation aware devices. It supports a variety of computing platforms (both serial and parallel) computers. Lastly, it uses a variety of modern solution algorithms dynamic parallel load-balancing and iterative solvers.

Thomquist, Heidi K.↗

DOE OSTI2023

An efficient solution of low-frequency magnetic problems with voltage sources using all-frequency stable formulation

The modeling and simulation of magnetic problems at low frequencies are considered in this paper. When excited with a voltage source, conduction current is induced in the circuit of interest, which generates the magnetic field. This type of problems is modeled using the all-frequency stable formulation, which employs the potential description of fields with an inhomogeneous Coulomb gauge. With the aid of the stable formulation, the low-frequency breakdown problem is circumvented and both electric and magnetic fields can be solved in a single simulation. To solve large magnetic problems efficiently, it is necessary to employ an iterative solver with an efficient preconditioner. In this work, a preconditioner based on the incomplete LU decomposition is constructed and applied in a wide frequency range. Several numerical examples are given to demonstrate the performance of the proposed method.

Mekonnen, Minyechil↗

DOE OSTI2019

Efficient discontinuous finite difference meshes for 3-D Laplace–Fourier domain seismic wavefield modelling in acoustic media with embedded boundaries

Simulation of acoustic wave propagation in the Laplace–Fourier (LF) domain, with a spatially uniform mesh, can be computationally demanding especially in areas with large velocity contrasts. To improve efficiency and convergence, we use 3-D second- and fourth-order velocity-pressure finite difference (FD) discontinuous meshes (DM). Our DM algorithm can use any spatial discretization ratio between meshes. We evaluate direct and iterative parallel solvers for computational speed, memory requirements and convergence. Finally, benchmarks in realistic 3-D models and topographies show more efficient and stable results for DM with direct solvers than uniform mesh results with iterative solvers.

58 GEOSCIENCES↗

NASA NTRS1994

A Parallel Incompressible Navier-Stokes Solver with Multigrid Iterations

We developed a parallel, numerically accurate and stable, and computationally efficient finate-difference incompressible Navier-Stokes (N-S) fluid flow solver. The solver runs on both sequential and massively parallel computers. The numerical method used here is a second-order projection method on a staggered grid. The code is highly modular and it can be used either as a stand-alone flow solver and or a template code which can be adapted or expanded to a specific application. Numerical results and parallel performances of our code on Intel Delta and Paragon are reported.

Navier-Stokes solver↗

NASA NTRS1990

High-performance equation solvers and their impact on finite element analysis

The role of equation solvers in modern structural analysis software is described. Direct and iterative equation solvers which exploit vectorization on modern high-performance computer systems are described and compared. The direct solvers are two Cholesky factorization methods. The first method utilizes a novel variable-band data storage format to achieve very high computation rates and the second method uses a sparse data storage format designed to reduce the number of operations. The iterative solvers are preconditioned conjugate gradient methods. Two different preconditioners are included; the first uses a diagonal matrix storage scheme to achieve high computation rates and the second requires a sparse data storage scheme and converges to the solution in fewer iterations that the first. The impact of using all of the equation solvers in a common structural analysis software system is demonstrated by solving several representative structural analysis problems.

Poole, Eugene L.↗

NASA NTRS1992

High-performance equation solvers and their impact on finite element analysis

The role of equation solvers in modern structural analysis software is described. Direct and iterative equation solvers which exploit vectorization on modern high-performance computer systems are described and compared. The direct solvers are two Cholesky factorization methods. The first method utilizes a novel variable-band data storage format to achieve very high computation rates and the second method uses a sparse data storage format designed to reduce the number od operations. The iterative solvers are preconditioned conjugate gradient methods. Two different preconditioners are included; the first uses a diagonal matrix storage scheme to achieve high computation rates and the second requires a sparse data storage scheme and converges to the solution in fewer iterations that the first. The impact of using all of the equation solvers in a common structural analysis software system is demonstrated by solving several representative structural analysis problems.

Poole, Eugene L.↗

NASA NTRS1991

Blade design and analysis using a modified Euler solver

An iterative method for blade design based on Euler solver and described in an earlier paper is used to design compressor and turbine blades providing shock free transonic flows. The method shows a rapid convergence, and indicates how much the flow is sensitive to small modifications of the blade geometry, that the classical iterative use of analysis methods might not be able to define. The relationship between the required Mach number distribution and the resulting geometry is discussed. Examples show how geometrical constraints imposed upon the blade shape can be respected by using free geometrical parameters or by relaxing the required Mach number distribution. The same code is used both for the design of the required geometry and for the off-design calculations. Examples illustrate the difficulty of designing blade shapes with optimal performance also outside of the design point.

Leonard, O.↗

NASA NTRS1988

Iterative finite element solver on transputer networks

The parallelism inherent in the Conjugate Gradient method is described. The initial results of a parallel implementation on a network of twelve transputers are discussed. The high efficiencies obtained indicate that significant speedup can be obtained with larger transputer arrays if communication overhead can be kept low. To this end, a method of communication that allows large, dynamically reconfigurable transputer arrays to exchange data in log sub 4 N steps for N processors is suggested.

Danial, Albert↗

NASA NTRS1985

Development of a boundary-layer-type solver based on simultaneous iteration technique for axisymmetric separated flows

A boundary-layer-type solver is developed for the numerical solution of axisymmetric separated flows. A new fully implicit coupling scheme for the viscous and inviscid regions is demonstrated. This fully implicit coupling technique is similar to the work of Carter, Veldman, and an extension of an earlier work of Halim and Hafez. A comparison is made for the convergence rate using this new fully implicit coupling technique and the semiimplicit coupling of Halim and Hafez. Numerical results using the fully implicit coupling are obtained for laminar incompressible separated flows, including a boattail and a series of trough geometries. Also, the near-wake flow problem is considered using the present formulation. A clear conclusion of this investigation is that the present scheme using the fully implicit coupling method converges at a faster rate than the semiimplicit coupling and the partially parabolized Navier-Stokes (PPNS) procedures.

Halim, A. A. M.↗