This note presents a new algorithm for the division of two polynomial matrices, consisting of a modification of the algorithm shown by Wang and Zhou. We improve the performance of their algorithm by means of the use of convolutions, and therefore of FFT techniques. Our method is based on the fast inversion of block triangular Toeplitz matrices, and it is amenable for parallel implementation.

A fast algorithm for the division of two polynomial matrices

Codenotti B;
1989

Abstract

This note presents a new algorithm for the division of two polynomial matrices, consisting of a modification of the algorithm shown by Wang and Zhou. We improve the performance of their algorithm by means of the use of convolutions, and therefore of FFT techniques. Our method is based on the fast inversion of block triangular Toeplitz matrices, and it is amenable for parallel implementation.
1989
Istituto di informatica e telematica - IIT
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
FAST ALGORITHM
Polynomial matrices
File in questo prodotto:
File Dimensione Formato  
prod_418007-doc_147481.pdf

solo utenti autorizzati

Descrizione: A fast algorithm for the division of two polynomial matrices
Tipologia: Versione Editoriale (PDF)
Dimensione 288.15 kB
Formato Adobe PDF
288.15 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/374772
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 4
social impact