Related papers: When Lanczos Iterations Generate Symmetric Quadrat…
The matroid parity (or matroid matching) problem, introduced as a common generalization of matching and matroid intersection problems, is so general that it requires an exponential number of oracle calls. Nevertheless, Lov\'asz (1980)…
A manifestly Lorentz-covariant calculus based on two matrix-coordinates and their associated derivatives is introduced. It allows formulating relativistic field theories in any even-dimensional spacetime. The construction extends a…
Ratios of quadratic forms in correlated normal variables which introduce noncentrality into the quadratic forms are considered. The denominator is assumed to be positive (with probability 1). Various serial correlation estimates such as…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
Schauder Orlicz-type estimates are derived for weak solutions to second-order linear elliptic equations in divergence form with lower-order terms. The Orlicz setting $X=L^\psi$ is treated first. Under suitable assumptions on the Young…
Decomposition of (finite-dimensional) operators in terms of orthogonal bases of matrices has been a standard method in quantum physics for decades. In recent years, it has become increasingly popular because of various methodologies applied…
The coupled nonlinear space fractional Ginzburg-Landau (CNLSFGL) equations with the fractional Laplacian have been widely used to model the dynamical processes in a fractal media with fractional dispersion. Due to the existence of…
This paper presents new quadrature rules for functions in a reproducing kernel Hilbert space using nodes drawn by a sampling algorithm known as randomly pivoted Cholesky. The resulting computational procedure compares favorably to previous…
In this paper we present a new algorithm based on a Cartesian mesh for the numerical approximation of kinetic models on complex geometry boundary. Due to the high dimensional property, numerical algorithms based on unstructured meshes for a…
In several applications, one must estimate a real-valued (symmetric) Toeplitz covariance matrix, typically shifted by the conjugated diagonal matrices of phase progression and phase "calibration" errors. Unlike the Hermitian Toeplitz…
We propose a new concept of a relatively inexact stochastic subgradient and present novel first-order methods that can use such objects to approximately solve convex optimization problems in relative scale. An important example where…
Canonical parametrisations of classical confocal coordinate systems are introduced and exploited to construct non-planar analogues of incircular (IC) nets on individual quadrics and systems of confocal quadrics. Intimate connections with…
Spectral clustering is a well-known technique which identifies $k$ clusters in an undirected graph with weight matrix $W\in\mathbb{R}^{n\times n}$ by exploiting its graph Laplacian $L(W)$, whose eigenvalues $0=\lambda_1\leq \lambda_2 \leq…
The continue fractions of quadratic surds are periodic, according to a theorem by Lagrange. Their periods may have differing types of symmetries. This work relates these types of symmetries to the symmetries of the classes of the…
An efficient scheme to compute the geometric entanglement per lattice site for quantum many-body systems on a periodic finite-size chain is proposed in the context of a tensor network algorithm based on the matrix product state…
Our goal in this paper is to clarify the relationship between the block Lanczos and the block conjugate gradient (BCG) algorithms. Under the full rank assumption for the block vectors, we show the one-to-one correspondence between the…
We consider the Lorenz equations, a system of three dimensional ordinary differential equations modeling atmospheric convection. These equations are chaotic and hard to study even numerically, and so a simpler "geometric model" has been…
In this paper we propose and analyze an algorithm for identifying spectral gaps of a real symmetric matrix $A$ by simultaneously approximating the traces of spectral projectors associated with multiple different spectral slices. Our method…
The implicitly shifted QR iteration is used as a restart procedure for the Arnoldi method for the calculation of a few dominant eigenvalues of a large matrix. We show that the underlying idea of implicit polynomial filtering can be utilized…
Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…