Related papers: Matrix approach to hypercomplex Appell polynomials
The Jacobian Conjecture would follow if it were known that real polynomial maps with a unipotent Jacobian matrix are injective. The conjecture that this is true even for $C^1$ maps is explored here. Some results known in the polynomial case…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
This is a review of the Riemann-Hilbert approach to the large $N$ asymptotics in random matrix models and its applications. We discuss the following topics: random matrix models and orthogonal polynomials, the Riemann-Hilbert approach to…
We introduce the concept of Almost-Companion Matrix (ACM) by relaxing the non-derogatory property of the standard Companion Matrix (CM). That is, we define an ACM as a matrix whose characteristic polynomial coincides with a given monic and…
Using a binary representation for basis elements of an algebra combined with a framework of multiplier and index functions, a connection has been established between the structure of a large class of algebras and the XOR componentwise…
We introduce the method of path-sums which is a tool for exactly evaluating a function of a discrete matrix with possibly non-commuting entries, based on the closed-form resummation of infinite families of terms in the corresponding Taylor…
We first show the existence of an effective determinantal representation for any univariate polynomial with real coefficients. Then, we more precisely establish that any univariate polynomial with real coefficients has an effective…
We present new algorithms that efficiently approximate the hypergeometric function of a matrix argument through its expansion as a series of Jack functions. Our algorithms exploit the combinatorial properties of the Jack function, and have…
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…
Following the celebrated quantum algorithm for solving linear equations (so-called HHL algorithm), Childs, Kothari and Somma [SIAM Journal on Computing, {\bf 46}: 1920, (2017)] provided an approach to solve a linear system of equations with…
The aim of this article is to give a generalization of the Cauchy-Pompeiu integral formula for functions valued in parameter-depending elliptic algebras with structure polynomial $X^2 + \beta X + \alpha$ where $\alpha$ and $\beta$ are real…
Archetypal analysis is an unsupervised learning method for exploratory data analysis. One major challenge that limits the applicability of archetypal analysis in practice is the inherent computational complexity of the existing algorithms.…
A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…
We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel,…
In this study, a collocation method based on the Fibonacci operational matrix is proposed to solve generalized pantograph equations with linear functional arguments. Some illustrative examples are given to verify the efficiency and…
We solve the infinite potential well problem using the methods of Heisenberg's matrix mechanics. In addition to being of educational value, the matrix mechanics allows us to deal with various unphysical issues caused by this potential in a…
Explicit time advancement for continuous finite elements requires the inversion of a global mass matrix. For spectral element simulations on quadrilaterals and hexahedra, there is an accurate approximate mass matrix which is diagonal,…
In this paper we introduce a family of rational approximations of the reciprocal of a $\phi$-function involved in the explicit solutions of certain linear differential equations, as well as in integration schemes evolving on manifolds. The…
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 define a special matrix multiplication among a special subset of $2N\x 2N$ matrices, and study the resulting (non-associative) algebras and their subalgebras. We derive the conditions under which these algebras become alternative…