Related papers: A Kaczmarz-Inspired Method for Orthogonalization
In the Orthogonal Vectors problem (OV), we are given two families $A, B$ of subsets of $\{1,\ldots,d\}$, each of size $n$, and the task is to decide whether there exists a pair $a \in A$ and $b \in B$ such that $a \cap b = \emptyset$.…
The method of alternation projections (MAP) is an iterative procedure for finding the projection of a point on the intersection of closed subspaces of an Hilbert space. The convergence of this method is usually slow, and several methods for…
The classical Dvoretzky--Rogers lemma provides a deterministic algorithm by which, from any set of isotropic vectors in Euclidean $d$-space, one can select a subset of $d$ vectors whose determinant is not too small. Subsequently,…
In this paper we present a continuation method which transforms spatially distributed ODE systems into continuous PDE. We show that this continuation can be performed both for linear and nonlinear systems, including multidimensional, space-…
For an arbitrary field $\mathbb{K}$ and a family of inner products in a $\mathbb{K}$-vector space $V$ of arbitrary dimension, we study necessary and sufficient conditions in order to have an orthogonal basis relative to all the inner…
The Kaczmarz algorithm is an iterative method for solving a system of linear equations. It can be extended so as to reconstruct a vector $x$ in a (separable) Hilbert space from the inner-products $\{\langle x, \phi_{n} \rangle\}$. The…
It is well known that, in any inner product space, a set of linearly independent (LI) vectors can be transformed to a set of orthogonal vectors, spanning the same space, by the Gram-Schmidt Orthogonalization Method (GSOM). In this paper, we…
Motivated by a model in quantum computation we study orthogonal sets of integral vectors of the same norm that can be extended with new vectors keeping the norm and the orthogonality. Our approach involves some arithmetic properties of the…
We propose a new deterministic Kaczmarz algorithm for solving consistent linear systems $A\mathbf{x}=\mathbf{b}$. Basically, the algorithm replaces orthogonal projections with reflections in the original scheme of Stefan Kaczmarz. Building…
An $n \times n$ matrix with $\pm 1$ entries which acts on $\mathbb{R}^n$ as a scaled isometry is called Hadamard. Such matrices exist in some, but not all dimensions. Combining number-theoretic and probabilistic tools we construct matrices…
In this study, the orthogonalization process for different inner products is applied to pairwise comparisons. Properties of consistent approximations of a given inconsistent pairwise comparisons matrix are examined. A method of a derivation…
We study the problem of testing whether two tensors in $\mathbb{R}^\ell\otimes \mathbb{R}^m\otimes \mathbb{R}^n$ are isomorphic under the natural action of orthogonal groups $\textbf{O}(\ell, \mathbb{R})\times\textbf{O}(m,…
In this paper we investigate homogenization results for the principal eigenvalue problem associated to $1$-homogeneous, uniformly elliptic, second-order operators. Under rather general assumptions, we prove that the principal eigenpair…
Randomized linear system solvers have become popular as they have the potential to reduce floating point complexity while still achieving desirable convergence rates. One particularly promising class of methods, random sketching solvers,…
A similarity transformation is constructed through which a system of particles interacting with inverse-square two-body and harmonic potentials in one dimension, can be mapped identically, to a set of free harmonic oscillators. This…
Sequences of unit vectors for which the Kaczmarz algorithm always converges in Hilbert space can be characterized in frame theory by tight frames with constant 1. We generalize this result to the context of frames and bases. In particular,…
An approach is proposed which, given a family of linearly independent functions, constructs the appropriate biorthogonal set so as to represent the orthogonal projector operator onto the corresponding subspace. The procedure evolves…
In this paper we study sequences of vector orthogonal polynomials. The vector orthogonality presented here provides a reinterpretation of what is known in the literature as matrix orthogonality. These systems of orthogonal polynomials…
The Kaczmarz method is a way to iteratively solve a linear system of equations $Ax = b$. One interprets the solution $x$ as the point where hyperplanes intersect and then iteratively projects an approximate solution onto these hyperplanes…
This work aims to numerically construct exactly commuting matrices close to given almost commuting ones, which is equivalent to the joint approximate diagonalization problem. We first prove that almost commuting matrices generically have…