Related papers: A mini-max problem for self-adjoint Toeplitz matri…
We study the relations between maximal functions in a Toeplitz kernel and those in a subkernel of the same Toeplitz operator, as well as the question of how multipliers between Toeplitz kernels act on subkernels. We use those relations to…
In this paper we solve the problem of approximating functionals $(\varphi(A)x, f)$ (where $\varphi(A)$ is some function of self-adjoint operator $A$) on the class of elements of a Hilbert space that is defined with the help of another…
We consider symmetry operators a from the group ring C[S_N] which act on the Hilbert space H of the 1D spin-1/2 Heisenberg magnetic ring with N sites. We investigate such symmetry operators a which are self-adjoint (in a sence defined in…
Low-rank tensor approximation techniques attempt to mitigate the overwhelming complexity of linear algebra tasks arising from high-dimensional applications. In this work, we study the low-rank approximability of solutions to linear systems…
This paper is essentially devoted to the study of the minimal eigenvalue $\lambda_{N,\alpha}$ of the Toepllitz matrice $T_N(\varphi_{\alpha})$ where $\varphi_{\alpha}(e^{i \theta})=|1- e^{i \theta} |^{2\alpha} c_{1}(e^{i \theta})$ with…
In this work, firstly in the Hilbert space of vector-functions L^2 (H,(-\infty,a)\bup(b,+\infty)),a<b all selfadjoint extensions of the minimal operator generated by linear singular symmetric differential expression l(\cdot)=i d/dt+A with a…
The classical theory of Toeplitz operators in spaces of analytic functions deals usually with symbols that are bounded measurable functions on the domain in question. A further extension of the theory was made for symbols being unbounded…
We improve known perturbation results for self-adjoint operators in Hilbert spaces and prove spectral enclosures for diagonally dominant $J$-self-adjoint operator matrices. These are used in the proof of the central result, a perturbation…
We propose NEP_MiniMax, a novel computational method for solving nonlinear eigenvalue problems (NEPs) $T(\lambda)\mathbf{u}= 0$ on compact continua $\Omega \subset \mathbb{C}$. The method combines two key components: (1) a rational minimax…
Given two linear operators $S$ and $T$ acting between Hilbert spaces $\mathscr{H}$ and $\mathscr{K}$, respectively $\mathscr{K}$ and $\mathscr{H}$ which satisfy the relation \begin{equation*} \langle Sh, k\rangle=\langle h, Tk\rangle, \quad…
A two-point algebra is a set of bounded analytic functions on the unit disk that agree at two distinct points $a,b \in \mathbb{D}$. This algebra serves as a multiplier algebra for the family of Hardy Hilbert spaces $H^2_t := \{ f\in H^2 :…
In this paper, we re-investigate the resolution of Toeplitz systems $T u =g$, from a new point of view, by correlating the solution of such problems with syzygies of polynomials or moving lines. We show an explicit connection between the…
We investigate the continuity of boundary operators, such as the Neumann-to-Dirichlet map, with respect to the coefficient matrices of the underlying elliptic equations. We show that for nonsmooth coefficients the correct notion of…
We explore the optimality of the constants making valid the recently established Little Grothendieck inequality for JB$^*$-triples and JB$^*$-algebras. In our main result we prove that for each bounded linear operator $T$ from a…
The computation of the matrix exponential is a ubiquitous operation in numerical mathematics, and for a general, unstructured $n\times n$ matrix it can be computed in $\mathcal{O}(n^3)$ operations. An interesting problem arises if the input…
In this paper, we introduce the Maximum Matrix Contraction problem, where we aim to contract as much as possible a binary matrix in order to maximize its density. We study the complexity and the polynomial approximability of the problem.…
In this article, by considering $T=(T_1,\dots, T_d)$, an $d$-tuple of commuting contractions on a Hilbert space $\mathcal{H}$, we study $T$-Toeplitz operators which consists of bounded operators $X$ on $\mathcal{H}$ such that \[ T_i^*XT_i=X…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
We show that any $n\times m$ matrix $A$ can be approximated in operator norm by a submatrix with a number of columns of order the stable rank of $A$. This improves on existing results by removing an extra logarithmic factor in the size of…
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…