Formal proof for the constant trace forgetting factor

DOI10.1080/00207178908953373MaRDI QIDQ4735084zbMATH OpenOpenAlexFDO

Authors A. Vien, R. Kevin Wood

Publication date 1989

Published in International Journal of Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207178908953373

zbMATH Keywords

constant trace algorithmsweighted least-squares identification

Mathematics Subject Classification ID

Control problems for functional-differential equations (34K35) System identification (93B30) Linear systems in control theory (93C05)

Recommendations

• On memoryless provers and insincere verifiers
• A finite memory structure smoother with recursive form using forgetting factor
• scientific article; zbMATH DE number 879755
• A Forgetting Property of Reciprocal Chains
• Preserving strong equivalence while forgetting
• From forgetting signature elements to forgetting formulas in epistemic states
• A counter example to the exponential convergence of the directional forgetting algorithm
• Towards a stable trace formula
• A GENERALIZED MEMORYLESS PROPERTY

Cites work

• A globally convergent adaptive pole placement algorithm without a persistency of excitation requirement
• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 3528420 (Why is no real title available?)
• Improved least squares identification

This page was built for publication: Formal proof for the constant trace forgetting factor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735084)