Related papers: Complexity of Linear Operators

The article presents a matrix differential operator and a pseudoinverse matrix differential operator for finding a particular solution to nonhomogeneous linear ordinary differential equations (ODE) with constant coefficients with special…

Let (H_t) be the Ornstein-Uhlenbeck semigroup on R^d with covariance matrix I and drift matrix \lambda(R-I), where \lambda>0 and R is a skew-adjoint matrix and denote by \gamma_\infty the invariant measure for (H_t). Semigroups of this form…

We consider solving a probably ill-conditioned linear operator equation, where the operator is not modeled by physical laws but is specified via training pairs (consisting of images and data) of the input-output relation of the operator. We…

We propose a general algorithm to compute all the symmetry classes of any $\mathrm{SO}(3)$ or $\mathrm{O}(3)$ linear representation. This method relies on the introduction of a binary operator between sets of conjugacy classes of closed…

We propose and investigate a strategy toward a proof of the Riemann Hypothesis based on a spectral realization of its non-trivial zeros. Our approach constructs self-adjoint operators obtained as rank-one perturbations of the spectral…

This is a summation of research done in the author's second and third year of undergraduate mathematics at The University of Toronto. As the previous details were largely scattered and disorganized; the author decided to rewrite the…

Let $T$ be a bounded linear operator on a (real or complex) Banach space $X$. If $(a_n)$ is a sequence of non-negative numbers tending to 0. Then, the set of $x \in X$ such that $\|T^nx\| \geqslant a_n \|T^n\|$ for infinitely many $n$'s has…

We present an algorithm computing the determinant of an integer matrix A. The algorithm is introspective in the sense that it uses several distinct algorithms that run in a concurrent manner. During the course of the algorithm partial…

We propose a more accurate variant of an algorithm for multiplying 4x4 matrices using 48 multiplications over any ring containing an inverse of 2. This algorithm has an error bound exponent of only log 4 $\gamma$$\infty$,2 $\approx$ 2.386.…

We investigate second order elliptic equations \[F(\mathcal{H}u) = 0\] where the function $F\colon S(n)\to\mathbb{R}$ on the space of symmetric $n\times n$ matrices is assumed to be sublinear. There is very little to be found in the…

We give an explicit algorithm and source code for computing optimal weights for combining a large number N of alphas. This algorithm does not cost O(N^3) or even O(N^2) operations but is much cheaper, in fact, the number of required…

Relativistic quantum systems that admit scattering experiments are quantitatively described by effective field theories, where $S$-matrix kinematics and symmetry considerations are encoded in the operator spectrum of the EFT. In this paper…

The learnable, linear neural network layers between tensor power spaces of $\mathbb{R}^{n}$ that are equivariant to the orthogonal group, $O(n)$, the special orthogonal group, $SO(n)$, and the symplectic group, $Sp(n)$, were characterised…

We consider accelerated versions of the operator Sinkhorn iteration (OSI) for solving scaling problems for completely positive maps. Based on the interpretation of OSI as alternating fixed point iteration, it has been recently proposed to…

We show that the product of an nx3 matrix and a 3x3 matrix over a commutative ring can be computed using 6n+3 multiplications. For two 3x3 matrices this gives us an algorithm using 21 multiplications. This is an improvement with respect to…

Matrix multiplication is a fundamental task in almost all computational fields, including machine learning and optimization, computer graphics, signal processing, and graph algorithms (static and dynamic). Twin-width is a natural complexity…

An Ornstein-Uhlenbeck (OU) process can be considered as a continuous time interpolation of the discrete time AR$(1)$ process. Departing from this fact, we analyse in this work the effect of iterating OU treated as a linear operator that…

We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…

Multiplication of n-digit integers by long multiplication requires O(n^2) operations and can be time-consuming. In 1970 A. Schoenhage and V. Strassen published an algorithm capable of performing the task with only O(n log(n)) arithmetic…

In this paper, we present a generalized version of the matrix chain algorithm to generate efficient code for linear algebra problems, a task for which human experts often invest days or even weeks of works. The standard matrix chain problem…