𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On computing the worst-case peak gain of linear systems

✍ Scribed by V. Balakrishnan; S. Boyd

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
359 KB
Volume
19
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the worst case of three algorithms fo
On the worst case of three algorithms for computing the Jacobi symbol
✍ Jeffrey Shallit πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 803 KB

We study the worst-case behavior of three iterative algorithms for computing the Jacobi symbol (~). Each algorithm is similar in format to the Euclidean algorithm for computing gcd(u, v). Eisenstein's algorithm chooses an even quotient at each step. It is shown that the worst case occurs when u = 2

On computing the largest fraction of mis
On computing the largest fraction of missing information for the EM algorithm and the worst linear function for data augmentation
✍ Chris Fraley πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 172 KB

We address the problem of computing the largest fraction of missing information for the EM algorithm and the worst linear function for data augmentation. These are the largest eigenvalue and its associated eigenvector for the Jacobian of the EM operator at a maximum likelihood estimate, which are im