The number of essential multiplications required to multiply matrices of size NxN and NxN?x is studied as a function f(x). Bounds to f(x) sharper than trivial ones are presented and the asymptotic behaviour of f(x) is studied. An analogous investigation is performed for the problem of multiplying matrices of size NxN?x and N?xxN?y.
On the asymptotic complexity of rectangular matrix multiplication
1983
Abstract
The number of essential multiplications required to multiply matrices of size NxN and NxN?x is studied as a function f(x). Bounds to f(x) sharper than trivial ones are presented and the asymptotic behaviour of f(x) is studied. An analogous investigation is performed for the problem of multiplying matrices of size NxN?x and N?xxN?y.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_420976-doc_149339.pdf
solo utenti autorizzati
Descrizione: On the asymptotic complexity of rectangular matrix multiplication
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.35 MB
Formato
Adobe PDF
|
1.35 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
