Related papers: Shifted unitary orthogonal methods for the overlap…
Numerous applications require algorithms that can align partially overlapping point sets while maintaining invariance to geometric transformations (e.g., similarity, affine, rigid). This paper introduces a novel global optimization method…
We propose a new simple variant of Fast Gradient Method that requires only one projection per iteration. We called this method Triangle Method (TM) because it has a corresponding geometric description. We generalize TM for convex and…
Accelerated MRI involves collecting partial $k$-space measurements to reduce acquisition time, patient discomfort, and motion artifacts, and typically uses regular undersampling patterns or human-designed schemes. Recent works have studied…
This paper is concerned with the analysis of convergent sequential and parallel overlapping domain decomposition methods for the minimization of functionals formed by a discrepancy term with respect to data and a total variation constraint.…
Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very…
In topology optimization, the design parameter with no contribution to the objective function vanishes. This causes the stiffness matrix to become singular. We show that a local optimal solution is obtained by Conjugate Residual Method and…
We present an iterative overlap estimation technique to augment existing point cloud registration algorithms that can achieve high performance in difficult real-world situations where large pose displacement and non-overlapping geometry…
Aligning partially overlapping point sets where there is no prior information about the value of the transformation is a challenging problem in computer vision. To achieve this goal, we first reduce the objective of the robust point…
Seismic imaging is a major challenge in geophysics with broad applications. It involves solving wave propagation equations with absorbing boundary conditions (ABC) multiple times. This drives the need for accurate and efficient numerical…
We present a set of related Hybrid Monte Carlo methods to simulate an arbitrary number of dynamical overlap fermions. Each fermion is represented by a chiral pseudo-fermion field. The new algorithm reduces critical slowing down in the…
The overlap formulation is applied to an anomaly free combination of chiral fermions coupled to U(1) gauge fields on a 2D torus. Evidence is presented that gauge averaging the overlap phases in these models produces correct continuum…
We propose a homogeneous primal-dual interior-point method to solve sum-of-squares optimization problems by combining non-symmetric conic optimization techniques and polynomial interpolation. The approach optimizes directly over the…
In this paper, we study the restarted Krylov subspace method, which is typically represented by the GMRES(m) method. Our work mainly focused on the amount of change in the iterative solution of GMRES(m) at each restart. We propose an…
Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions,…
The goal of this paper is to present two algorithms for solving systems of inclusion problems, with all component of the systems being a sum of two maximal monotone operators. The algorithms are variants of the forward-backward splitting…
I apply a recently developed algorithm for reweighting simulations of lattice QCD from one quark mass to another to simulations performed with overlap fermions in the epsilon regime. I test it by computing the condensate from distributions…
We collect and summarize results on the unitary equivalence of Gabor systems by pairs of unitary operators and global isometries. The methods are then used to study Gabor systems with Hermite functions. We provide new proofs of some known…
A unified method for three-dimensional reconstruction of objects from transmission images collected at multiple illumination directions is described. The method may be applicable to experimental conditions relevant to absorption-based,…
Fractional programming (FP) arises in various communications and signal processing problems because several key quantities in the field are fractionally structured, e.g., the Cram\'{e}r-Rao bound, the Fisher information, and the…
In this paper, we develop rapidly convergent forward-backward algorithms for computing zeroes of the sum of finitely many maximally monotone operators. A modification of the classical forward-backward method for two general operators is…