Scilab Website | Contribute with GitLab | Mailing list archives | ATOMS toolboxes

Change language to:
English - 日本語 - Português

Please note that the recommended version of Scilab is 6.1.1. This page might be outdated.
See the recommended documentation of this function

Aide Scilab >> Traitement du Signal > lindquist

lindquist

Lindquist's algorithm

Calling Sequence

[P,R,T]=lindquist(n,H,F,G,R0)

Arguments

n

number of iterations.

H, F, G

estimated triple from the covariance sequence of y.

R0

E(yk*yk')

P

solution of the Riccati equation after n iterations.

R, T

gain matrices of the filter.

Description

computes iteratively the minimal solution of the algebraic Riccati equation and gives the matrices R and T of the filter model, by the Lindquist's algorithm.

See Also

  • srfaur — square-root algorithm
  • faurre — filter computation by simple Faurre algorithm
  • phc — Markovian representation

Authors

G. Le V.

<< levin Traitement du Signal mese >>

Copyright (c) 2022-2023 (Dassault Systèmes)
Copyright (c) 2017-2022 (ESI Group)
Copyright (c) 2011-2017 (Scilab Enterprises)
Copyright (c) 1989-2012 (INRIA)
Copyright (c) 1989-2007 (ENPC)
with contributors
Last updated:
Thu Mar 03 11:00:11 CET 2011