Related papers: Reorthogonalized Block Classical Gram--Schmidt
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
In this paper, a class of optimization problems with nonlinear inequality constraints is discussed. Based on the ideas of sequential quadratic programming algorithm and the method of strongly sub-feasible directions, a new superlinearly…
In this paper we present a novel quantum algorithm, namely the quantum grid search algorithm, to solve a special search problem. Suppose $ k $ non-empty buckets are given, such that each bucket contains some marked and some unmarked items.…
The general rational solution of the Yang-Baxter equation with the symmetry algebra sl(2) can be represented as the product of the simpler building blocks denoted as R-operators. The R-operators are constructed explicitly and have simple…
This paper considers the triangle finding problem in the CONGEST model of distributed computing. Recent works by Izumi and Le Gall (PODC'17), Chang, Pettie and Zhang (SODA'19) and Chang and Saranurak (PODC'19) have successively reduced the…
The definition for the Slater-type orbitals is generalized. Transformation between an orthonormal basis function and the Slater-type orbital with non-integer principal quantum numbers is investigated. Analytical expressions for the linear…
Almost block diagonal linear systems of equations can be exemplified by two modules. This makes it possible to construct all sequential forms of band and/or block elimination methods, six old and fourteen new. It allows easy assessment of…
We consider fast algorithms for monotone submodular maximization with a general matroid constraint. We present a randomized $(1 - 1/e - \epsilon)$-approximation algorithm that requires $\tilde{O}_{\epsilon}(\sqrt{r} n)$ independence oracle…
Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to…
Structure learning methods for covariance and concentration graphs are often validated on synthetic models, usually obtained by randomly generating: (i) an undirected graph, and (ii) a compatible symmetric positive definite (SPD) matrix. In…
Algebraic Multigrid (AMG) methods are often robust and effective solvers for solving the large and sparse linear systems that arise from discretized PDEs and other problems, relying on heuristic graph algorithms to achieve their…
A many-body Hamiltonian can be block-diagonalized by expressing it in terms of symmetry-adapted basis states. Finding the group orbit representatives of these basis states and their corresponding symmetries is currently a…
We propose commuting sets of matrix-valued difference operators in terms of trigonometric ${\rm GL}(N|M)$-valued $R$-matrices thus providing quantum supersymmetric (and possibly anisotropic) spin Ruijsenaars-Macdonald operators. Two types…
In [Steinerberger, Q. Appl. Math., 79:3, 419-429, 2021] and [Shao, SIAM J. Matrix Anal. Appl. 44(1), 212-239, 2023], two new types of Kaczmarz algorithms, which share some similarities, for consistent linear systems were proposed. These two…
We use the mathematical structure of group algebras and $H^{+}$-algebras for describing certain problems concerning the quantum dynamics of systems of angular momenta, including also the spin systems. The underlying groups are ${\rm SU}(2)$…
This work revisits existing algorithms for the QR factorization of rectangular matrices composed of p-by-q tiles, where p >= q. Within this framework, we study the critical paths and performance of algorithms such as Sameh and Kuck, Modi…
We introduce the Stochastic Monotone Aggregated Root-Finding (SMART) algorithm, a new randomized operator-splitting scheme for finding roots of finite sums of operators. These algorithms are similar to the growing class of incremental…
It is known that the restarted full orthogonalization method (FOM) outperforms the restarted generalized minimum residual (GMRES) method in several circumstances for solving shifted linear systems when the shifts are handled simultaneously.…
In this note we define geometric classical r-matrices and quantum R-matrices, and show how any geometric classical r-matrix can be quantized to a geometric quantum R-matrix. This is one of the simplest nontrivial examples of quantization of…
We introduce a generalization of the conventional renormalization schemes used in dimensional regularization, which illuminates the renormalization scheme and scale ambiguities of pQCD predictions, exposes the general pattern of…