Related papers: On semi-separability and differentiation matrices
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
Pseudospectral analysis serves as a powerful tool in matrix computation and the study of both linear and nonlinear dynamical systems. Among various numerical strategies, random sampling, especially in the form of rank-$1$ perturbations,…
The set of linear, differential operators preserving the vector space of couples of polynomials of degrees n and n-2 in one real variable leads to an abstract associative graded algebra A(2). The irreducible, finite dimensional…
We analyse various structural and order-theoretical aspects of abstract separation systems and partial lattices, as well as the relationship between the different submodularity conditions one can impose on them.
Jacobi matrices probably are the most classical object in spectral theory, while CMV matrices are a comparably fresh one, although they are related to a very classical topic, namely to orhtogonal polynomials on the unit circle (in the same…
The aim of the work is to construct new polynomial systems, which are solutions to certain functional equations which generalize the second-order differential equations satisfied by the so called classical orthogonal polynomial families of…
A theory of higher rank multiresolution analysis is given in the setting of abelian multiscalings. This theory enables the construction, from a higher rank MRA, of finite wavelet sets whose multidilations have translates forming an…
Correlation functions for matrix ensembles with orthogonal and unitarysymplectic rotation symmetry are more complicated to calculate than in the unitary case. The supersymmetry method and the orthogonal polynomials are two techniques to…
This paper is devoted to studying difference indices of quasi-regular difference algebraic systems. We give the definition of difference indices through a family of pseudo-Jacobian matrices. Some properties of difference indices are proved.…
Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in…
Pseudo-differential operator equations with parameter are studied. Uniform separability properties and resolvent estimates are obtained in terms of fractional derivatives. Moreover, maximal regularity properties of the pseudo-differential…
We describe efficient differentiation methods for computing Jacobians and gradients of a large class of matrix functions including the matrix logarithm $\log(A)$ and $p$-th roots $A^{\frac{1}{p}}$. We exploit contour integrals and conformal…
The notion of double depth associated with quasi-Jacobi forms allows distinguishing,within the algebra of quasi-Jacobi singular forms of index zero, certain significant subalgebras (modular-type forms, elliptic-type forms, Jacobi forms). We…
We prove descent theorems for semiorthogonal decompositions using techniques from derived algebraic geometry. Our methods allow us to capture more general filtrations of derived categories and even marked filtrations, where one descends not…
The paper is devoted to developing subdifferential theory for set-valued mappings taking values in ordered infinite-dimensional spaces. This study is motivated by applications to problems of vector and set optimization with various…
In this paper, we give an alternative proof of separation of variables for scalar-valued polynomials $P:(\mathbb R^m)^k\to\mathbb C$ in the semistable range $m\geq 2k-1$ for the symmetry given by the orthogonal group $O(m)$. It turns out…
An efficient procedure for constructing quasi-exactly solvable matrix models is suggested. It is based on the fact that the representation spaces of representations of the algebra sl(2,R) within the class of first-order matrix differential…
Over fields of characteristic unequal to $2$, we can identify symmetric matrices with homogeneous polynomials of degree $2$. This allows us to view symmetric rank-metric codes as living inside the space of such polynomials. In this paper,…
The class of quasiseparable matrices is defined by a pair of bounds, called the quasiseparable orders, on the ranks of the maximal sub-matrices entirely located in their strictly lower and upper triangular parts. These arise naturally in…
In the spectral Petrov-Galerkin methods, the trial and test functions are required to satisfy particular boundary conditions. By a suitable linear combination of orthogonal polynomials, a basis, that is called the modal basis, is obtained.…