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 37 records · Page 2

A GTD study of pyramidal horns for offset reflector antenna applications

An efficient computational method is demonstrated for determining the far-field patterns of reflectors illuminated by pyramidal horns. A uniform geometrical theory of diffraction (GTD) formulation is used to determine the near- and far-fields of the horn. The far-field patterns of the offset reflector are constructed using the physical optics (PO) formulation in conjunction with the Jacobi-Bessel expansion method. Many representative results are shown for the far-field patterns of the reflector. In particular, the concept of the optimum phase center for the best location of a horn illuminating a reflector is carefully studied and some useful observations are made.

Huang, J.↗

An efficient technique for the computation of vector secondary patterns of offset paraboloid reflectors

A series approach for the rapid computation of the vector secondary pattern of offset paraboloid reflectors wherein the feed is displaced is presented. We show that the Jacobi polynomial series method, which has been demonstrated to provide an efficient means for evaluating the radiation integral of symmetric paraboloid reflectors, can be extended to the case of an offset paraboloid without compromising the ease or speed of computation. The analysis leading to the series formula is also useful for deriving an analytic expression for the optimum scan plane for the displacement of the feed. Representative numerical results illustrating the application of the method and the properties of the offset paraboloid are presented.

Mittra, R.↗

Simultaneous iterations algorithm for general eigenvalue problems on parallel processors

The method of simultaneous iteration with shift is extended to extraction of m-eigenpairs of a general eigenvalue problem of large order n in a parallel processing environment. The algorithm combines the power method and the Jacobi technique, and reduces to performing four basic operations. Parallel implementation of the algorithm is discussed in detail. The analysis accounts for computation and communication costs, and utilizes a parallel processing architecture of the ensemble type. Expressions for the computational efficiency and speedup are defined as a function of the problem and hardware parameters. Selected representative problems exhibit efficiencies ranging from 60 to 98 percent.

Utku, S.↗

Some suggested approaches to solving the Hamilton-Jacobi equation associated with constrained rigid body motion

Some methods of approaching a solution to the Hamilton-Jacobi equation are outlined and examples are given to illustrate particular methods. These methods may be used for cases where the Hamilton-Jacobi equation is not separable and have been particularly useful in solving the rigid body motion of an earth satellite subjected to gravity torques. These general applications may also have usefulness in studying the motion of satellites with aerodynamic torque and in studying space vehicle motion where thrusting is involved.

Fitzpatrick, P. M.↗

Analysis of Preconditioning and Relaxation Operators for the Discontinuous Galerkin Method Applied to Diffusion

The explicit stability constraint of the discontinuous Galerkin method applied to the diffusion operator decreases dramatically as the order of the method is increased. Block Jacobi and block Gauss-Seidel preconditioner operators are examined for their effectiveness at accelerating convergence. A Fourier analysis for methods of order 2 through 6 reveals that both preconditioner operators bound the eigenvalues of the discrete spatial operator. Additionally, in one dimension, the eigenvalues are grouped into two or three regions that are invariant with order of the method. Local relaxation methods are constructed that rapidly damp high frequencies for arbitrarily large time step.

Atkins, H. L.↗

Finite Element Methods for real-time Haptic Feedback of Soft-Tissue Models in Virtual Reality Simulators

We have applied the linear elastic finite element method to compute haptic force feedback and domain deformations of soft tissue models for use in virtual reality simulators. Our results show that, for virtual object models of high-resolution 3D data (>10,000 nodes), haptic real time computations (>500 Hz) are not currently possible using traditional methods. Current research efforts are focused in the following areas: 1) efficient implementation of fully adaptive multi-resolution methods and 2) multi-resolution methods with specialized basis functions to capture the singularity at the haptic interface (point loading). To achieve real time computations, we propose parallel processing of a Jacobi preconditioned conjugate gradient method applied to a reduced system of equations resulting from surface domain decomposition. This can effectively be achieved using reconfigurable computing systems such as field programmable gate arrays (FPGA), thereby providing a flexible solution that allows for new FPGA implementations as improved algorithms become available. The resulting soft tissue simulation system would meet NASA Virtual Glovebox requirements and, at the same time, provide a generalized simulation engine for any immersive environment application, such as biomedical/surgical procedures or interactive scientific applications.

Frank, Andreas O.↗

Large-scale computation of incompressible viscous flow by least-squares finite element method

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to large-scale/three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations and results in symmetric, positive definite algebraic system which can be solved effectively by simple iterative methods. The first-order velocity-Bernoulli function-vorticity formulation for incompressible viscous flows is also tested. For three-dimensional cases, an additional compatibility equation, i.e., the divergence of the vorticity vector should be zero, is included to make the first-order system elliptic. The simple substitution of the Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. To show the validity of this scheme for large-scale computation, we give numerical results for 2D driven cavity problem at Re = 10000 with 408 x 400 bilinear elements. The flow in a 3D cavity is calculated at Re = 100, 400, and 1,000 with 50 x 50 x 50 trilinear elements. The Taylor-Goertler-like vortices are observed for Re = 1,000.

Jiang, Bo-Nan↗

A least-squares finite element method for 3D incompressible Navier-Stokes equations

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations, and results in symmetric, positive definite algebraic system. An additional compatibility equation, i.e., the divergence of vorticity vector should be zero, is included to make the first-order system elliptic. The Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. The flow in a half of 3D cubic cavity is calculated at Re = 100, 400, and 1,000 with 50 x 52 x 25 trilinear elements. The Taylor-Gortler-like vortices are observed at Re = 1,000.

Jiang, Bo-Nan↗

A Parallel Symmetric Successive Overrelaxation Method for OVERFLOW

The block Jacobi symmetric successive overrelaxation (SSOR) algorithm has been reformulated as a parallelized algorithm for the OVERFLOWstructured, overset grid, computational fluid dynamics flow solver. Simple changes to the flow solver required to implement the algorithm are discussed. A series of test cases are presented that demonstrate how the addition of implicit overset boundaries has improved the robustness and nonlinear convergence characteristics of the flow solver.

Computational Fluid Dynamics↗

Robust Multigrid Smoothers for Three Dimensional Elliptic Equations with Strong Anisotropies

We discuss the behavior of several plane relaxation methods as multigrid smoothers for the solution of a discrete anisotropic elliptic model problem on cell-centered grids. The methods compared are plane Jacobi with damping, plane Jacobi with partial damping, plane Gauss-Seidel, plane zebra Gauss-Seidel, and line Gauss-Seidel. Based on numerical experiments and local mode analysis, we compare the smoothing factor of the different methods in the presence of strong anisotropies. A four-color Gauss-Seidel method is found to have the best numerical and architectural properties of the methods considered in the present work. Although alternating direction plane relaxation schemes are simpler and more robust than other approaches, they are not currently used in industrial and production codes because they require the solution of a two-dimensional problem for each plane in each direction. We verify the theoretical predictions of Thole and Trottenberg that an exact solution of each plane is not necessary and that a single two-dimensional multigrid cycle gives the same result as an exact solution, in much less execution time. Parallelization of the two-dimensional multigrid cycles, the kernel of the three-dimensional implicit solver, is also discussed. Alternating-plane smoothers are found to be highly efficient multigrid smoothers for anisotropic elliptic problems.

Llorente, Ignacio M.↗

High-Order Semi-Discrete Central-Upwind Schemes for Multi-Dimensional Hamilton-Jacobi Equations

We present the first fifth order, semi-discrete central upwind method for approximating solutions of multi-dimensional Hamilton-Jacobi equations. Unlike most of the commonly used high order upwind schemes, our scheme is formulated as a Godunov-type scheme. The scheme is based on the fluxes of Kurganov-Tadmor and Kurganov-Tadmor-Petrova, and is derived for an arbitrary number of space dimensions. A theorem establishing the monotonicity of these fluxes is provided. The spacial discretization is based on a weighted essentially non-oscillatory reconstruction of the derivative. The accuracy and stability properties of our scheme are demonstrated in a variety of examples. A comparison between our method and other fifth-order schemes for Hamilton-Jacobi equations shows that our method exhibits smaller errors without any increase in the complexity of the computations.

Bryson, Steve↗

A numerical method for the solution of three dimensional, incompressible, viscous flows over slender bodies

A marching iterative method for the solution of the three dimensional, incompressibhle, steady and parabolized Navier-Stokes equations is described. The equations are written in primitive variables and discretized in general axisymmetric orthogonal coordinate systems. The coupled set of finite-difference equations are solved without any splitting or factorization errors. Moreover, the continuity equation and the two crossflow momentum equations are exactly satisfied at every step of the iterative process. The solution scheme is equivalent to the solution of one Poisson equation by the Successive Plane Over Relaxation method and has good convergence properties. Other existing solution methods resemble a Jacobi-type iterative scheme and therefore are less efficient. Numerical experiments include the laminar, incompressible flow over prolate spheroids at incidence.

Rosenfeld, Moshe↗

Faster Computation Of Far Fields Of Dish Antennas

Modified Zernike-polynomial approach reduces number of terms in numerical integration. Yields greater or equal accuracy with fewer terms in series expansion and fewer sampling points across aperture and, less computation. Method based on Jacobi-Bessel-expansion concept.

Jamnejad, Vahraz↗

Accelerated complete-linearization method for calculating NLTE model stellar atmospheres

Two approaches to accelerating the method of complete linearization for calculating NLTE model stellar atmospheres are suggested. The first one, the so-called Kantorovich variant of the Newton-Raphson method, consists of keeping the Jacobi matrix of the system fixed, which allows us to calculate the costly matrix inversions only a few times and then keep them fixed during the subsequent computations. The second method is an application of the Ng acceleration. Both methods are extremely easy to implement with any model atmosphere code based on complete linearization. It is demonstrated that both methods, and especially their combination, yield a rapidly and globally convergent algorithm, which takes 2 to 5 times less computer time, depending on the model at hand and the required accuracy, than the ordinary complete linearization. Generally, the time gain is more significant for more complicated models. The methods were tested for a broad range of atmospheric parameters, and in all cases they exhibited similar behavior. Ng acceleration applied on the Kantorovich variant thus offers a significant improvement of the standard complete-linearization method, and may now be used for calculating relatively involved NLTE model stellar atmospheres.

Hubeny, I.↗