Two Algorithms for the Factorization of Time Limited Functions
Αποθηκεύτηκε σε:
| Εκδόθηκε σε: | ProQuest Dissertations and Theses (1990) |
|---|---|
| Κύριος συγγραφέας: | |
| Έκδοση: |
ProQuest Dissertations & Theses
|
| Θέματα: | |
| Διαθέσιμο Online: | Citation/Abstract Full Text - PDF |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2811363926 | ||
| 003 | UK-CbPIL | ||
| 020 | |a 9798379457020 | ||
| 035 | |a 2811363926 | ||
| 045 | 2 | |b d19900101 |b d19901231 | |
| 084 | |a 66569 |2 nlm | ||
| 100 | 1 | |a Farinaccio, Joseph N. | |
| 245 | 1 | |a Two Algorithms for the Factorization of Time Limited Functions | |
| 260 | |b ProQuest Dissertations & Theses |c 1990 | ||
| 513 | |a Dissertation/Thesis | ||
| 520 | 3 | |a Two novel methods developed by A. Papoulis for the factorization of a class of time limited functions are discussed. They are both implemented in the Pascal programming language on a Macintosh Plus personal computer and the results of test cases are presented. A summary of the accuracy of the results and the computational requirements of both algorithms is included. | |
| 653 | |a Computer engineering | ||
| 653 | |a Automotive engineering | ||
| 653 | |a Electrical engineering | ||
| 773 | 0 | |t ProQuest Dissertations and Theses |g (1990) | |
| 786 | 0 | |d ProQuest |t ProQuest Dissertations & Theses Global | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2811363926/abstract/embedded/75I98GEZK8WCJMPQ?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/2811363926/fulltextPDF/embedded/75I98GEZK8WCJMPQ?source=fedsrch |