Add to ORKGIn this contribution we present an extension of the Leverrier-Faddeev algorithm for the simultaneous computation of the determinant and the adjoint matrix B(s) of a pencil sE−A where E is a singular matrix but det(sE−A) ≡ / 0. Using a previous result by the authors we express B(s) and det(sE−A) in terms of classical orthogonal polynomials. Copyright © 2006 Hindawi Publishing Corporation. All rights reserved. 1
9 pages, no figures.-- MSC2000 codes: Primary 42C05, 33C45.MR#: MR2065838Zbl#: Zbl 1105.65039[EN] Us...
Abstract. Many Hankel determinants computations arising in combinatorial analysis, can be done by re...
Fiedler pencils are a family of strong linearizations for polynomials expressed in the monomial basi...
In this contribution we present an extension of the Leverrier-Faddeev algorithm for the simultaneous...
13 pages, no figures.-- MSC2000 codes: 33C45, 15A22, 65F40, 65F30.MR#: MR2251717 (2007f:33012)Zbl#: ...
In this contribution we present an extension of the Leverrier-Faddeev algorithm for the simultaneous...
AbstractThe Leverrier–Chebyshev algorithm is presented. It is an extension of the Leverrier–Fadeev a...
20 pages, no figures.-- MSC2000 codes: Primary 42C05; Secondary 33C45, 15A15.MR#: MR2122756 (2005i:4...
AbstractThe Leverrier-Fadeev algorithm for simultaneous computation of the adjoint B(λ) and determin...
AbstractProperties of an eigenmatrix proposed by Faddeev and an extension thereof investigated by Go...
Properties of an eigenmatrix proposed by Faddeev and an extension thereof investigated by Gower are ...
AbstractThe Leverrier algorithm as modified by Faddeev gives the characteristic equation of a matrix...
A linear machine is one in which the time dependent input y is related to the output z by P(D). z = ...
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-line...
We give an elementary proof, only using linear algebra, of a result due to Helton, Mccullough and Vi...
9 pages, no figures.-- MSC2000 codes: Primary 42C05, 33C45.MR#: MR2065838Zbl#: Zbl 1105.65039[EN] Us...
Abstract. Many Hankel determinants computations arising in combinatorial analysis, can be done by re...
Fiedler pencils are a family of strong linearizations for polynomials expressed in the monomial basi...
In this contribution we present an extension of the Leverrier-Faddeev algorithm for the simultaneous...
13 pages, no figures.-- MSC2000 codes: 33C45, 15A22, 65F40, 65F30.MR#: MR2251717 (2007f:33012)Zbl#: ...
In this contribution we present an extension of the Leverrier-Faddeev algorithm for the simultaneous...
AbstractThe Leverrier–Chebyshev algorithm is presented. It is an extension of the Leverrier–Fadeev a...
20 pages, no figures.-- MSC2000 codes: Primary 42C05; Secondary 33C45, 15A15.MR#: MR2122756 (2005i:4...
AbstractThe Leverrier-Fadeev algorithm for simultaneous computation of the adjoint B(λ) and determin...
AbstractProperties of an eigenmatrix proposed by Faddeev and an extension thereof investigated by Go...
Properties of an eigenmatrix proposed by Faddeev and an extension thereof investigated by Gower are ...
AbstractThe Leverrier algorithm as modified by Faddeev gives the characteristic equation of a matrix...
A linear machine is one in which the time dependent input y is related to the output z by P(D). z = ...
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-line...
We give an elementary proof, only using linear algebra, of a result due to Helton, Mccullough and Vi...
9 pages, no figures.-- MSC2000 codes: Primary 42C05, 33C45.MR#: MR2065838Zbl#: Zbl 1105.65039[EN] Us...
Abstract. Many Hankel determinants computations arising in combinatorial analysis, can be done by re...
Fiedler pencils are a family of strong linearizations for polynomials expressed in the monomial basi...