Related papers: Schur analysis of matricial Hausdorff moment seque…
We consider the problem of approximating numerically the moments and the supports of measures which are invariant with respect to the dynamics of continuous- and discrete-time polynomial systems, under semialgebraic set constraints. First,…
This paper introduces the application of the asynchronous iterations theory within the framework of the primal Schur domain decomposition method. A suitable relaxation scheme is designed, which asynchronous convergence is established under…
We reconsider the two related problems: distribution of the diagonal elements of a Hermitian n x n matrix of known eigenvalues (Schur) and determination of multiplicities of weights in a given irreducible representation of SU(n) (Kostka).…
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…
The Schur transform is a unitary operator that block diagonalizes the action of the symmetric and unitary groups on an $n$ fold tensor product $V^{\otimes n}$ of a vector space $V$ of dimension $d$. Bacon, Chuang and Harrow \cite{BCH07}…
This paper deals with (1) the truncated matrix Hamburger moment problem from the point of view of reproducing kernel Hilbert spaces of vector valued entire functions of the kind introduced and extensively studied by Louis de Branges and (2)…
We consider a random process with discrete time formed by singular values of products of truncations of Haar distributed unitary matrices. We show that this process can be understood as a scaling limit of the Schur process, which gives…
A conversion matrix approach to solving network problems involving time-varying circuit components is applied to the method of moments for electromagnetic scattering analysis. Detailed formulations of this technique's application to the…
We study the fixed point for a non-linear transformation in the set of Hausdorff moment sequences, defined by the formula: $T((a_n))_n=1/(a_0+... +a_n)$. We determine the corresponding measure $\mu$, which has an increasing and convex…
It is shown how Darboux coordinates on a reduced symplectic vector space may be used to parametrize the phase space on which the finite gap solutions of matrix nonlinear Schr\"odinger equations are realized as isospectral Hamiltonian flows.…
Quantum computers are believed to have the ability to process huge data sizes which can be seen in machine learning applications. In these applications, the data in general is classical. Therefore, to process them on a quantum computer,…
We introduce a class of permutation centralizer algebras which underly the combinatorics of multi-matrix gauge invariant observables. One family of such non-commutative algebras is parametrised by two integers. Its Wedderburn-Artin…
In this article we solve four special cases of the truncated Hamburger moment problem (THMP) of degree $2k$ with one or two missing moments in the sequence. As corollaries we obtain, by using appropriate substitutions, the solutions to…
In this paper, we develop a numerical resolution of the space-time fractional advection-dispersion equation. After time discretization, we utilize collocation technique and implement a product integration method in order to simplify the…
The partial Schur factorization can be used to represent several eigenpairs of a matrix in a numerically robust way. Different adaptions of the Arnoldi method are often used to compute partial Schur factorizations. We propose here a…
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…
We present a general framework for the rigorous numerical analysis of time-fractional nonlinear parabolic partial differential equations, with a fractional derivative of order $\alpha\in(0,1)$ in time. The framework relies on three…
We discuss a modification to Random Matrix Theory eigenstate statistics, that systematically takes into account the non-universal short-time behavior of chaotic systems. The method avoids diagonalization of the Hamiltonian, instead…
We propose a simple technique that, if combined with algorithms for computing functions of triangular matrices, can make them more efficient. Basically, such a technique consists in a specific scaling similarity transformation that reduces…
Hagedorn functions are carefully constructed generalizations of Hermite functions to the setting of many-dimensional squeezed and coupled harmonic systems. Wavepackets formed by superpositions of Hagedorn functions have been successfully…