Search NASA⌕ Search

SEARCH · Search NASA

Results for “Krylov subspace methods”

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

The tensor t‐function: A definition for functions of third‐order tensors

Summary A definition for functions of multidimensional arrays is presented. The definition is valid for third‐order tensors in the tensor t‐product formalism, which regards third‐order tensors as block circulant matrices. The tensor function definition is shown to have similar properties as standard matrix function definitions in fundamental scenarios. To demonstrate the definition's potential in applications, the notion of network communicability is generalized to third‐order tensors and computed for a small‐scale example via block Krylov subspace methods for matrix functions. A complexity analysis for these methods in the context of tensors is also provided.

Lund, Kathryn↗

Multiscale two-stage solver for Biot’s poroelasticity equations in subsurface media

In this paper, we propose a two-stage preconditioner for accelerating the iterative solution by a Krylov subspace method of Biot’s poroelasticity equations based on a displacement-pressure formulation. The spatial discretization combines a finite element method for mechanics and a finite volume approach for flow. The fully implicit backward Euler scheme is used for time integration. The result is a 2 × 2 block linear system for each timestep. The preconditioning operator is obtained by applying a two-stage scheme. The first stage is a global preconditioner that employs multiscale basis functions to construct coarse-scale coupled systems using a Galerkin projection. This global stage is effective at damping low-frequency error modes associated with long-range coupling of the unknowns. The second stage is a local block-triangular smoothing preconditioner, which is aimed at high-frequency error modes associated with short-range coupling of the variables. Lastly, various numerical experiments are used to demonstrate the robustness of the proposed solver.

58 GEOSCIENCES↗

Approximate inverse-based block preconditioners in poroelasticity

We focus on the fully implicit solution of the linear systems arising from a three-field mixed finite element approximation of Biot’s poroleasticity equations. The objective is to develop algebraic block preconditioners for the efficient solution of such systems by Krylov subspace methods. In this work, we investigate the use of approximate inverse-based techniques to decouple the native system of equations and obtain explicit sparse approximations of the Schur complements related to the physics-based partitioning of the unknowns by field type. Here, the proposed methods are tested in various numerical experiments including real-world applications dealing with petroleum and geotechnical engineering.

54 ENVIRONMENTAL SCIENCES↗

A new relaxed splitting preconditioner for the generalized saddle point problems from the incompressible Navier–Stokes equations

Based on the modified relaxed splitting (MRS) preconditioner proposed by Fan and Zhu (Appl Math Lett 55:18–26, 2016), a new relaxed splitting preconditioner is proposed for the generalized saddle point problems arising from the incompressible Navier–Stokes equations. The eigenvalue distribution and an upper bound of the degree of the minimal polynomial of the preconditioned matrix are analyzed. Numerical results show that the proposed preconditioner is superior to the MRS preconditioner when they are used as preconditioners to accelerate the convergence rate of the Krylov subspace methods, such as GMRES.

97 MATHEMATICS AND COMPUTING↗

A low-order block preconditioner for saddle point linear systems

A preconditioner is proposed for the large and sparse linear saddle point problems, which is based on a low-order three-by-three block saddle point form. The eigenvalue distribution and an upper bound of the degree of the minimal polynomial for the preconditioned matrix are discussed. Numerical results show that the optimal convergence behavior can be achieved when the new preconditioner is used to accelerate the convergence rate of Krylov subspace methods such as GMRES.

97 MATHEMATICS AND COMPUTING↗

The parameterized preconditioner for the generalized saddle point problems from the incompressible Navier–Stokes equations

A parameterized preconditioner is proposed for the generalized saddle point problems arising from the incompressible Navier–Stokes equations. The eigenvalues and eigenvectors of the preconditioned matrix are analyzed. Numerical results show that the proposed preconditioner is efficient to accelerate the convergence rate of Krylov subspace methods, such as GMRES method.

97 MATHEMATICS AND COMPUTING↗

Performance of fully-coupled algebraic multigrid preconditioners for large-scale VMS resistive MHD

Here, we explore the current performance and scaling of a fully-implicit stabilized unstructured finite element (FE) variational multiscale (VMS) capability for large-scale simulations of 3D incompressible resistive magnetohydrodynamics (MHD). The large-scale linear systems that are generated by a Newton nonlinear solver approach are iteratively solved by preconditioned Krylov subspace methods. The efficiency of this approach is critically dependent on the scalability and performance of the algebraic multigrid preconditioner. Our study considers the performance of the numerical methods as recently implemented in the second-generation Trilinos implementation that is 64-bit compliant and is not limited by the 32-bit global identifiers of the original Epetra-based Trilinos. The study presents representative results for a Poisson problem on 1.6 million cores of an IBM Blue Gene/Q platform to demonstrate very large-scale parallel execution. Additionally, results for a more challenging steady-state MHD generator and a transient solution of a benchmark MHD turbulence calculation for the full resistive MHD system are also presented. These results are obtained on up to 131,000 cores of a Cray XC40 and one million cores of a BG/Q system.

97 MATHEMATICS AND COMPUTING↗

A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation

We develop a parallel Jacobi-Davidson approach for finding a partial set of eigenpairs of large sparse polynomial eigenvalue problems with application in quantum dot simulation. A Jacobi-Davidson eigenvalue solver is implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc). The eigensolver thus inherits PETSc's efficient and various parallel operations, linear solvers, preconditioning schemes, and easy usages. The parallel eigenvalue solver is then used to solve higher degree polynomial eigenvalue problems arising in numerical simulations of three dimensional quantum dots governed by Schroedinger's equations. We find that the parallel restricted additive Schwarz preconditioner in conjunction with a parallel Krylov subspace method (e.g. GMRES) can solve the correction equations, the most costly step in the Jacobi-Davidson algorithm, very efficiently in parallel. Besides, the overall performance is quite satisfactory. We have observed near perfect superlinear speedup by using up to 320 processors. The parallel eigensolver can find all target interior eigenpairs of a quintic polynomial eigenvalue problem with more than 32 million variables within 12 minutes by using 272 Intel 3.0 GHz processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Loschmidt-echo approach to error estimation in Krylov-subspace approximation

The Krylov subspace method is a traditional approach to approximate quantum evolution, allowing us to treat systems with large Hilbert spaces. Despite its popularity, current bounds typically overestimate the error, which translates into more expensive simulation routines. Here, in this paper, we tackle this problem by realizing that the error can be understood as a Loschmidt echo in a one-dimensional (1D) noninteracting tight-binding Hamiltonian. We show that the different time regimes of the approximation can be understood using simple physical ideas. More importantly, we obtain computationally cheap error bounds that describe with high precision the actual error in the approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic quantum Krylov protocol with double-factorized Hamiltonians

Here we propose a class of randomized quantum Krylov diagonalization (rQKD) algorithms capable of solving the eigenstate estimation problem with modest quantum resource requirements. Compared to previous real-time evolution quantum Krylov subspace methods, our approach expresses the time evolution operator e –i$\widehat{H}$$\tau$ as a linear combination of unitaries and subsequently uses a stochastic sampling procedure to reduce circuit depth requirements. While our methodology applies to any Hamiltonian with fast-forwardable subcomponents, we focus on its application to the explicitly double-factorized electronic-structure Hamiltonian. To demonstrate the potential of the proposed rQKD algorithm on near-term quantum devices, we provide numerical benchmarks for a variety of molecular systems with circuit-based state-vector simulators including the effects of sampling noise, achieving ground-state energy errors of less than 1 kcal mol -1 with circuit depths orders of magnitude shallower than those required for low-rank deterministic Trotter-Suzuki decompositions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparsity-Independent Lyapunov Exponent in the Sachdev-Ye-Kitaev Model

The saturation of a recently proposed universal bound on the Lyapunov exponent has been conjectured to signal the existence of a gravity dual. This saturation occurs in the low-temperature limit of the dense Sachdev-Ye-Kitaev (SYK) model, N Majorana fermions with q body ( q > 2 ) infinite-range interactions. We calculate certain out-of-time-order correlators (OTOCs) for N ≤ 64 fermions for a highly sparse SYK model and find no significant dependence of the Lyapunov exponent on sparsity up to near the percolation limit where the Hamiltonian breaks up into blocks. This provides strong support to the saturation of the Lyapunov exponent in the low-temperature limit of the sparse SYK. A key ingredient to reaching N = 64 is the development of a novel quantum spin model simulation library that implements highly optimized matrix-free Krylov subspace methods on graphical processing units. This leads to a significantly lower simulation time as well as vastly reduced memory usage over previous approaches, while using modest computational resources. Strong sparsity-driven statistical fluctuations require both the use of a much larger number of disorder realizations with respect to the dense limit and a careful finite size scaling analysis. The saturation of the bound in the sparse SYK points to the existence of a gravity analog that would enlarge substantially the number of field theories with this feature. Published by the American Physical Society 2024

Physics↗

A Shift Selection Strategy for Parallel Shift-invert Spectrum Slicing in Symmetric Self-consistent Eigenvalue Computation

The central importance of large-scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world’s largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing massive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions that will be explored in future work.

97 MATHEMATICS AND COMPUTING↗

Initial Exploration of the Use of Mixed Precision in Iterative Solvers (B639388 Subcontract Quarter I Report)

The first quarter of the project was primarily spent identifying potential projects at the intersection of finite precision analysis, mixed precision computation, and Krylov subspace methods. We summarize our findings in the remainder of the document. Other activities include attending biweekly xSDK meetings as well as contributing material to the technical report and journal versions of the multiprecision landscape paper. The subsequent quarter will be spent selecting a subset of the described projects to focus on, performing initial numerical experiments to evaluate the potential for the use of mixed precision, and developing initial theoretical analysis.

97 MATHEMATICS AND COMPUTING↗

TRANAIR - A computer code for transonic analyses of arbitrary configurations

Attention is given to a new approach to solving full potential equations about arbitrary configurations. Numerical algorithms from such fields as finite elements, preconditioned Krylov subspace methods, discrete Fourier analysis, and integral equations are combined to take advantage of the size and speed of current and emerging supercomputers. On the basis of this appraoch, a robust, efficient and easy to use computer code referred to as TRANAIR has been developed for transonic analysis of complex geometries.

Samant, S. S.↗

A new approach to the solution of boundary value problems involving complex configurations

A new approach for solving certain types of boundary value problems about complex configurations is presented. Numerical algorithms from such diverse fields as finite elements, preconditioned Krylov subspace methods, discrete Fourier analysis, and integral equations are combined to take advantage of the memory, speed and architecture of current and emerging supercomputers. Although the approach has application to many branches of computational physics, the present effort is concentrated in areas of Computational Fluid Dynamics (CFD) such as steady nonlinear aerodynamics, time harmonic unsteady aerodynamics, and aeroacoustics. The most significant attribute of the approach is that it can handle truly arbitrary boundary geometries and eliminates the difficult task of generating surface fitted grids.

Rubbert, P. E.↗

Implicity restarted Arnoldi/Lanczos methods for large scale eigenvalue calculations

Eigenvalues and eigenfunctions of linear operators are important to many areas of applied mathematics. The ability to approximate these quantities numerically is becoming increasingly important in a wide variety of applications. This increasing demand has fueled interest in the development of new methods and software for the numerical solution of large-scale algebraic eigenvalue problems. In turn, the existence of these new methods and software, along with the dramatically increased computational capabilities now available, has enabled the solution of problems that would not even have been posed five or ten years ago. Until very recently, software for large-scale nonsymmetric problems was virtually non-existent. Fortunately, the situation is improving rapidly. The purpose of this article is to provide an overview of the numerical solution of large-scale algebraic eigenvalue problems. The focus will be on a class of methods called Krylov subspace projection methods. The well-known Lanczos method is the premier member of this class. The Arnoldi method generalizes the Lanczos method to the nonsymmetric case. A recently developed variant of the Arnoldi/Lanczos scheme called the Implicitly Restarted Arnoldi Method is presented here in some depth. This method is highlighted because of its suitability as a basis for software development.

Sorensen, Danny C.↗

MGLab: An Interactive Multigrid Environment

MGLab is a set of Matlab functions that defines an interactive environment for experimenting with multigrid algorithms. The package solves two-dimensional elliptic partial differential equations discretized using either finite differences or finite volumes, depending on the problem. Built-in problems include the Poisson equation, the Helmholtz equation, a convection-diffusion problem, and a discontinuous coefficient problem. A number of parameters controlling the multigrid V-cycle can be set using a point-and-click mechanism. The menu-based user interface also allows a choice of several Krylov subspace methods, including CG, GMRES(k), and Bi-CGSTAB, which can be used either as stand-alone solvers or as multigrid acceleration schemes. The package exploits Matlab's visualization and sparse matrix features and has been structured to be easily extensible.

Bordner, James↗

A Reduced Order Model of the Linearized Incompressible Navier-Strokes Equations for the Sensor/Actuator Placement Problem

A reduced order modeling approach of the Navier-Stokes equations is presented for the design of a distributed optimal feedback kernel. This approach is based oil a Krylov subspace method where significant modes of the flow are captured in the model This model is then used in all optimal feedback control design where sensing and actuation is performed oil tile entire flow field. This control design approach yields all optimal feedback kernel which provides insight into the placement of sensors and actuators in the flow field. As all evaluation of this approach, a two-dimensional shear layer and driven cavity flow are investigated.

Allan, Brian G.↗