相关论文: Solving the Dirac equation on a GPU for strong-fie…
In the present article, using a further generalization of the algebraic method of separation of variables, the Dirac equation is separated in a family of space-times where it is not possible to find a complete set of first order commuting…
Exact analytic solutions for an electron in graphene interacting with external complex magnetic fields are found. The eigenvalue problem for the non-hermitian Dirac-Weyl Hamiltonian leads to a pair of intertwined Schr{\"o}dinger equations,…
We describe main issues and design principles of an efficient implementation, tailored to recent generations of Nvidia Graphics Processing Units (GPUs), of an Algebraic Multigrid (AMG) preconditioner previously proposed by one of the…
We obtain exact solution of the Dirac equation for a charged particle with position-dependent mass in the Coulomb field. The effective mass of the spinor has a relativistic component which is proportional to the square of the Compton…
The Dirac equation is exactly solved for a pseudoscalar linear plus Coulomb-like potential in a two-dimensional world. This sort of potential gives rise to an effective quadratic plus inversely quadratic potential in a Sturm-Liouville…
We derive and solve the Hamiltonian flow equations for a Dirac particle in an external static potential. The method shows a general procedure for the set up of continuous unitary transformations to reduce the Hamiltonian to a quasidiagonal…
Principal component analysis (PCA) is a key statistical technique for multivariate data analysis. For large data sets the common approach to PCA computation is based on the standard NIPALS-PCA algorithm, which unfortunately suffers from…
The polyhedral homotopy method of Huber and Sturmfels is a particularly efficient and robust numerical method for solving system of (Laurent) polynomial equations. A central component in an implementation of this method is an efficient and…
The identification, and subsequent discovery, of fast radio transients through blind-search surveys requires a large amount of processing power, in worst cases scaling as $\mathcal{O}(N^3)$. For this reason, survey data are generally…
We calculate on GPUs the disconnected diagrams associated with the nucleon form factors and moments of generalized parton distributions using Nf=2+1+1 twisted mass fermions. We employ the truncated solver method (TSM) for estimating the…
In this article we design a novel quasi-regression Monte Carlo algorithm in order to approximate the solution of discrete time backward stochastic differential equations (BSDEs), and we analyze the convergence of the proposed method. The…
Many problems in geophysical and atmospheric modelling require the fast solution of elliptic partial differential equations (PDEs) in "flat" three dimensional geometries. In particular, an anisotropic elliptic PDE for the pressure…
In this paper we present new versions of previously published numerical programs for solving the dipolar Gross-Pitaevskii (GP) equation including the contact interaction in two and three spatial dimensions in imaginary and in real time,…
We consider single-layer plane graphene with electronic excitations described by the Dirac equation. Using a known representation of the polarization tensor in terms of the spinor loop we show the existence of surface modes, i.e., of…
Let $(M^{n},g)$ be a complete Riemannian manifold. In this paper, we establish a space-time gradient estimates for positive solutions of nonlinear parabolic equations $$\partial_{t}u(x,t)=\Delta u(x,t)+a u(x,t)(\log u(x,t))^b +…
In the Graph Isomorphism problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G into G'. If yes, then G and G' are said…
In this paper, we develop a new parallel auxiliary grid algebraic multigrid (AMG) method to leverage the power of graphic processing units (GPUs). In the construction of the hierarchical coarse grid, we use a simple and fixed coarsening…
The Graph Pricing problem is among the fundamental problems whose approximability is not well-understood. While there is a simple combinatorial 1/4-approximation algorithm, the best hardness result remains at 1/2 assuming the Unique Games…
The graphics processing unit (GPU) has emerged as a powerful and cost effective processor for general performance computing. GPUs are capable of an order of magnitude more floating-point operations per second as compared to modern central…
On neutral atom platforms, preparing specific quantum states is usually achieved by pulse shaping, i.e., by optimizing the time-dependence of the Hamiltonian related to the system. This process can be extremely costly, as it requires…