๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Factorization of polynomials using nilpotent Jordan blocks

โœ Scribed by Thomas J. Laffey; Eleanor Meehan


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
283 KB
Volume
5
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The polynomial numerical hulls of Jordan
โœ Vance Faber; Anne Greenbaum; Donald E. Marshall ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 211 KB

The polynomial numerical hull of degree k for a square matrix A is a set designed to give useful information about the norms of polynomial functions of the matrix; it is defined as |p(z)| for all p of degree k or less}. While these sets have been computed numerically for a number of matrices, the

Solution of piecewise constant delay sys
โœ H. R. Marzban; M. Shahsiah ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 135 KB

## Abstract An efficient numerical method for finding the solution of piecewise constant delay systems is presented. The method is based upon hybrid of blockโ€pulse functions and Chebyshev polynomials. The operational matrix of delay is constructed. The properties of hybrid functions together with t