{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T14:34:30Z","timestamp":1787236470340,"version":"build-2736575974"},"reference-count":11,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. and Stat. Comput."],"published-print":{"date-parts":[[1991,11]]},"abstract":"<jats:p>In this paper a square root covariance form of the Kalman filter is presented which is in many ways the covariance analog of the Paige and Saunders information filter [SIAM J. Numer. Anal., 14 (1977), pp. 180\u2013193] and possesses many of the advantages of their algorithm. For example, it is a true square root implementation; but the distinctive feature which it shares with the Paige and Saunders algorithm is a compact, convenient, and effective square root implementation of the interpolation smoother. The algorithm is based on the Duncan and Home generalised least squares form of the filter equations [J. Amer. Statist. Assoc., 67 (1972), pp. 816\u2013821], but uses these in a recursive manner.<\/jats:p>","DOI":"10.1137\/0912072","type":"journal-article","created":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T03:37:13Z","timestamp":1109648233000},"page":"1324-1331","source":"Crossref","is-referenced-by-count":1,"title":["What is the Covariance Analog of the Paige and Saunders Information Filter?"],"prefix":"10.1137","volume":"12","author":[{"given":"M. R.","family":"Osborne","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tania","family":"Prvan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","volume-title":"Optimal Filtering","author":"Anderson B. D. O.","year":"1979"},{"key":"R2","volume-title":"Factorization methods for discrete sequential estimation","author":"Bierman Gerald J.","year":"1977"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(83)90005-5"},{"key":"R4","first-page":"815","volume":"67","author":"Duncan D. B.","year":"1972","journal-title":"J. Amer. Statist. Assoc."},{"key":"R5","volume-title":"Matrix computations","author":"Golub Gene H.","year":"1989"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1975.1100994"},{"key":"R7","volume-title":"Finite algorithms in optimization and data analysis","author":"Osborne M. R.","year":"1985"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1017\/S0334270000006020"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0893-9659(91)90165-R"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0714012"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1017\/S0334270000006032"}],"container-title":["SIAM Journal on Scientific and Statistical Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0912072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T13:27:45Z","timestamp":1787232465000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0912072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["10.1137\/0912072"],"URL":"https:\/\/doi.org\/10.1137\/0912072","relation":{},"ISSN":["0196-5204","2168-3417"],"issn-type":[{"value":"0196-5204","type":"print"},{"value":"2168-3417","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}