Search NASA⌕ Search

SEARCH · Search NASA

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Modeling the asynchronous Jacobi method without communication delays

Asynchronous iterative methods for solving linear systems are gaining renewed interest due to the high cost of synchronization points in massively parallel codes. Historically, theory on asynchronous iterative methods has focused on asymptotic behavior, while the transient behavior remains poorly understood. In this paper, we study a model of the asynchronous Jacobi method without communication delays, which we call simplified asynchronous Jacobi. Simplified asynchronous Jacobi can be used to model asynchronous Jacobi implemented in shared memory or distributed memory with fast communication networks. Our analysis uses the idea of a propagation matrix, which is similar in concept to an iteration matrix. We show that simplified asynchronous Jacobi can continue to reduce the residual when some processes are slower than other processes. We also show that simplified asynchronous Jacobi can converge when synchronous Jacobi does not. We verify our analysis of simplified asynchronous Jacobi using results from asynchronous Jacobi implemented in shared and distributed memory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

The classical limit of minimal length uncertainty relation: revisit with the Hamilton-Jacobi method

The existence of a minimum measurable length could deform not only the standard quantum mechanics but also classical physics. The effects of the minimal length on classical orbits of particles in a gravitation field have been investigated before, using the deformed Poisson bracket or Schwarzschild metric. In this paper, we first use the Hamilton-Jacobi method to derive the deformed equations of motion in the context of Newtonian mechanics and general relativity. We then employ them to study the precession of planetary orbits, deflection of light, and time delay in radar propagation. We also set limits on the deformation parameter by comparing our results with the observational measurements. Finally, comparison with results from previous papers is given at the end of this paper.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2013

Effect of the refractive index on the hawking temperature: an application of the Hamilton-Jacobi method

Hawking radiation of a non-asymptotically flat 4-dimensional spherically symmetric and static dilatonic black hole (BH) via the Hamilton-Jacobi (HJ) method is studied. In addition to the naive coordinates, we use four more different coordinate systems that are well-behaved at the horizon. Except for the isotropic coordinates, direct computation by the HJ method leads to the standard Hawking temperature for all coordinate systems. The isotropic coordinates allow extracting the index of refraction from the Fermat metric. It is explicitly shown that the index of refraction determines the value of the tunneling rate and its natural consequence, the Hawking temperature. The isotropic coordinates in the conventional HJ method produce a wrong result for the temperature of the linear dilaton. Here, we explain how this discrepancy can be resolved by regularizing the integral possessing a pole at the horizon.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Generalized Jacobi method for linear bounded operators system

In this paper, we construct a generalization of the Jacobi iterative method adapted to a system of linear bounded operators. This new method is used with product integration method to solve a linear Fredholm integral equation of the second kind with a weakly singular kernel. The convergence analysis is proved. The numerical tests developed show its effectiveness.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Jacobi-Integral Method For Two-Body Problem

Jacobi-integral method enables efficient, accurate computation of trajectory of natural satellite or spacecraft perturbed by component of gravitational potential depending explicitly on both position and time. Instead of total energy, Jacobi integral, which is energylike constant of motion in this case, embedded in Newtonian differential equations of motion. Trajectories computed in fewer steps. With modifications, applicable to such terrestrial problems as motions of rotors and of beams of electrically charged particles in changing electrical and magnetic fields.

Bond, Victor R.↗
DOE OSTI2015

Anderson acceleration of the Jacobi iterative method: An efficient alternative to Krylov methods for large, sparse linear systems

We employ Anderson extrapolation to accelerate the classical Jacobi iterative method for large, sparse linear systems. Specifically, we utilize extrapolation at periodic intervals within the Jacobi iteration to develop the Alternating Anderson–Jacobi (AAJ) method. We verify the accuracy and efficacy of AAJ in a range of test cases, including nonsymmetric systems of equations. We demonstrate that AAJ possesses a favorable scaling with system size that is accompanied by a small prefactor, even in the absence of a preconditioner. In particular, we show that AAJ is able to accelerate the classical Jacobi iteration by over four orders of magnitude, with speed-ups that increase as the system gets larger. Moreover, we find that AAJ significantly outperforms the Generalized Minimal Residual (GMRES) method in the range of problems considered here, with the relative performance again improving with size of the system. As a result, the proposed method represents a simple yet efficient technique that is particularly attractive for large-scale parallel solutions of linear systems of equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

On optimizing Jacobi–Davidson method for calculating eigenvalues in low dimensional structures using eight band k · p model

The paper presents two ways of improving the Jacobi–Davidson method for calculating the eigenvalues and eigenvectors described by eight-band k · p model for quantum dots and other low dimensional structures. First, the method is extended by the application of time reversal symmetry operator. This extension allows efficient calculations of the twofold degeneracy present in the multiband k · p model and other interior eigenvalues. Second, the preconditioner for the indefinite matrix which comes from the discretization of the eight band k · p Hamiltonian is presented. The construction of this preconditioner is based on physical considerations about energy band structure in the k · p model. On the basis of two real examples, it is shown that the preconditioner can significantly shorten the time needed to calculate the interior eigenvalues, despite the fact that the memory usage of the preconditioner and Hamiltionian is comparable. Finally, some technical details for implementing the eight band k · p Hamiltonian and the eigensolver are provided.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2018

Generalized Jacobi–Galerkin method for nonlinear fractional differential algebraic equations

In this paper, we provide an approximate approach based on the Galerkin method to solve a class of nonlinear fractional differential algebraic equations. The fractional derivative operator in the Caputo sense is utilized and the generalized Jacobi functions are employed as trial functions. The existence and uniqueness theorem as well as the asymptotic behavior of the exact solution are provided. It is shown that some derivatives of the solutions typically have singularity at origin dependence on the order of the fractional derivative. The influence of the perturbed data on the exact solutions along with the convergence analysis of the proposed scheme is also established. Some illustrative examples provided to demonstrate that this novel scheme is computationally efficient and accurate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Holographic trace anomaly and local renormalization group

The Hamilton-Jacobi method in holography has produced important results both at a renormalization group (RG) fixed point and away from it. In this paper we use the Hamilton-Jacobi method to compute the holographic trace anomaly for four- and six-dimensional boundary conformal field theories (CFTs), assuming higher-derivative gravity and interactions of scalar fields in the bulk. The scalar field contributions to the anomaly appear in CFTs with exactly marginal operators. Moving away from the fixed point, we show that the Hamilton-Jacobi formalism provides a deep connection between the holographic and the local RG. We derive the local RG equation holographically, and verify explicitly that it satisfies Weyl consistency conditions stemming from the commutativity of Weyl scalings. We also consider massive scalar fields in the bulk corresponding to boundary relevant operators, and comment on their effects to the local RG equation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Numerical solution of linear and nonlinear hyperbolic telegraph type equations with variable coefficients using shifted Jacobi collocation method

The telegraph equation is one of the important equations of mathematical physics. In this work, a spectral collocation scheme is proposed for the numerical solutions of one- and two-dimensional linear telegraph equations and telegraph equations with nonlinear forcing term. The homogeneous initial and boundary conditions are satisfied exactly by expanding the unknown variable using polynomial bases of functions which are built upon the Jacobi polynomials. The suggested scheme is successfully developed for the aforementioned problem with nonhomogeneous data. Extensive numerical experiments are presented to verify the efficiency of the proposed scheme.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1981

Numerical algorithms for finite element computations on arrays of microprocessors

The development of a multicolored successive over relaxation (SOR) program for the finite element machine is discussed. The multicolored SOR method uses a generalization of the classical Red/Black grid point ordering for the SOR method. These multicolored orderings have the advantage of allowing the SOR method to be implemented as a Jacobi method, which is ideal for arrays of processors, but still enjoy the greater rate of convergence of the SOR method. The program solves a general second order self adjoint elliptic problem on a square region with Dirichlet boundary conditions, discretized by quadratic elements on triangular regions. For this general problem and discretization, six colors are necessary for the multicolored method to operate efficiently. The specific problem that was solved using the six color program was Poisson's equation; for Poisson's equation, three colors are necessary but six may be used. In general, the number of colors needed is a function of the differential equation, the region and boundary conditions, and the particular finite element used for the discretization.

Ortega, J. M.↗