๐”– Scriptorium
โœฆ   LIBER   โœฆ
๐Ÿ“

Padรฉ-Type Approximation and General Orthogonal Polynomials

โœ Scribed by Claude Brezinski (auth.)

Publisher
Birkhรคuser Basel
Year
1980
Tongue
German
Leaves
251
Series
International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Sรฉrie internationale dโ€™Analyse numรฉrique 50
Edition
1
Category
Library
โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Table of Contents

Front Matter....Pages 1-6
Introduction....Pages 7-8
Padรฉ-type approximants....Pages 9-39
General orthogonal polynomials....Pages 40-125
Padรฉ approximants and related matters....Pages 126-177
Generalizations....Pages 178-226
Back Matter....Pages 227-250

โœฆ Subjects

Science, general

๐Ÿ“œ SIMILAR VOLUMES

Orthogonal Polynomials: Computation and
๐Ÿ“ Orthogonal Polynomials: Computation and Approximation
โœ 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
๐Ÿ“ Linear Algebra, Rational Approximation and Orthogonal Polynomials
โœ 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
๐Ÿ“ Linear Algebra, Rational Approximation and Orthogonal Polynomials
โœ 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