This paper presents VLSI networks for the solution of linear systems, which are based on the application of Monte Carlo methods. We obtain areax (time)?2 performances improving the results attained by the best known VLSI linear system solvers, at the price of introducing, in the result, a "probabilistic error", which can be evaluated in terms of Chebychev's inequality.
VLSI designs for the solution of linear systems by Montecarlo methods
Codenotti B
1987
Abstract
This paper presents VLSI networks for the solution of linear systems, which are based on the application of Monte Carlo methods. We obtain areax (time)?2 performances improving the results attained by the best known VLSI linear system solvers, at the price of introducing, in the result, a "probabilistic error", which can be evaluated in terms of Chebychev's inequality.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_419573-doc_148340.pdf
accesso aperto
Descrizione: VLSI designs for the solution of linear systems by Montecarlo methods
Dimensione
1.79 MB
Formato
Adobe PDF
|
1.79 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
