Results 31 to 40 of about 549,018 (333)
Efficient Evaluation of Matrix Polynomials beyond the Paterson–Stockmeyer Method
Recently, two general methods for evaluating matrix polynomials requiring one matrix product less than the Paterson–Stockmeyer method were proposed, where the cost of evaluating a matrix polynomial is given asymptotically by the total number of matrix ...
Jorge Sastre, Javier Ibáñez
doaj +1 more source
Matrix Valued Laguerre Polynomials [PDF]
20 pages, to appear in Positivity and Noncommutative Analysis Festschrift in Honour of Ben de Pagter (eds. G. Buskes, M. de Jeu, P. Dodds, A. Schep, F. Sukochev, J. van Neerven and A. Wickstead)
Koelink, H.T., Roman, P.M.
openaire +3 more sources
Polynomial detection of matrix subalgebras [PDF]
The double Capelli polynomial of total degree 2 t 2t is ∑ { ( s g σ τ ) x σ ( 1 ) y
openaire +6 more sources
Polynomial sequences generated by infinite Hessenberg matrices
We show that an infinite lower Hessenberg matrix generates polynomial sequences that correspond to the rows of infinite lower triangular invertible matrices. Orthogonal polynomial sequences are obtained when the Hessenberg matrix is tridiagonal. We study
Verde-Star Luis
doaj +1 more source
The Extended Invariant Factor Algorithm with Application to the Forney Analysis of Convolutional Codes [PDF]
In his celebrated paper on the algebraic structure of convolutional codes, Forney showed that by using the invariant-factor theorem, one can transform an arbitrary polynomial generator matrix for an (n, k) convolutional code C into a basic (and ...
McEliece, Robert J., Onyszchuk, Ivan
core +1 more source
Biorthogonal matrix polynomials related to Jacobi matrix polynomials
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Varma, Serhan, Taşdelen, Fatma
openaire +2 more sources
The structure of solutions of the matrix linear unilateral polynomial equation with two variables
We investigate the structure of solutions of the matrix linear polynomial equation $A(\lambda)X(\lambda)+B(\lambda)Y(\lambda)=C(\lambda),$ in particular, possible degrees of the solutions.
N.S. Dzhaliuk, V.M. Petrychkovych
doaj +1 more source
CHARACTERISTIC ANTIADJACENCY MATRIX OF GRAPH JOIN
Let be a simple, connected, and undirected graph. The graph can be represented as a matrix such as antiadjacency matrix. An antiadjacency matrix for an undirected graph with order is a matrix that has an order and symmetric so that the ...
Wahri Irawan, Kiki Ariyanti Sugeng
doaj +1 more source
A Look at Generalized Degenerate Bernoulli and Euler Matrices
In this paper, we consider the generalized degenerate Bernoulli/Euler polynomial matrices and study some algebraic properties for them. In particular, we focus our attention on some matrix-inversion formulae involving these matrices.
Juan Hernández +2 more
doaj +1 more source
Random Perturbations of Matrix Polynomials [PDF]
AbstractA sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of the resolvent of the sum is derived, and the eigenvalues are localised.
Patryk Pagacz, Michał Wojtylak
openaire +3 more sources

