Related papers: Transformations of Matrix Structures Work Again II
We explore new approaches for finding matrix multiplication algorithms in the commutative setting by adapting the flip graph technique: a method previously shown to be effective for discovering fast algorithms in the non-commutative case.…
Analytical tools to $K$-theory; namely, self-stabilization of rapidly decreasing matrices, linearization of cyclic loops, and the contractibility of the pointed stable Toeplitz algebra are discussed in terms of concrete formulas. Adaptation…
The objective of this study is to present a novel, efficient, and fast direct method for solving linear systems of equations whose coefficient matrix is a tridiagonal Quasi-Toeplitz matrix. Such matrices are frequently encountered in the…
An important representation of the general-type fundamental solutions of the canonical systems corresponding to matrix string equations is established using linear similarity of a certain class of Volterra operators to the squared…
We study the structure of isometries defined on the algebra $\mathcal{A}$ of upper-triangular Toeplitz matrices. Our first result is that a continuous multiplicative isometry $\mathcal{A}\to M_n$ must be of the form either $A\mapsto UAU^*$…
The randomized Kaczmarz method is an iterative algorithm that solves overdetermined systems of linear equations. Recently, the method was extended to systems of equalities and inequalities by Leventhal and Lewis. Even more recently, Needell…
Circulant matrices are an important family of operators, which have a wide range of applications in science and engineering related fields. They are in general non-sparse and non-unitary. In this paper, we present efficient quantum circuits…
Focusing inversion of potential field data for the recovery of sparse subsurface structures from surface measurement data on a uniform grid is discussed. For the uniform grid the model sensitivity matrices exhibit block Toeplitz Toeplitz…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
Inverse iteration is known to be an effective method for computing eigenvectors corresponding to simple and well-separated eigenvalues. In the non-symmetric case, the solution of shifted Hessenberg systems is a central step. Existing…
A generalized version of the Kato-Bloch perturbation expansion is presented. It consists of replacing simple numbers appearing in the perturbative series by matrices. This leads to the fact that the dependence of the eigenvalues of the…
We introduce the smt toolbox for Matlab. It implements optimized storage and fast arithmetics for circulant and Toeplitz matrices, and is intended to be transparent to the user and easily extensible. It also provides a set of test matrices,…
In this paper, we present and analyze a new set of low-rank recovery algorithms for linear inverse problems within the class of hard thresholding methods. We provide strategies on how to set up these algorithms via basic ingredients for…
When solving systems of banded Toeplitz equations or calculating their inverses, it is necessary to determine the invertibility of the matrices beforehand. In this paper, we equate the invertibility of an $n$-order banded Toeplitz matrix…
Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value…
The complexity of matrix multiplication (hereafter MM) has been intensively studied since 1969, when Strassen surprisingly decreased the exponent 3 in the cubic cost of the straightforward classical MM to log 2 (7) $\approx$ 2.8074.…
Prony's problem in several variables has attracted some attention recently and provides an interesting combination of polynomial ideal theory with analytic and numeric computations. This note points out further connections to Hankel…
The structured $\varepsilon$-stability radius is introduced as a quantity to assess the robustness of transient bounds of solutions to linear differential equations under structured perturbations of the matrix. This applies to general…
Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…
The computation of the structured pseudospectral abscissa and radius (with respect to the Frobenius norm) of a Toeplitz matrix is discussed and two algorithms based on a low rank property to construct extremal perturbations are presented.…