Results 31 to 40 of about 81,041 (236)
The Hamiltonian extended Krylov subspace method
An algorithm for constructing a $J$-orthogonal basis of the extended Krylov subspace$\mathcal{K}_{r,s}=\operatorname{range}\{u,Hu, H^2u,$ $ \ldots, $ $H^{2r-1}u, H^{-1}u, H^{-2}u, \ldots, H^{-2s}u\},$where $H \in \mathbb{R}^{2n \times 2n}$ is a large (and sparse) Hamiltonian matrix is derived (for $r = s+1$ or $r=s$).
Peter Benner +2 more
openaire +4 more sources
On the Preconditioned Delayed Weighted Gradient Method
In this article a preconditioned version of the Delayed Weighted Gradient Method (DWGM) is presented and analyzed. In addition to the convergence, some nice properties as the A- orthogonality of the current transformed gradient with all the previous ...
R. Aleixo, H. Lara Urdaneta
doaj +1 more source
Toeplitz-like preconditioner for linear systems from spatial fractional diffusion equations [PDF]
The article deals with constructing Toeplitz-like preconditioner for linear systems arising from finite difference discretization of the spatial fractional diffusion equations. The coefficient matrices of these linear systems have an $S+L$ structure,
N. Akhoundi
doaj +1 more source
Krylov Subspace Methods in Dynamical Sampling [PDF]
12 pages, 2 ...
Aldroubi, Akram, Krishtal, Ilya
openaire +3 more sources
Randomized Orthogonal Projection Methods for Krylov Subspace Solvers [PDF]
Randomized orthogonal projection methods (ROPMs) can be used to speed up the computation of Krylov subspace methods in various contexts. Through a theoretical and numerical investigation, we establish that these methods produce quasi-optimal ...
E. Timsit, L. Grigori, O. Balabanov
semanticscholar +1 more source
Measurement-efficient quantum Krylov subspace diagonalisation [PDF]
The Krylov subspace methods, being one category of the most important classical numerical methods for linear algebra problems, can be much more powerful when generalised to quantum computing.
Zongkang Zhang +3 more
doaj +1 more source
Quantum Power Method by a Superposition of Time-Evolved States
We propose a quantum-classical hybrid algorithm of the power method, here dubbed as the quantum power method, to evaluate H[over ^]^{n}|ψ⟩ with quantum computers, where n is a non-negative integer, H[over ^] is a time-independent Hamiltonian of interest,
Kazuhiro Seki, Seiji Yunoki
doaj +1 more source
A nested Krylov subspace method to compute the sign function of large complex matrices [PDF]
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the overlap Dirac operator at both zero and nonzero baryon density.
Bloch +22 more
core +1 more source
Solving Coupled Cluster Equations by the Newton Krylov Method
We describe using the Newton Krylov method to solve the coupled cluster equation. The method uses a Krylov iterative method to compute the Newton correction to the approximate coupled cluster amplitude.
Chao Yang +4 more
doaj +1 more source
On Numerical Approximations of the Koopman Operator
We study numerical approaches to computation of spectral properties of composition operators. We provide a characterization of Koopman Modes in Banach spaces using Generalized Laplace Analysis.
Igor Mezić
doaj +1 more source

