Related papers: An efficient solution for Dirac equation in 3D lat…
In practical computations, the (preconditioned) conjugate gradient (P)CG method is the iterative method of choice for solving systems of linear algebraic equations $Ax=b$ with a real symmetric positive definite matrix $A$. During the…
The linear conjugate gradient method is an efficient iterative method for the convex quadratic minimization problems $ \mathop {\min }\limits_{x \in { \mathbb R^n}} f(x) =\dfrac{1}{2}x^TAx+b^Tx $, where $ A \in R^{n \times n} $ is symmetric…
Convolution-type integral equations arise from various fields, \textit{e.g.}, finite impulse response filters in signal processing and deblurring problems in image processing. When solving these equations, conventional numerical methods,…
We introduce a dilated coordinate method to address computational challenges in nuclear lattice effective field theory (NLEFT) for weakly-bound few-body systems. The approach employs adaptive mesh refinement via analytic coordinate…
In contact mechanics computation, the constraint conditions on the contact surfaces are typically enforced by the Lagrange multiplier method, resulting in a saddle point system. The mortar finite element method is usually employed to…
Conjugate Gradient (CG) methods are one of the most effective iterative methods to solve linear equations in Hilbert spaces. So far, they have been inherently bound to these spaces since they make use of the inner product structure. In more…
We propose an easy-to-implement iterative method for resolving the implicit (or semi-implicit) schemes arising in solving reaction-diffusion (RD) type equations. We formulate the nonlinear time implicit scheme as a min-max saddle point…
We introduce new hybridizable discontinuous Galerkin (HDG) methods for solving the two-dimensional vector Laplacian equation under three types of boundary conditions: electric, magnetic, and Dirichlet. The method is formulated on a…
This work studies a composite minimization problem involving a differentiable function q and a nonsmooth function h, both of which may be nonconvex. This problem is ubiquitous in signal processing and machine learning yet remains…
This work presents an safe and efficient methodology for autonomous indoor exploration with aerial robots using Harmonic Potential Fields (HPF). The challenge of applying HPF in complex 3D environments rests on high computational load…
A numerical method is developed to solve the time-dependent Dirac equation in cylindrical coordinates for 3-D axisymmetric systems. The time evolution is treated by a splitting scheme in coordinate space using alternate direction iteration,…
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 for the first time an efficient iterative method to directly solve the four-component Dirac-Kohn-Sham (DKS) density functional theory. Due to the existence of the negative energy continuum in the DKS operator, the existing…
A Crank-Nicolson finite volume approximation for three-dimensional conservative space-fractional diffusion equation results in large and dense three-level Toeplitz discrete linear systems. Preconditioned Krylov subspace methods with sine…
Lattice field theory (LFT) is the standard non-perturbative method to perform numerical calculations of quantum field theory. However, the typical bottleneck of fermionic lattice calculations is the inversion of the Dirac matrix. This…
We develop a high-order hybridized discontinuous Galerkin (HDG) method for a linear degenerate elliptic equation arising from a two-phase mixture of mantle convection or glacier dynamics. We show that the proposed HDG method is well-posed…
Solving large-scale linear systems problems is a cornerstone in scientific and industrial computing. Classical iterative solvers face increasing difficulty as the number of unknowns becomes large, while fully quantum linear solvers require…
Accelerating the convergence of second-order optimization, particularly Newton-type methods, remains a pivotal challenge in algorithmic research. In this paper, we extend previous work on the \textbf{Quadratic Gradient (QG)} and rigorously…
A spacetime discontinuous Petrov-Galerkin (DPG) method for the linear wave equation is presented. This method is based on a weak formulation that uses a broken graph space. The wellposedness of this formulation is established using a…
A hybridized discontinuous Galerkin method is proposed for solving 2D fractional convection-diffusion equations containing derivatives of fractional order in space on a finite domain. The Riemann-Liouville derivative is used for the spatial…