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

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

Fast linear iterations for distributed averaging

Lin Xiao, Boyd, S.·2004·42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)

Abstract

We consider the problem of finding a linear iteration that yields distributed averaging consensus over a network, i.e., that asymptotically computes the average of some initial values given at the nodes. When the iteration is assumed symmetric, the problem of finding the fastest converging linear iteration can be cast as a semidefinite program, and therefore efficiently and globally solved. These optimal linear iterations are often substantially faster than several simple heuristics that are based on the Laplacian matrix of the associated graph.

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.1109/cdc.2003.1272421

Cites

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

Cited by

See all 218

Metadata

Authors
Xiao, L., & Boyd, S.
Venue
42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)
Publisher
IEEE
Published
2004-06-21
Pages
4997-5002
OpenAlex
W2169593613
Cited by
218
References
4
FWCI
2.06
Type
conference paper
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: Fast linear iterations for distributed averaging. https://app.cochat.ai/papers/10.1109/cdc.2003.1272421
The paper
Xiao, L., & Boyd, S. (2004). Fast linear iterations for distributed averaging. 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475). https://doi.org/10.1109/cdc.2003.1272421

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.