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

The DOI matches its Crossref record.

Efficient recursive computation of molecular integrals over Cartesian Gaussian functions

Obara, S., Saika, A.·1986·The Journal of Chemical Physics

Abstract

Recurrence expressions are derived for various types of molecular integrals over Cartesian Gaussian functions by the use of the recurrence formula for three-center overlap integrals. A number of characteristics inherent in the recursive formalism allow an efficient scheme to be developed for molecular integral computations. With respect to electron repulsion integrals and their derivatives, the present scheme with a significant saving of computer time is found superior to other currently available methods. A long innermost loop incorporated in the present scheme facilitates a fast computation on a vector processing computer.

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.1063/1.450106

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 694

Metadata

Authors
Obara, S., & Saika, A.
Venue
The Journal of Chemical Physics
Published
1986-04-01
Volume
84
Issue
7
Pages
3963-3974
ISSN
  • 0021-9606 (ISSN-L)
  • 1089-7690
OpenAlex
W2029228724
Cited by
694
References
0
FWCI
4.69
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: Efficient recursive computation of molecular integrals over Cartesian Gaussian functions. https://app.cochat.ai/papers/10.1063/1.450106
The paper
Obara, S., & Saika, A. (1986). Efficient recursive computation of molecular integrals over Cartesian Gaussian functions. The Journal of Chemical Physics. https://doi.org/10.1063/1.450106

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.