Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 186

The DOI matches its Crossref record.

Fourth Order Chebyshev Methods with Recurrence Relation

Open access
Abdulle, Assyr · 2002 · SIAM Journal on Scientific Computing

Abstract

In this paper, a new family of fourth order Chebyshev methods (also called stabilized methods) is constructed. These methods possess nearly optimal stability regions along the negative real axis and a three-term recurrence relation. The stability properties and the high order make them suitable for large stiff problems, often space discretization of parabolic PDEs. A new code ROCK4 is proposed, illustrated at several examples, and compared to existing programs.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s1064827500379549

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 186

Metadata

Authors
Abdulle, A.
Venue
SIAM Journal on Scientific Computing
Published
2002-01
Volume
23
Issue
6
Pages
2041-2054
ISSN
  • 1064-8275 (ISSN-L)
  • 1095-7197
OpenAlex
W2053909454
Cited by
186
References
0
FWCI
9.35
Type
journal article
Language
en
Open access
green

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: Fourth Order Chebyshev Methods with Recurrence Relation. https://app.cochat.ai/papers/10.1137/s1064827500379549
The paper
Abdulle, A. (2002). Fourth Order Chebyshev Methods with Recurrence Relation. SIAM Journal on Scientific Computing. https://doi.org/10.1137/s1064827500379549

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.