Two Algorithms for the Factorization of Time Limited Functions
Guardado en:
| Publicado en: | ProQuest Dissertations and Theses (1990) |
|---|---|
| Autor principal: | |
| Publicado: |
ProQuest Dissertations & Theses
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full Text - PDF |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Resumen: | 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. |
|---|---|
| ISBN: | 9798379457020 |
| Fuente: | ProQuest Dissertations & Theses Global |