Search NASA⌕ Search

SEARCH · Search NASA

Results for “iterative linear solution”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Parallel linear equation solvers for finite element computations

The overall objective of this research is to develop efficient methods for the solution of linear and nonlinear systems of equations on parallel and supercomputers, and to apply these methods to the solution of problems in structural analysis. Attention has been given so far only to linear equations. The methods considered for the solution of the stiffness equation Kx=f have been Choleski factorization and the conjugate gradient iteration with SSOR and Incomplete Choleski preconditioning. More detail on these methods will be given on subsequent slides. These methods have been used to solve for the static displacements for the mast and panel focus problems in conjunction with the CSM testbed system based on NICE/SPAR.

Ortega, James M.↗
NASA NTRS1992

Radiative equilibrium in rapidly expanding shells

The equation of radiative equilibrium for rapidly expanding spherical shells including the special relativistic terms is discussed, and a temperature-correction procedure for the solution of this equation is given. The temperature-correction scheme combines a partial linearization approach with the approximate Lambda-operator iteration method. For some test problems, the temperature structures of atmospheres in radiative equilibrium in the Lagrangian frame are calculated. The effects of the velocity field on the temperature stratification and the luminosity are also discussed. We find that the temperature structure of a moving photosphere in radiative equilibrium in the Lagrangian frame differs significantly from that of a static photosphere and that, at least, all first-order terms, in particular the advection and aberration terms, have to be included consistently both in the radiative transfer and the energy equation in studies of supernovae atmospheres and other high-speed radiating flows.

Hauschildt, P. H.↗
NASA NTRS2010

Deconvolution methods and systems for the mapping of acoustic sources from phased microphone arrays

A method and system for mapping acoustic sources determined from a phased microphone array. A plurality of microphones are arranged in an optimized grid pattern including a plurality of grid locations thereof. A linear configuration of N equations and N unknowns can be formed by accounting for a reciprocal influence of one or more beamforming characteristics thereof at varying grid locations among the plurality of grid locations. A full-rank equation derived from the linear configuration of N equations and N unknowns can then be iteratively determined. A full-rank can be attained by the solution requirement of the positivity constraint equivalent to the physical assumption of statically independent noise sources at each N location. An optimized noise source distribution is then generated over an identified aeroacoustic source region associated with the phased microphone array in order to compile an output presentation thereof, thereby removing the beamforming characteristics from the resulting output presentation.

Brooks, Thomas F.↗
DOE OSTI2016

High-order solution methods for grey discrete ordinates thermal radiative transfer

This work presents a solution methodology for solving the grey radiative transfer equations that is both spatially and temporally more accurate than the canonical radiative transfer solution technique of linear discontinuous finite element discretization in space with implicit Euler integration in time. We solve the grey radiative transfer equations by fully converging the nonlinear temperature dependence of the material specific heat, material opacities, and Planck function. The grey radiative transfer equations are discretized in space using arbitrary-order self-lumping discontinuous finite elements and integrated in time with arbitrary-order diagonally implicit Runge–Kutta time integration techniques. Iterative convergence of the radiation equation is accelerated using a modified interior penalty diffusion operator to precondition the full discrete ordinates transport operator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A least-squares finite element method based on the Helmholtz decomposition for hyperbolic balance laws

In this paper, a least-squares finite element method for scalar nonlinear hyperbolic balance laws is proposed and studied. The approach is based on a formulation that utilizes an appropriate Helmholtz decomposition of the flux vector and is related to the standard notion of a weak solution. This relationship, together with a corresponding connection to negative-norm least-squares, is described in detail. As a consequence, an important numerical conservation theorem is obtained, similar to the famous Lax–Wendroff theorem. The numerical conservation properties of the method in this paper do not fall precisely in the framework introduced by Lax and Wendroff, but they are similar in spirit as they guarantee that when L 2 convergence holds, the resulting approximations approach a weak solution to the hyperbolic problem. The least-squares functional is continuous and coercive in an H -1 -type norm, but not L 2 -coercive. Nevertheless, the L 2 convergence properties of the method are discussed. Convergence can be obtained either by an explicit regularization of the functional, that provides control of the L 2 norm, or by properly choosing the finite element spaces, providing implicit control of the L 2 norm. Numerical results for the inviscid Burgers equation with discontinuous source terms are shown, demonstrating the L 2 convergence of the obtained approximations to the physically admissible solution. The numerical method utilizes a least-squares functional, minimized on finite element spaces, and a Gauss–Newton technique with nested iteration. Finally, we believe that the linear systems encountered with this formulation are amenable to multigrid techniques and combining the method with adaptive mesh refinement would make this approach an efficient tool for solving balance laws (this is the focus of a future study).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Highly scalable distributed-memory sparse triangular solution algorithms.

This paper presents a highly efficient distributed-memory parallel sparse triangular solver. The triangular solution phase is often performed following factorization phase in the sparse linear solvers and has become increasingly computa­tionally expensive for direct solvers with many right hand sides (RHSs) or preconditioned iterative solvers. However, the low arithmetic intensity and sequential nature of the triangular solve algorithm pose performance challenges for its large-scale distributed-memory parallelization. In this work, we propose several strategies to enhance scalability of an algorithm with 2D block cyclic process layout. First, an asynchronous binary-tree-based communication scheme implemented via non-blocking MPI functions is leveraged to broadcast partial solutions and reduce partial updates among a subset of processes for each block column and row of the triangular matrix, respectively. This scheme reduces message latency, improves communication load balance and significantly accelerates asynchronous execution of the triangular solve. In addition, efficient BLAS operations and threading implementations are exploited to accelerate local computations and further reduce process idle time. The proposed strategies are implemented in SuperLU_DIST and numerical experiments show up to 4.4x improvement with one right-hand side and up to 6.1x improvement with 50 right- hand sides on 4096 processes, compared to the current release. This is the first time that sparse triangular solution is demonstrated strong scaling on more than 4000 cores.

Liu, Yang↗
NASA NTRS1977

An implicit-iterative solution of the heat conduction equation with a radiation boundary condition

For the problem of predicting one-dimensional heat transfer between conducting and radiating mediums by an implicit finite difference method, four different formulations were used to approximate the surface radiation boundary condition while retaining an implicit formulation for the interior temperature nodes. These formulations are an explicit boundary condition, a linearized boundary condition, an iterative boundary condition, and a semi-iterative boundary method. The results of these methods in predicting surface temperature on the space shuttle orbiter thermal protection system model under a variety of heating rates were compared. The iterative technique caused the surface temperature to be bounded at each step. While the linearized and explicit methods were generally more efficient, the iterative and semi-iterative techniques provided a realistic surface temperature response without requiring step size control techniques.

Williams, S. D.↗
DOE OSTI2018

Three Dimensional Characterization of Defects by Ultrasonic Time-of-Flight Diffraction (ToFD) Technique

Ultrasonic time-of-flight diffraction (ToFD) technique has high accuracy in locating and sizing discontinuities. The primary reason for this accuracy is the use of time instead of amplitude for measurement of the depth and size of discontinuities. Despite the many advantages of ToFD, it suffers from a number of shortcomings, the most notable one being its two-dimensional character. The goal of this paper is to develop an algorithm, as a prerequisite, to extend ToFD measurements to a three-dimensional space. For this purpose, a combination of multiple transmitting and receiving probes is proposed instead of just one pair commonly used in ToFD measurements. The approach for locating and sizing defects in a 3D space follows the methods used in radar and acoustic positioning systems. Non-iterative techniques are used for positioning a single source (defect) based on signals collected by several transducers. The estimation formula, in the form of a closed-form solution, is derived by linear least-squares minimization. In addition to existing conventional passive algorithms, a new active algorithm is also proposed for the general arrangement of transducers. This algorithm is tested on a steel specimen having an artificially implanted discontinuity and the three-dimensional location of the defect is estimated.

42 ENGINEERING↗
NASA NTRS1988

The solution of linear systems of equations with a structural analysis code on the NAS CRAY-2

Two methods for solving linear systems of equations on the NAS Cray-2 are described. One is a direct method; the other is an iterative method. Both methods exploit the architecture of the Cray-2, particularly the vectorization, and are aimed at structural analysis applications. To demonstrate and evaluate the methods, they were installed in a finite element structural analysis code denoted the Computational Structural Mechanics (CSM) Testbed. A description of the techniques used to integrate the two solvers into the Testbed is given. Storage schemes, memory requirements, operation counts, and reformatting procedures are discussed. Finally, results from the new methods are compared with results from the initial Testbed sparse Choleski equation solver for three structural analysis problems. The new direct solvers described achieve the highest computational rates of the methods compared. The new iterative methods are not able to achieve as high computation rates as the vectorized direct solvers but are best for well conditioned problems which require fewer iterations to converge to the solution.

Poole, Eugene L.↗
DOE OSTI2017

Stability analysis of nonlinear two-grid method for multigroup neutron diffusion problems

We present theoretical analysis of a nonlinear acceleration method for solving multigroup neutron diffusion problems. This method is formulated with two energy grids that are defined by (i) fine-energy groups structure and (ii) coarse grid with just a single energy group. The coarse-grid equations are derived by averaging of the multigroup diffusion equations over energy. The method uses a nonlinear prolongation operator. We perform stability analysis of iteration algorithms for inhomogeneous (fixed-source) and eigenvalue neutron diffusion problems. To apply Fourier analysis the equations of the method are linearized about solutions of infinite-medium problems. The developed analysis enables us to predict convergence properties of this two-grid method in different types of problems. Numerical results of problems in 2D Cartesian geometry are presented to confirm theoretical predictions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Robust Decentralized Learning Using ADMM With Unreliable Agents

Many signal processing and machine learning problems can be formulated as consensus optimization problems which can be solved efficiently via a cooperative multi-agent system. However, the agents in the system can be unreliable due to a variety of reasons: noise, faults and attacks. Providing erroneous updates leads the optimization process in a wrong direction, and degrades the performance of distributed machine learning algorithms. This paper considers the problem of decentralized learning using ADMM in the presence of unreliable agents. First, we rigorously analyze the effect of erroneous updates (in ADMM learning iterations) on the convergence behavior of the multi-agent system. We show that the algorithm linearly converges to a neighborhood of the optimal solution under certain conditions and characterize the neighborhood size analytically. Next, we provide guidelines for network design to achieve a faster convergence to the neighborhood. Here, we also provide conditions on the erroneous updates for exact convergence to the optimal solution. Finally, to mitigate the influence of unreliable agents, we propose ROAD , a robust variant of ADMM, and show its resilience to unreliable agents with an exact convergence to the optimum.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1972

Numerical method for the solution of large systems of differential equations of the boundary layer type

A numerical method for the solution of large systems of nonlinear differential equations of the boundary-layer type is described. The method is a modification of the technique for satisfying asymptotic boundary conditions. The present method employs inverse interpolation instead of the Newton method to adjust the initial conditions of the related initial-value problem. This eliminates the so-called perturbation equations. The elimination of the perturbation equations not only reduces the user's preliminary work in the application of the method, but also reduces the number of time-consuming initial-value problems to be numerically solved at each iteration. For further ease of application, the solution of the overdetermined system for the unknown initial conditions is obtained automatically by applying Golub's linear least-squares algorithm. The relative ease of application of the proposed numerical method increases directly as the order of the differential-equation system increases. Hence, the method is especially attractive for the solution of large-order systems. After the method is described, it is applied to a fifth-order problem from boundary-layer theory.

Green, M. J.↗
NASA NTRS1990

Propeller-wing interaction using a frequency domain panel method

The unsteady aerodynamic coupling between a propeller and a wing is analyzed using linear compressible aerodynamic theory. The periodic loads are decomposed into harmonics, and the harmonic amplitudes are found iteratively. Each stage of the iteration involves the solution of an isolated propeller or wing problem; the interaction is done through the Fourier transform of the induced velocity field. The method was validated by comparing the predicted velocity field about an isolated propeller with detailed laser Doppler velocimeter measurements and by comparison with mean loads measured in a wing-propeller experiment. Comparisons have also been made between the fluctuating loads predicted by the present method and a quasisteady vortex lattice scheme.

Williams, Marc H.↗
NASA NTRS1992

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↗
NASA NTRS1991

Evaluation of a transfinite element numerical solution method for nonlinear heat transfer problems

Laplace transform techniques have been widely used to solve linear, transient field problems. A transform-based algorithm enables calculation of the response at selected times of interest without the need for stepping in time as required by conventional time integration schemes. The elimination of time stepping can substantially reduce computer time when transform techniques are implemented in a numerical finite element program. The coupling of transform techniques with spatial discretization techniques such as the finite element method has resulted in what are known as transfinite element methods. Recently attempts have been made to extend the transfinite element method to solve nonlinear, transient field problems. This paper examines the theoretical basis and numerical implementation of one such algorithm, applied to nonlinear heat transfer problems. The problem is linearized and solved by requiring a numerical iteration at selected times of interest. While shown to be acceptable for weakly nonlinear problems, this algorithm is ineffective as a general nonlinear solution method.

Cerro, J. A.↗
DOE OSTI2023

Linearized frequency domain Landau-Lifshitz-Gilbert equation formulation

We present a general finite element linearized Landau-Lifshitz-Gilbert equation (LLGE) solver for magnetic systems under weak time-harmonic excitation field. The linearized LLGE is obtained by assuming a small deviation around the equilibrium state of the magnetic system. Inserting such expansion into LLGE and keeping only first order terms gives the linearized LLGE, which gives a frequency domain solution for the complex magnetization amplitudes under an external time-harmonic applied field of a given frequency. We solve the linear system with an iterative solver using generalized minimal residual method. We construct a preconditioner matrix to effectively solve the linear system. The validity, effectiveness, speed, and scalability of the linear solver are demonstrated via numerical examples.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Hybrid Fixed-Point Fixed-Stress Splitting Method for Linear Poroelasticity

Efficient and accurate poroelasticity models are critical in modeling geophysical problems such as oil exploration, gas-hydrate detection, and hydrogeology. We propose an efficient operator splitting method for Biot’s model of linear poroelasticity based on fixed-point iteration and constrained stress. In this method, we eliminate the constraint on time step via combining our fixed-point approach with a physics-based restraint between iterations. Three different cases are considered to demonstrate the stability and consistency of the method for constant and variable parameters. The results are validated against the results from the fully coupled approach. In case I, a single iteration is used for continuous coefficients. The relative error decreases with an increase in time. In case II, material coefficients are assumed to be linear. In the single iteration approach, the relative error grows significantly to 40% before rapidly decaying to zero. This is an artifact of the approximate solutions approaching the asymptotic solution. The error in the multiple iterations oscillates within 10 − 6 before decaying to the asymptotic solution. Nine iterations per time step are enough to achieve the relative error close to 10 − 7 . In the last case, the hybrid method with multiple iterations requires approximately 16 iterations to make the relative error 5 × 10 − 6 .

Delgado, Paul M.↗