Related papers: Matrix approach to hypercomplex Appell polynomials
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
We introduce a discrete delayed exponential depending on sequence of matrices. This discrete matrix gives a representation of a solution to the Cauchy problem for a discrete linear system with pure delay with sequence of matrices. We…
The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…
We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.
The set of matrix tuples with invariant subspaces whose dimensions sum up to the dimension of the space, but which do not span the whole space form an algebraic hypersurface. We found the equation of this hypersurface. This generalizes…
In this paper, by the umbral calculus method, we give a remarkable congruence involving Appell polynomials. Some applications on derangement polynomials are also presented.
The aim of the present work is to introduce a method based on Chebyshev polynomials for the numerical solution of a system of Cauchy type singular integral equations of the first kind on a finite segment. Moreover, an estimation error is…
We obtain several Cauchy-like and Pellet-like results for the zeros of a general complex polynomial by considering similarity transformations of the squared companion matrix and the reformulation of the zeros of a scalar polynomial as the…
We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…
Explicit expressions are given for the actions and radial matrix elements of basic radial observables on multi-dimensional spaces in a continuous sequence of orthonormal bases for unitary SU(1,1) irreps. Explicit expressions are also given…
We propose an extremely versatile approach to address a large family of matrix nearness problems, possibly with additional linear constraints. Our method is based on splitting a matrix nearness problem into two nested optimization problems,…
The paper presents the classification of matrix valued superpotentials corresponding to shape invariant systems of Schr\"odinger equations. All inequivalent irreducible matrix superpotentials realized by matrices of arbitrary dimension with…
Given any elliptic system with $t$-independent coefficients in the upper-half space, we obtain representation and trace for the conormal gradient of solutions in the natural classes for the boundary value problems of Dirichlet and Neumann…
Linear first order systems of partial differential equations of the form $\nabla f = M\nabla g,$ where $M$ is a constant matrix, are studied on vector spaces over the fields of real and complex numbers, respectively. The Cauchy--Riemann…
Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.
Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. Complex systems with…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
In this paper we introduce a new concept of atoms on discrete sets to develop an advanced method to find a particular solution for higher-order non-homogeneous Cauchy-Euler equations. The proposed method provides also an approximate…