We develop efficient algorithms for computing the expansion of a given symmetric polynomial into Schur functions. This problem frequently arises in applications Ε½ as the problem of decomposing a given representation of the symmetric or general . linear group into irreducible constituents. Our algori
Change of basis in polynomial interpolation
β Scribed by W. Gander
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 94 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1070-5325
- DOI
- 10.1002/nla.450
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Several representations for the interpolating polynomial exist: Lagrange, Newton, orthogonal polynomials, etc. Each representation is characterized by some basis functions. In this paper we investigate the transformations between the basis functions which map a specific representation to another. We show that for this purpose the LUβ and the QRβdecomposition of the Vandermonde matrix play a crucial role. Copyright Β© 2005 John Wiley & Sons, Ltd.
π SIMILAR VOLUMES
Stimulated by recent work of Hakopian and Sahakian, polynomial interpolation to data at all the s-dimensional intersections of an arbitrary sequence of hyperplanes in R d is considered, and reduced, by the adjunction of an additional s hyperplanes in general position with respect to the given sequen