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

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

Some large-scale matrix computation problems

Open access
Bai, Zhaojun, Fahey, Gark, Golub, Gene · 1996 · Journal of Computational and Applied Mathematics

Abstract

There are numerous applications in physics, statistics and electrical circuit simulation where it is required to bound entries and the trace of the inverse and the determinant of a large sparse matrix. All these computational tasks are related to the central mathematical problem studied in this paper, namely, bounding the bilinear form uTf(A)v for a given matrix A and vectors u and v, where f is a given smooth function and is defined on the spectrum of A. We will study a practical numerical algorithm for bounding the bilinear form, where the matrix A is only referenced through matrix-vector multiplications. A Monte Carlo method is also presented to efficiently estimate the trace of the inverse and the determinant of a large sparse matrix.

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.1016/0377-0427(96)00018-0

Cites

1 of 1 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 1 references

Cited by

See all 195

Metadata

Authors
Bai, Z., Fahey, G., & Golub, G.
Venue
Journal of Computational and Applied Mathematics
Publisher
Elsevier BV
Published
1996-11
Volume
74
Issue
1-2
Pages
71-89
ISSN
0377-0427 (ISSN-L)
OpenAlex
W2130152237
Cited by
195
References
1
FWCI
7.21
Type
journal article
Language
en
Open access
hybrid

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: Some large-scale matrix computation problems. https://app.cochat.ai/papers/10.1016/0377-0427(96)00018-0
The paper
Bai, Z., Fahey, G., & Golub, G. (1996). Some large-scale matrix computation problems. Journal of Computational and Applied Mathematics. https://doi.org/10.1016/0377-0427(96)00018-0

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.