✦ LIBER ✦

Additive Scaling and the DIRECT Algorithm

✍ Scribed by D. E. Finkel; C. T. Kelley

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 251 KB
Volume: 36
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-006-9029-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scaling the neural TSP algorithm

✍ R. Cuykendall; R. Reese 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 537 KB

The combination of complex scaling and t

The combination of complex scaling and the Lanczos algorithm

✍ Stefan Dallwig; Norman Fahrer; Christoph Schlier 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 677 KB

We present a symbiosis of three very powerful mathematical tools: the discrete variable representation (DVR), complex scaling, and the Lanczos algorithm, by which we demonstrate that the widespread negative view on combining the Lanczos algorithm with the complex coordinate method for large systems

Stevens’ Direct Scaling Methods and the

Stevens’ Direct Scaling Methods and the Uniqueness Problem

✍ Thomas Augustin 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 237 KB

On the bigℳin the affine scaling algorit

On the bigℳin the affine scaling algorithm

✍ Tohru Ishihara; Masakazu Kojima 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 498 KB

Direct constructions of additive codes

✍ Jürgen Bierbrauer 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## Abstract A code is __q^m^__‐ary __q__‐linear if its alphabet forms an __m__‐dimensional vector space over 𝔽~__q__~ and the code is linear over 𝔽~__q__~. These __additive codes__ form a natural generalization of linear codes. Our main results are direct constructions of certain families of additi

On the convergence of the affine-scaling

On the convergence of the affine-scaling algorithm

✍ Paul Tseng; Zhi-Quan Luo 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 1017 KB