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

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

Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem

Censor, Yair, Elfving, Tommy · 2002 · SIAM Journal on Matrix Analysis and Applications

Abstract

We formulate a block-iterative algorithmic scheme for the solution of systems of linear inequalities and/or equations and analyze its convergence. This study provides as special cases proofs of convergence of (i) the recently proposed component averaging (CAV) method of Censor, Gordon, and Gordon [Parallel Comput., 27 (2001), pp. 777--808], (ii) the recently proposed block-iterative CAV (BICAV) method of the same authors [IEEE Trans. Medical Imaging, 20 (2001), pp. 1050--1060], and (iii) the simultaneous algebraic reconstruction technique (SART) of Andersen and Kak [Ultrasonic Imaging, 6 (1984), pp. 81--94] and generalizes them to linear inequalities. The first two algorithms are projection algorithms which use certain generalized oblique projections and diagonal weighting matrices which reflect the sparsity of the underlying matrix of the linear system. The previously reported experimental acceleration of the initial behavior of CAV and BICAV is thus complemented here by a mathematical study of the convergence of the algorithms.

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.1137/s089547980138705x

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

Cited by

See all 162

Metadata

Authors
Censor, Y., & Elfving, T.
Venue
SIAM Journal on Matrix Analysis and Applications
Published
2002-01
Volume
24
Issue
1
Pages
40-58
ISSN
  • 0895-4798 (ISSN-L)
  • 1095-7162
OpenAlex
W1965018134
Cited by
162
References
1
FWCI
6.07
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: Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem. https://app.cochat.ai/papers/10.1137/s089547980138705x
The paper
Censor, Y., & Elfving, T. (2002). Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/s089547980138705x

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.