Related papers: An efficient solution for Dirac equation in 3D lat…
This paper develops a finite-difference analogue of the boundary integral/element method for the numerical solution of two-dimensional exterior scattering from scatterers of arbitrary shapes. The discrete fundamental solution, known as the…
Recent progress on deep learning relies heavily on the quality and efficiency of training algorithms. In this paper, we develop a fast training method motivated by the nonlinear Conjugate Gradient (CG) framework. We propose the Conjugate…
We propose an augmented Lagrangian-based preconditioner to accelerate the convergence of Krylov subspace methods applied to linear systems of equations with a block three-by-three structure such as those arising from mixed finite element…
In this paper we propose a variant of the substructuring preconditioner for solving three-dimensional elliptic-type equations with strongly discontinuous coefficients. In the proposed preconditioner, we use the simplest coarse solver…
Multigrid methods were invented for the solution of discretized partial differential equations in ordered systems. The slowness of traditional algorithms is overcome by updates on various length scales. In this article we discuss…
In this paper, we present a structured solver based on the preconditioned conjugate gradient method (PCGM) for solving the linear quadratic (LQ) optimal control problem for $K \times N$ sub-systems connected in a two-dimensional (2D) grid…
This paper proposes a generalization of the conjugate gradient (CG) method used to solve the equation $Ax=b$ for a symmetric positive definite matrix $A$ of large size $n$. The generalization consists of permitting the scalar control…
Nesterov's accelerated gradient (AG) method for minimizing a smooth strongly convex function $f$ is known to reduce $f({\bf x}_k)-f({\bf x}^*)$ by a factor of $\epsilon\in(0,1)$ after $k=O(\sqrt{L/\ell}\log(1/\epsilon))$ iterations, where…
In this paper, we develop a class of high-order conservative methods for simulating non-equilibrium radiation diffusion problems. Numerically, this system poses significant challenges due to strong nonlinearity within the stiff source terms…
In this work, a fully implicit numerical approach based on space-time finite element method is presented to solve the Dirac equation in 1 (space) + 1 (time), 2 + 1, and 3 + 1 dimensions. We utilize PETSc/Tao library to implement our linear…
We propose the experimental realization of (3+1) relativistic Dirac fermions using ultracold atoms in a rotating optical lattice or, alternatively, in a synthetic magnetic field. This approach has the advantage to give mass to the Dirac…
We propose an iterative solution method for the 3D high-frequency Helmholtz equation that exploits a contour integral formulation of spectral projectors. In this framework, the solution in certain invariant subspaces is approximated by…
We introduce two novel interpolatory dynamical low-rank (DLR) approximation methods for the efficient time integration of the Boltzmann-BGK equation. Both methods overcome limitations of classic DLR schemes based on orthogonal projections…
We study acceleration and preconditioning strategies for a class of Douglas-Rachford methods aiming at the solution of convex-concave saddle-point problems associated with Fenchel-Rockafellar duality. While the basic iteration converges…
The coordinate space formulation of the Hartree-Fock-Bogoliubov (HFB) method enables self-consistent treatment of mean-field and pairing in weakly bound systems whose properties are affected by the particle continuum space. Of particular…
The primal-dual hybrid gradient (PDHG) algorithm is popular in solving min-max problems which are being widely used in a variety of areas. To improve the applicability and efficiency of PDHG for different application scenarios, we focus on…
There are several approaches to describe flows with particles e.g. Lattice-Gas Automata (LGA), Lattice-Boltzmann method (LBM) or smoothed particle hydrodynamics (SPH). These approaches do not use fixed grids on which the Navier-Stokes…
The linear primal-dual hybrid gradient (PDHG) method is a first-order method that splits convex optimization problems with saddle-point structure into smaller subproblems. Unlike those obtained in most splitting methods, these subproblems…
The conjugate gradient (CG) method is a classic Krylov subspace method for solving symmetric positive definite linear systems. We introduce an analogous semi-conjugate gradient (SCG) method for unsymmetric positive definite linear systems.…
We present an efficient numerical method, inspired by transformation optics, for solving the Poisson equation in complex and arbitrarily shaped geometries. The approach operates by mapping the physical domain to a uniform computational…