This paper presents a new algorithm for the division of two polynomial matrices, consisting of a modification of the algorithm show 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 loeplitz matrices, and it is amenable for parallel implementation.

A fast algorithm for the division of two polynomial matrices

Codenotti B;
1988

Abstract

This paper presents a new algorithm for the division of two polynomial matrices, consisting of a modification of the algorithm show 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 loeplitz matrices, and it is amenable for parallel implementation.
1988
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_419261-doc_148104.pdf

accesso aperto

Descrizione: A fast algorithm for the division of two polynomial matrices
Dimensione 493.38 kB
Formato Adobe PDF
493.38 kB Adobe PDF Visualizza/Apri

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/361542
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact