Efficient Change of Initial Conditions , Dual Chandrasekhar Equations, and some Applications
1977 (English)In: IEEE Transactions on Automatic Control, ISSN 0018-9286, E-ISSN 1558-2523, Vol. 22, no 3, 443-447 p.Article in journal (Refereed) Published
We give simple proofs of formulas for converting linear least-squares filtered and smoothed estimates derived for one set of initial conditions to estimates valid for some other set. These are then used to study the possible advantages of first deliberately mischoosing the initial conditions so as to allow computational benefits to be obtained by using certain fast algorithms. In the course of this application we also obtain a new "dual" set of Chandrasekhar equations that provide a fast algorithm for fixed-point smoothing.
Place, publisher, year, edition, pages
IEEE Control Systems Society , 1977. Vol. 22, no 3, 443-447 p.
Chandrasekhar equations, Least-squares estimation, Linear systems, Time-varying continuous-time, State estimation
IdentifiersURN: urn:nbn:se:liu:diva-100854DOI: 10.1109/TAC.1977.1101516OAI: oai:DiVA.org:liu-100854DiVA: diva2:664038