Related papers: A framework for structured linearizations of matri…
Our aim in this paper is two-fold: First, for computing zeros of a linear time-invariant (LTI) system $\Sigma$ in {\em state-space form}, we introduce a "trimmed structured linearization", which we refer to as {\em Rosenbrock…
A general theory of matrix-spherical functions for dual Hopf algebras and right coideal subalgebras is developed. We establish their existence and define their orthogonality relations. When specialized to Kolb and Letzter's quantum…
We introduce a general framework for the construction of polynomial frames in $L^2(\mathbb{S}^{d-1})$, $d \geq 3$, where the frame functions are obtained as rotated versions of an initial sequence of polynomials $\Psi^j$, $j\in…
We generalize the solution of linear recurrence relations from fields to central division algebras, adapting the standard tools of companion matrices and characteristic polynomials to the non-commutative setting. We then solve linear…
The aim of this paper is to bring into the picture a new phenomenon in the theory of orthogonal matrix polynomials satisfying second order differential equations. The last few years have witnessed some examples of a (fixed) family of…
It is possible to generalize the fruitful interaction between (real or complex) Jacobi matrices, orthogonal polynomials and Pade approximants at infinity by considering rational interpolants, (bi-)orthogonal rational functions and linear…
In this paper we first construct an analytic realization of the $C_\lambda$-extended oscillator algebra with the help of difference-differential operators. Secondly, we study families of $d$-orthogonal polynomials which are extensions of…
A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
We introduce a new class of structured matrix polynomials, namely, the class of M_A-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the…
Several recently discovered properties of multiple families of special polynomials (some orthogonal and some not) that satisfy certain differential, difference or q-difference equations are reviewed. A general method of construction of…
We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of…
A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.
We introduce and study a mathematical framework for a broad class of regularization functionals for ill-posed inverse problems: Regularization Graphs. Regularization graphs allow to construct functionals using as building blocks linear…
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…
The paper deals with two fundamental types of trigonometric polynomials and splines on uniform grids, which allow us to construct interpolation approximations that depend linearly on the values of the interpolated function. Fundamental on…
In this work we deduce explicit formulae for the elements of the matrices that represent the action of integro-differential operators over the coefficients of generalized Fourier series. Our formulae are obtained by performing operations on…
To study orthogonal arrays and signed orthogonal arrays, Ray-Chaudhuri and Singhi (1988 and 1994) considered some module spaces. Here, using a linear algebraic approach we define an inclusion matrix and find its rank. In the special case of…
Unlike in complex linear operator theory, polynomials or, more generally, Laurent series in antilinear operators cannot be modelled with complex analysis. There exists a corresponding function space, though, surfacing in spectral mapping…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…