Related papers: Krylov subspace methods for the Dirac equation

The technique that was used to build the EigCG algorithm for sparse symmetric linear systems is extended to the nonsymmetric case using the BiCG algorithm. We show that, similarly to the symmetric case, we can build an algorithm that is…

We present a Lanczos tau method for the approximation and optimization of the $H^2$-norm of time-delay systems described by semi-explicit delay differential algebraic equations. The soundness of this approach is proven under the assumption…

Continuing the previous initiatives arXiv: 2207.05347 and arXiv: 2212.06180, we pursue the exploration of operator growth and Krylov complexity in dissipative open quantum systems. In this paper, we resort to the bi-Lanczos algorithm…

The Krylov subspace projection approach is a well-established tool for the reduced order modeling of dynamical systems in the time domain. In this paper, we address the main issues obstructing the application of this powerful approach to…

We establish global existence and derive sharp pointwise decay estimates of solutions to cubic Dirac and Dirac-Klein-Gordon systems on a curved background, close to the Minkowski spacetime. By squaring the Dirac operator, we reduce the…

We model a single-electron ion (hydrogenic atom) as a static, spherically symmetric electrovacuum spacetime in which the nucleus is treated as a timelike line-singularity and the electron is treated as a test particle following Dirac's…

We provide convergence rates for Krylov subspace solutions to the trust-region and cubic-regularized (nonconvex) quadratic problems. Such solutions may be efficiently computed by the Lanczos method and have long been used in practice. We…

We introduce a quantum algorithm for simulating the time-dependent Dirac equation in 3+1 dimensions using discrete-time quantum walks. Thus far, promising quantum algorithms have been proposed to simulate quantum dynamics in…

We introduce a micro-macro parareal algorithm for the time-parallel integration of multiscale-in-time systems. The algorithm first computes a cheap, but inaccurate, solution using a coarse propagator (simulating an approximate slow…

Many scientific applications require the solution of large initial-value problems, such as those produced by the method of lines after semi-discretization in space of partial differential equations. The computational cost of implicit time…

We investigate the oblique Lanczos method recently put forward in arXiv:2406.20009 for analysing Euclidean correlators in lattice field theories and show that it is analytically equivalent to the well known Prony Generalised Eigenvalue…

We present a matrix-free parallel scalable multilevel deflation preconditioned method for heterogeneous time-harmonic wave problems. Building on the higher-order deflation preconditioning proposed by Dwarka and Vuik (SIAM J. Sci. Comput.…

We present a matrix technique to obtain the spectrum and the analytical index of some elliptic operators defined on compact Riemannian manifolds. The method uses matrix representations of the derivative which yield exact values for the…

We introduce a new implementation of time-dependent density-functional theory which allows the \emph{entire} spectrum of a molecule or extended system to be computed with a numerical effort comparable to that of a \emph{single} standard…

The distribution of the eigenvalues of a Hermitian matrix (or of a Hermitian matrix pencil) reveals important features of the underlying problem, whether a Hamiltonian system in physics, or a social network in behavioral sciences. However,…

The overlap operator in lattice QCD requires the computation of the sign function of a matrix, which is non-Hermitian in the presence of a quark chemical potential. In previous work we introduced an Arnoldi-based Krylov subspace…

Different recently developed Krylov space methods for solving linear systems are studied and compared for the solution of the Dirac equation on the lattice. Stabilized Biconjugate Gradient (BiCGstab2) is shown to be a robust and efficient…

The Lewis and Riesenfeld method has been investigated, by Ramos et al in Ref.[1], for quantum systems governed by time-dependent PT symmetric Hamiltonians and particularly where the quantum system is a particle submitted to action of a…

For linear inverse problems with a large number of unknown parameters, uncertainty quantification remains a challenging task. In this work, we use Krylov subspace methods to approximate the posterior covariance matrix and describe efficient…

We derive and implement an alternative formulation of the Stochastic Lanczos algorithm to be employed in connection with the Many-Body Dispersion model (MBD). Indeed, this formulation, which is only possible due to the Stochastic Lanczos'…