Arithmetic complexity of computations
Shmuel (Society for Industrial and Applied Mathematics, 1980)
|
Focuses on finding the minimum number of arithmetic operations needed to perform the computation and on finding a better algorithm when improvement is possible. The author concentrates on that class of problems concerned with computing a system of bilinear forms. Results that lead to applications in the area of signal processing are emphasized, since (1) even a modest reduction in the execution time of signal processing problems could have practical significance; (2) results in this area are relatively new and are scattered in journal articles; and (3) this emphasis indicates the flavor of complexity of computation. |
Arithmetic complexity of computations.pdf :: Unduh
|
No. Panggil : | e20442851 |
Entri utama-Nama orang : | |
Subjek : | |
Penerbitan : | Philadelphia : Society for Industrial and Applied Mathematics, 1980 |
Sumber Pengatalogan: | LibUI eng rda |
Tipe Konten: | text |
Tipe Media: | computer |
Tipe Pembawa: | online resource |
Deskripsi Fisik: | 93 pages : illustration |
Tautan: | http://portal.igpublish.com/iglibrary/search/SIAMB0000258.main.html?2 |
Lembaga Pemilik: | |
Lokasi: |
No. Panggil | No. Barkod | Ketersediaan |
---|---|---|
e20442851 | 02-17-746523183 | TERSEDIA |
Ulasan: |
Tidak ada ulasan pada koleksi ini: 20442851 |