{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T09:26:47Z","timestamp":1749720407118},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J VLSI Sign Process Syst Sign Image Video Technol"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1007\/bf00925827","type":"journal-article","created":{"date-parts":[[2005,1,2]],"date-time":"2005-01-02T15:00:07Z","timestamp":1104678007000},"page":"163-172","source":"Crossref","is-referenced-by-count":12,"title":["A square root covariance algorithm for constrained recursive least squares estimation"],"prefix":"10.1007","volume":"3","author":[{"given":"Marc","family":"Moonen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joos","family":"Vandewalle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1991,9,1]]},"reference":[{"key":"BF00925827_CR1","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/BF01436075","volume":"7","author":"G.H. Golub","year":"1965","unstructured":"G.H. Golub, \u201cNumerical methods for solving linear least squares problems,\u201dNumer. Math., vol. 7, 1965, pp. 206\u2013216.","journal-title":"Numer. Math."},{"key":"BF00925827_CR2","unstructured":"G.H. Golub and C.F. Van Loan,Matrix computations, North Oxford Academic Publishing Co., Johns Hopkins Press, 1983."},{"key":"BF00925827_CR3","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1090\/S0025-5718-1974-0343558-6","volume":"28","author":"P.E. Gill","year":"1974","unstructured":"P.E. Gill, G.H. Golub, W. Murray and M. A. Saunders, \u201cMethods for modifying matrix factorizations,\u201dMath. Comp., vol. 28, 1974, pp. 505\u2013535.","journal-title":"Math. Comp."},{"key":"BF00925827_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1117\/12.932507","volume":"298","author":"W.M. Gentleman","year":"1982","unstructured":"W.M. Gentleman and H.T. Kung, \u201cMatrix triangularization by systolic arrays,\u201dReal-Time Signal Processing IV, Proc. SPIE, vol. 298, 1982, pp. 19\u201326.","journal-title":"Real-Time Signal Processing IV"},{"key":"BF00925827_CR5","first-page":"775","volume-title":"Mathematics in Signal Processing II","author":"T.J. Shepherd","year":"1990","unstructured":"T.J. Shepherd, J.G. McWhirter and J.E. Hudson, \u201cParallel weight extraction from a systolic adaptive beamformer,\u201d InMathematics in Signal Processing II (J.G. McWhirter, ed.), Oxford: Clarendon Press, 1990, pp. 775\u2013790."},{"key":"BF00925827_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0165-1684(90)90022-Q","volume":"21","author":"M. Moonen","year":"1990","unstructured":"M. Moonen and J. Vandewalle, \u201cRecursive least squares with stabilized inverse factorization,\u201dSignal Processing, vol. 21, 1990, pp. 1\u201315.","journal-title":"Signal Processing"},{"key":"BF00925827_CR7","unstructured":"M. Moonen and J. Vandewalle, \u201cA systolic array for recursive least squares computations,\u201d K. Univ. Leuven, Dept. El. Eng., ESAT-SISTA report 90-22 (submitted for publication)."},{"key":"BF00925827_CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0377-0427(89)90363-4","volume":"27","author":"C.T. Pan","year":"1989","unstructured":"C.T. Pan and R.J. Plemmons, \u201cLeast squares modifications with inverse factorization: Parallel implications,\u201dJ. Comp. Appl. Math., vol. 27, 1989, pp. 109\u2013127.","journal-title":"J. Comp. Appl. Math."},{"key":"BF00925827_CR9","first-page":"607","volume-title":"Mathematics in Signal Processing","author":"T.J. Shepherd","year":"1987","unstructured":"T.J. Shepherd and J.G. McWhirter, \u201cA pipelined array for linearly constrained least squares optimization,\u201d InMathematics in Signal Processing (T.S. Durrani, J.B. Abbiss, J.E. Hudson, R.W. Madan, J.G. McWhirter and T.A. Moore, eds.), Oxford: Clarendon Press, 1987, pp. 607\u2013635."},{"key":"BF00925827_CR10","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1137\/0906058","volume":"6","author":"G.W. Stewart","year":"1985","unstructured":"G.W. Stewart, \u201cA Jacobi-like algorithm for computing the Schur decomposition of a nonhermitian matrix,\u201dSIAM J. Sc. Stat. Comp., vol. 6, 1985, pp. 853\u2013863.","journal-title":"SIAM J. Sc. Stat. Comp."},{"key":"BF00925827_CR11","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0024-3795(86)90171-0","volume":"77","author":"F.T. Luk","year":"1986","unstructured":"F.T. Luk, \u201cA triangular processor array for computing singular values,\u201dLin. Alg. Appl., vol. 77, 1986, pp. 259\u2013273.","journal-title":"Lin. Alg. Appl."},{"key":"BF00925827_CR12","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1145\/4021.4025","volume":"28","author":"D.P. O'Leary","year":"1975","unstructured":"D.P. O'Leary and G.W. Stewart, \u201cData flow algorithms for parallel matrix computations,\u201dComm. ACM, vol. 28, 1975, pp. 840\u2013853.","journal-title":"Comm. ACM"},{"key":"BF00925827_CR13","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1049\/el:19900261","volume":"26","author":"M. Moonen","year":"1990","unstructured":"M. Moonen and J. Vandewalle, \u201cA hexagonally connected processor array for Jacobi-type matrix algorithms,\u201dElectronics Letters, vol. 26, 1990, pp. 400\u2013401.","journal-title":"Electronics Letters"}],"container-title":["Journal of VLSI signal processing systems for signal, image and video technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00925827.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00925827\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00925827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T16:52:00Z","timestamp":1556556720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00925827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["BF00925827"],"URL":"https:\/\/doi.org\/10.1007\/bf00925827","relation":{},"ISSN":["0922-5773"],"issn-type":[{"value":"0922-5773","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}