The DOI matches its Crossref record.
Approximation of Functions: Theory and Numerical Methods
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Hamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · Quantum · doi:10.22331/q-2019-07-12-163 · Cited by 854
A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
Burke, J. V., Lewis, A. S., & Overton, M. L. (2005) · SIAM Journal on Optimization · doi:10.1137/030601296 · Cited by 453
Decay rates for inverses of band matrices
Demko, S., Moss, W. F., & Smith, P. W. (1984) · Mathematics of Computation · doi:10.1090/s0025-5718-1984-0758197-9 · Cited by 384
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
Crest-factor minimization using nonlinear Chebyshev approximation methods
Guillaume, P., Schoukens, J., Pintelon, R., & Kollar, I. (1991) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/19.119778 · Cited by 262
Metadata
- Authors
- Meinardus, G.
- Venue
- Springer Tracts in Natural Philosophy
- Publisher
- Springer Berlin Heidelberg
- Published
- 1967
- ISSN
- 0081-3877 (ISSN-L)
- OpenAlex
- W1981674498
- Cited by
- 493
- References
- 0
- FWCI
- 4.43
- Type
- book
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Approximation of Functions: Theory and Numerical Methods. https://app.cochat.ai/papers/10.1007/978-3-642-85643-3
- The paper
- Meinardus, G. (1967). Approximation of Functions: Theory and Numerical Methods. Springer Tracts in Natural Philosophy. https://doi.org/10.1007/978-3-642-85643-3
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.