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

The DOI matches its Crossref record.

Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3]

Open access
Swarztrauber, Paul N., Sweet, Roland A.·1979·ACM Transactions on Mathematical Software

Abstract

article Free AccessArtifacts AvailableArtifacts Evaluated & Reusable Share on Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3] Authors: Paul N. Swarztrauber National Center for Atmospheric Research, P.O. Box 3000, Boulder, CO National Center for Atmospheric Research, P.O. Box 3000, Boulder, COView Profile , Roland A. Sweet University of Colorado at Denver, Denver, CO University of Colorado at Denver, Denver, COView Profile Authors Info & Claims ACM Transactions on Mathematical SoftwareVolume 5Issue 3Sept. 1979 pp 352–364https://doi.org/10.1145/355841.355850Online:01 September 1979Publication History 144citation1,683DownloadsMetricsTotal Citations144Total Downloads1,683Last 12 Months39Last 6 weeks7 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

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.

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

Integrity signals

Registry

Crossref · 10.1145/355841.355850

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.

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 233

Metadata

Authors
Swarztrauber, P. N., & Sweet, R. A.
Venue
ACM Transactions on Mathematical Software
Published
1979-09
Volume
5
Issue
3
Pages
352-364
ISSN
  • 0098-3500 (ISSN-L)
  • 1557-7295
OpenAlex
W2061323261
Cited by
233
References
0
FWCI
8.39
Type
journal article
Language
en
Open access
bronze

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: Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3]. https://app.cochat.ai/papers/10.1145/355841.355850
The paper
Swarztrauber, P. N., & Sweet, R. A. (1979). Algorithm 541: Efficient Fortran Subprograms for the Solution of Separable Elliptic Partial Differential Equations [D3]. ACM Transactions on Mathematical Software. https://doi.org/10.1145/355841.355850

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.