Search NASA⌕ Search

SEARCH · Search NASA

Results for “Krylov”

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 OSTI2021

Strong and almost strong modes of Floquet spin chains in Krylov subspaces

Integrable Floquet spin chains are known to host strong zero and π modes which are boundary operators that respectively commute and anticommute with the Floquet unitary generating stroboscopic time evolution, in addition to anticommuting with a discrete symmetry of the Floquet unitary. Thus the existence of strong modes implies a characteristic pairing structure of the full spectrum. Weak interactions modify the strong modes to almost strong modes that almost commute or anticommute with the Floquet unitary. Manifestations of strong and almost strong modes are presented in two different Krylov subspaces. One is a Krylov subspace obtained from a Lanczos iteration that maps the time evolution generated by the Floquet Hamiltonian onto dynamics of a single particle on a fictitious chain with nearest-neighbor hopping. The second is a Krylov subspace obtained from the Arnoldi iteration that maps the time evolution generated directly by the Floquet unitary onto dynamics of a single particle on a fictitious chain with longer-range hopping. While the former Krylov subspace is sensitive to the branch of the logarithm of the Floquet unitary, the latter obtained from the Arnoldi scheme is not. In this work, the effective single-particle models in the Krylov subspace are discussed, and the topological properties of the Krylov chain that ensure stable zero and π modes at the boundaries are highlighted. The role of interactions is discussed. Expressions for the lifetime of the almost strong modes are derived in terms of the parameters of the Krylov subspace, and are compared with exact diagonalization.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Building Krylov complexity from circuit complexity

Krylov complexity has emerged as a probe of operator growth in a wide range of nonequilibrium quantum dynamics. However, a fundamental issue remains in such studies: the definition of the distance between basis states in Krylov space is ambiguous. Here we show that Krylov complexity can be rigorously established from circuit complexity when dynamical symmetries exist. Whereas circuit complexity characterizes the geodesic distance in a multidimensional operator space, Krylov complexity measures the height of the final operator in a particular direction. The geometric representation of circuit complexity thus unambiguously designates the distance between basis states in Krylov space. This geometric approach also applies to time-dependent Liouvillian superoperators, where a single Krylov complexity is no longer sufficient. Multiple Krylov complexity may be exploited jointly to fully describe operator dynamics. Published by the American Physical Society 2024

Lv, Chenwei (ORCID:0000000250952582)↗
NASA NTRS1995

Newton-Krylov-Schwarz: An implicit solver for CFD

Newton-Krylov methods and Krylov-Schwarz (domain decomposition) methods have begun to become established in computational fluid dynamics (CFD) over the past decade. The former employ a Krylov method inside of Newton's method in a Jacobian-free manner, through directional differencing. The latter employ an overlapping Schwarz domain decomposition to derive a preconditioner for the Krylov accelerator that relies primarily on local information, for data-parallel concurrency. They may be composed as Newton-Krylov-Schwarz (NKS) methods, which seem particularly well suited for solving nonlinear elliptic systems in high-latency, distributed-memory environments. We give a brief description of this family of algorithms, with an emphasis on domain decomposition iterative aspects. We then describe numerical simulations with Newton-Krylov-Schwarz methods on aerodynamics applications emphasizing comparisons with a standard defect-correction approach, subdomain preconditioner consistency, subdomain preconditioner quality, and the effect of a coarse grid.

Cai, Xiao-Chuan↗
NASA NTRS1997

Improvements in Block-Krylov Ritz Vectors and the Boundary Flexibility Method of Component Synthesis

A method of dynamic substructuring is presented which utilizes a set of static Ritz vectors as a replacement for normal eigenvectors in component mode synthesis. This set of Ritz vectors is generated in a recurrence relationship, proposed by Wilson, which has the form of a block-Krylov subspace. The initial seed to the recurrence algorithm is based upon the boundary flexibility vectors of the component. Improvements have been made in the formulation of the initial seed to the Krylov sequence, through the use of block-filtering. A method to shift the Krylov sequence to create Ritz vectors that will represent the dynamic behavior of the component at target frequencies, the target frequency being determined by the applied forcing functions, has been developed. A method to terminate the Krylov sequence has also been developed. Various orthonormalization schemes have been developed and evaluated, including the Cholesky/QR method. Several auxiliary theorems and proofs which illustrate issues in component mode synthesis and loss of orthogonality in the Krylov sequence have also been presented. The resulting methodology is applicable to both fixed and free- interface boundary components, and results in a general component model appropriate for any type of dynamic analysis. The accuracy is found to be comparable to that of component synthesis based upon normal modes, using fewer generalized coordinates. In addition, the block-Krylov recurrence algorithm is a series of static solutions and so requires significantly less computation than solving the normal eigenspace problem. The requirement for less vectors to form the component, coupled with the lower computational expense of calculating these Ritz vectors, combine to create a method more efficient than traditional component mode synthesis.

Carney, Kelly Scott↗
DOE OSTI2025

Moment method and continued fraction expansion in Floquet operator Krylov space

Recursion methods such as Krylov techniques map complex dynamics to an effective noninteracting problem in one dimension. For example, the operator Krylov space for Floquet dynamics can be mapped to the dynamics of an edge operator of the one-dimensional Floquet inhomogeneous transverse field Ising model (ITFIM), where the latter, after a Jordan-Wigner transformation, is a Floquet model of noninteracting Majorana fermions and the couplings correspond to Krylov angles. We present an application of this showing that a moment method exists where given an autocorrelation function, one can construct the corresponding Krylov angles and from that the corresponding Floquet ITFIM. Consequently, when no solutions for the Krylov angles are obtained, it indicates that the autocorrelation is not generated by unitary dynamics. We highlight this by studying certain special cases: stable m-period dynamics derived using the method of continued fractions, exponentially decaying, and power-law decaying stroboscopic dynamics. Remarkably, our examples of stable m-period dynamics correspond to m-period edge modes for the Floquet ITFIM where, deep in the chain, the couplings correspond to a critical phase. Furthermore our results pave the way to engineer Floquet systems with desired properties of edge modes and also provide examples of persistent edge modes in gapless Floquet systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Quantum Krylov subspace algorithms for ground- and excited-state energy estimation

Quantum Krylov subspace diagonalization (QKSD) algorithms provide a low-cost alternative to the conventional quantum phase estimation algorithm for estimating the ground- and excited-state energies of a quantum many-body system. While QKSD algorithms typically rely on using the Hadamard test for estimating Krylov subspace matrix elements of the form $\langle \phi_i|e^{-\widehat{H}τ}|\phi_j\rangle$, the associated quantum circuits require an ancilla qubit with controlled multiqubit gates that can be quite costly for near-term quantum hardware. In this paper, we show that a wide class of Hamiltonians relevant to condensed-matter physics and quantum chemistry contain symmetries that can be exploited to avoid the use of the Hadamard test. We propose a multifidelity estimation protocol that can be used to compute such quantities, showing that our approach, when combined with efficient single-fidelity estimation protocols, provides a substantial reduction in circuit depth. In addition, here we develop a unified theory of quantum Krylov subspace algorithms and present three quantum-classical algorithms for the ground- and excited-state energy estimation problems, where each algorithm provides various advantages and disadvantages in terms of total number of calls to the quantum computer, gate depth, classical complexity, and stability of the generalized eigenvalue problem within the Krylov subspace.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Krylov spaces for truncated spectrum methodologies

We propose herein an extension of truncated spectrum methodologies, a nonperturbative numerical approach able to elucidate the low energy properties of quantum field theories. TSMs, in their various flavors, involve a division of a computational Hilbert space, H , into two parts, one part, H 1 that is “kept” for the numerical computations, and one part, H 2 , that is discarded or “truncated.” Even though H 2 is discarded, truncated spectrum methodologies will often try to incorporate the effects of H 2 in some effective way. In these terms, we propose to keep the dimension of H 1 small. We pair this choice of H 1 with a Krylov subspace iterative approach able to take into account the effects of H 2 . This iterative approach can be taken to arbitrarily high order and so offers the ability to compute quantities to arbitrary precision. In many cases it also offers the advantage of not needing an explicit UV cutoff. To compute the matrix elements that arise in the Krylov iterations, we employ a Feynman diagrammatic representation that is then evaluated with Monte Carlo techniques. Each order of the Krylov iteration is variational and is guaranteed to improve upon the previous iteration. The first Krylov iteration is akin to the next-to-leading order approach of Elias-Miró [NLO renormalization in the Hamiltonian truncation, ]. To demonstrate this approach, we focus on the ( 1 + 1 d )-dimensional ϕ 4 model and compute the bulk energy and mass gaps in both the Z 2 -broken and unbroken sectors. We estimate the critical ϕ 4 coupling in the broken phase to be g c = 0.2645 ± 0.002 . Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1988

Block-Krylov component synthesis method for structural model reduction

A new analytical method is presented for generating component shape vectors, or Ritz vectors, for use in component synthesis. Based on the concept of a block-Krylov subspace, easily derived recurrence relations generate blocks of Ritz vectors for each component. The subspace spanned by the Ritz vectors is called a block-Krylov subspace. The synthesis uses the new Ritz vectors rather than component normal modes to reduce the order of large, finite-element component models. An advantage of the Ritz vectors is that they involve significantly less computation than component normal modes. Both 'free-interface' and 'fixed-interface' component models are derived. They yield block-Krylov formulations paralleling the concepts of free-interface and fixed-interface component modal synthesis. Additionally, block-Krylov reduced-order component models are shown to have special disturbability/observability properties. Consequently, the method is attractive in active structural control applications, such as large space structures. The new fixed-interface methodology is demonstrated by a numerical example. The accuracy is found to be comparable to that of fixed-interface component modal synthesis.

Craig, Roy R., Jr.↗
NASA NTRS1989

Overview of Krylov subspace methods with applications to control problems

An overview of projection methods based on Krylov subspaces are given with emphasis on their application to solving matrix equations that arise in control problems. The main idea of Krylov subspace methods is to generate a basis of the Krylov subspace Span and seek an approximate solution the the original problem from this subspace. Thus, the original matrix problem of size N is approximated by one of dimension m typically much smaller than N. Krylov subspace methods have been very successful in solving linear systems and eigenvalue problems and are now just becoming popular for solving nonlinear equations. It is shown how they can be used to solve partial pole placement problems, Sylvester's equation, and Lyapunov's equation.

Saad, Youcef↗
NASA NTRS1990

Krylov subspace methods - Theory, algorithms, and applications

Projection methods based on Krylov subspaces for solving various types of scientific problems are reviewed. The main idea of this class of methods when applied to a linear system Ax = b, is to generate in some manner an approximate solution to the original problem from the so-called Krylov subspace span. Thus, the original problem of size N is approximated by one of dimension m, typically much smaller than N. Krylov subspace methods have been very successful in solving linear systems and eigenvalue problems and are now becoming popular for solving nonlinear equations. The main ideas in Krylov subspace methods are shown and their use in solving linear systems, eigenvalue problems, parabolic partial differential equations, Liapunov matrix equations, and nonlinear system of equations are discussed.

Sad, Youcef↗
DOE OSTI2022

Two-Stage Gauss-Seidel Preconditioners and Smoothers for Krylov Solvers on a GPU Cluster: Preprint

Gauss-Seidel (GS) relaxation is often employed as a preconditioner for a Krylov solver or as a smoother for Algebraic Multigrid (AMG). However, the requisite sparse triangular solve is difficult to parallelize on many-core architectures such as graphics processing units (GPUs). In the present study, the performance of the sequential GS relaxation based on a triangular solve is compared with two-stage variants, replacing the direct triangular solve with a fixed number of inner Jacobi-Richardson (JR) iterations. When a small number of inner iterations is sufficient to maintain the Krylov convergence rate, the two-stage GS (GS2) often outperforms the sequential algorithm on many-core architectures. The GS2 algorithm is also compared with JR. When they perform the same number of ops for SpMV (e.g. three JR sweeps compared to two GS sweeps with one inner JR sweep), the GS2 iterations, and the Krylov solver preconditioned with GS2, may converge faster than the JR iterations. Moreover, for some problems (e.g. elasticity), it was found that JR may diverge with a damping factor of one, whereas two-stage GS may improve the convergence with more inner iterations. Finally, to study the performance of the two-stage smoother and preconditioner for a practical problem, these were applied to incompressible uid ow simulations on GPUs.

algebraic multigrid↗
DOE OSTI2026

Krylov winding and emergent coherence in operator growth dynamics

The operator wavefunction provides a fine-grained description of quantum chaos and of the irreversible growth of simple operators into increasingly complex ones. Remarkably, at finite temperature this wavefunction can acquire a phase that increases linearly with the operator’s size, a phenomenon called . Although size winding occurs naturally in a holographic setting, the emergence of a coherent phase in a scrambled operator remains mysterious from the standpoint of a thermalizing quantum many-body system. Here, in this article, we elucidate this phenomenon by introducing the related concept of , whereby the operator wavefunction acquires a phase which winds linearly with the Krylov index. We show that Krylov winding is a generic feature of quantum chaotic systems and is a direct consequence of the universal operator growth bound hypothesis. It gives rise to size winding under two additional conditions: (i) a low-rank mapping between the Krylov and size bases, which ensures phase alignment among operators of the same size, and (ii) the saturation of the "chaos-operator growth" bound 𝜆 𝐿 ≤ 2⁢𝛼 (with 𝜆 𝐿 the Lyapunov exponent and 𝛼 the growth rate), which ensures a linear phase dependence on size. For systems which do not saturate this bound, with ℎ = 𝜆 𝐿 /2⁢𝛼 < 1, the winding with Pauli size ℓ becomes superliner, behaving as ℓ 1/ℎ . We illustrate these results with two classes of microscopic models: the Sachdev-Ye-Kitaev (SYK) model and its variants, and a disordered 𝑘-local spin model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Krylov complexity in mixed phase space

We investigate the Krylov complexity of thermofield double states in systems with mixed phase space, uncovering a direct correlation with the Brody distribution, which interpolates between Poisson and Wigner statistics. Our analysis spans two-dimensional random matrix models featuring (I) GOE-Poisson and (II) GUE-Poisson transitions and extends to higher-dimensional cases, including a stringy matrix model (GOE-Poisson) and the mass-deformed SYK model (GUE-Poisson). Krylov complexity consistently emerges as a reliable marker of quantum chaos, displaying a characteristic peak in the chaotic regime that gradually diminishes as the Brody parameter approaches zero, signaling a shift toward integrability. These results establish Krylov complexity as a powerful diagnostic of quantum chaos and highlight its interplay with eigenvalue statistics in mixed phase systems.

chaos & nonlinear dynamics↗
NASA NTRS1989

Model reduction and control of flexible structures using Krylov subspaces

Krylov vectors and the concept of parameter-matching are combined to develop a model reduction algorithm for a damped structural dynamics system. The reduced-order model obtained matches a certain number of low-frequency moments of the full-order system. The major application of the present method is to the control of flexible structures. It is shown that, in the control of flexible structures, there generally exist three types of control energy spillover, namely, the control spillover, the observation spillover, and dynamic spillover. The formulation based on Krylov subspaces can eliminate the control and the observation spillover, while leaving only the dynamic spillover to be considered. Two examples are used to illustrate the efficacy of the Krylov method.

Craig, Roy R., Jr.↗
NASA NTRS1989

Globally convergent techniques in nonlinear Newton-Krylov

Some convergence theory is presented for nonlinear Krylov subspace methods. The basic idea of these methods is to use variants of Newton's iteration in conjunction with a Krylov subspace method for solving the Jacobian linear systems. These methods are variants of inexact Newton methods where the approximate Newton direction is taken from a subspace of small dimensions. The main focus is to analyze these methods when they are combined with global strategies such as linesearch techniques and model trust region algorithms. Most of the convergence results are formulated for projection onto general subspaces rather than just Krylov subspaces.

Brown, Peter N.↗
NASA NTRS1992

Application of vector-valued rational approximations to the matrix eigenvalue problem and connections with Krylov subspace methods

Let F(z) be a vectored-valued function F: C approaches C sup N, which is analytic at z=0 and meromorphic in a neighborhood of z=0, and let its Maclaurin series be given. We use vector-valued rational approximation procedures for F(z) that are based on its Maclaurin series in conjunction with power iterations to develop bona fide generalizations of the power method for an arbitrary N X N matrix that may be diagonalizable or not. These generalizations can be used to obtain simultaneously several of the largest distinct eigenvalues and the corresponding invariant subspaces, and present a detailed convergence theory for them. In addition, it is shown that the generalized power methods of this work are equivalent to some Krylov subspace methods, among them the methods of Arnoldi and Lanczos. Thus, the theory provides a set of completely new results and constructions for these Krylov subspace methods. This theory suggests at the same time a new mode of usage for these Krylov subspace methods that were observed to possess computational advantages over their common mode of usage.

Sidi, Avram↗
NASA NTRS1991

Krylov model reduction algorithm for undamped structural dynamics systems

Krylov vectors furnish an efficient basis for eigenvalue analysis and model reduction of structural dynamics systems. The reduced-order model obtained by the present Krylov model-reduction algorithm for an undamped structural-dynamics system is found to match low-frequency moments. The transformed system equation in Krylov coordinates reflects the structure of a tandem system.

Craig, Roy R., Jr.↗
NASA NTRS1991

Krylov Subspace Methods for Complex Non-Hermitian Linear Systems

We consider Krylov subspace methods for the solution of large sparse linear systems Ax = b with complex non-Hermitian coefficient matrices. Such linear systems arise in important applications, such as inverse scattering, numerical solution of time-dependent Schrodinger equations, underwater acoustics, eddy current computations, numerical computations in quantum chromodynamics, and numerical conformal mapping. Typically, the resulting coefficient matrices A exhibit special structures, such as complex symmetry, or they are shifted Hermitian matrices. In this paper, we first describe a Krylov subspace approach with iterates defined by a quasi-minimal residual property, the QMR method, for solving general complex non-Hermitian linear systems. Then, we study special Krylov subspace methods designed for the two families of complex symmetric respectively shifted Hermitian linear systems. We also include some results concerning the obvious approach to general complex linear systems by solving equivalent real linear systems for the real and imaginary parts of x. Finally, numerical experiments for linear systems arising from the complex Helmholtz equation are reported.

Freund, Roland W.↗