Search NASA⌕ Search

SEARCH · Search NASA

Results for “JACOBI MATRIX 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

Electron-impact ionization excitation of helium in the quasiphoton regime

The triply differential cross section of ionization excitation of helium, leaving the residual ion in the n=2 excited states, is evaluated for the kinematics considered experimentally by Dupreet al. [J. Phys. B 25, 259 (1992)]. The interaction of the incident electron with the target is described at the first order, while the interaction of the ejected electron with the residual ion is treated very accurately within the formalism of the Jacobi matrix method. In the quasiphoton limit and for low ejected electron energies, the presence of series of doubly excited states, mainly below the n=3 single ionization threshold in helium, makes the triply differential cross sections extremely sensitive to both the energy and the emission angle of the ejected electron. We show that the convolution of our results with a Gaussian energy profile, in which the full width at half-maximum corresponds to the energy resolution in the experiment, has a significant effect. Our results suggest that it is also important to account for the finite resolution on the measurement of the scattering angle when the experimental data are compared to the theoretical predictions. Comparison of our theoretical results convoluted both in energy and in angle with the experimental data demonstrates the importance of an accurate description of the helium spectrum. A possible two-step mechanism involving single ionization of the target followed by excitation of the core electron is proposed to explain the remaining discrepancies.

74 ATOMIC AND MOLECULAR PHYSICS↗

Electron-impact double ionization of He by applying the Jacobi matrix approach to the Faddeev-Merkuriev equations

We apply the Jacobi matrix method to the Faddeev-Merkuriev differential equations in order to calculate the three-body wave function that describes the double continuum of an atomic two-electron system. This function is used to evaluate within the first-order Born approximation, the fully differential cross sections for (e,3e) processes in helium. The calculations are performed in the case of a coplanar geometry in which the incident electron is fast and both ejected electrons are slow. Quite unexpectedly, the results obtained by reducing our double-continuum wave function to its asymptotic expression are in satisfactory agreement with all the experimental data of Lahmam-Bennani et al.[A. Lahaman-Bennani et al., Phys. Rev. A 59, 3548 (1999); A. Kheifets et al., J. Phys. B 32, 5047 (1999).] without any need for renormalizing the data. When the full double-continuum wave function is used, the agreement of the results with the experimental data improves significantly. However, a detailed analysis of the calculations shows that full convergence in terms of the basis size is not reached. This point is discussed in detail.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Phenomenology of the Prethermal Many-Body Localized Regime

The dynamical phase diagram of interacting disordered systems has seen substantial revision over the past few years. Theory must now account for a large prethermal many-body localized regime in which thermalization is extremely slow, but not completely arrested. We derive a quantitative description of these dynamics in short-ranged one-dimensional systems using a model of successive many-body resonances. Here, the model explains the decay timescale of mean autocorrelators, the functional form of the decay—a stretched exponential—and relates the value of the stretch exponent to the broad distribution of resonance timescales. The Jacobi method of matrix diagonalization provides numerical access to this distribution, as well as a conceptual framework for our analysis. The resonance model correctly predicts the stretch exponents for several models in the literature. Successive resonances may also underlie slow thermalization in strongly disordered systems in higher dimensions, or with long-range interactions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Improved parallel solution techniques for the integral transport matrix method

Alternative solution strategies to the parallel block Jacobi (PBJ) method for the solution of the global problem with the integral transport matrix method operators have been designed and tested. The most straightforward improvement to the Jacobi iterative method is the Gauss-Seidel alternative. The parallel red-black Gauss-Seidel (PGS) algorithm can improve on the number of iterations and reduce work per iteration by applying an alternating red-black color-set to the subdomains and assigning multiple sub-domains per processor. A parallel GMRES(m) method was implemented as an alternative to stationary iterations. Computational results show that the PGS method can improve on the PBJ method execution by up to {approx}50% when eight sub-domains per processor are used. However, compared to traditional source iterations with diffusion synthetic acceleration, it is still approximately an order of magnitude slower. The best-performing case are opticaUy thick because sub-domains decouple, yielding faster convergence. Further tests revealed that 64 sub-domains per processor was the best performing level of sub-domain division. An acceleration technique that improves the convergence rate would greatly improve the ITMM. The GMRES(m) method with a diagonal block preconditioner consumes approximately the same time as the PBJ solver but could be improved by an as yet undeveloped, more efficient preconditioner.

97 MATHEMATICS AND COMPUTING↗

Iterative stability analysis of spatial domain decomposition based on block Jacobi algorithm for the diamond-difference scheme

Here, we study convergence of the integral transport matrix method (ITMM) based on a parallel block Jacobi (PBJ) iterative strategy for solving particle transport problems. The ITMM is a spatial domain decomposition method proposed for massively parallel computations. AFourier analysis of the PBJ-based iterations applied to SN diamond-difference equations in 1D slab and 2D Cartesian geometries is performed. It is carried out for infinite-medium problems with homogeneous material properties. To analyze the performance of the ITMM with the PBJ algorithm and evaluate its potential in scalability we consider a limiting case of one spatial cell per subdomain. The analysis shows that in such limit the spectral radius of the iteration method is one without regard to values of the scattering ratio and optical thickness of the spatial cells. This implies lack of convergence in infinite medium. Numerical results of finite-medium problems are presented. They demonstrate effects of finite size of spatial domain on the performance of the iteration algorithm as well as its asymptotic behavior when the extent of the spatial domain increases. Finally, these numerical experiments also show that for finite domains iterative convergence to a finite criterion is achievable in a multiple of the sum of number of cells in each dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An updated Lagrangian discontinuous Galerkin hydrodynamic method for gas dynamics

Here, we present a new Lagrangian discontinuous Galerkin (DG) hydrodynamic method for gas dynamics. The new method evolves conserved unknowns in the current configuration, which obviates the Jacobi matrix that maps the element in a reference coordinate system or the initial coordinate system to the current configuration. The density, momentum, and total energy (ρ, ρu, E ) are approximated with conservative higher-order Taylor expansions over the element and are limited toward a piecewise constant field near discontinuities using a limiter. Two new limiting methods are presented for enforcing the bounds on the primitive variables of density, velocity, and specific internal energy (ρ, u, e). The nodal velocity, and the corresponding forces, are calculated by solving an approximate Riemann problem at the element nodes. An explicit second-order method is used to temporally advance the solution. This new Lagrangian DG hydrodynamic method conserves mass, momentum, and total energy. 1D Cartesian coordinates test problem results are presented to demonstrate the accuracy and convergence order of the new DG method with the new limiters.

97 MATHEMATICS AND COMPUTING↗

HFEM3D

Software solves the three-dimensional Poisson equation div(k(grad(u)) = f, by the finite element method for the case when material properties, k, are distributed over hierarchy of edges, facets and tetrahedra in the finite element mesh. Method is described in Weiss, CJ, Finite element analysis for model parameters distributed on a hierarchy of geometric simplices, Geophysics, v82, E155-167, doi:10.1190/GEO2017-0058.1 (2017). A standard finite element method for solving Poisson’s equation is augmented by including in the 3D stiffness matrix additional 2D and 1D stiffness matrices representing the contributions from material properties associated with mesh faces and edges, respectively. The resulting linear system is solved iteratively using the conjugate gradient method with Jacobi preconditioning. To minimize computer storage for program execution, the linear solver computes matrix-vector contractions element-by-element over the mesh, without explicit storage of the global stiffness matrix. Program output vtk compliant for visualization and rendering by 3rd party software. Program uses dynamic memory allocation and as such there are no hard limits on problem size outside of those imposed by the operating system and configuration on which the software is run. Dimension, N, of the finite element solution vector is constrained by the the addressable space in 32-vs-64 bit operating systems. Total storage requirements for the problem. Total working space required for the program is approximately 13*N double precision words.

Weiss, Chester J↗

Quantifying the Impact of Single Bit Flips on Floating Point Arithmetic

In high-end computing, the collective surface area, smaller fabrication sizes, and increasing density of components have led to an increase in the number of observed bit flips. If mechanisms are not in place to detect them, such flips produce silent errors, i.e. the code returns a result that deviates from the desired solution by more than the allowed tolerance and the discrepancy cannot be distinguished from the standard numerical error associated with the algorithm. These phenomena are believed to occur more frequently in DRAM, but logic gates, arithmetic units, and other circuits are also susceptible to bit flips. Previous work has focused on algorithmic techniques for detecting and correcting bit flips in specific data structures, however, they suffer from lack of generality and often times cannot be implemented in heterogeneous computing environment. Our work takes a novel approach to this problem. We focus on quantifying the impact of a single bit flip on specific floating-point operations. We analyze the error induced by flipping specific bits in the most widely used IEEE floating-point representation in an architecture-agnostic manner, i.e., without requiring proprietary information such as bit flip rates and the vendor-specific circuit designs. We initially study dot products of vectors and demonstrate that not all bit flips create a large error and, more importantly, expected value of the relative magnitude of the error is very sensitive on the bit pattern of the binary representation of the exponent, which strongly depends on scaling. Our results are derived analytically and then verified experimentally with Monte Carlo sampling of random vectors. Furthermore, we consider the natural resilience properties of solvers based on the fixed point iteration and we demonstrate how the resilience of the Jacobi method for linear equations can be significantly improved by rescaling the associated matrix.

Elliott, James J.↗

Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods

In this study, we develop a new tensor-product based preconditioner for discontinuous Galerkin methods with polynomial degrees higher than those typically employed. This preconditioner uses an automatic, purely algebraic method to approximate the exact block Jacobi preconditioner by Kronecker products of several small, one-dimensional matrices. Traditional matrix-based preconditioners require O ( p 2d ) storage and O ( p 3d ) computational work, where p is the degree of basis polynomials used, and d is the spatial dimension. Our SVD-based tensor-product preconditioner requires O ( p d+1 ) storage, O ( p d+1 ) work in two spatial dimensions, and O ( p d+2 ) work in three spatial dimensions. Combined with a matrix-free Newton–Krylov solver, these preconditioners allow for the solution of DG systems in linear time in p per degree of freedom in 2D, and reduce the computational complexity from O ( p 9 ) to O ( p 5 ) in 3D. Numerical results are shown in 2D and 3D for the advection, Euler, and Navier–Stokes equations, using polynomials of degree up to p = 30. For many test cases, the preconditioner results in similar iteration counts when compared with the exact block Jacobi preconditioner, and performance is significantly improved for high polynomial degrees p .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Riccati Solution for the Ideal MHD Plasma Response with Applications to Real-time Stability Control

To effectuate near real-time feedback control of ideal MHD instabilities in a tokamak geometry, a rapid solution for stability analysis is a prerequisite. Toward this end, we reformulate the δW stability method with a Hamilton-Jacobi theory, elucidating analytical and numerical features of the generic tokamak ideal MHD stability problem. The plasma response matrix is demonstrated to be the solution of an ideal MHD matrix Riccati differential equation (MRDE). Since Riccati equations are prevalent in the control theory literature, such a shift in perspective brings to bear a range of numerical methods that are well-suited to the robust, fast solution of control problems. We discuss the usefulness of Riccati techniques in solving the stiff ODEs often encountered in ideal MHD stability analyses-—for example, in tokamak edge and stellarator physics. We then demonstrate the applicability of such methods to an existing 2D ideal MHD stability code—DCON—enabling its parallel operation in near real-time. Output is shown to match with high accuracy, and with wall-clock time ≪ 1s. Such speed may help enable active feedback ideal MHD stability control, especially in tokamak plasmas whose ideal MHD equilibria evolve with inductive timescale τ > 1s-—as in ITER.

Parallel↗

A reactant-coordinate-based wave packet method for full-dimensional state-to-state quantum dynamics of tetra-atomic reactions: Application to both the abstraction and exchange channels in the H + H 2 O reaction

Here, an efficient and accurate wave packet method is proposed for the calculation of the state-to-state S -matrix elements in bimolecular reactions involving four atoms. This approach propagates an initial state specific wave packet in reactant Jacobi coordinates. The projection in product channels is carried out on projection planes, which have one less degree of freedom, by transforming both the time-dependent wave packet and final product states into a set of intermediate coordinates. This reactant-coordinate-based method is more efficient than product-coordinate-based methods because it typically requires a smaller number of basis functions or grid points and allows the determination of S -matrix elements for multiple product channels from a single propagation. This method is demonstrated in calculating the ( J tot = 0) state-to-state S -matrix elements for both the abstraction and exchange channels of the H + H 2 O reaction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Data-Driven Smoothers for Extreme-Scale Computing

Patch-based relaxation refers to a family of methods for solving linear systems which partitions the matrix into smaller pieces often corresponding to groups of adjacent degrees of freedom residing within patches of the computational domain. The two most common families of patch-based methods are block-Jacobi and Schwarz methods, where the former typically corresponds to non-overlapping domains and the later implies some overlap. We focus on cases where each patch consists of the degrees of freedom on a finite element method mesh cell. Patch methods often capture complex local physics much more effectively than simpler point-smoothers such as Jacobi; however, forming, inverting, and applying each patch can be prohibitively expensive in terms of both storage and computation time. To this end, we propose several approaches for performing analysis on these patches and constructing a reduced representation. The compression techniques rely on either matrix norm comparisons or unsupervised learning via a clustering approach. We illustrate how it is frequently possible to retain/factor less than 5% of all patches and still develop a method that converges only a little slower than when all patches are stored/factored.

97 MATHEMATICS AND COMPUTING↗

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↗

Asymptotics of Selberg-like integrals by lattice path counting

We obtain explicit expressions for positive integer moments of the probability density of eigenvalues of the Jacobi and Laguerre random matrix ensembles, in the asymptotic regime of large dimension. These densities are closely related to the Selberg and Selberg-like multidimensional integrals. Our method of solution is combinatorial: it consists in the enumeration of certain classes of lattice paths associated to the solution of recurrence relations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Complex quantum Hamilton-Jacobi equation with Bohmian trajectories: Application to the photodissociation dynamics of NOCl

The complex quantum Hamilton-Jacobi equation-Bohmian trajectories (CQHJE-BT) method is introduced as a synthetic trajectory method for integrating the complex quantum Hamilton-Jacobi equation for the complex action function by propagating an ensemble of real-valued correlated Bohmian trajectories. Substituting the wave function expressed in exponential form in terms of the complex action into the time-dependent Schrödinger equation yields the complex quantum Hamilton-Jacobi equation. We transform this equation into the arbitrary Lagrangian-Eulerian version with the grid velocity matching the flow velocity of the probability fluid. The resulting equation describing the rate of change in the complex action transported along Bohmian trajectories is simultaneously integrated with the guidance equation for Bohmian trajectories, and the time-dependent wave function is readily synthesized. The spatial derivatives of the complex action required for the integration scheme are obtained by solving one moving least squares matrix equation. In addition, the method is applied to the photodissociation of NOCl. The photodissociation dynamics of NOCl can be accurately described by propagating a small ensemble of trajectories. This study demonstrates that the CQHJE-BT method combines the considerable advantages of both the real and the complex quantum trajectory methods previously developed for wave packet dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Threaded Operations on Sparse Matrices

We investigate the use of sparse matrices and OpenMP multi-threading on linear algebra operations involving them. Several sparse matrix data structures are presented. Implementation of the multi- threading primarily occurs in the level one and two BLAS functions used within the four algorithms investigated{the Power Method, Conjugate Gradient, Biconjugate Gradient, and Jacobi's Method. The bene ts of launching threads once per high level algorithm are explored.

97 MATHEMATICS AND COMPUTING↗

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↗