Related papers: Fast computation of the matrix exponential for a T…
Volker Strassen first suggested an algorithm to multiply matrices with worst case running time less than the conventional $\mathcal{O}(n^3)$ operations in 1969. He also presented a recursive algorithm with which to invert matrices, and…
The large-scale three-dimensional inversion of surface gravity / tensor gravity data is a very challenging numerical and practical problem, which is a highly physical memory usage, time-consuming computation and high precision for…
We present a sublinear query algorithm for outputting a near-optimal low-rank approximation to any positive semidefinite Toeplitz matrix $T \in \mathbb{R}^{d \times d}$. In particular, for any integer rank $k \leq d$ and $\epsilon,\delta >…
Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…
We study the spectral norm of large rectangular random Toeplitz and circulant matrices with independent entries. For Toeplitz matrices, we show that the scaled norm converges to the norm of a bilinear operator defined via the pointwise…
We address the problems of computing operator norms of matrices induced by given norms on the argument and the image space. It is known that aside of a fistful of "solvable cases," most notably, the case when both given norms are Euclidean,…
Unlike Toeplitz operators on $H^2$, truncated Toeplitz operators do not have a natural matricial characterization. Consequently, these operators are difficult to study numerically. In this note we provide criteria for a matrix with distinct…
Rational approximations of functions with singularities can converge at a root-exponential rate if the poles are exponentially clustered. We begin by reviewing this effect in minimax, least-squares, and AAA approximations on intervals and…
The computation of approximating e^tA B, where A is a large sparse matrix and B is a rectangular matrix, serves as a crucial element in numerous scientific and engineering calculations. A powerful way to consider this problem is to use…
In this paper we derive a Toeplitz-structured closed form of the unique positive semi-definite stabilizing solution for the discrete-time algebraic Riccati equations, especially for the case that the state matrix is not stable. Based on the…
A matrix approach to continuous iteration is proposed for general formal series. It leads, in particular, to an order{to{order iteration of the exponential function, and consequently to an algorithmic approach to tetration. Lower{order…
We review some history and some recent results concerning Toeplitz determinants and their applications. We discuss, in particular, the crucial role of the two-dimensional Ising model in stimulating the development of the theory of Toeplitz…
In this article, we introduce a notion of an exponential matrix, which is a polynomial matrix with exponential properties, and a notion of an equivalence relation of two exponential matrices, and then we initiate to study classifying…
We design an algorithm for computing the $p$-curvature of a differential system in positive characteristic $p$. For a system of dimension $r$ with coefficients of degree at most $d$, its complexity is $\softO (p d r^\omega)$ operations in…
The inverse problem of fractional Brownian motion and other Gaussian processes with stationary increments involves inverting an infinite hermitian positively definite Toeplitz matrix (a matrix that has equal elements along its diagonals).…
Multiplying matrices is among the most fundamental and compute-intensive operations in machine learning. Consequently, there has been significant work on efficiently approximating matrix multiplies. We introduce a learning-based algorithm…
We present a new superfast algorithm for solving Toeplitz systems. This algorithm is based on a relation between the solution of such problems and syzygies of polynomials or moving lines. We show an explicit connection between the…
multiplication operator on a Hilbert space may be approximated with finite sections by choosing an orthonormal basis of the Hilbert space. Nonzero multiplication operators on $L^2$ spaces of functions are never compact and then such…
The purpose of this paper is to compute the asymptotics of determinants of finite sections of operators that are trace class perturbations of Toeplitz operators. For example, we consider the asymptotics in the case where the matrices are of…
On distributed memory electronic computers, the implementation and association of fast parallel matrix multiplication algorithms has yielded astounding results and insights. In this discourse, we use the tools of molecular biology to…