Related papers: Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox
In recent years, various subspace algorithms have been developed to handle large-scale optimization problems. Although existing subspace Newton methods require fewer iterations to converge in practice, the matrix operations and full…
In this paper, we study the matrix period and the competition period of Toeplitz matrices over a binary Boolean ring $\mathbb{B} = \{0,1\}$. Given subsets $S$ and $T$ of $\{1,\ldots,n-1\}$, an $n\times n$ Toeplitz matrix $A=T_n\langle S ; T…
We study the spectrum of the product of two Toeplitz operators. Assume that the symbols of these operators are continuous and real-valued and that one of them is non-negative. We prove that the spectrum of the product of finite section…
We solve the following problems associated with Toeplitz operators $T_{\Phi}$ on Hilbert space-valued Hardy spaces $H_{\mathcal{E}}^2(\mathbb{D}^n)$ over the unit polydisc $\mathbb{D}^n$. $(I)$ Given operator-valued bounded analytic…
We consider partial symmetric Toeplitz matrices where a positive definite completion exists. We characterize those patterns where the maximum determinant completion is itself Toeplitz. We then extend these results with positive definite…
The $T$-matrix formally describes the solution of any electromagnetic scattering problem by a given particle in a given medium at a given wavelength. As such it is commonly used in a number of contexts, for example to predict the…
Quasi-elliptic cohomology is a variant of Tate K-theory. It is the orbifold K-theory of a space of constant loops. For global quotient orbifolds, it can be expressed in terms of equivariant K-theories. In this paper we show how this theory…
We present a deterministic algorithm that computes the zeta function of a nonsupersingular elliptic curve E over a finite field with p^n elements in time quasi-quadratic in n. An older algorithm having the same time complexity uses the…
The theory of quantum symmetric pairs provides a universal K-matrix which is an analogue of the universal R-matrix for quantum groups. The main ingredient in the construction of the universal K-matrix is a quasi K-matrix which has so far…
For some kernel matrices, low-rank approximations can be quickly obtained via analytic techniques. One important class of analytic methods that has received attention in recent years is based on the use of proxy points. Accuracy analysis…
This paper is devoted to the asymptotic behavior of all eigenvalues of Symmetric (in general non Hermitian) Toeplitz matrices with moderately smooth symbols which trace out a simple loop on the complex plane line as the dimension of the…
We review the quiver matrix model (the ITEP model) in the light of the recent progress on 2d-4d connection of conformal field theories, in particular, on the relation between Toda field theories and a class of quiver superconformal gauge…
This paper is concerned with the determination of a close real banded positive definite Toeplitz matrix in the Frobenius norm to a given square real banded matrix. While it is straightforward to determine the closest banded Toeplitz matrix…
In this paper, we study products of asymmetric Toeplitz matrices, we give necessary and sufficient conditions for the product of two asymmetric Toeplitz matrices compatible sizes is asymmetric Toeplitz matrix. We also give some results…
Non-commutative polynomial optimization is a powerful technique with numerous applications in quantum nonlocality, quantum key distribution, causal inference, many-body physics, amongst others. The standard approach is to reduce such…
We review existing methods for implementing smooth functions f(A) of a sparse Hermitian matrix A on a quantum computer, and analyse a further combination of these techniques which has some advantages of simplicity and resource consumption…
T-IFISS is a finite element software package for studying finite element solution algorithms for deterministic and parametric elliptic partial differential equations. The emphasis is on self-adaptive algorithms with rigorous error control…
We consider the problem of computing the q->p norm of a matrix A, which is defined for p,q \ge 1, as |A|_{q->p} = max_{x !=0 } |Ax|_p / |x|_q. This is in general a non-convex optimization problem, and is a natural generalization of the…
Following previous works for the unit ball, we define quasi-radial pseudo-homogeneous symbols on the projective space and obtain the corresponding commutativity results for Toeplitz operators. A geometric interpretation of these symbols in…
We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra…