𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for computing the Nth roots of unity in bit-reversed order

✍ Scribed by Keys, R.

Book ID
117905510
Publisher
IEEE
Year
1980
Weight
250 KB
Volume
28
Category
Article
ISSN
0096-3518

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Newton’s method and high-order algorithm
Newton’s method and high-order algorithms for the nth root computation
✍ FranΓ§ois Dubeau πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 705 KB

Two modifications of Newton's method to accelerate the convergence of the nth root computation of a strictly positive real number are revisited. Both modifications lead to methods with prefixed order of convergence p ∈ N, p β‰₯ 2. We consider affine combinations of the two modified pth-order methods w

An Algorithm for the Computation of Opti
An Algorithm for the Computation of Optimal Control Gains for Second Order Matrix Equations
✍ M.K. Kwak; L. Meirovitch πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 332 KB

In control of structures, the problem is ordinarily formulated in terms of second order matrix differential equations. In general, for an \(n\)-degree-of-freedom structure, design of a linear quadratic regulator requires the solution of a \(2 n \times 2 n\) matrix Ricatti equation. In the case of se