Related papers: $N\times N$ Matrix Time-/Band- Limiting examples
We show how the numerical range of a matrix can be used to bound the optimal value of certain optimization problems over real tensor product vectors. Our bound is stronger than the trivial bounds based on eigenvalues, and can be computed…
Singular Spectrum Analysis and many other subspace-based methods of signal processing are implicitly relying on the assumption of close proximity of unperturbed and perturbed signal subspaces extracted by the Singular Value Decomposition of…
By learning the mappings between infinite function spaces using carefully designed neural networks, the operator learning methodology has exhibited significantly more efficiency than traditional methods in solving complex problems such as…
In this article, we study a direct and an inverse problem for the bi-wave operator $(\Box^2)$ along with second and lower order time-dependent perturbations. In the direct problem, we prove that the operator is well-posed, given initial and…
We are concerned with the monic orthogonal polynomials with respect to a singularly perturbed Laguerre-type weight. By using the ladder operator approach, we derive a complicated system of nonlinear second-order difference equations…
We introduce the new concepts of pseu\-do numerical range for operator functions and families of sesquilinear forms as well as the pseu\-do block numerical range for $n \times n$ operator matrix functions. While these notions are new even…
We introduce matrix-valued weight functions of arbitrary size, which are analogues of the weight function for the Gegenbauer or ultraspherical polynomials for the parameter $\nu>0$. The LDU-decomposition of the weight is explicitly given in…
If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting…
Deriving the time evolution of a distribution of probability (or a probability density matrix) is a problem encountered frequently in a variety of situations: for physical time, it could be a kinetic reaction study, while identifying time…
In Part 1 we study the spherical functions on compact symmetric pairs of arbitrary rank under a suitable multiplicity freeness assumption and additional conditions on the branching rules. The spherical functions are taking values in the…
Given a line segment $I=[0,L]$, the so-called barrier, and a set of $n$ sensors with varying ranges positioned on the line containing $I$, the barrier coverage problem is to move the sensors so that they cover $I$, while minimising the…
We give a quantum-inspired $O(n^4)$ algorithm computing the Tutte polynomial of a lattice path matroid, where $n$ is the size of the ground set of the matroid. Furthermore, this can be improved to $O(n^2)$ arithmetic operations if we…
In analogy to a characterisation of operator matrices generating $C_0$-semigroups due to R. Nagel (\cite{[Na89]}), we give conditions on its entries in order that a $2\times 2$ operator matrix generates a cosine operator function. We apply…
We study the phenomenon of composite operator renormalization and mixing in systems where time-translational invariance is broken and the evolution is out-of-equilibrium. We show that composite operators mix also through non-local memory…
We study the monic orthogonal polynomials with respect to a singularly perturbed Airy weight. By using Chen and Ismail's ladder operator approach, we derive a discrete system satisfied by the recurrence coefficients for the orthogonal…
We investigate a large class of linear boundary value problems for the general first-order one-dimensional hyperbolic systems in the strip $[0,1]\times\R$. We state rather broad natural conditions on the data under which the operators of…
This document contains notes based on lectures given by Hendrik Lenstra at the PCMI summer school 2022. There are many problems in algebraic number theory which one would like to solve algorithmically, for example computation of the maximal…
For a fixed $p \in \mathbb{N}$, sequences of polynomials $\{P_n\}$, $n \in \mathbb{N}$, defined by a $(p+2)$-term recurrence relation are related to several topics in Approximation Theory. A $(p+2)$-banded matrix $J$ determines the…
We consider algorithms for the factorization of linear partial differential operators. We introduce several new theoretical notions in order to simplify such considerations. We define an obstacle and a ring of obstacles to factorizations.…
Criterion for a companion matrix to have a certain number of flat portions on the boundary of its numerical range is given. The criterion is specialized to the cases of 3-by-3 and 4-by-4 matrices. In the latter case, it is proved that a…