DOI: 10.1007/s10543-009-0240-1. Barycentric-Remez algorithms for best polynomial approximation in the chebfun system

Barycentric-Remez algorithms for best polynomial approximation in the chebfun system

10.1007/s10543-009-0240-1

Crossref journal-article

Springer Science and Business Media LLC

BIT Numerical Mathematics (297)

Bibliography

PachÃ³n, R., & Trefethen, L. N. (2009). Barycentric-Remez algorithms for best polynomial approximation in the chebfun system. BIT Numerical Mathematics, 49(4), 721â741.

Authors 2

Ricardo Pachón (first)
Lloyd N. Trefethen (additional)

References 53 Referenced 42

Almacany, M., Dunham, C., Williams, J.: Discrete Chebyshev approximation by interpolating rationals. IMA J. Numer. Anal. 4, 467–477 (1984) (10.1093/imanum/4.4.467) / IMA J. Numer. Anal. by M. Almacany (1984)
Barrodale, I., Phillips, C.: Solution of an overdetermined system of linear equations in the Chebyshev norm. ACM Trans. Math. Softw. 1, 264–270 (1975) (10.1145/355644.355651) / ACM Trans. Math. Softw. by I. Barrodale (1975)
Battles, Z.: Numerical linear algebra for continuous functions. PhD thesis, University of Oxford (2005)
Battles, Z., Trefethen, L.N.: An extension of MATLAB to continuous functions and operators. SIAM J. Sci. Comput. 25(5), 1743–1770 (2004) (10.1137/S1064827503430126) / SIAM J. Sci. Comput. by Z. Battles (2004)
Bernstein, S.: Sur la meilleure approximation de |x| par des polynomes de degrés donnés. Acta Math. 37, 1–57 (1914) (10.1007/BF02401828) / Acta Math. by S. Bernstein (1914)
Berrut, J.P., Trefethen, L.N.: Barycentric Lagrange interpolation. SIAM Rev. 46, 501–517 (2004) (10.1137/S0036144502417715) / SIAM Rev. by J.P. Berrut (2004)
Boothroyd, J.: Algorithm 318: Chebyschev curve-fit. Commun. ACM 10(12), 801–803 (1967) (10.1145/363848.363865) / Commun. ACM by J. Boothroyd (1967)
Borel, E.: Leçons sur les fonctions de variables réelles. Gauthier-Villars, Paris (1905) / Leçons sur les fonctions de variables réelles by E. Borel (1905)
Boyd, J.A.: Computing zeros on a real interval through Chebyshev expansion and polynomial rootfinding. SIAM J. Numer. Anal. 40(5), 1666–1682 (2002) (10.1137/S0036142901398325) / SIAM J. Numer. Anal. by J.A. Boyd (2002)
Brutman, L.: Lebesgue functions for polynomial interpolation—a survey. Ann. Numer. Math. 4, 111–128 (1997) / Ann. Numer. Math. by L. Brutman (1997)
Cheney, E.W.: Introduction to Approximation Theory. McGraw-Hill, New York (1966) / Introduction to Approximation Theory by E.W. Cheney (1966)
Cody, W.J.: The FUNPACK package of special function subroutines. ACM Trans. Math. Softw. 1(1), 13–25 (1975) (10.1145/355626.355631) / ACM Trans. Math. Softw. by W.J. Cody (1975)
Cody, W.J.: Algorithm 715: SPECFUN—a portable FORTRAN package of special function routines and test drivers. ACM Trans. Math. Softw. 19(1), 22–30 (1993) (10.1145/151271.151273) / ACM Trans. Math. Softw. by W.J. Cody (1993)
Curtis, P.C., Frank, W.L.: An algorithm for the determination of the polynomial of best minimax approximation to a function defined on a finite point set. J. ACM 6, 395–404 (1959) (10.1145/320986.320994) / J. ACM by P.C. Curtis (1959)
Davis, P.J.: Interpolation and Approximation. Dover, New York (1975) / Interpolation and Approximation by P.J. Davis (1975)
de Boor, C., Rice, J.R.: Extremal polynomials with application to Richardson iteration for indefinite linear systems. SIAM J. Sci. Stat. Comput. 3, 47–57 (1982) (10.1137/0903004) / SIAM J. Sci. Stat. Comput. by C. Boor de (1982)
de la Vallée Poussin, C.J.: Sur les polynomes d’approximation et la représentation approchée d’un angle. Acad. R. Belg., Bull. Cl. Sci. 12 (1910)
Dunham, C.B.: Choice of basis for Chebyshev approximation. ACM Trans. Math. Softw. 8(1), 21–25 (1982) (10.1145/355984.355987) / ACM Trans. Math. Softw. by C.B. Dunham (1982)
Golub, G.H., Smith, L.B.: Algorithm 414: Chebyshev approximation of continuous functions by a Chebyshev system of functions. Commun. ACM 14(11), 737–746 (1971) (10.1145/362854.362890) / Commun. ACM by G.H. Golub (1971)
Good, I.J.: The colleague matrix, a Chebyshev analogue of the companion matrix. Q. J. Math. 12, 61–68 (1961) (10.1093/qmath/12.1.61) / Q. J. Math. by I.J. Good (1961)
Gutknecht, M.H., Trefethen, L.N.: Real polynomial Chebyshev approximation by the Carathéodory-Fejér method. SIAM J. Numer. Anal. 19, 358–371 (1982) (10.1137/0719022) / SIAM J. Numer. Anal. by M.H. Gutknecht (1982)
Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia (2002) (10.1137/1.9780898718027) / Accuracy and Stability of Numerical Algorithms by N.J. Higham (2002)
Higham, N.J.: The numerical stability of barycentric Lagrange interpolation. IMA J. Numer. Anal. 24, 547–556 (2004) (10.1093/imanum/24.4.547) / IMA J. Numer. Anal. by N.J. Higham (2004)
Kaufman, Jr., E.H., Leeming, D.J., Taylor, G.D.: Uniform rational approximation by differential correction and Remes-differential correction. Int. J. Numer. Methods Eng. 17, 1273–1278 (1981) (10.1002/nme.1620170810) / Int. J. Numer. Methods Eng. by E.H. Kaufman Jr. (1981)
Le Bailly, B., Thiran, J.P.: Computing complex polynomial Chebyshev approximants on the unit circle by the real Remez algorithm. SIAM J. Numer. Anal. 36, 1858–1877 (1999) (10.1137/S0036142998339519) / SIAM J. Numer. Anal. by B. Bailly Le (1999)
Lorentz, G.G.: Approximation of Functions. Holt, Rinehart and Winston (1966)
MATLAB: User’s Guide. The MathWorks Inc., Natick, Massachusetts
McClellan, J.H., Parks, T.W.: A personal history of the Parks-McClellan algorithm. IEEE Signal Process. Mag. 22, 82–86 (2005) (10.1109/MSP.2005.1406492) / IEEE Signal Process. Mag. by J.H. McClellan (2005)
McClellan, J.H., Parks, T.W., Rabiner, L.R.: A computer program for designing optimum FIR linear phase digital filters. IEEE Trans. Audio Electroacoust. 21, 506–526 (1973) (10.1109/TAU.1973.1162525) / IEEE Trans. Audio Electroacoust. by J.H. McClellan (1973)
Meinardus, G.: Approximation of Functions: Theory and Numerical Methods. Springer, Heidelberg (1967) (10.1007/978-3-642-85643-3) / Approximation of Functions: Theory and Numerical Methods by G. Meinardus (1967)
Mhaskar, H.N., Pai, D.V.: Fundamentals of Approximation Theory. Narosa Publishing House, New Delhi (2000) / Fundamentals of Approximation Theory by H.N. Mhaskar (2000)
Murnaghan, F.D., Wrench, J.W.: J.: The determination of the Chebyshev approximating polynomial for a differentiable function. Math. Tables Aids Comput. 13, 185–193 (1959) (10.2307/2002711) / Math. Tables Aids Comput. by F.D. Murnaghan (1959)
NAG: Library, Manual. The Numerical Algorithms Group, Ltd., Oxford, UK
Numerical Libraries, I.M.S.L.: Technical Documentation. Visual Numerics Inc., Houston
Pachón, R., Platte, R., Trefethen, L.N.: Piecewise smooth chebfuns. IMA J. Numer. Anal. (to appear) (10.1093/imanum/drp008)
Parks, T.W., McClellan, J.H.: Chebyshev approximation for nonrecursive digital filters with linear phase. IEEE Trans. Circuit Theory 19, 189–194 (1972) (10.1109/TCT.1972.1083419) / IEEE Trans. Circuit Theory by T.W. Parks (1972)
Powell, M.J.D.: Approximation Theory and Methods. Cambridge University Press, Cambridge (1981) (10.1017/CBO9781139171502) / Approximation Theory and Methods by M.J.D. Powell (1981)
Rabinowitz, P.: Applications of linear programming to numerical analysis. SIAM Rev. 10, 121–159 (1968) (10.1137/1010029) / SIAM Rev. by P. Rabinowitz (1968)
Remes, E.: Sur le calcul effectif des polynomes d’approximation de Tchebychef. C. R. Acad. Sci. 199, 337–340 (1934) / C. R. Acad. Sci. by E. Remes (1934)
Remes, E.: Sur un procédé convergent d’approximations successives pour déterminer les polynomes d’approximation. C. R. Acad. Sci. 198, 2063–2065 (1934) / C. R. Acad. Sci. by E. Remes (1934)
Remes, E.: Sur la détermination des polynomes d’approximation de degré donnée. Commun. Soc. Math. Kharkov 10 (1934)
Rice, J.R.: The Approximation of Functions, vol. 1. Addison-Wesley, Reading (1964) / The Approximation of Functions, vol. 1 by J.R. Rice (1964)
Sauer, F.W.: Algorithm 604: A FORTRAN program for the calculation of an extremal polynomial. ACM Trans. Math. Softw. 9(3), 381–383 (1983) (10.1145/356044.356055) / ACM Trans. Math. Softw. by F.W. Sauer (1983)
Schmitt, H.: Algorithm 409, discrete Chebychev curve fit. Commun. ACM 14, 355–356 (1971) (10.1145/362588.362600) / Commun. ACM by H. Schmitt (1971)
Simpson, J.C.: Fortran translation of algorithm 409, Discrete Chebychev curve fit. ACM Trans. Math. Softw. 2, 95–97 (1976) (10.1145/355666.355674) / ACM Trans. Math. Softw. by J.C. Simpson (1976)
Specht, W.: Die Lage der Nullstellen eines Polynoms, IV. Math. Nachr. 21, 201–222 (1960) (10.1002/mana.19600210307) / Math. Nachr. by W. Specht (1960)
Steffens, K.G.: The History of Approximation Theory: From Euler to Bernstein. Birkhäuser, Boston (2006) / The History of Approximation Theory: From Euler to Bernstein by K.G. Steffens (2006)
Stiefel, E.L.: Numerical methods of Tchebycheff approximation. In: Langer, R. (ed.) On Numerical Approximation, pp. 217–232. University of Wisconsin Press, Madison (1959) / On Numerical Approximation by E.L. Stiefel (1959)
Taylor, R., Totik, V.: Lebesgue constants for Leja points. IMA J. Numer. Anal. (to appear) (10.1093/imanum/drn082)
Trefethen, L.N.: Square blocks and equioscillation in the Padé, Walsh, and CF tables. In: Graves-Morris, P., Saff, E., Varga, R. (eds.) Rational Approximation and Interpolation. Lect. Notes in Math., vol. 1105. Springer, Berlin (1984) / Rational Approximation and Interpolation / Lect. Notes in Math. by L.N. Trefethen (1984)
Trefethen, L.N.: Spectral Methods in MATLAB. SIAM, Philadelphia (2000) (10.1137/1.9780898719598) / Spectral Methods in MATLAB by L.N. Trefethen (2000)
Varga, R.S., Carpenter, A.J.: On the Bernstein conjecture in approximation theory. Constr. Approx. 1, 333–348 (1985) (10.1007/BF01890040) / Constr. Approx. by R.S. Varga (1985)
Veidinger, L.: On the numerical determination of the best approximation in the Chebyshev sense. Numer. Math. 2, 99–105 (1960) (10.1007/BF01386215) / Numer. Math. by L. Veidinger (1960)

Dates

Type	When
Created	15 years, 10 months ago (Oct. 9, 2009, 6:44 a.m.)
Deposited	6 years, 2 months ago (May 31, 2019, 7:37 a.m.)
Indexed	2 months ago (June 20, 2025, 9:25 a.m.)
Issued	15 years, 10 months ago (Oct. 10, 2009)
Published	15 years, 10 months ago (Oct. 10, 2009)
Published Online	15 years, 10 months ago (Oct. 10, 2009)
Published Print	15 years, 8 months ago (Dec. 1, 2009)

Funders 0

None

BibTeX

@article{Pach_n_2009, title={Barycentric-Remez algorithms for best polynomial approximation in the chebfun system}, volume={49}, ISSN={1572-9125}, url={http://dx.doi.org/10.1007/s10543-009-0240-1}, DOI={10.1007/s10543-009-0240-1}, number={4}, journal={BIT Numerical Mathematics}, publisher={Springer Science and Business Media LLC}, author={Pachón, Ricardo and Trefethen, Lloyd N.}, year={2009}, month=oct, pages={721–741} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        6,
        20
      ]
    ],
    "date-time": "2025-06-20T13:25:01Z",
    "timestamp": 1750425901622
  },
  "reference-count": 53,
  "publisher": "Springer Science and Business Media LLC",
  "issue": "4",
  "license": [
    {
      "start": {
        "date-parts": [
          [
            2009,
            10,
            10
          ]
        ],
        "date-time": "2009-10-10T00:00:00Z",
        "timestamp": 1255132800000
      },
      "content-version": "tdm",
      "delay-in-days": 0,
      "URL": "http://www.springer.com/tdm"
    }
  ],
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        2009,
        12
      ]
    ]
  },
  "DOI": "10.1007/s10543-009-0240-1",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2009,
        10,
        9
      ]
    ],
    "date-time": "2009-10-09T10:44:16Z",
    "timestamp": 1255085056000
  },
  "page": "721-741",
  "source": "Crossref",
  "is-referenced-by-count": 42,
  "title": "Barycentric-Remez algorithms for best polynomial approximation in the chebfun system",
  "prefix": "10.1007",
  "volume": "49",
  "author": [
    {
      "given": "Ricardo",
      "family": "Pach\u00f3n",
      "sequence": "first",
      "affiliation": []
    },
    {
      "given": "Lloyd N.",
      "family": "Trefethen",
      "sequence": "additional",
      "affiliation": []
    }
  ],
  "member": "297",
  "published-online": {
    "date-parts": [
      [
        2009,
        10,
        10
      ]
    ]
  },
  "reference": [
    {
      "key": "240_CR1",
      "doi-asserted-by": "crossref",
      "first-page": "467",
      "DOI": "10.1093/imanum/4.4.467",
      "volume": "4",
      "author": "M. Almacany",
      "year": "1984",
      "unstructured": "Almacany, M., Dunham, C., Williams, J.: Discrete Chebyshev approximation by interpolating rationals. IMA J. Numer. Anal. 4, 467\u2013477 (1984)",
      "journal-title": "IMA J. Numer. Anal."
    },
    {
      "key": "240_CR2",
      "doi-asserted-by": "crossref",
      "first-page": "264",
      "DOI": "10.1145/355644.355651",
      "volume": "1",
      "author": "I. Barrodale",
      "year": "1975",
      "unstructured": "Barrodale, I., Phillips, C.: Solution of an overdetermined system of linear equations in the Chebyshev norm. ACM Trans. Math. Softw. 1, 264\u2013270 (1975)",
      "journal-title": "ACM Trans. Math. Softw."
    },
    {
      "key": "240_CR3",
      "unstructured": "Battles, Z.: Numerical linear algebra for continuous functions. PhD thesis, University of Oxford (2005)"
    },
    {
      "issue": "5",
      "key": "240_CR4",
      "doi-asserted-by": "crossref",
      "first-page": "1743",
      "DOI": "10.1137/S1064827503430126",
      "volume": "25",
      "author": "Z. Battles",
      "year": "2004",
      "unstructured": "Battles, Z., Trefethen, L.N.: An extension of MATLAB to continuous functions and operators. SIAM J. Sci. Comput. 25(5), 1743\u20131770 (2004)",
      "journal-title": "SIAM J. Sci. Comput."
    },
    {
      "key": "240_CR5",
      "doi-asserted-by": "crossref",
      "first-page": "1",
      "DOI": "10.1007/BF02401828",
      "volume": "37",
      "author": "S. Bernstein",
      "year": "1914",
      "unstructured": "Bernstein, S.: Sur la meilleure approximation de |x| par des polynomes de degr\u00e9s donn\u00e9s. Acta Math. 37, 1\u201357 (1914)",
      "journal-title": "Acta Math."
    },
    {
      "key": "240_CR6",
      "doi-asserted-by": "crossref",
      "first-page": "501",
      "DOI": "10.1137/S0036144502417715",
      "volume": "46",
      "author": "J.P. Berrut",
      "year": "2004",
      "unstructured": "Berrut, J.P., Trefethen, L.N.: Barycentric Lagrange interpolation. SIAM Rev. 46, 501\u2013517 (2004)",
      "journal-title": "SIAM Rev."
    },
    {
      "issue": "12",
      "key": "240_CR7",
      "doi-asserted-by": "crossref",
      "first-page": "801",
      "DOI": "10.1145/363848.363865",
      "volume": "10",
      "author": "J. Boothroyd",
      "year": "1967",
      "unstructured": "Boothroyd, J.: Algorithm 318: Chebyschev curve-fit. Commun. ACM 10(12), 801\u2013803 (1967)",
      "journal-title": "Commun. ACM"
    },
    {
      "key": "240_CR8",
      "volume-title": "Le\u00e7ons sur les fonctions de variables r\u00e9elles",
      "author": "E. Borel",
      "year": "1905",
      "unstructured": "Borel, E.: Le\u00e7ons sur les fonctions de variables r\u00e9elles. Gauthier-Villars, Paris (1905)"
    },
    {
      "issue": "5",
      "key": "240_CR9",
      "doi-asserted-by": "crossref",
      "first-page": "1666",
      "DOI": "10.1137/S0036142901398325",
      "volume": "40",
      "author": "J.A. Boyd",
      "year": "2002",
      "unstructured": "Boyd, J.A.: Computing zeros on a real interval through Chebyshev expansion and polynomial rootfinding. SIAM J. Numer. Anal. 40(5), 1666\u20131682 (2002)",
      "journal-title": "SIAM J. Numer. Anal."
    },
    {
      "key": "240_CR10",
      "first-page": "111",
      "volume": "4",
      "author": "L. Brutman",
      "year": "1997",
      "unstructured": "Brutman, L.: Lebesgue functions for polynomial interpolation\u2014a survey. Ann. Numer. Math. 4, 111\u2013128 (1997)",
      "journal-title": "Ann. Numer. Math."
    },
    {
      "key": "240_CR11",
      "volume-title": "Introduction to Approximation Theory",
      "author": "E.W. Cheney",
      "year": "1966",
      "unstructured": "Cheney, E.W.: Introduction to Approximation Theory. McGraw-Hill, New York (1966)"
    },
    {
      "issue": "1",
      "key": "240_CR12",
      "doi-asserted-by": "crossref",
      "first-page": "13",
      "DOI": "10.1145/355626.355631",
      "volume": "1",
      "author": "W.J. Cody",
      "year": "1975",
      "unstructured": "Cody, W.J.: The FUNPACK package of special function subroutines. ACM Trans. Math. Softw. 1(1), 13\u201325 (1975)",
      "journal-title": "ACM Trans. Math. Softw."
    },
    {
      "issue": "1",
      "key": "240_CR13",
      "doi-asserted-by": "crossref",
      "first-page": "22",
      "DOI": "10.1145/151271.151273",
      "volume": "19",
      "author": "W.J. Cody",
      "year": "1993",
      "unstructured": "Cody, W.J.: Algorithm 715: SPECFUN\u2014a portable FORTRAN package of special function routines and test drivers. ACM Trans. Math. Softw. 19(1), 22\u201330 (1993)",
      "journal-title": "ACM Trans. Math. Softw."
    },
    {
      "key": "240_CR14",
      "doi-asserted-by": "crossref",
      "first-page": "395",
      "DOI": "10.1145/320986.320994",
      "volume": "6",
      "author": "P.C. Curtis",
      "year": "1959",
      "unstructured": "Curtis, P.C., Frank, W.L.: An algorithm for the determination of the polynomial of best minimax approximation to a function defined on a finite point set. J. ACM 6, 395\u2013404 (1959)",
      "journal-title": "J. ACM"
    },
    {
      "key": "240_CR15",
      "volume-title": "Interpolation and Approximation",
      "author": "P.J. Davis",
      "year": "1975",
      "unstructured": "Davis, P.J.: Interpolation and Approximation. Dover, New York (1975)"
    },
    {
      "key": "240_CR16",
      "doi-asserted-by": "crossref",
      "first-page": "47",
      "DOI": "10.1137/0903004",
      "volume": "3",
      "author": "C. Boor de",
      "year": "1982",
      "unstructured": "de Boor, C., Rice, J.R.: Extremal polynomials with application to Richardson iteration for indefinite linear systems. SIAM J. Sci. Stat. Comput. 3, 47\u201357 (1982)",
      "journal-title": "SIAM J. Sci. Stat. Comput."
    },
    {
      "key": "240_CR17",
      "unstructured": "de\u00a0la Vall\u00e9e Poussin, C.J.: Sur les polynomes d\u2019approximation et la repr\u00e9sentation approch\u00e9e d\u2019un angle. Acad. R. Belg., Bull. Cl. Sci. 12 (1910)"
    },
    {
      "issue": "1",
      "key": "240_CR18",
      "doi-asserted-by": "crossref",
      "first-page": "21",
      "DOI": "10.1145/355984.355987",
      "volume": "8",
      "author": "C.B. Dunham",
      "year": "1982",
      "unstructured": "Dunham, C.B.: Choice of basis for Chebyshev approximation. ACM Trans. Math. Softw. 8(1), 21\u201325 (1982)",
      "journal-title": "ACM Trans. Math. Softw."
    },
    {
      "issue": "11",
      "key": "240_CR19",
      "doi-asserted-by": "crossref",
      "first-page": "737",
      "DOI": "10.1145/362854.362890",
      "volume": "14",
      "author": "G.H. Golub",
      "year": "1971",
      "unstructured": "Golub, G.H., Smith, L.B.: Algorithm 414: Chebyshev approximation of continuous functions by a Chebyshev system of functions. Commun. ACM 14(11), 737\u2013746 (1971)",
      "journal-title": "Commun. ACM"
    },
    {
      "key": "240_CR20",
      "doi-asserted-by": "crossref",
      "first-page": "61",
      "DOI": "10.1093/qmath/12.1.61",
      "volume": "12",
      "author": "I.J. Good",
      "year": "1961",
      "unstructured": "Good, I.J.: The colleague matrix, a Chebyshev analogue of the companion matrix. Q. J. Math. 12, 61\u201368 (1961)",
      "journal-title": "Q. J. Math."
    },
    {
      "key": "240_CR21",
      "doi-asserted-by": "crossref",
      "first-page": "358",
      "DOI": "10.1137/0719022",
      "volume": "19",
      "author": "M.H. Gutknecht",
      "year": "1982",
      "unstructured": "Gutknecht, M.H., Trefethen, L.N.: Real polynomial Chebyshev approximation by the Carath\u00e9odory-Fej\u00e9r method. SIAM J. Numer. Anal. 19, 358\u2013371 (1982)",
      "journal-title": "SIAM J. Numer. Anal."
    },
    {
      "key": "240_CR22",
      "doi-asserted-by": "crossref",
      "DOI": "10.1137/1.9780898718027",
      "volume-title": "Accuracy and Stability of Numerical Algorithms",
      "author": "N.J. Higham",
      "year": "2002",
      "unstructured": "Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia (2002)",
      "edition": "2"
    },
    {
      "key": "240_CR23",
      "doi-asserted-by": "crossref",
      "first-page": "547",
      "DOI": "10.1093/imanum/24.4.547",
      "volume": "24",
      "author": "N.J. Higham",
      "year": "2004",
      "unstructured": "Higham, N.J.: The numerical stability of barycentric Lagrange interpolation. IMA J. Numer. Anal. 24, 547\u2013556 (2004)",
      "journal-title": "IMA J. Numer. Anal."
    },
    {
      "key": "240_CR24",
      "doi-asserted-by": "crossref",
      "first-page": "1273",
      "DOI": "10.1002/nme.1620170810",
      "volume": "17",
      "author": "E.H. Kaufman Jr.",
      "year": "1981",
      "unstructured": "Kaufman, Jr., E.H., Leeming, D.J., Taylor, G.D.: Uniform rational approximation by differential correction and Remes-differential correction. Int. J. Numer. Methods Eng. 17, 1273\u20131278 (1981)",
      "journal-title": "Int. J. Numer. Methods Eng."
    },
    {
      "key": "240_CR25",
      "doi-asserted-by": "crossref",
      "first-page": "1858\u20131877",
      "DOI": "10.1137/S0036142998339519",
      "volume": "36",
      "author": "B. Bailly Le",
      "year": "1999",
      "unstructured": "Le Bailly, B., Thiran, J.P.: Computing complex polynomial Chebyshev approximants on the unit circle by the real Remez algorithm. SIAM J. Numer. Anal. 36, 1858\u20131877 (1999)",
      "journal-title": "SIAM J. Numer. Anal."
    },
    {
      "key": "240_CR26",
      "unstructured": "Lorentz, G.G.: Approximation of Functions. Holt, Rinehart and Winston (1966)"
    },
    {
      "key": "240_CR27",
      "unstructured": "MATLAB: User\u2019s Guide. The MathWorks Inc., Natick, Massachusetts"
    },
    {
      "key": "240_CR28",
      "doi-asserted-by": "crossref",
      "first-page": "82",
      "DOI": "10.1109/MSP.2005.1406492",
      "volume": "22",
      "author": "J.H. McClellan",
      "year": "2005",
      "unstructured": "McClellan, J.H., Parks, T.W.: A personal history of the Parks-McClellan algorithm. IEEE Signal Process. Mag. 22, 82\u201386 (2005)",
      "journal-title": "IEEE Signal Process. Mag."
    },
    {
      "key": "240_CR29",
      "doi-asserted-by": "crossref",
      "first-page": "506",
      "DOI": "10.1109/TAU.1973.1162525",
      "volume": "21",
      "author": "J.H. McClellan",
      "year": "1973",
      "unstructured": "McClellan, J.H., Parks, T.W., Rabiner, L.R.: A computer program for designing optimum FIR linear phase digital filters. IEEE Trans. Audio Electroacoust. 21, 506\u2013526 (1973)",
      "journal-title": "IEEE Trans. Audio Electroacoust."
    },
    {
      "key": "240_CR30",
      "doi-asserted-by": "crossref",
      "DOI": "10.1007/978-3-642-85643-3",
      "volume-title": "Approximation of Functions: Theory and Numerical Methods",
      "author": "G. Meinardus",
      "year": "1967",
      "unstructured": "Meinardus, G.: Approximation of Functions: Theory and Numerical Methods. Springer, Heidelberg (1967)"
    },
    {
      "key": "240_CR31",
      "volume-title": "Fundamentals of Approximation Theory",
      "author": "H.N. Mhaskar",
      "year": "2000",
      "unstructured": "Mhaskar, H.N., Pai, D.V.: Fundamentals of Approximation Theory. Narosa Publishing House, New Delhi (2000)"
    },
    {
      "key": "240_CR32",
      "doi-asserted-by": "crossref",
      "first-page": "185",
      "DOI": "10.2307/2002711",
      "volume": "13",
      "author": "F.D. Murnaghan",
      "year": "1959",
      "unstructured": "Murnaghan, F.D., Wrench, J.W.: J.: The determination of the Chebyshev approximating polynomial for a differentiable function. Math. Tables Aids Comput. 13, 185\u2013193 (1959)",
      "journal-title": "Math. Tables Aids Comput."
    },
    {
      "key": "240_CR33",
      "unstructured": "NAG: Library, Manual. The Numerical Algorithms Group, Ltd., Oxford, UK"
    },
    {
      "key": "240_CR34",
      "unstructured": "Numerical Libraries, I.M.S.L.: Technical Documentation. Visual Numerics Inc., Houston"
    },
    {
      "key": "240_CR35",
      "doi-asserted-by": "crossref",
      "unstructured": "Pach\u00f3n, R., Platte, R., Trefethen, L.N.: Piecewise smooth chebfuns. IMA J. Numer. Anal. (to appear)",
      "DOI": "10.1093/imanum/drp008"
    },
    {
      "key": "240_CR36",
      "doi-asserted-by": "crossref",
      "first-page": "189",
      "DOI": "10.1109/TCT.1972.1083419",
      "volume": "19",
      "author": "T.W. Parks",
      "year": "1972",
      "unstructured": "Parks, T.W., McClellan, J.H.: Chebyshev approximation for nonrecursive digital filters with linear phase. IEEE Trans. Circuit Theory 19, 189\u2013194 (1972)",
      "journal-title": "IEEE Trans. Circuit Theory"
    },
    {
      "key": "240_CR37",
      "doi-asserted-by": "crossref",
      "DOI": "10.1017/CBO9781139171502",
      "volume-title": "Approximation Theory and Methods",
      "author": "M.J.D. Powell",
      "year": "1981",
      "unstructured": "Powell, M.J.D.: Approximation Theory and Methods. Cambridge University Press, Cambridge (1981)"
    },
    {
      "key": "240_CR38",
      "doi-asserted-by": "crossref",
      "first-page": "121",
      "DOI": "10.1137/1010029",
      "volume": "10",
      "author": "P. Rabinowitz",
      "year": "1968",
      "unstructured": "Rabinowitz, P.: Applications of linear programming to numerical analysis. SIAM Rev. 10, 121\u2013159 (1968)",
      "journal-title": "SIAM Rev."
    },
    {
      "key": "240_CR39",
      "first-page": "337",
      "volume": "199",
      "author": "E. Remes",
      "year": "1934",
      "unstructured": "Remes, E.: Sur le calcul effectif des polynomes d\u2019approximation de Tchebychef. C. R. Acad. Sci. 199, 337\u2013340 (1934)",
      "journal-title": "C. R. Acad. Sci."
    },
    {
      "key": "240_CR40",
      "first-page": "2063",
      "volume": "198",
      "author": "E. Remes",
      "year": "1934",
      "unstructured": "Remes, E.: Sur un proc\u00e9d\u00e9 convergent d\u2019approximations successives pour d\u00e9terminer les polynomes d\u2019approximation. C. R. Acad. Sci. 198, 2063\u20132065 (1934)",
      "journal-title": "C. R. Acad. Sci."
    },
    {
      "key": "240_CR41",
      "unstructured": "Remes, E.: Sur la d\u00e9termination des polynomes d\u2019approximation de degr\u00e9 donn\u00e9e. Commun. Soc. Math. Kharkov 10 (1934)"
    },
    {
      "key": "240_CR42",
      "volume-title": "The Approximation of Functions, vol.\u00a01",
      "author": "J.R. Rice",
      "year": "1964",
      "unstructured": "Rice, J.R.: The Approximation of Functions, vol.\u00a01. Addison-Wesley, Reading (1964)"
    },
    {
      "issue": "3",
      "key": "240_CR43",
      "doi-asserted-by": "crossref",
      "first-page": "381",
      "DOI": "10.1145/356044.356055",
      "volume": "9",
      "author": "F.W. Sauer",
      "year": "1983",
      "unstructured": "Sauer, F.W.: Algorithm 604: A FORTRAN program for the calculation of an extremal polynomial. ACM Trans. Math. Softw. 9(3), 381\u2013383 (1983)",
      "journal-title": "ACM Trans. Math. Softw."
    },
    {
      "key": "240_CR44",
      "doi-asserted-by": "crossref",
      "first-page": "355",
      "DOI": "10.1145/362588.362600",
      "volume": "14",
      "author": "H. Schmitt",
      "year": "1971",
      "unstructured": "Schmitt, H.: Algorithm 409, discrete Chebychev curve fit. Commun. ACM 14, 355\u2013356 (1971)",
      "journal-title": "Commun. ACM"
    },
    {
      "key": "240_CR45",
      "doi-asserted-by": "crossref",
      "first-page": "95",
      "DOI": "10.1145/355666.355674",
      "volume": "2",
      "author": "J.C. Simpson",
      "year": "1976",
      "unstructured": "Simpson, J.C.: Fortran translation of algorithm 409, Discrete Chebychev curve fit. ACM Trans. Math. Softw. 2, 95\u201397 (1976)",
      "journal-title": "ACM Trans. Math. Softw."
    },
    {
      "key": "240_CR46",
      "doi-asserted-by": "crossref",
      "first-page": "201",
      "DOI": "10.1002/mana.19600210307",
      "volume": "21",
      "author": "W. Specht",
      "year": "1960",
      "unstructured": "Specht, W.: Die Lage der Nullstellen eines Polynoms,\u00a0IV. Math. Nachr. 21, 201\u2013222 (1960)",
      "journal-title": "Math. Nachr."
    },
    {
      "key": "240_CR47",
      "volume-title": "The History of Approximation Theory: From Euler to Bernstein",
      "author": "K.G. Steffens",
      "year": "2006",
      "unstructured": "Steffens, K.G.: The History of Approximation Theory: From Euler to Bernstein. Birkh\u00e4user, Boston (2006)"
    },
    {
      "key": "240_CR48",
      "first-page": "217",
      "volume-title": "On Numerical Approximation",
      "author": "E.L. Stiefel",
      "year": "1959",
      "unstructured": "Stiefel, E.L.: Numerical methods of Tchebycheff approximation. In: Langer, R. (ed.) On Numerical Approximation, pp. 217\u2013232. University of Wisconsin Press, Madison (1959)"
    },
    {
      "key": "240_CR49",
      "doi-asserted-by": "crossref",
      "unstructured": "Taylor, R., Totik, V.: Lebesgue constants for Leja points. IMA J. Numer. Anal. (to appear)",
      "DOI": "10.1093/imanum/drn082"
    },
    {
      "key": "240_CR50",
      "series-title": "Lect. Notes in Math.",
      "volume-title": "Rational Approximation and Interpolation",
      "author": "L.N. Trefethen",
      "year": "1984",
      "unstructured": "Trefethen, L.N.: Square blocks and equioscillation in the Pad\u00e9, Walsh, and CF tables. In: Graves-Morris, P., Saff, E., Varga, R. (eds.) Rational Approximation and Interpolation. Lect. Notes in Math., vol.\u00a01105. Springer, Berlin (1984)"
    },
    {
      "key": "240_CR51",
      "doi-asserted-by": "crossref",
      "DOI": "10.1137/1.9780898719598",
      "volume-title": "Spectral Methods in MATLAB",
      "author": "L.N. Trefethen",
      "year": "2000",
      "unstructured": "Trefethen, L.N.: Spectral Methods in MATLAB. SIAM, Philadelphia (2000)"
    },
    {
      "key": "240_CR52",
      "doi-asserted-by": "crossref",
      "first-page": "333",
      "DOI": "10.1007/BF01890040",
      "volume": "1",
      "author": "R.S. Varga",
      "year": "1985",
      "unstructured": "Varga, R.S., Carpenter, A.J.: On the Bernstein conjecture in approximation theory. Constr. Approx. 1, 333\u2013348 (1985)",
      "journal-title": "Constr. Approx."
    },
    {
      "key": "240_CR53",
      "doi-asserted-by": "crossref",
      "first-page": "99",
      "DOI": "10.1007/BF01386215",
      "volume": "2",
      "author": "L. Veidinger",
      "year": "1960",
      "unstructured": "Veidinger, L.: On the numerical determination of the best approximation in the Chebyshev sense. Numer. Math. 2, 99\u2013105 (1960)",
      "journal-title": "Numer. Math."
    }
  ],
  "container-title": "BIT Numerical Mathematics",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "http://link.springer.com/content/pdf/10.1007/s10543-009-0240-1.pdf",
      "content-type": "application/pdf",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "http://link.springer.com/article/10.1007/s10543-009-0240-1/fulltext.html",
      "content-type": "text/html",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "http://link.springer.com/content/pdf/10.1007/s10543-009-0240-1",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2019,
        5,
        31
      ]
    ],
    "date-time": "2019-05-31T11:37:28Z",
    "timestamp": 1559302648000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "http://link.springer.com/10.1007/s10543-009-0240-1"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        2009,
        10,
        10
      ]
    ]
  },
  "references-count": 53,
  "journal-issue": {
    "issue": "4",
    "published-print": {
      "date-parts": [
        [
          2009,
          12
        ]
      ]
    }
  },
  "alternative-id": [
    "240"
  ],
  "URL": "http://dx.doi.org/10.1007/s10543-009-0240-1",
  "relation": {},
  "ISSN": [
    "0006-3835",
    "1572-9125"
  ],
  "subject": [],
  "container-title-short": "Bit Numer Math",
  "published": {
    "date-parts": [
      [
        2009,
        10,
        10
      ]
    ]
  }
}