Related papers: Krylov subspace methods for the Dirac equation
In this paper, the Lorentz covariance of algorithms is introduced. Under Lorentz transformation, both the form and performance of a Lorentz covariant algorithm are invariant. To acquire the advantages of symplectic algorithms and Lorentz…
Numerical evolution of time-dependent differential equations via explicit Runge-Kutta or Taylor methods typically fails to preserve symmetries of a system. It is known that there exists no numerical integration method that in general…
Advantageous numerical methods for solving the Dirac equations are derived. They are based on different stochastic optimization techniques, namely the Genetic algorithms, the Particle Swarm Optimization and the Simulated Annealing method,…
This paper presents new analytic solutions to the Dirac equation employing a recently introduced method that is based on the formulation of spinorial fields and their driving electromagnetic fields in terms of geometric algebras. A first…
A quantum algorithm that solves the time-dependent Dirac equation on a digital quantum computer is developed and analyzed. The time evolution is performed by an operator splitting decomposition technique that allows for a mapping of the…
In this work we study the Dirac equation on the cosmic string background, which models a one--dimensional topological defect in the spacetime. We first define the Dirac operator in this setting, classifying all of its selfadjoint…
The parareal in time algorithm allows to efficiently use parallel computing for the simulation of time-dependent problems. It is based on a decomposition of the time interval into subintervals, and on a predictor-corrector strategy, where…
We give an alternative proof of the completeness of the Chandrasekhar ansatz for the Dirac equation in the Kerr-Newman metric. Based on this, we derive an integral representation for smooth compactly supported functions which in turn we use…
An extension of the synchronous parallel kinetic Monte Carlo (pkMC) algorithm developed by Martinez {\it et al} [{\it J.\ Comp.\ Phys.} {\bf 227} (2008) 3804] to discrete lattices is presented. The method solves the master equation…
Presented is a quantum lattice gas algorithm to efficiently model a system of Dirac particles interacting through an intermediary gauge field. The algorithm uses a fixed qubit array to represent both the spacetime and the particles…
The spectral transformation Lanczos method for the sparse symmetric definite generalized eigenvalue problem for matrices $A$ and $B$ is an iterative method that addresses the case of semidefinite or ill conditioned $B$ using a shifted and…
We present a method that can evaluate a RANSAC hypothesis in constant time, i.e. independent of the size of the data. A key observation here is that correct hypotheses are tightly clustered together in the latent parameter domain. In a…
We solve the Dirac equation in one space dimension for the case of a linear, Lorentz-scalar potential. This extends earlier work of Bhalerao and Ram [Am. J. Phys. 69 (7), 817-818 (2001)] by eliminating unnecessary constraints. The spectrum…
We present four frequently used finite difference methods and establish the error bounds for the discretization of the Dirac equation in the massless and nonrelativistic regime, involving a small dimensionless parameter $0< \varepsilon \ll…
Rational Krylov subspaces have become a reference tool in dimension reduction procedures for several application problems. When data matrices are symmetric, a short-term recurrence can be used to generate an associated orthonormal basis. In…
Krylov subspace methods are a powerful tool for efficiently solving high-dimensional linear algebra problems. In this work, we study the approximation quality that a Krylov subspace provides for estimating the numerical range of a matrix.…
We consider the following constrained Rayleigh quotient optimization problem (CRQopt) $$ \min_{x\in \mathbb{R}^n} x^{T}Ax\,\,\mbox{subject to}\,\, x^{T}x=1\,\mbox{and}\,C^{T}x=b, $$ where $A$ is an $n\times n$ real symmetric matrix and $C$…
We investigate $L^1\to L^\infty$ dispersive estimates for the one dimensional Dirac equation with a potential. In particular, we show that the Dirac evolution satisfies the natural $t^{-\frac12}$ decay rate, which may be improved to…
We present a modified Lanczos algorithm to diagonalize lattice Hamiltonians with dramatically reduced memory requirements, {\em without restricting to variational ansatzes}. The lattice of size $N$ is partitioned into two subclusters. At…
Global and block Krylov subspace methods are efficient iterative solvers for large sparse linear systems with multiple right-hand sides. However, global or block Lanczos-type solvers often exhibit large oscillations in the residual norms…