✦ LIBER ✦

On the period length of the generalized Lagrange algorithm

✍ Scribed by Johannes Buchmann

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 278 KB
Volume: 26
Category: Article
ISSN: 0022-314X
DOI: 10.1016/0022-314x(87)90093-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the length of generalized fractions

✍ Nguyen Tu Cuong; Marcel Morales; Le Thanh Nhan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Let M be a finitely generated module over a Noetherian local ring (R, m) with dim M = d. Let (x 1 , . . . , x d ) be a system of parameters of M and (n 1 , . . . , n d ) a set of positive integers. Consider the length of generalized fraction 1/(x n 1 1 , . . . , x n d d , 1) as a function in n 1 , .

The Period Lengths of Inversive Pseudora

The Period Lengths of Inversive Pseudorandom Vector Generations

✍ W.-S. Chou 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 273 KB

We describe all possible period lengths for inversive pseudorandom vector generations. 1995 Academic Press, Inc.

On generalizations of the Euler–Lagrange

On generalizations of the Euler–Lagrange equation

✍ Urszula Ledzewicz; Heinz Schaettler 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 555 KB

On the computation of units and class nu

On the computation of units and class numbers by a generalization of Lagrange's algorithm

✍ Johannes Buchmann 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 926 KB

On the period length of congruential pse

On the period length of congruential pseudorandom number sequences generated by inversions

✍ J. Eichenauer-Herrmann; A. Topuzoǧlu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 530 KB

On Generalized Hermite–Fejér Interpolati

On Generalized Hermite–Fejér Interpolation of Lagrange Type on the Chebyshev Nodes

✍ Graeme J. Byrne; T.M. Mills; Simon J. Smith 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 131 KB

For f # C [&1, 1], let H m, n ( f, x) denote the (0, 1, ..., m) Hermite Feje r (HF) interpolation polynomial of f based on the Chebyshev nodes. That is, H m, n ( f, x) is the polynomial of least degree which interpolates f (x) and has its first m derivatives vanish at each of the zeros of the nth Ch