In this paper, several algorithms for the matrix polynomial division are taken into consideration. Such algorithms represent extensions of known parallel algorithms for the scalar polynomial division with remainder. The interest resides in the comparison of the parallel computational cost of these algorithms in the general non scalar case.
Parallel algorithms for matrix polynomial division
Favati P;
1991
Abstract
In this paper, several algorithms for the matrix polynomial division are taken into consideration. Such algorithms represent extensions of known parallel algorithms for the scalar polynomial division with remainder. The interest resides in the comparison of the parallel computational cost of these algorithms in the general non scalar case.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_489427-doc_203810.pdf
solo utenti autorizzati
Descrizione: Parallel algorithms for matrix polynomial division
Tipologia:
Versione Editoriale (PDF)
Dimensione
898.02 kB
Formato
Adobe PDF
|
898.02 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.
