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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

A static model of chromospheric heating in solar flares

The response of the solar chromosphere to flare processes, namely nonthermal electrons, thermal conduction, and coronal pressure, is modeled. Finite difference methods employing linearization and iteration are used in obtaining simultaneous solutions to the equations of steady-state energy balance, hydrostatic equilibrium, radiative transfer, and atomic statistical equilibrium. The atmospheric response is assumed to be confined to one dimension by a strong vertical magnetic field. A solution is obtained to the radiative transfer equation for the most important optically thick transitions of hydrogen, magnesium, and calcium. The theoretical atmospheres discussed here are seen as elucidating the role of various physical processes in establishing the structure of flare chromospheres. At low coronal pressures, conduction is found to be more important than nonthermal electrons in establishing the position of the transition region. Only thermal conduction can adequately account for the chromospheric evaporation in compact flares. Of the mechanisms considered, only nonthermal electrons bring about significant heating below the flare transition region.

Ricchiazzi, P. J.↗
NASA NTRS1992

An extended-source spatial acquisition process based on maximum likelihood criterion for planetary optical communications

This paper describes an extended-source spatial acquisition process based on the maximum likelihood criterion for interplanetary optical communications. The objective is to use the sun-lit Earth image as a receiver beacon and point the transmitter laser to the Earth-based receiver to establish a communication path. The process assumes the existence of a reference image. The uncertainties between the reference image and the received image are modeled as additive white Gaussian disturbances. It has been shown that the optimal spatial acquisition requires solving two nonlinear equations to estimate the coordinates of the transceiver from the received camera image in the transformed domain. The optimal solution can be obtained iteratively by solving two linear equations. Numerical results using a sample sun-lit Earth as a reference image demonstrate that sub-pixel resolutions can be achieved in a high disturbance environment. Spatial resolution is quantified by Cramer-Rao lower bounds.

Yan, Tsun-Yee↗
NASA NTRS1984

Newton like: Minimal residual methods applied to transonic flow calculations

A computational technique for the solution of the full potential equation is presented. The method consists of outer and inner iterations. The outer iterate is based on a Newton like algorithm, and a preconditioned Minimal Residual method is used to seek an approximate solution of the system of linear equations arising at each inner iterate. The present iterative scheme is formulated so that the uncertainties and difficulties associated with many iterative techniques, namely the requirements of acceleration parameters and the treatment of additional boundary conditions for the intermediate variables, are eliminated. Numerical experiments based on the new method for transonic potential flows around the NACA 0012 airfoil at different Mach numbers and different angles of attack are presented, and these results are compared with those obtained by the Approximate Factorization technique. Extention to three dimensional flow calculations and application in finite element methods for fluid dynamics problems by the present method are also discussed. The Inexact Newton like method produces a smoother reduction in the residual norm, and the number of supersonic points and circulations are rapidly established as the number of iterations is increased.

Wong, Y. S.↗
NASA NTRS1985

Newton-like minimal residual methods applied to transonic flow calculations

A computational technique for the solution of the full potential equation is presented. The method consists of outer and inner iterations. The outer iterate is based on a Newton like algorithm, and a preconditioned Minimal Residual method is used to seek an approximate solution of the system of linear equations arising at each inner iterate. The present iterative scheme is formulated so that the uncertainties and difficulties associated with many iterative techniques, namely the requirements of acceleration parameters and the treatment of additional boundary conditions for the intermediate variables, are eliminated. Numerical experiments based on the new method for transonic potential flows around the NACA 0012 airfoil at different Mach numbers and different angles of attack are presented, and these results are compared with those obtained by the Approximate Factorization technique. Extention to three dimensional flow calculations and application in finite element methods for fluid dynamics problems by the present method are also discussed. The Inexact Newton like method produces a smoother reduction in the residual norm, and the number of supersonic points and circulations are rapidly established as the number of iterations is increased.

Wong, Y. S.↗
DOE OSTI2017

A Preconditioned Low-Rank Projection Method with a Rank-Reduction Scheme for Stochastic Partial Differential Equations

Herein, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations. We propose an iterative algorithm that exploits the Kronecker product structure of the linear systems. The proposed algorithm efficiently approximates the solutions in low-rank tensor format. Using standard Krylov subspace methods for the data in tensor format is computationally prohibitive due to the rapid growth of tensor ranks during the iterations. To keep tensor ranks low over the entire iteration process, we devise a rank-reduction scheme that can be combined with the iterative algorithm. The proposed rank-reduction scheme identifies an important subspace in the stochastic domain and compresses tensors of high rank on-the-fly during the iterations. The proposed reduction scheme is a coarse-grid method in that the important subspace can be identified inexpensively in a coarse spatial grid setting. The efficiency of the present method is displayed by numerical experiments on benchmark problems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2011

A Universal Tare Load Prediction Algorithm for Strain-Gage Balance Calibration Data Analysis

An algorithm is discussed that may be used to estimate tare loads of wind tunnel strain-gage balance calibration data. The algorithm was originally developed by R. Galway of IAR/NRC Canada and has been described in the literature for the iterative analysis technique. Basic ideas of Galway's algorithm, however, are universally applicable and work for both the iterative and the non-iterative analysis technique. A recent modification of Galway's algorithm is presented that improves the convergence behavior of the tare load prediction process if it is used in combination with the non-iterative analysis technique. The modified algorithm allows an analyst to use an alternate method for the calculation of intermediate non-linear tare load estimates whenever Galway's original approach does not lead to a convergence of the tare load iterations. It is also shown in detail how Galway's algorithm may be applied to the non-iterative analysis technique. Hand load data from the calibration of a six-component force balance is used to illustrate the application of the original and modified tare load prediction method. During the analysis of the data both the iterative and the non-iterative analysis technique were applied. Overall, predicted tare loads for combinations of the two tare load prediction methods and the two balance data analysis techniques showed excellent agreement as long as the tare load iterations converged. The modified algorithm, however, appears to have an advantage over the original algorithm when absolute voltage measurements of gage outputs are processed using the non-iterative analysis technique. In these situations only the modified algorithm converged because it uses an exact solution of the intermediate non-linear tare load estimate for the tare load iteration.

balance calibration analysis↗
NASA NTRS1989

Inverse dynamics of a 3 degree of freedom spatial flexible manipulator

A technique is presented for solving the inverse dynamics and kinematics of 3 degree of freedom spatial flexible manipulator. The proposed method finds the joint torques necessary to produce a specified end effector motion. Since the inverse dynamic problem in elastic manipulators is closely coupled to the inverse kinematic problem, the solution of the first also renders the displacements and rotations at any point of the manipulator, including the joints. Furthermore the formulation is complete in the sense that it includes all the nonlinear terms due to the large rotation of the links. The Timoshenko beam theory is used to model the elastic characteristics, and the resulting equations of motion are discretized using the finite element method. An iterative solution scheme is proposed that relies on local linearization of the problem. The solution of each linearization is carried out in the frequency domain. The performance and capabilities of this technique are tested through simulation analysis. Results show the potential use of this method for the smooth motion control of space telerobots.

Bayo, Eduardo↗
NASA NTRS1994

A linear method for analyzing lightning field changes

A constrained, least-squares method for analyzing multiple-station measurements of lightning field changes (delta Es) is introduced. Previous methods have attempted to fit the spatial pattern of lightning delta Es using nonlinear models, such as a point charge (Q) or a point dipole (P) model. With the linear method, the delta Es are described not by models but by a general volume charge distribution that is deposited on a large (40 x 40 x 20 cu km) Cartesian grid above the measuring network. A linear system of equations is used to relate the measured delta Es to the charges that are deposited at each grid point. With this approach, the information content of the measurements can be quantified by an eigenanalysis of the covariance matrix of the linear system. Constraints can be used to reduce the infinity of possible solutions to the linear system and also to reduce systematic biases that can be introduced by the method of solution. It is shown that a Landweber iterative method, derived from the general method of steepest descent, can be used to solve the linear system and that the resulting volume charge distributions are generally consistent with computer-simulated charge sources, when these sources are over the measuring network. The Landweber iteration has also provided solutions for natural lightning events that are consistent with Q- and P-model results.

Koshak, William J.↗
NASA NTRS1983

Wing Subsonic Aerodynamic Performance Estimates

Solution by iteration estimates performance of twisted and cambered wings of arbitrary planform. SUBAER based on linearized theory lifting-surface solution provides spanwise distribution of theoretical leading edge thrust, in addition to surface distribution of perturbation velocities. Program written in FORTRAN IV.

Carlson, H. W.↗
NASA NTRS1987

Block iterative restoration of astronomical images with the massively parallel processor

A method is described for algebraic image restoration capable of treating astronomical images. For a typical 500 x 500 image, direct algebraic restoration would require the solution of a 250,000 x 250,000 linear system. The block iterative approach is used to reduce the problem to solving 4900 121 x 121 linear systems. The algorithm was implemented on the Goddard Massively Parallel Processor, which can solve a 121 x 121 system in approximately 0.06 seconds. Examples are shown of the results for various astronomical images.

Heap, Sara R.↗
NASA NTRS1989

A nearly-linear computational-cost scheme for the forward dynamics of an N-body pendulum

The dynamic equations of motion of an n-body pendulum with spherical joints are derived to be a mixed system of differential and algebraic equations (DAE's). The DAE's are kept in implicit form to save arithmetic and preserve the sparsity of the system and are solved by the robust implicit integration method. At each solution point, the predicted solution is corrected to its exact solution within given tolerance using Newton's iterative method. For each iteration, a linear system of the form J delta X = E has to be solved. The computational cost for solving this linear system directly by LU factorization is O(n exp 3), and it can be reduced significantly by exploring the structure of J. It is shown that by recognizing the recursive patterns and exploiting the sparsity of the system the multiplicative and additive computational costs for solving J delta X = E are O(n) and O(n exp 2), respectively. The formulation and solution method for an n-body pendulum is presented. The computational cost is shown to be nearly linearly proportional to the number of bodies.

Chou, Jack C. K.↗
NASA NTRS1987

Vortex breakdown simulation

In this paper, steady, axisymmetric inviscid, and viscous (laminar) swirling flows representing vortex breakdown phenomena are simulated using a stream function-vorticity-circulation formulation and two numerical methods. The first is based on an inverse iteration, where a norm of the solution is prescribed and the swirling parameter is calculated as a part of the output. The second is based on direct Newton iterations, where the linearized equations, for all the unknowns, are solved simultaneously by an efficient banded Gaussian elimination procedure. Several numerical solutions for inviscid and viscous flows are demonstrated, followed by a discussion of the results. Some improvements on previous work have been achieved: first order upwind differences are replaced by second order schemes, line relaxation procedure (with linear convergence rate) is replaced by Newton's iterations (which converge quadratically), and Reynolds numbers are extended from 200 up to 1000.

Hafez, M.↗
NASA NTRS1982

On nonlinear finite element analysis in single-, multi- and parallel-processors

Numerical solution of nonlinear equilibrium problems of structures by means of Newton-Raphson type iterations is reviewed. Each step of the iteration is shown to correspond to the solution of a linear problem, therefore the feasibility of the finite element method for nonlinear analysis is established. Organization and flow of data for various types of digital computers, such as single-processor/single-level memory, single-processor/two-level-memory, vector-processor/two-level-memory, and parallel-processors, with and without sub-structuring (i.e. partitioning) are given. The effect of the relative costs of computation, memory and data transfer on substructuring is shown. The idea of assigning comparable size substructures to parallel processors is exploited. Under Cholesky type factorization schemes, the efficiency of parallel processing is shown to decrease due to the occasional shared data, just as that due to the shared facilities.

Utku, S.↗
NASA NTRS1988

Optimal rejection of persistent disturbances, robust stability, and mixed sensitivity minimization

The problem of optimal disturbance rejection of bounded persistent disturbances is solved in the general nonsquare case. The minimum value of the objective function can be obtained by solving a semiinfinite linear programming problem, and an iterative procedure for obtaining approximate solutions is introduced. Application of the l1-optimal problem to robustness is discussed. A mixed sensitivity problem is formulated and shown to guarantee good disturbance rejection in the presence of plant perturbations.

Dahleh, Munther A.↗
NASA NTRS1988

On the constrained Chebyshev approximation problem on ellipses

Constrained Chebyshev approximation problems of the type with minimum (p is an element of Pi(sub n):p(c)=1) and maximum (z is an element of E) with /p(z)/ are considered. Here Pi(sub n) denotes the set of all complex polynomials of degree at most n, E is any ellipse in the complex plane, and c is an element of C/E. Such approximation problems arise in the context of optimizing semi-iterative methods for the solution of large, sparse systems of linear equations Ax=b with complex non-Hermitian coefficient matrices A. The problem of obtaining optimal polynomial preconditioners for conjugate gradient type methods for Ax=b also leads to problems of this type. A new family of polynomials -- q(sub n)(z;c), n is an element of N, and c is an element of C/E -- are introduced as the polynomials which are optimal for a modified version of the Chebyshev approximation problem with Pi(sub n) replaced by a certain subfamily. Some simple properties of q(sub n) are also listed. A necessary and sufficient condition for q(sub n) to be the extremal polynomial for the approximation problem is then derived. Finally, it is shown that q(sub n) is indeed optimal for the problem for all fixed n whenever the distance between c and E is sufficiently large. Results of some numerical tests are presented.

Freund, Roland↗
NASA NTRS1993

Multigrid properties of upwind-biased data reconstructions

The multigrid properties of two data reconstruction methods used for achieving second-order spatial accuracy when solving the two-dimensional Euler equations are examined. The data reconstruction methods are used with an implicit upwind algorithm which uses linearized backward-Euler time-differencing. The solution of the resulting linear system is performed by an iterative procedure. In the present study only regular quadrilateral grids are considered, so a red-black Gauss-Seidel iteration is used. Although the Jacobian is approximated by first-order upwind extrapolation, two alternative data reconstruction techniques for the flux integral that yield higher-order spatial accuracy at steady state are examined. The first method, probably most popular for structured quadrilateral grids, is based on estimating the cell gradients using one-dimensional reconstruction along curvilinear coordinates. The second method is based on Green's theorem. Analysis and numerical results for the two dimensional Euler equations show that data reconstruction based on Green's theorem has superior multigrid properties as compared to the one-dimensional data reconstruction method.

Warren, Gary P.↗