✦ LIBER ✦

A recursive algorithm for the calculation of identity coefficients

✍ Scribed by G. KARIGL

Book ID: 115248905
Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 378 KB
Volume: 45
Category: Article
ISSN: 0003-4800
DOI: 10.1111/j.1469-1809.1981.tb00341.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for the recursive calcu

A fast algorithm for the recursive calculation of dominant singular subspaces

✍ N. Mastronardi; M. Van Barel; R. Vandebril 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 412 KB

In many engineering applications it is required to compute the dominant subspace of a matrix A of dimension m × n, with m?n. Often the matrix A is produced incrementally, so all the columns are not available simultaneously. This problem arises, e.g., in image processing, where each column of the mat

The pragacz identity and a new algorithm

The pragacz identity and a new algorithm for Littlewood-Richardson coefficients

✍ J. Van der Jeugt; V. Fack 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 529 KB

An effective algorithm for calculation o

An effective algorithm for calculation of the Clebsch–Gordan coefficients

✍ Zuo, L. ;Humbert, M. ;Esling, C. 📂 Article 📅 1993 🏛 International Union of Crystallography 🌐 English ⚖ 220 KB

A recursive algorithm for evaluating Mol

A recursive algorithm for evaluating Molodenskii-type truncation error coefficients at altitude

✍ Stanley W. Shepperd 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 434 KB

Fast calculation of coefficients in the

Fast calculation of coefficients in the Smolyak algorithm

✍ Knut Petras 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 254 KB

Recursive cyclotomic factorization--A ne

Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform

✍ Martens, J.-B. 📂 Article 📅 1984 🏛 IEEE ⚖ 942 KB