The DOI matches its Crossref record.
Introduction to Approximation Theory
Abstract
Introduction: 1 Examples and prospectus 2 Metric spaces 3 Normed linear spaces 4 Inner-product spaces 5 Convexity 6 Existence and unicity of best approximations 7 Convex functions The Tchebycheff Solution of Inconsistent Linear Equations: 1 Introduction 2 Systems of equations with one unknown 3 Characterization of the solution 4 The special case 5 Polya's algorithm 6 The ascent algorithm 7 The descent algorithm 8 Convex programming Tchebycheff Approximation by Polynomials and Other Linear Families: 1 Introduction 2 Interpolation 3 The Weierstrass theorem 4 General linear families 5 the unicity problem 6 Discretization errors: General theory 7 Discretization: Algebraic polynomials. The inequalities of Markoff and Bernstein 8 Algorithms Least-squares Approximation and Related Topics: 1 Introduction 2 Orthogonal systems of polynomials 3 Convergence of orthogonal expansions 4 Approximation by series of Tchebycheff polynomials 5 Discrete least-squares approximation 6 The Jackson theorems Rational Approximation: 1 Introduction 2 Existence of best rational approximations 3 The characterization of best approximations 4 Unicity Continuity of best-approximation operators 5 Algorithms 6 Pade Approximation and its generalizations 7 Continued fractions Some Additional Topics: 1 The Stone approximation theorem 2 The Muntz theorem 3 The converses of the Jackson theorems 4 Polygonal approximation and bases in $C[a, b]$ 5 The Kharshiladze-Lozinski theorems 6 Approximation in the mean Notes References Index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Wavelets on graphs via spectral graph theory
Hammond, D. K., Vandergheynst, P., & Gribonval, R. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.04.005 · Cited by 2,171
Wavelets and filter banks: theory and design
Vetterli, M., & Herley, C. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.157221 · Cited by 1,690
A computer program for designing optimum FIR linear phase digital filters
McClellan, J., Parks, T., & Rabiner, L. (1973) · IEEE Transactions on Audio and Electroacoustics · doi:10.1109/tau.1973.1162525 · Cited by 1,139
Electronic structure based on the local atomic environment for tight-binding bands
Haydock, R., Heine, V, & Kelly, M. J. (1972) · Journal of Physics C: Solid State Physics · doi:10.1088/0022-3719/5/20/004 · Cited by 1,137
Weiße, A., Wellein, G., Alvermann, A., & Fehske, H. (2006) · Reviews of Modern Physics · doi:10.1103/revmodphys.78.275 · Cited by 1,036
Networks and the best approximation property
Girosi, F., & Poggio, T. (1990) · Biological Cybernetics · doi:10.1007/bf00195855 · Cited by 888
Approximation Theory and Methods.
Wahlbin, L. B., & Powell, M. J. D. (1982) · Mathematics of Computation · doi:10.2307/2007351 · Cited by 805
Conjugate Gradient Methods for Toeplitz Systems
Chan, R. H., & Ng, M. K. (1996) · SIAM Review · doi:10.1137/s0036144594276474 · Cited by 801
Chebyshev Approximation for Nonrecursive Digital Filters with Linear Phase
Parks, T., & McClellan, J. (1972) · IEEE Transactions on Circuit Theory · doi:10.1109/tct.1972.1083419 · Cited by 772
Childs, A. M., Kothari, R., & Somma, R. D. (2017) · SIAM Journal on Computing · doi:10.1137/16m1087072 · Cited by 646
Transmit beamforming for MIMO radar systems using signal cross-correlation
Fuhrmann, D. R., & San Antonio, G. (2008) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2008.4516997 · Cited by 567
The Bernstein polynomial basis: A centennial retrospective
Farouki, R. T. (2012) · Computer Aided Geometric Design · doi:10.1016/j.cagd.2012.03.001 · Cited by 506
A dual algorithm for the constrained shortest path problem
Handler, G. Y., & Zang, I. (1980) · Networks · doi:10.1002/net.3230100403 · Cited by 457
FIR digital filter design techniques using weighted Chebyshev approximation
Rabiner, L. R., McClellan, J. H., & Parks, T. W. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9794 · Cited by 350
Generalized polynomial approximations in Markovian decision processes
Schweitzer, P. J., & Seidmann, A. (1985) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(85)90317-8 · Cited by 330
On the numerical evaluation of Fredholm determinants
Bornemann, F. (2009) · Mathematics of Computation · doi:10.1090/s0025-5718-09-02280-7 · Cited by 281
A unified approach to the design of optimum FIR linear-phase digital filters
McClellan, J., & Parks, T. (1973) · IEEE Transactions on Circuit Theory · doi:10.1109/tct.1973.1083764 · Cited by 269
Metadata
- Authors
- Rivlin, T., & Cheney, E. W.
- Venue
- Mathematics of Computation
- Publisher
- JSTOR
- Published
- 1969-04
- Volume
- 23
- Issue
- 106
- Pages
- 443
- ISSN
- 0025-5718 (ISSN-L)
- OpenAlex
- W2144181355
- Cited by
- 2,035
- References
- 0
- FWCI
- 51.71
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.