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

The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.

Stochastic Runge-Kutta algorithms. I. White noise

Honeycutt, Rebecca L.·1992·Physical Review A

Abstract

A higher-order algorithm for the numerical integration of one-variable, additive, white-noise equations is developed. The method of development is to extend standard deterministic Runge-Kutta algorithms to include stochastic terms. The ability of the algorithm to generate proper correlation properties is tested on the Ornstein-Uhlenbeck process, showing higher accuracy even with longer step size.

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.1103/physreva.45.600

Cites

7 of 7 references verified0 citation errors · 0 not checkable

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

Cites

Show all 7 references

Cited by

See all 468

Metadata

Authors
Honeycutt, R. L.
Venue
Physical Review A
Published
1992-01-01
Volume
45
Issue
2
Pages
600-603
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2033755632
Cited by
468
References
7
FWCI
4.39
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Stochastic Runge-Kutta algorithms. I. White noise. https://app.cochat.ai/papers/10.1103/physreva.45.600
The paper
Honeycutt, R. L. (1992). Stochastic Runge-Kutta algorithms. I. White noise. Physical Review A. https://doi.org/10.1103/physreva.45.600

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.