Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Jacobi Method”

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 73 records · Page 4

Reachability Subspace Exploration Using Continuation Methods

Reachability manifold computation suffers from the curse of dimensionality and for large state spaces is computationally intractable. This paper examines the use of continuation methods to address this issue by formulating the reachability sub-space manifold calculation into a number of initial valued problems. As a result of computing the reachability manifold for a subspace of interest, an exponential improvement in computational cost occurs. This concept is applied to a position subspace reachability problem of a spacecraft in a Keplerian orbit under maximum thrust constraints. Future work includes a comparison of the proposed method with computing reachability manifolds using viscosity solutions of the Hamilton Jacobi Bellman partial differential equation.

orbital mechanics↗

Multigrid method for stability problems

The problem of calculating the stability of steady state solutions of differential equations is treated. Leading eigenvalues (i.e., having maximal real part) of large matrices that arise from discretization are to be calculated. An efficient multigrid method for solving these problems is presented. The method begins by obtaining an initial approximation for the dominant subspace on a coarse level using a damped Jacobi relaxation. This proceeds until enough accuracy for the dominant subspace has been obtained. The resulting grid functions are then used as an initial approximation for appropriate eigenvalue problems. These problems are being solved first on coarse levels, followed by refinement until a desired accuracy for the eigenvalues has been achieved. The method employs local relaxation on all levels together with a global change on the coarsest level only, which is designed to separate the different eigenfunctions as well as to update their corresponding eigenvalues. Coarsening is done using the FAS formulation in a non-standard way in which the right hand side of the coarse grid equations involves unknown parameters to be solved for on the coarse grid. This in particular leads to a new multigrid method for calculating the eigenvalues of symmetric problems. Numerical experiments with a model problem demonstrate the effectiveness of the method proposed. Using an FMG algorithm a solution to the level of discretization errors is obtained in just a few work units (less than 10), where a work unit is the work involved in one Jacobi relization on the finest level.

Taasan, Shlomo↗

Photometric geodesy of main-belt asteroids. IV - An updated analysis of lightcurves for poles, periods, and shapes

The Drummond et al. (1988) analysis of main-belt asteroids is presently extended, using three independent methods to derive poles, periods, phase functions, and triaxial ellipsoid shapes from lightcurve maxima and minima. This group of 26 asteroids is also reinvestigated with a view to the distributions of triaxial shapes and obliquity distributions. Poles weakly tend to avoid asteroid orbital planes; a rough-smooth dichotomization appears to be justified by the persistence of two solar phase angle-amplitude relations. Seven of the objects may be Jacobi ellipsoids if axial ratios are slightly exaggerated by a systematic effect of the analytical method employed.

Drummond, J. D.↗

A new numerical method for the simulation of three dimensional flow in a pipe

A new numerical technique for simulating three dimensional, unsteady, incompressible pipe flows is presented and its utility and accuracy is shown. Each vector function in the expansion of the velocity field is divergence free and satisfies the boundary conditions for viscous flow. Some of the benefits of the expansion technique are that pressure is eliminated from the dynamics, only two unknowns per mesh point are required, implicit treatment of the viscous terms is provided at no extra computational cost, and no fractional time steps are required. The method uses spectral expansions: Fourier series in the azimuthal and streamwise directions, and Jacobi polynominals in the radial direction.

Leonard, A.↗

A new numerical method for the simulation of three-dimensional flow in a pipe

A new numerical technique for simulating three dimensional, unsteady, incompressible pipe flows is presented and its utility and accuracy is shown. Each vector function in the expansion of the velocity field is divergence free and satisfies the boundary conditions for viscous flow. Some of the benefits of the expansion technique are that pressure is eliminated from the dynamics, only two unknowns per mesh point are required, implicit treatment of the viscous terms is provided at no extra computational cost, and no fractional time steps are required. The method uses spectral expansions: Fourier series in the azimuthal and streamwise directions, and Jacobi polynominals in the radial direction. Previously announced in STAR as N82-31644

Leonard, A.↗

Efficient High Order Central Schemes for Multi-Dimensional Hamilton-Jacobi Equations: Talk Slides

This viewgraph presentation presents information on the attempt to produce high-order, efficient, central methods that scale well to high dimension. The central philosophy is that the equations should evolve to the point where the data is smooth. This is accomplished by a cyclic pattern of reconstruction, evolution, and re-projection. One dimensional and two dimensional representational methods are detailed, as well.

Bryson, Steve↗

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, J. H.↗

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, Joel H.↗

A parallel algorithm for the eigenvalues and eigenvectors for a general complex matrix

A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex matrix. Most parallel methods for this parallel typically display only linear convergence. Sequential norm-reducing algorithms also exit and they display quadratic convergence in most cases. The new algorithm is a parallel form of the norm-reducing algorithm due to Eberlein. It is proven that the asymptotic convergence rate of this algorithm is quadratic. Numerical experiments are presented which demonstrate the quadratic convergence of the algorithm and certain situations where the convergence is slow are also identified. The algorithm promises to be very competitive on a variety of parallel architectures.

Shroff, Gautam↗

Spectral element multigrid. Part 2: Theoretical justification

A multigrid algorithm is analyzed which is used for solving iteratively the algebraic system resulting from tha approximation of a second order problem by spectral or spectral element methods. The analysis, performed here in the one dimensional case, justifies the good smoothing properties of the Jacobi preconditioner that was presented in Part 1 of this paper.

Maday, Yvon↗

Comparison of Implicit Schemes for the Incompressible Navier-Stokes Equations

For a computational flow simulation tool to be useful in a design environment, it must be very robust and efficient. To develop such a tool for incompressible flow applications, a number of different implicit schemes are compared for several two-dimensional flow problems in the current study. The schemes include Point-Jacobi relaxation, Gauss-Seidel line relaxation, incomplete lower-upper decomposition, and the generalized minimum residual method preconditioned with each of the three other schemes. The efficiency of the schemes is measured in terms of the computing time required to obtain a steady-state solution for the laminar flow over a backward-facing step, the flow over a NACA 4412 airfoil, and the flow over a three-element airfoil using overset grids. The flow solver used in the study is the INS2D code that solves the incompressible Navier-Stokes equations using the method of artificial compressibility and upwind differencing of the convective terms. The results show that the generalized minimum residual method preconditioned with the incomplete lower-upper factorization outperforms all other methods by at least a factor of 2.

Rogers, Stuart E.↗

A plane-polar approach for far-field construction from near-field measurements

The planar configuration with a probe scanning a polar geometry is discussed with reference to its usefulness in the determination of a far field from near-field measurements. The accuracy of the method is verified numerically, using the concept of probe compensation as a vector deconvolution. Advantages of the Jacobi-Bessel series over the fast Fourier transforms for the plane-polar geometry are demonstrated. Finally, the far-field pattern of the Viking high gain antenna is constructed from the plane-polar near-field measured data and compared with the previously measured far-field pattern.

Rahmat-Samii, Y.↗

Spectral element miltigrid. II - Theoretical justification

A multigrid algorithm is analyzed which is used for solving iteratively the algebraic system resulting from the approximation of a second order problem by spectral or spectral element methods. The analysis, performed here in the one-dimensional case, justifies the good smoothing properties of the Jacobi preconditioner that was presented in Part 1 of this paper.

Maday, Yvon↗

Advanced Sine Wave Modulation of Continuous Wave Laser System for Atmospheric CO2 Differential Absorption Measurements

NASA Langley Research Center in collaboration with ITT Exelis have been experimenting with Continuous Wave (CW) laser absorption spectrometer (LAS) as a means of performing atmospheric CO2 column measurements from space to support the Active Sensing of CO2 Emissions over Nights, Days, and Seasons (ASCENDS) mission.Because range resolving Intensity Modulated (IM) CW lidar techniques presented here rely on matched filter correlations, autocorrelation properties without side lobes or other artifacts are highly desirable since the autocorrelation function is critical for the measurements of lidar return powers, laser path lengths, and CO2 column amounts. In this paper modulation techniques are investigated that improve autocorrelation properties. The modulation techniques investigated in this paper include sine waves modulated by maximum length (ML) sequences in various hardware configurations. A CW lidar system using sine waves modulated by ML pseudo random noise codes is described, which uses a time shifting approach to separate channels and make multiple, simultaneous online/offline differential absorption measurements. Unlike the pure ML sequence, this technique is useful in hardware that is band pass filtered as the IM sine wave carrier shifts the main power band. Both amplitude and Phase Shift Keying (PSK) modulated IM carriers are investigated that exibit perfect autocorrelation properties down to one cycle per code bit. In addition, a method is presented to bandwidth limit the ML sequence based on a Gaussian filter implemented in terms of Jacobi theta functions that does not seriously degrade the resolution or introduce side lobes as a means of reducing aliasing and IM carrier bandwidth.

Campbell, Joel F.↗

A nonlinear relaxation/quasi-Newton algorithm for the compressible Navier-Stokes equations

A highly efficient implicit method for the computation of steady, two-dimensional compressible Navier-Stokes flowfields is presented. The discretization of the governing equations is hybrid in nature, with flux-vector splitting utilized in the streamwise direction and central differences with flux-limited artificial dissipation used for the transverse fluxes. Line Jacobi relaxation is used to provide a suitable initial guess for a new nonlinear iteration strategy based on line Gauss-Seidel sweeps. The applicability of quasi-Newton methods as convergence accelerators for this and other line relaxation algorithms is discussed, and efficient implementations of such techniques are presented. Convergence histories and comparisons with experimental data are presented for supersonic flow over a flat plate and for several high-speed compression corner interactions. Results indicate a marked improvement in computational efficiency over more conventional upwind relaxation strategies, particularly for flowfields containing large pockets of streamwise subsonic flow.

Edwards, Jack R.↗

H(sub infinity)-type filter for spacecraft attitude estimation

A nonlinear filtering theory from a deterministic point of view is presented and an application to attitude determination is considered. The approach that is taken in this paper is motivated largely by the H(sun infinity) control and estimation theory for linear systems which has been evolved within the last decade. Rather than formulating the estimation problem as a game played by two adversaries, as has been done in the linear case, we employ in this work some notions from the theory of dissipative systems as a vehicle for arriving at certain Hamilton-Jacobi inequality, which in turn, provides a solution to the filtering problem, whenever it is satisfied. Application of this method to a linear estimation problem and to the problem of estimating a spacecraft attitude quaternion and gyro drift bias vector are presented. In limiting cases, these give the Kalman filter and the extended Kalman filter, respectively. The main advantages of this approach over its probabilistic counterpart are that this approach does not require a prior knowledge of any statistics, and that in general it is more amenable to a quantitative assessment regarding approximations such as linearization, and that in certain cases this approach yields an exact solution to the nonlinear filtering.

Markley, F. Landis↗

Efficient Preconditioning of a High-Order Solver for Multiple Physics

This work addresses preconditioning approaches for an implicit high-order solver frame-work applied to multiple physics. The solver is based on a space-time spectral element method and matrix-free Newton-Krylov solver developed at NASA over the recent years. Within this context, most preconditioning methods are impractical, as the computational time and memory requirements scale poorly with increasing polynomial orders. To improve computational efficiency, we first describe a novel entity-based Block Jacobi preconditioner for the continuous-Galerkin solution of the linear-elasticity and linear-shell equations. Second, we introduce a multigrid algorithm to further reduce time-to-solution on stiff cases arising from continuous-and discontinuous-Galerkin discretizations. Results obtained on relevant single-physics reference solutions, demonstrate the feasibility of the methods, paving the way for high-order solutions of fully coupled multi-physics problems.

STMD↗