๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Orthogonal Polynomials: Computation and Approximation

โœ Scribed by Walter Gautschi


Publisher
Oxford University Press, USA
Year
2004
Tongue
English
Leaves
312
Series
Numerical Mathematics and Scientific Computation
Edition
illustrated edition
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Orthogonal Polynomials: Computation and
โœ Walter Gautschi ๐Ÿ“‚ Library ๐Ÿ“… 2004 ๐Ÿ› Oxford University Press ๐ŸŒ English

This is the first book on constructive methods for, and applications of orthogonal polynomials, and the first available collection of relevant Matlab codes. The book begins with a concise introduction to the theory of polynomials orthogonal on the real line (or a portion thereof), relative to a posi

Orthogonal Polynomials: Computation and
โœ Walter Gautschi ๐Ÿ“‚ Library ๐Ÿ“… 2004 ๐Ÿ› Oxford University Press ๐ŸŒ English

This is the first book on constructive methods for, and applications of orthogonal polynomials, and the first available collection of relevant Matlab codes. The book begins with a concise introduction to the theory of polynomials orthogonal on the real line (or a portion thereof), relative to a posi

Linear Algebra, Rational Approximation a
โœ Bultheel A., van Barel M. ๐Ÿ“‚ Library ๐Ÿ“… 1997 ๐ŸŒ English

Evolving from an elementary discussion, this book develops the Euclidean algorithm to a very powerful tool to deal with general continued fractions, non-normal Padรฉ tables, look-ahead algorithms for Hankel and Toeplitz matrices, and for Krylov subspace methods. It introduces the basics of fast algor

Linear Algebra, Rational Approximation a
โœ Adhemar Bultheel and Marc Van Barel (Eds.) ๐Ÿ“‚ Library ๐Ÿ“… 1997 ๐Ÿ› North Holland ๐ŸŒ English

Evolving from an elementary discussion, this book develops the Euclidean algorithm to a very powerful tool to deal with general continued fractions, non-normal Padรฉ tables, look-ahead algorithms for Hankel and Toeplitz matrices, and for Krylov subspace methods. It introduces the basics of fast algor