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

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

On positive real transfer functions and the convergence of some recursive schemes

Ljung, L.·1977·IEEE Transactions on Automatic Control

Abstract

The convergence with probability one of a recently suggested recursive identification method by Landau is investigated. The positive realness of a certain transfer function is shown to play a crucial role, both for the proof of convergence and for convergence itself. A completely analogous analysis can be performed also for the extended least squares method and for the self-tuning regulator of Åström and Wittenmark. Explicit conditions for convergence of all these schemes are given. A more general structure is also discussed, as well as relations to other recursive 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.1109/tac.1977.1101552

Cites

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

Cited by

See all 406

Metadata

Authors
Ljung, L.
Venue
IEEE Transactions on Automatic Control
Published
1977-08
Volume
22
Issue
4
Pages
539-551
ISSN
0018-9286 (ISSN-L)
OpenAlex
W2148401037
Cited by
406
References
6
FWCI
54.17
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: On positive real transfer functions and the convergence of some recursive schemes. https://app.cochat.ai/papers/10.1109/tac.1977.1101552
The paper
Ljung, L. (1977). On positive real transfer functions and the convergence of some recursive schemes. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.1977.1101552

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.