{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T05:21:16Z","timestamp":1735881676861,"version":"3.32.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2005,7,15]],"date-time":"2005-07-15T00:00:00Z","timestamp":1121385600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2006,1]]},"DOI":"10.1007\/s00607-005-0124-4","type":"journal-article","created":{"date-parts":[[2005,7,15]],"date-time":"2005-07-15T14:42:59Z","timestamp":1121438579000},"page":"55-66","source":"Crossref","is-referenced-by-count":2,"title":["An Alternative Algorithm for a Sliding Window ULV Decomposition"],"prefix":"10.1007","volume":"76","author":[{"given":"H.","family":"Erbay","sequence":"first","affiliation":[]},{"given":"J.","family":"Barlow","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,15]]},"reference":[{"key":"124_CR1","unstructured":"Barlow, J. L., Yoon, P. A.: Solving recursive TLS problems using rank-revaling ULV decomposition. In: Proc. Workshop on TLS and Errors-in-variables (Van Huffel, S., ed.). Philadelphia, PA: SIAM Publications 1997, pp. 117\u2013126."},{"key":"124_CR2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01740542","volume":"36","author":"J. L. Barlow","year":"1996","journal-title":"BIT"},{"key":"124_CR3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-9473(02)00069-5","volume":"41","author":"H. Erbay","year":"2002","journal-title":"Adv. Comput. Stat. Data Anal."},{"key":"124_CR4","doi-asserted-by":"crossref","unstructured":"Erbay, H., Barlow, J. L.: Recursive ULV decompositions and an alternative refinement algorithm. In: Adv. Sign. Proc. Alg., Arch. Impl. X (Luk, F. T., ed.). SPIE Proc. (Bellingham, WA) 2000, pp. 157\u2013166.","DOI":"10.1117\/12.406492"},{"key":"124_CR5","first-page":"93","volume":"96","author":"D. K. Faddeev","year":"1968","journal-title":"Proc. Steklov Inst. Math."},{"key":"124_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02145580","volume":"1","author":"R. Ferng","year":"1991","journal-title":"Numer. Algorithm"},{"key":"124_CR7","unstructured":"Fierro, R., Vanhamme, L., Van Huffel, S.: Total least squares algorithms based on rank-revealing complete orthogonal decompositions. Philadelphia, PA: SIAM Publications 1997, pp. 99\u2013116."},{"key":"124_CR8","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1137\/S0895479893251472","volume":"16","author":"M. Gu","year":"1995","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"124_CR9","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1090\/S0025-5718-1969-0258258-9","volume":"23","author":"R. J. Hanson","year":"1969","journal-title":"Math. Comput."},{"key":"124_CR10","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/1029112","volume":"29","author":"N. J. Higham","year":"1987","journal-title":"SIAM Rev."},{"key":"124_CR11","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1137\/0911047","volume":"11","author":"N. J. Higham","year":"1990","journal-title":"SIAM J. Stat. Comput."},{"volume-title":"The symmetric eigenvalue problem","year":"1997","author":"B. N. Parlett","key":"124_CR12"},{"key":"124_CR13","first-page":"135","volume":"59","author":"G. W. Stewart","year":"1992","journal-title":"Math. Comput."},{"key":"124_CR14","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1137\/0614034","volume":"14","author":"G. W. Stewart","year":"1993","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"124_CR15","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1007\/BF02510414","volume":"38","author":"P. A. Yoon","year":"1998","journal-title":"BIT"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-005-0124-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-005-0124-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-005-0124-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T14:31:48Z","timestamp":1735828308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-005-0124-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,15]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["124"],"URL":"https:\/\/doi.org\/10.1007\/s00607-005-0124-4","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2005,7,15]]}}}