{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:20:16Z","timestamp":1736572816623,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540649526"},{"type":"electronic","value":"9783540499206"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0057933","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T15:01:27Z","timestamp":1154444487000},"page":"798-803","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fault tolerant QR-decomposition algorithm and its parallel implementation"],"prefix":"10.1007","author":[{"given":"Oleg","family":"Maslennikow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juri","family":"Kaniewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Wyrzykowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,30]]},"reference":[{"key":"99_CR1","volume-title":"Matrix computations","author":"G.H. Golub","year":"1996","unstructured":"G.H. Golub, C.F. Van Loan, Matrix computations, John Hopkins Univ. Press, Baltimore, Maryland, 1996."},{"key":"99_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical methods for least squares problems","author":"\u00e5. Bj\u00f6rck","year":"1996","unstructured":"\u00e5. Bj\u00f6rck, Numerical methods for least squares problems, SIAM, Philadelphia, 1996."},{"key":"99_CR3","volume-title":"VLSI array processors","author":"S.Y. Kung","year":"1988","unstructured":"S.Y. Kung, VLSI array processors, Prentice-Hall, Englewood Cliffs, N.J., 1988."},{"key":"99_CR4","volume-title":"Tech.Rep. CSL TR-211","author":"S.E. Butner","year":"1981","unstructured":"S.E. Butner, Triple time redundancy, fault-masking in byte-sliced systems. Tech.Rep. CSL TR-211, Dept. of Elec.Eng., Stanford Univ., CA, 1981."},{"key":"99_CR5","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/TC.1984.1676475","volume":"C-35","author":"K.H. Huang","year":"1984","unstructured":"K.H. Huang, J.A. Abraham, Algorithm-based fault tolerance for matrix operations. IEEE Trans. Comput., C-35 (1984) 518\u2013528.","journal-title":"IEEE Trans. Comput."},{"key":"99_CR6","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1109\/12.54836","volume":"C-39","author":"V.S. Nair","year":"1990","unstructured":"V.S. Nair, J.A. Abraham, Real-number codes for fault-tolerant matrix operations on processor arrays. IEEE Trans. Comp., C-39 (1990) 426\u2013435.","journal-title":"IEEE Trans. Comp."},{"key":"99_CR7","doi-asserted-by":"crossref","unstructured":"J.-Y. Han, D.C. Krishna, Linear arithmetic code and its application in fault tolerant systolic arrays, in Proc. IEEE Southeastcon, 1989, 1015\u20131020.","DOI":"10.1109\/SECON.1989.132562"},{"key":"99_CR8","unstructured":"J.S. Kaniewski, O.V. Maslennikow, R. Wyrzykowski, Algorithm-based fault tolerant matrix triangularization on VLSI processor arrays, in Proc. Int. Workshop \u201dParallel Numerics\u201995\u201d, Sorrento, Italy, 1995, 281\u2013295."},{"key":"99_CR9","unstructured":"J.S. Kaniewski, O.V. Maslennikow, R. Wyrzykowski, Algorithm-based fault tolerant solution of linear systems on processor arrays, in Proc. 7-th Int. Workshop \u201dPARCELLA \u201996\u201d, Berlin, Germany, 1996, 165\u2013173."},{"key":"99_CR10","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1117\/12.976256","volume":"698","author":"D.E. Schimmel","year":"1986","unstructured":"D.E. Schimmel, F.T. Luk, A practical real-time SVD machine with multi-level fault tolerance. Proc. SPIE, 698 (1986) 142\u2013148.","journal-title":"Proc. SPIE"},{"key":"99_CR11","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1117\/12.936896","volume":"696","author":"F.T. Luk","year":"1986","unstructured":"F.T. Luk, H. Park, An analysis of algorithm-based fault tolerance techniques. Proc. SPIE, 696 (1986) 222\u2013227.","journal-title":"Proc. SPIE"},{"key":"99_CR12","unstructured":"R. Wyrzykowski, J. Kanevski, O. Maslennikov, Mapping recursive algorithms into processor arrays, in Proc. Int. Workshop Parallel Numerics\u201994, M. Vajtersic and P. Zinterhof eds., Bratislava, 1994, 169\u2013191."}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201998 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0057933","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T08:12:10Z","timestamp":1736496730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0057933"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649526","9783540499206"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0057933","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"30 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}