Related papers: Surface worm algorithm for abelian Gauge-Higgs sys…

This paper presents a multi-objective version of the Cat Swarm Optimization Algorithm called the Grid-based Multi-objective Cat Swarm Optimization Algorithm (GMOCSO). Convergence and diversity preservation are the two main goals pursued by…

In this paper I describe a new optimal Krylov subspace solver for shifted unitary matrices called the Shifted Unitary Orthogonal Method (SUOM). This algorithm is used as a benchmark against any improvement like the two-grid algorithm. I use…

In this monograph, we review and develop variable projection Gauss-Newton, Levenberg-Marquardt and Newton methods for the Weighted Low-Rank Approximation (WLRA) problem, which has now an increasing number of applications in many scientific…

Spins in gated semiconductor quantum dots (QDs) are a promising platform for Hubbard model simulation inaccessible to computation. Precise control of the tunnel couplings by tuning voltages on metallic gates is vital for a successful…

The identification of electromagnetic emission from gravitational-wave sources typically requires multiple follow-up observations due to the limited fields-of-view of follow-up observatories compared to the poorly localized direction of…

Many surfactant-based formulations are utilised in industry as they produce desirable visco-elastic properties at low-concentrations. These properties are due to the presence of worm-like micelles (WLM) and, as a result, understanding the…

The Gromov-Wasserstein (GW) problem is a variant of the classical optimal transport problem that allows one to compute meaningful transportation plans between incomparable spaces. At an intuitive level, it seeks plans that minimize the…

We proposed an iterate scheme for solving convex-concave saddle-point problems associated with general convex-concave functions. We demonstrated that when our iterate scheme is applied to a special class of convex-concave functions, which…

We introduce a low-rank algorithm inspired by the Basis-Update and Galerkin (BUG) integrator to efficiently approximate solutions to Sylvester-type equations. The algorithm can exploit both the low-rank structure of the solution as well as…

The CP(N-1) model in 2D is an interesting toy model for 4D QCD as it possesses confinement, asymptotic freedom and a non-trivial vacuum structure. Due to the lower dimensionality and the absence of fermions, the computational cost for…

This paper analyzes the convergence for a large class of Riemannian stochastic approximation (SA) schemes, which aim at tackling stochastic optimization problems. In particular, the recursions we study use either the exponential map of the…

We consider the one-dimensional shallow water equations (SW) in a finite channel with variable bottom topography. We pose several initial-boundary-value problems for the SW system, including problems with transparent (characteristic)…

We compute, by free field techniques, the scalar product of the SU(2) Chern-Simons states on genus > 1 surfaces. The result is a finite-dimensional integral over positions of ``screening charges'' and one complex modular parameter. It uses…

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.…

In this work, we consider convex optimization problems with smooth objective function and nonsmooth functional constraints. We propose a new stochastic gradient algorithm, called Stochastic Halfspace Approximation Method (SHAM), to solve…

The Worldvolume Hybrid Monte Carlo (WV-HMC) method [arXiv:2012.08468] is a reliable and versatile algorithm for addressing the numerical sign problem. It resolves the ergodicity issues commonly encountered in Lefschetz thimble-based…

The problem of situational awareness (SAW) is investigated from the probabilistic modeling point of view. Taking the situation as a hidden variable, we introduce a hidden Markov model (HMM) and an extended state space model (ESSM) to…

We study a generalization of Swendsen-Wang algorithm suited for Potts models with next-next-neighborhood interactions. Using the embedding technique proposed by Wolff we test it on the Symanzik improved bidimensional non-linear $\sigma$…

GROUSE (Grassmannian Rank-One Update Subspace Estimation) is an iterative algorithm for identifying a linear subspace of R^n from data consisting of partial observations of random vectors from that subspace. This paper examines local…

The Stochastic Green Function (SGF) algorithm is able to simulate any Hamiltonian that does not suffer from the so-called "sign problem". We propose a new global space-time update scheme for the SGF algorithm which, in addition to being…