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

Chebyshev Systems of Minimal Degree

โœ Scribed by Granovsky, B. L.; Passow, Eli

Book ID
118199415
Publisher
Society for Industrial and Applied Mathematics
Year
1984
Tongue
English
Weight
522 KB
Volume
15
Category
Article
ISSN
0036-1410

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for minimal degree linear C
An algorithm for minimal degree linear Chebyshev approximation on a discrete set
โœ F. D. K. Roberts ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 779 KB

## Abstract An algorithm for computing a linear Chebyshev approximation to a function defined on a finite set of points is presented. The method requires the accuracy of the approximation to be specified, and determines the least degree approximation which achieves this accuracy. The algorithm is b

Subgraphs of minimal degree k
Subgraphs of minimal degree k
โœ P. Erdős; R.J. Faudree; C.C. Rousseau; R.H. Schelp ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 392 KB

## For k 2 2, any graph G with n vertices and (k -1) (n -k + 2) + (" 1') edges has a subgraph of minimum degree at least k; however, this subgraph need not be proper. It is shown that if G has at least (k -1) (n -k + 2) + (e ;') + 1 edges, then there is a subgraph H of minimal degree k that has at

Chebyshev interpolation and quadrature f
Chebyshev interpolation and quadrature formulas of very high degree
โœ Salzer, Herbert E. ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 73 KB

All the zeros x 2 m , i , i = 1(1)2 m , of the Chebyshev polynomials T 2 m ( x ), m = 0(1) n , are found recursively just by taking n 2 n -1 real square roots. For interpolation or integration of ฦ’( x ), given ฦ’( x 2 m , i ), only x 2 m , i is needed to calculate (a) the (2 m - 1)-th degree