Related work and references

M. J. D. Powell

doi:10.1017/CBO9781139171502.027

Appendix B - Related work and references

Published online by Cambridge University Press: 28 May 2018

M. J. D. Powell

Book contents

Get access

Summary

Many excellent books are published on approximation theory and methods. The general texts that are particularly valuable to the present work are the ones by Achieser [2], Cheney [35], Davis [50], Handscomb (ed.) [74], Hayes (ed.) [77], Hildebrand [78], Holland & Sahney [81], Lorentz [100], Rice [132] and [134], Rivlin [138] and Watson [161]. Detailed references and suggestions for further reading are given in this appendix.

Most of the theory in Chapter 1 is taken from Cheney [35] and from Rice [132]. If one prefers an introduction to approximation theory that shows the relations to functional analysis, then the paper by Buck [32] is recommended. We give further attention only in special cases to the interesting problem, mentioned at the end of Section 1.1, of investigating how well any member of B can be approximated from A; a more general study of this problem is in Lorentz [100] and in Vitushkin [160]. The development of the Polya algorithm, which is the subject of Exercise 1.10, into a useful computational procedure is considered by Fletcher, Grant & Hebden [57].

In Chapter 2, as in Chapter 1, much of the basic theory is taken from Cheney [35]. For a further study of convexity the book by Rockafellar [142] is recommended. Several excellent examples of the non-uniqueness of best approximation with respect to the 1- and the ∞-norms are given by Watson [161]. An interesting case of Exercise 2.1, namely when B is the space Rn and the unit ball {f:∥f∥≤1; f∈R} is a polyhedron, is considered by Anderson & Osborne [5].

The point of view in Chapter 3 that approximation algorithms can be regarded as operators is treated well by Cheney [35], and more advanced work on this subject can be found in Cheney & Price [37]. Several references to applications of Theorem 3.1 are given later, including properties of polynomial approximation operators that are defined by interpolation conditions.

Information

Type: Chapter
Information: Approximation Theory and Methods
, pp. 317 - 332

DOI: https://doi.org/10.1017/CBO9781139171502.027 [Opens in a new window]

Publisher: Cambridge University Press

Print publication year: 1981

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Book purchase

Temporarily unavailable

References

[1] N. N., Abdelmalek, ‘On the discrete linear L1 approximation and L1 solutions of overdetermined linear equations’, J. Approx. Theory, 11 (1974) 38–53.Google Scholar

[2] N. I., Achieser, Theory of Approximation (1947), translation published by Ungar, New York (1956).

[3] N. I., Achieser & M. G., Krein, ‘Best approximation of differentiable periodic functions by means of trigonometric sums’, Doklady Akad. Nauk SSSR, 15 (1937) 107–111.Google Scholar

[4] J. H., Ahlberg, E. N., Nilson & J. L., Walsh, The Theory of Splines and their Applications, Academic Press, New York (1967).Google Scholar

[5] D. H., Anderson & M. R., Osborne, ‘Discrete linear approximation problems in polyhedral norms’, Numer. Math., 26 (1976) 179–189.Google Scholar

[6] U., Ascher, ‘On the invariance of the interpolation points of the discrete L1 approximation’, J. Approx. Theory, 24 (1978) 83–91.Google Scholar

[7] I., Barrodale, ‘On computing best L1 approximations’, in Approximation Theory, ed. A., Talbot, Academic Press, London (1970).Google Scholar

[8] I., Barrodale, ‘Best rational approximation and strict quasi-convexity’, SIAMJ. Numer. Anal, 10 (1973) 8–12.Google Scholar

[9] I., Barrodale & C., Phillips, ‘Solution of an overdetermined system of linear equations in the Chebyshev norm’, ACM Trans. Math. Software, 1 (1975) 264–270.Google Scholar

[10] I., Barrodale, M. J. D., Powell & F. D. K., Roberts, ‘The differential correction algorithm for rational L1 approximation’, SIAM J. Numer. Anal, 9 (1972) 493–504.Google Scholar

[11] I., Barrodale & F. D. K., Roberts, ‘An improved algorithm for discrete L1 linear approximation’, SIAMJ. Numer. Anal, 10 (1973) 839–848.Google Scholar

[12] I., Barrodale & F. D. K., Roberts, ‘An efficient algorithm for discrete L1 linear approximation with linear constraints’, SIAMJ. Numer. Anal, 15 (1978) 603–611.Google Scholar

[13] I., Barrodale & A., Young, ‘Algorithms for best L1 and L∞ linear approximations on a discrete set’, Numer. Math., 8 (1966) 295–306.Google Scholar

[14] R. H., Bartels, A. R., Conn & J. W., Sinclair, ‘Minimization techniques for piecewise differentiable functions: the L1 solution to an overdetermined linear system’, SIAMJ. Numer. Anal, 15 (1978) 224–241.Google Scholar

[15] G., Birkhoff & C., de Boor, ‘Piecewise polynomial interpolation and approximation’, in Approximation of Functions, ed. H. L., Garabedian, Elsevier Publishing Co., Amsterdam (1965).Google Scholar

[16] G., Blanch, ‘On modified divided differences I’, Maths. of Comp., 8 (1954) 1–11.Google Scholar

[17] P., Bloomfield & W., Steiger, ‘Least absolute deviations curve-fitting’, SIAM Stat. Comp., in press.

[18] C., de Boor, ‘Bicubic spline interpolation’, J. of Maths, and Physics, 41 (1962) 212–218.Google Scholar

[19] C., de Boor, ‘On uniform approximation by splines’, J. Approx. Theory, 1 (1968) 219–235.Google Scholar

[20] C., de Boor, ‘On writing an automatic integration algorithm’, in Mathematical Software, ed. J. R., Rice, Academic Press, New York (1971).Google Scholar

[21] C., de Boor, ‘On calculating with B-splines’, Approx. Theory, 6 (1972) 50–62.Google Scholar

[22] C., de Boor, ‘A remark concerning perfect splines’, Bull. Amer. Math. Soc, 80 (1974) 724–727.Google Scholar

[23] C., de Boor, ‘On bounding spline interpolation’, Approx. Theory, 14 (1975) 191–203.Google Scholar

[24] C., de Boor, ‘On “best” interpolation’, J. Approx. Theory, 16 (1976) 28–42.Google Scholar

[25] C., de Boor, ‘Package for calculating with B-splines’, SIAM J. Numer. Anal, 14 (1977) 441–472.Google Scholar

[26] C., de Boor, A Practical Guide to Splines, Springer-Verlag, New York (1978).Google Scholar

[27] C., de Boor & G. J., Fix, ‘Spline approximation by quasi-interpolants’, Approx. Theory, 8 (1973) 19–45.Google Scholar

[28] C., de Boor & A., Pinkus, ‘Proof of the conjectures of Bernstein and Erdös concerning the optimal nodes for polynomial interpolation’, J. Approx. Theory, 24 (1978) 289–303.Google Scholar

[29] C., de Boor & J. R., Rice, ‘Least squares cubic spline approximation II – variable knots’, Report No. CSD TR 21, Purdue University, Indiana (1968).

[30] E. O., Brigham, The Fast Fourier Transform, Prentice-Hall, Englewood Cliffs, N.J. (1974).Google Scholar

[31] L., Brutman, ‘On the Lebesgue function for polynomial interpolation’, SIAM J. Numer. Anal., 15 (1978) 694–704.Google Scholar

[32] R. C., Buck, ‘Linear spaces and approximation theory’, in On Numerical Approximation, ed. R. E., Langer, University of Wisconsin Press, Madison (1959).Google Scholar

[33] B. A., Chalmers, ‘On the rate of convergence of discretization in Chebyshev approximation’, SIAM J. Numer. Anal., 15 (1978) 612–617.Google Scholar

[34] B. L., Chalmers & F. T., Metcalf, ‘On the computation of minimal projections from l[0,1] to pn[0,1]’, in Approximation Theory II, eds. G. G., Lorentz, C. K., Chui & L. L., Schumaker, Academic Press, New York (1976).Google Scholar

[35] E. W., Cheney, Introduction to Approximation Theory, McGraw-Hill, New York (1966).Google Scholar

[36] E. W., Cheney & H. L., Loeb, ‘On rational Chebyshev approximation’, Numer. Math., 4 (1962) 124–127.Google Scholar

[37] E. W., Cheney & K. H., Price, ‘Minimal projections’, in Approximation Theory, ed. A., Talbot, Academic Press, London (1970).Google Scholar

[38] C. W., Clenshaw, ‘A comparison of “best” polynomial approximations with truncated Chebyshev series expansions’, SIAM J. Numer. Anal., 1 (1964) 26–37.Google Scholar

[39] J. W., Cooley & J. W., Tukey, ‘An algorithm for the machine calculation of complex Fourier series’, Maths. of Comp., 19 (1965) 297–301.Google Scholar

[40] M. G., Cox, ‘The numerical evaluation of B-splines’, J. Inst. Maths. Applies., 10 (1972) 134–149.Google Scholar

[41] M. G., Cox, ‘An algorithm for spline interpolation’, J. Inst. Maths. Applies., 15 (1975) 95–108.Google Scholar

[42] M. G., Cox, ‘The numerical evaluation of a spline from its B-spline representation’, J. Inst. Maths. Applies., 21 (1978) 135–143.Google Scholar

[43] H. B., Curry & I. J., Schoenberg, ‘On Polya frequency functions IV. The fundamental spline functions and their limits’, J. dAnalyse Math., 17 (1966) 71–107.Google Scholar

[44] A. R., Curtis, ‘Theory and calculation of best rational approximations’, in Methods of Numerical Approximation, ed. D. C., Handscomb, Pergamon Press, Oxford (1966).Google Scholar

[45] A. R., Curtis, ‘The approximation of a function of one variable by cubic splines’, in Numerical Approximation to Functions and Data, ed. J. G., Hayes, The Athlone Press, London (1970).Google Scholar

[46] A. R., Curtis & M. R., Osborne, ‘The construction of minimax rational approximations to functions’, Computer Journal, 9 (1966) 286–293.Google Scholar

[47] A. R., Curtis & M. J. D., Powell, ‘Necessary conditions for a minimax approximation’, Computer Journal, 8 (1966) 358–361.Google Scholar

[48] A. R., Curtis & M. J. D., Powell, ‘On the convergence of exchange algorithms for calculating minimax approximations’, Computer Journal, 9 (1966) 78–80.Google Scholar

[49] P. C., Curtis & W. L., Frank, ‘An algorithm for the determination of the polynomial of best minimax approximation to a function defined on a finite point set’, J. Assoc. Comp. Mach., 6 (1959) 395–404.Google Scholar

[50] P. J., Davis, Interpolation and Approximation, Blaisdell Publishing Co., Waltham, Mass. (1963).Google Scholar

[51] C. B., Dunham, ‘Efficiency of Chebyshev approximation on finite subsets’, J. Assoc. Comp. Mach., 21 (1974) 311–313.Google Scholar

[52] C. B., Dunham, ‘Convergence of Stiefel's exchange method on an infinite set’, SIAMJ. Numer. Anal., 11 (1974) 729–731.Google Scholar

[53] D., Elliott, ‘The evaluation and estimation of the coefficients in the Chebyshev series expansion of a function’, Maths, of Comp., 18 (1964) 274–284.Google Scholar

[54] J., Favard, ‘Sur les meilleurs procédés d'approximation de certaines classes de fonctions par des polynomes trigonométriques’, Bull, des Sciences Math., 61 (1937) 209–224.Google Scholar

[55] S. D., Fisher, ‘Best approximation by polynomials’, J. Approx. Theory, 21 (1977) 43–59.Google Scholar

[56] S. D., Fisher & J. W., Jerome, ‘Perfect spline solutions to L∞x extremal problems’, J. Approx. Theory, 12 (1974) 78–90.Google Scholar

[57] R., Fletcher, J. A., Grant & M. D., Hebden, ‘Linear minimax approximation as the limit of best Lp-approximation’, SIAMJ. Numer. Anal., 11 (1974) 123–136.Google Scholar

[58] G. E., Forsythe, ‘Generation and use of orthogonal polynomials for data fitting with a digital computer’, SIAM Journal, 5 (1957) 74–88.Google Scholar

[59] L., Fox & I. B., Parker, Chebyshev Polynomials in Numerical Analysis, Oxford University Press, London (1968).Google Scholar

[60] W., Fraser, ‘Examples of best discrete L1, and L2 rational approximations’, J. Approx. Theory, 27 (1979) 249–253.Google Scholar

[61] P. W., Gaffney, ‘The calculation of indefinite integrals of B-splines’, J. Inst. Maths. Applies., 17 (1976) 37–41.Google Scholar

[62] P. W., Gaffney, ‘To compute the optimal interpolation formula’, Maths, of Comp., 32 (1978) 763–777.Google Scholar

[63] P. W., Gaffney & M. J. D., Powell, ‘Optimal interpolation’, in Numerical Analysis Dundee 1975, Lecture Notes in Mathematics No. 506, ed. G. A., Watson, Springer-Verlag, Berlin (1976).Google Scholar

[64] W., Gautschi, ‘The condition of polynomials in power form’, Maths, of Comp., 33 (1979) 343–352.Google Scholar

[65] P. E., Gill, G. H., Golub, W., Murray & M. A., Saunders, ‘Methods for modifying matrix factorizations’, Maths, of Comp., 28 (1974) 505–535.Google Scholar

[66] M., Golomb & H. F., Weinberger, ‘Optimal approximation and error bounds’, in On Numerical Approximation, ed. R. E., Langer, University of Wisconsin Press, Madison (1959).Google Scholar

[67] G. H., Golub, ‘Numerical methods for solving linear least squares problems’, Numer. Math., 7 (1965) 206–216.Google Scholar

[68] W. J., Gordon & R. F., Riesenfeld, ‘Bernstein-Bezier methods for the computer-aided design of free-form curves and surfaces’, J. Assoc. Comp. Mach., 21 (1974) 293–310.Google Scholar

[69] W. J., Gordon & R. F., Riesenfeld, ‘B-spline curves and surfaces’, in Computer Aided Geometric Design, eds. R. E., Barnhill & R. F., Riesenfeld, Academic Press, New York (1974).Google Scholar

[70] T. N. E., Greville, ‘Introduction to spline functions’, in Theory and Applications of Spline Functions, ed. T. N. E., Greville, Academic Press, New York (1969).Google Scholar

[71] C. A., Hall, ‘On error bounds for spline interpolation’, J. Approx. Theory, 1 (1968) 209–218.Google Scholar

[72] C. A., Hall, ‘Natural cubic and bicubic spline interpolation’, SIAMJ. Numer. Anal., 10 (1973) 1055–1060.Google Scholar

[73] C. A., Hall & W. W., Meyer, ‘Optimal error bounds for cubic spline interpolation’, J. Approx. Theory, 16 (1976) 105–122.Google Scholar

[74] D. C., Handscomb (ed.), Methods of Numerical Approximation, Pergamon Press, Oxford (1966).

[75] D. C., Handscomb, ‘Characterization of best spline approximations with free knots’, in Approximation Theory, ed. A., Talbot, Academic Press, London (1970).Google Scholar

[76] C., Hastings, Approximations for Digital Computers, Princeton University Press, Princeton (1955).Google Scholar

[77] J. G., Hayes (ed.), Numerical Approximation to Functions and Data, The Athlone Press, London (1970).

[78] F. B., Hildebrand, Introduction to Numerical Analysis, McGraw-Hill, New York (1956).Google Scholar

[79] C. R., Hobby & J. R., Rice, ‘A moment problem in L1 approximation’, Proc. Amer. Math. Soc., 16 (1965) 665–670.Google Scholar

[80] J. C., Holladay, ‘A smoothest curve approximation’, Maths, of Comp., 11 (1957) 233–243.Google Scholar

[81] A. S. B., Holland & B. N., Sahney, The General Problem of Approximation and Spline Functions, Krieger Publishing Co., Huntington, N.Y. (1979).Google Scholar

[82] D. L. B., Jupp, ‘Approximation to data by splines with free knots’, SIAM J. Numer. Anal., 15 (1978) 328–343.Google Scholar

[83] W. J., Kammerer & G. W., Reddien, ‘Local convergence of smooth cubic spline interpolates’, SIAM J. Numer. Anal., 9 (1972) 687–694.Google Scholar

[84] S., Karlin, ‘Interpolation properties of generalized perfect splines and the solutions of certain extremal problems’, Trans. Amer. Math. Soc, 206 (1975) 25–66.Google Scholar

[85] S., Karlin & W. J., Studden, Tchebyscheff Systems: with Applications in Analysis and Statistics, Interscience, New York (1966).Google Scholar

[86] E. H., Kaufman, D. L., Leeming & G. D., Taylor, ‘A combined Remes – differential correction algorithm for rational approximation’, Maths. of Comp., 32 (1978) 233–242.Google Scholar

[87] D., Kershaw, ‘A note on the convergence of interpolatory cubic splines’, SIAM J. Numer. Anal., 8 (1971) 67–74.Google Scholar

[88] D., Kershaw, ‘The orders of approximation of the first derivative of cubic splines at the knots’, Maths. of Comp., 26 (1972) 191–198.Google Scholar

[89] T. A., Kilgore, ‘A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm’, J. Approx. Theory, 24 (1978) 273–288.Google Scholar

[90] P., Kirchberger, ‘Uber Tchebychefsche annaherungsmethoden’, Math. Ann., 57 (1903) 509–540.Google Scholar

[91] D. G., Korn & J. L., Lambiotte, ‘Computing the Fast Fourier Transform on a vector computer’, Maths, of Comp., 33 (1979) 977–992.Google Scholar

[92] N. P., Korneichuk, ‘The exact constant in D. Jackson's theorem on best uniform approximation of continuous periodic functions’, Doklady Akad. Nauk SSSR, 145 (1962) 514–515.Google Scholar

[93] F. T., Krogh, ‘Efficient algorithms for polynomial interpolation and numerical differentiation’, Maths, of Comp., 24 (1970) 185–190.Google Scholar

[94] B., Lam & D., Elliott, ‘On a conjecture of C. W. Clenshaw’, SIAM J. Numer. Anal., 9 (1972) 44–52.Google Scholar

[95] C., Lanczos, Applied Analysis, Prentice-Hall, Englewood Cliffs, N.J. (1956).Google Scholar

[96] C., Lanczos, Discourse on Fourier Series, Oliver & Boyd, Edinburgh (1966).Google Scholar

[97] C. L., Lawson & R. J., Hanson, Solving Least Squares Problems, Prentice-Hall, Englewood Cliffs, N.J. (1974).Google Scholar

[98] C. M., Lee & F. D. K., Roberts, ‘A comparison of algorithms for rational L∞ approximation’, Maths, of Comp., 27 (1973) 111–121.Google Scholar

[99] G. G., Lorentz, Bernstein Polynomials, University of Toronto Press, Toronto (1953).Google Scholar

[100] G. G., Lorentz, Approximation of Functions, Holt, Rinehart & Winston, New York (1966).Google Scholar

[101] S. M., Lozinski, ‘On a class of linear operators’, Doklady Akad. Nauk SSSR, 61 (1948) 193–196.Google Scholar

[102] T. R., Lucas, ‘Error bounds for interpolating cubic splines under various nd conditions’, SIAMJ. Numer. Anal, 11 (1974) 569–584.Google Scholar

[103] T., Lyche & L. L., Schumaker, ‘Local spline approximation methods’, J. Approx. Theory, 15 (1975) 294–325.Google Scholar

[104] D. E., McClure, ‘Perfect spline solutions of L∞ extremal problems by control methods’, J. Approx. Theory, 15 (1975) 226–242.Google Scholar

[105] H. J., Maehly, ‘Methods for fitting rational approximations, Parts II and II’, J. Assoc. Comp. Mach., 10 (1963) 257–277.Google Scholar

[106] M. J., Marsden, ‘An identity for spline functions with applications to variation-diminishing spline approximation’, J. Approx. Theory, 3 (1970) 7–49.Google Scholar

[107] M. J., Marsden, ‘On uniform spline approximation’, J. Approx. Theory, 6 (1972) 249–253.Google Scholar

[108] M. J., Marsden, ‘Cubic spline interpolation of continuous functions’, J. Approx. Theory, 10 (1974) 103–111.Google Scholar

[109] M. J., Marsden, ‘Quadratic spline interpolation’, Bull. Amer. Math. Soc, 80 (1974) 903–906.Google Scholar

[110] D. F., Mayers, ‘Interpolation by rational functions’, in Methods of Numerical Approximation, ed. D. C., Handscomb, Pergamon Press, Oxford (1966).Google Scholar

[111] J., Meinguet, ‘On the solubility of the Cauchy interpolation problem’, in Approximation Theory, ed. A., Talbot, Academic Press, London (1970).Google Scholar

[112] J., Meinguet, ‘Optimal approximation and interpolation in normed spaces’, in Numerical Approximation to Functions and Data, ed. J. G., Hayes, The Athlone Press, London (1970).Google Scholar

[113] C. A., Micchelli, ‘Best Lx approximation by weak Chebyshev systems and the uniqueness of interpolating perfect splines’, J. Approx. Theory, 19 (1977)1–14.Google Scholar

[114] C. A., Micchelli, T. J., Rivlin & S., Winograd, ‘The optimal recovery of smooth functions’, Numer. Math., 26 (1976) 191–200.Google Scholar

[115] J. C. P., Miller, ‘Checking by differences I’, Maths, of Comp., 4 (1950) 3–11.Google Scholar

[116] F. D., Murnaghan & J. W., Wrench, ‘The determination of the Chebyshev approximating polynomial for a differentiable function’, Maths, of Comp., 13 (1959) 185–193.Google Scholar

[117] E., Neuman, ‘Bounds for the norm of certain spline projections’, J. Approx. Theory, 27 (1979) 135–145.

[118] G. P., Nevai, ‘Mean convergence of Lagrange interpolation, I’, J. Approx. Theory, 18 (1976) 363–377.

[119] G. M., Phillips, ‘Estimate of the maximum error in best polynomial approximations’, Computer Journal, 11 (1968) 110–111.

[120] A., Pinkus, ‘Some extremal properties of perfect splines and the pointwise Landau problem on the finite interval’, J. Approx. Theory, 23 (1978) 37–64.

[121] M. J. D., Powell, ‘On the maximum errors of polynomial approximations defined by interpolation and by least squares criteria’, Computer Journal, 9 (1967) 404–407.

[122] M. J. D., Powell, ‘On best L2 spline approximations’, in Numerische Mathematik, Differentialgleichungen, Approximationstheorie, Birkhäuser Verlag, Basel (1968).Google Scholar

[123] M. J. D., Powell, ‘A comparison of spline approximations with classical interpolation methods’, in Proceedings IFIP Congress, Edinburgh, 1968, North-Holland, Amsterdam (1969).Google Scholar

[124] M. J. D., Powell, ‘The local dependence of least squares cubic splines’, SIAM J. Numer. Anal., 6 (1969) 398–413.Google Scholar

[125] M. J. D., Powell, ‘Curve fitting by splines in one variable’, in Numerical Approximation to Functions and Data, ed. J. G., Hayes, The Athlone Press, London (1970).Google Scholar

[126] M. J. D., Powell & F. D. K., Roberts, ‘A discrete characterization theorem for the discrete L1 linear approximation problem’, J. Approx. Theory, in press.

[127] P. M., Prenter, Splines and Variational Methods, John Wiley & Sons Inc., New York (1975).Google Scholar

[128] T. E., Price, ‘Orthogonal polynomials for nonclassical weight functions’, SIAM J. Numer. Anal, 16 (1979) 999–1006.Google Scholar

[129] P., Rabinowitz, ‘Applications of linear programming to numerical analysis’, SIAM Review, 10 (1968) 121–159.Google Scholar

[130] G. U., Ramos, ‘Roundoff error analysis of the Fast Fourier Transform’, Maths, of Comp., 25 (1971) 757–768.Google Scholar

[131] J. K., Reid, ‘A note on the least squares solution of a band system of linear equations by Householder reductions’, Computer Journal, 10 (1967) 188–189.Google Scholar

[132] J. R., Rice, The Approximation of Functions: vol. 1, Linear Theory, Addison-Wesley Publishing Co., Reading, Mass. (1964).Google Scholar

[133] J. R., Rice, ‘Characterization of Chebyshev approximations by splines’, SIAM J. Numer. Anal, 4 (1967) 557–565.Google Scholar

[134] J. R., Rice, The Approximation of Functions: vol. 2, Nonlinear and Multivariate Theory, Addison-Wesley Publishing Co., Reading, Mass. (1969).Google Scholar

[135] J. R., Rice, ‘On the degree of convergence of nonlinear spline approximation’, in Approximation with Special Emphasis on Spline Functions, ed. I. J., Schoenberg, Academic Press, New York (1969).Google Scholar

[136] F., Richards, ‘The Lebesgue constants for cardinal spline interpolation’, J. Approx. Theory, 14 (1975) 83–92.Google Scholar

[137] R. D., Riess & L. W., Johnson, ‘Errors in interpolating functions at the zeros of T+1(x)’, SIAM J. Numer. Anal., 11 (1974) 244–253.Google Scholar

[138] T. J., Rivlin, An Introduction to the Approximation of Functions, Blaisdell Publishing Co., Waltham, Mass. (1969).Google Scholar

[139] T. J., Rivlin, The Chebyshev Polynomials, John Wiley & Sons Inc., New York (1974).Google Scholar

[140] T. J., Rivlin & E. W., Cheney, ‘A comparison of uniform approximations on an interval and a finite subset thereof’, SIAM J. Numer. Anal., 3 (1966) 311–320.Google Scholar

[141] T. J., Rivlin & H. S., Shapiro, ‘A unified approach to certain problems of approximation and minimization’, SIAM Journal, 9 (1961) 670–699.Google Scholar

[142] R. T., Rockafellar, Convex Analysis, Princeton University Press, Princeton (1970).Google Scholar

[143] I. J., Schoenberg, ‘On variation diminishing approximation methods’, in On Numerical Approximation, ed. R. E., Langer, University of Wisconsin Press, Madison (1959).Google Scholar

[144] I. J., Schoenberg, ‘On interpolation by spline functions and its minimal properties’, in On Approximation Theory, eds. P. L., Butzer & J., Korevaar, Birkhäuser Verlag, Stuttgart (1964).Google Scholar

[145] I. J., Schoenberg, ‘Spline interpolation and best quadrature formulae’, Bull. Amer. Math. Soc, 70 (1964) 143–148.Google Scholar

[146] I. J., Schoenberg, ‘Spline interpolation and the higher derivatives’, Proc. Nat. Acad. Sci. U.S.A., 51 (1964) 24–28.Google Scholar

[147] I. J., Schoenberg, ‘On spline functions’, in Inequalities, ed. O., Shisha, Academic Press, New York (1967).Google Scholar

[148] I. J., Schoenberg, ‘Monosplines and quadrature formulae’, in Theory and Applications of Spline Functions, ed. T. N. E., Greville, Academic Press, New York (1969).Google Scholar

[149] I. J., Schoenberg, Cardinal Spline Interpolation, Regional Conference Series in Applied Mathematics No. 12, SIAM, Philadelphia (1973).Google Scholar

[150] I. J., Schoenberg & A., Whitney, ‘On Polya frequency functions, III. The positivity of translation determinants with an application to the interpolation problem by spline curves’, Trans. Amer. Math. Soc, 74 (1953) 246–259.Google Scholar

[151] M. H., Schultz, Spline Analysis, Prentice-Hall, Englewood Cliffs, N.J. (1973).Google Scholar

[152] L. L., Schumaker, ‘Zeros of spline functions and applications’, J. Approx. Theory, 18 (1976) 152–168.Google Scholar

[153] M. A., Snyder, Chebyshev Methods in Numerical Approximation, Prentice-Hall, Englewood Cliffs, N.J. (1966).Google Scholar

[154] D. D., Stancu, ‘Evaluation of the remainder term in approximation formulas by Bernstein polynomials’, Maths, of Comp., 17 (1963) 270–278.Google Scholar

[155] J. F., Steffensen, Interpolation, Chelsea Publishing Co., New York (1927).Google Scholar

[156] E. L., Stiefel, ‘Numerical methods of Tchebycheff approximation’, in On Numerical Approximation, ed. R. E., Langer, University of Wisconsin Press, Madison (1959).Google Scholar

[157] G., Szego, Orthogonal Polynomials, Amer. Math. Soc. Colloquium Publications, No. 23 (1939).Google Scholar

[158] A., Talbot, ‘The uniform approximation of polynomials by polynomials of lower degree’, J. Approx. Theory, 17 (1976) 254–279.Google Scholar

[159] L., Veidinger, ‘On the numerical determination of the best approximations in the Chebyshev sense’, Numer. Math., 2 (1960) 99–105.Google Scholar

[160] A. G., Vitushkin, Theory of the Transmission and Processing of Information (transl.), Pergamon Press, Oxford (1961).Google Scholar

[161] G. A., Watson, Approximation Theory and Numerical Methods, John Wiley & Sons, Chichester (1980).Google Scholar

[162] H., Werner, J., Stoer & W., Bommas, ‘Rational Chebyshev approximation’, Numer. Math., 10 (1967) 289–306.Google Scholar

[163] S., Winograd, ‘On computing the discrete Fourier transform’, Maths, of Comp., 32 (1978) 175–199.Google Scholar

[164] P., Wolfe, ‘The composite simplex algorithm’, SIAM Review, 7 (1965) 42–54.Google Scholar

[165] L., Wuytack, ‘On some aspects of the rational interpolation problem’, SIAMJ. Numer. Anal., 11 (1974) 52–60.Google Scholar

Accessibility standard: Unknown

Why this information is here

This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

Accessibility Information

Accessibility compliance for the PDF of this chapter is currently unknown and may be updated in the future.