Related papers: Krylov subspace methods for the Dirac equation
A new algorithm is proposed to accelerate RANSAC model quality calculations. The method is based on partitioning the joint correspondence space, e.g., 2D-2D point correspondences, into a pair of regular grids. The grid cells are mapped by…
A novel fourth-order finite difference formula coupling the Crank-Nicolson explicit linearized method is proposed to solve Riesz space fractional nonlinear reaction-diffusion equations in two dimensions. Theoretically, under the Lipschitz…
Presented is a quantum computing representation of Dirac particle dynamics. The approach employs an operator splitting method that is an analytically closed-form product decomposition of the unitary evolution operator. This allows the Dirac…
We present an algorithm for the solution of a simultaneous space-time discretization of linear parabolic evolution equations with a symmetric differential operator in space. Building on earlier work, we recast this discretization into a…
The Dirac's formalism for constrained systems is applied to the analysis of time-dependent Hamiltonians in the extended phase space. We show that the Lewis invariant is a reparametrization invariant and we calculate the Feynman propagator…
We present a Hamiltonian Monte Carlo algorithm to sample from multivariate Gaussian distributions in which the target space is constrained by linear and quadratic inequalities or products thereof. The Hamiltonian equations of motion can be…
The aim of this paper is to develop fast second-order accurate difference schemes for solving one- and two-dimensional time distributed-order and Riesz space fractional diffusion equations. We adopt the same measures for one- and…
The behavior of a Lattice Monte Carlo algorithm (if it is designed correctly) must approach that of the continuum system that it is designed to simulate as the time step and the mesh step tend to zero. However, we show for an algorithm for…
The eigenvalue spectrum $\rho(\lambda)$ of the Dirac operator is numerically calculated in lattice QCD with 2+1 flavors of dynamical domain-wall fermions. In the high-energy regime, the discretization effects become significant. We subtract…
Solving the trust-region subproblem (TRS) plays a key role in numerical optimization and many other applications. The generalized Lanczos trust-region (GLTR) method is a well-known Lanczos type approach for solving a large-scale TRS. The…
We examine the accuracy of the microcanonical Lanczos method (MCLM) developed by Long, {\it et al.} [Phys. Rev. B {\bf 68}, 235106 (2003)] to compute dynamical spectral functions of interacting quantum models at finite temperatures. The…
Distributed computing is a standard way to scale up machine learning and data science algorithms to process large amounts of data. In such settings, avoiding communication amongst machines is paramount for achieving high performance. Rather…
We present a procedure for the systematic estimation of the dispersion properties of linear discrete systems with periodic time-varying coefficients. The approach relies on the analysis of a single unit cell, making use of Bloch theorem…
In this work, we propose a novel preconditioned Krylov subspace method for solving an optimal control problem of wave equations, after explicitly identifying the asymptotic spectral distribution of the involved sequence of linear…
We consider the task of computing solutions of linear systems that only differ by a shift with the identity matrix as well as linear systems with several different right hand sides. In the past Krylov subspace methods have been developed…
We propose a computationally efficient and systematically convergent approach for elastodynamics simulations. We recast the second-order dynamical equation of elastodynamics into an equivalent first-order system of coupled equations, so as…
We propose and analyze a non-iterative domain decomposition integrator for the linear acoustic wave equation. The core idea is to combine an implicit Crank-Nicolson step on spatial subdomains with a local prediction step at the subdomain…
In view of the existing limitations of sequential computing, parallelization has emerged as an alternative in order to improve the speedup of numerical simulations. In the framework of evolutionary problems, space-time parallel methods…
A delay Lyapunov matrix corresponding to an exponentially stable system of linear time-invariant delay differential equations can be characterized as the solution of a boundary value problem involving a matrix valued delay differential…
The runtime for Kernel Partial Least Squares (KPLS) to compute the fit is quadratic in the number of examples. However, the necessity of obtaining sensitivity measures as degrees of freedom for model selection or confidence intervals for…