An extension of Leverrier-Faddeev algorithm using a basis of classical orthogonal polynomials

Hernández, Javier; Marcellán Español, Francisco José

e-Archivo Principal
→
Investigación
→
Departamentos
→
Departamento de Matemáticas
→
Grupo de Análisis Matemático Aplicado (GAMA)
→
DM - GAMA - Artículos de Revistas
→
Ver ítem

An extension of Leverrier-Faddeev algorithm using a basis of classical orthogonal polynomials

Autor(es): Hernández, Javier; Marcellán Español, Francisco José

Editorial: University of Niš

Fecha de edición: 2004

Cita: Facta Universitatis Series Mathematics and Informatics, 2004, vol. 19, p. 73-92

ISSN: 0352-9665

Agradecimientos: The work of the second author (F. Marcellán) was supported by Dirección General de Investigación, Ministerio de Ciencia y Tecnología of Spain, under grant BFM2003-06335-C03-02. The work of the first author (J. Hernández) has been supported by Fundación Universidad Carlos III de Madrid.

Revisado: PeerReviewed

Versión del editor: http://facta.junis.ni.ac.rs/mai/mai19/f19-073-092.pdf

URI: http://hdl.handle.net/10016/5963

Derechos: © University of Niš

Resumen:

In this paper, the Leverrier-Faddeev algorithm is extended in order to compute both the determinant a(s) and the adjoint B(s) of the polynomial matrix s^pA_p + s^p-1A_p-1 + ... + sA_1 + A_0, where A_i ∈ Cnxn; i = 1, 2, ..., p. B(s) and a(s) are expressed in te [+]