𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by J. Van der Jeugt; V. Fack

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
529 KB
Volume
21
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Generalized cross-validation as a stoppi
Generalized cross-validation as a stopping rule for the Richardson-Lucy algorithm
✍ Stanley J. Reeves πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 488 KB

The Richardson-Lucy (R-L) algorithm has been widely used to restore degraded astronomical images. This algorithm is nothing more than the expectation-maximization (EM) algorithm applied to Poisson data. The R-L method is iterative in nature and converges to a (possibly local) maximum of the likeliho

A Closed Formula for the Rule of Littlew
A Closed Formula for the Rule of Littlewood/Richardson with Applications in the Theory of Representations of gl(V) and the Superalgebra pl(V)
✍ Hartmut Schlosser πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 491 KB

A rlosed formula for the rule of LITTLEW~OD/RICHARDSOX is given. By specialization closed formulas are gotten for the decomposition of representations of gZ( V) and pZ( V) resp. where V is a vector space (graduate vector space) over 6. Math. Nadir. 161 (1991) We order to this partion a YOUNG frame

A new algorithm for the symmetric (LΓΆwdi
A new algorithm for the symmetric (LΓΆwdin) orthonormalization
✍ Peter Scharfenberg πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 485 KB

## Abstract A new method for the numerical calculation of (inverse) square roots of real symmetric matrices is proposed. Simplicity of the algorithm, good numerical accuracy, short computational time and the possibility to solve the problem in an (__n__, __n__) array are some of its features; in ad