{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:32:53Z","timestamp":1773815573150,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1007\/bf02139475","type":"journal-article","created":{"date-parts":[[2005,9,15]],"date-time":"2005-09-15T20:33:56Z","timestamp":1126816436000},"page":"371-391","source":"Crossref","is-referenced-by-count":14,"title":["A block algorithm for computing rank-revealing QR factorizations"],"prefix":"10.1007","volume":"2","author":[{"given":"Christian H.","family":"Bischof","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Per Christian","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,27]]},"reference":[{"key":"BF02139475_CR1","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/76263.76290","volume-title":"Proc. SUPER-COMPUTING '89","author":"C.H. Bischof","year":"1989","unstructured":"C.H. Bischof, A block QR factorization algorithm using restricted pivoting, in:Proc. SUPER-COMPUTING '89 (ACM Press, Baltimore, MD, 1989) pp. 248\u2013256."},{"key":"BF02139475_CR2","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0611021","volume":"11","author":"C.H. Bischof","year":"1990","unstructured":"C.H. Bischof, Incremental condition estimation, SIAM J. Matrix Anal. Appl. 11 (1990) 312\u2013322.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"BF02139475_CR3","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1137\/0912002","volume":"12","author":"C.H. Bischof","year":"1991","unstructured":"C.H. Bischof, A parallel QR factorization algorithm with controlled local pivoting, SIAM J. Sci. Stat. Comput. 12 (1991) 36\u201357.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02139475_CR4","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.1137\/0912073","volume":"12","author":"C.H. Bischof","year":"1991","unstructured":"C.H. Bischof and P.C. Hansen, Structure-preserving and rank-revealing QR factorizations, SIAM J. Sci. Stat. Comput. 12 (1991) 1332\u20131350.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02139475_CR5","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/78.157185","volume":"40","author":"C.H. Bischof","year":"1992","unstructured":"C.H. Bischof and G.M. Shroff, On updating signal subspaces, IEEE Trans. Signal Proc. SP-40 (1992) 96\u2013105.","journal-title":"IEEE Trans. Signal Proc. SP"},{"key":"BF02139475_CR6","doi-asserted-by":"crossref","unstructured":"C.H. Bischof and P.T.P. Tang, Robust incremental condition estimation, Preprint MCS-P225-0391, Argonne National Laboratory, Mathematics and Computer Science Division (1991).","DOI":"10.2172\/10133022"},{"key":"BF02139475_CR7","doi-asserted-by":"crossref","first-page":"s2","DOI":"10.1137\/0908009","volume":"8","author":"C.H. Bischof","year":"1987","unstructured":"C.H. Bischof and C.F. Van Loan, The WY representation for products of Householder matrices, SIAM J. Sci. Stat. Comput. 8 (1987) s2-s13.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02139475_CR8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0024-3795(87)90103-0","volume":"88\/89","author":"T.F. Chan","year":"1987","unstructured":"T.F. Chan, Rank revealing QR factorizations, Linear Alg. Appl. 88\/89 (1987) 67\u201382.","journal-title":"Linear Alg. Appl."},{"key":"BF02139475_CR9","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1137\/0911029","volume":"11","author":"T.F. Chan","year":"1990","unstructured":"T.F. Chan and P.C. Hansen, Computing truncated SVD least squares solutions by rank revealing QR factorizations, SIAM J. Sci. Stat. Comput. 11 (1990) 519\u2013530.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02139475_CR10","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1137\/0913043","volume":"13","author":"T.F. Chan","year":"1992","unstructured":"T.F. Chan and P.C. Hansen, Some applications of the rank revealing QR factorization, SIAM J. Sci. Stat. Comput. 13 (1992) 727\u2013741.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02139475_CR11","volume-title":"Direct Methods for Sparse Matrices","author":"I.S. Duff","year":"1987","unstructured":"I.S. Duff, A.M. Erisman and J.K. Reid,Direct Methods for Sparse Matrices (Oxford Press, London, 1987)."},{"key":"BF02139475_CR12","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1137\/0907060","volume":"7","author":"L. Eld\u00e9n","year":"1986","unstructured":"L. Eld\u00e9n and R. Schreiber, An application of systolic arrays to linear discrete ill-posed problems, SIAM J. Sci. Stat. Comput. 7 (1986) 892\u2013903.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02139475_CR13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0024-3795(86)90115-1","volume":"74","author":"L.V. Foster","year":"1986","unstructured":"L.V. Foster, Rank and null space calculations using matrix decomposition without column interchanges, Linear Alg. Appl. 74 (1986) 47\u201371.","journal-title":"Linear Alg. Appl."},{"key":"BF02139475_CR14","doi-asserted-by":"crossref","unstructured":"G.H. Golub, V. Klema and G.W. Stewart, Rank degeneracy and least squares problems, Technical Report TR-456, University of Maryland, Dept. of Computer Science (1976).","DOI":"10.3386\/w0165"},{"key":"BF02139475_CR15","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1137\/0907053","volume":"7","author":"G.H. Golub","year":"1986","unstructured":"G.H. Golub, P. Manneback and P.L. Toint, A comparison between some direct and iterative methods for certain large scale geodetic least-squares problem, SIAM J. Sci. Stat. Comput. 7 (1986) 799\u2013816.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02139475_CR16","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/BF01436075","volume":"7","author":"G.H. Golub","year":"1965","unstructured":"G.H. Golub, Numerical methods for solving linear least squares problems, Numer. Math. 7 (1965) 206\u2013216.","journal-title":"Numer. Math."},{"key":"BF02139475_CR17","unstructured":"G.H. Golub and C.F. Van Loan,Matrix Computations (The Johns Hopkins University Press, 1983)."},{"key":"BF02139475_CR18","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0167-8396(87)90005-7","volume":"4","author":"T.A. Grandine","year":"1987","unstructured":"T.A. Grandine, An iterative method for computing multivariateC 1 piecewise polynomial interpolants, Comput. Aided Geometric Design 4 (1987) 307\u2013319.","journal-title":"Comput. Aided Geometric Design"},{"key":"BF02139475_CR19","unstructured":"T.A. Grandine, Rank deficient interpolation and optimal design: An example, Technical Report SCA-TR-113, Boeing Computer Services, Engineering and Scientific Services Division (February 1989)."},{"key":"BF02139475_CR20","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/0911028","volume":"11","author":"P.C. Hansen","year":"1990","unstructured":"P.C. Hansen, Truncated SVD solutions to discrete ill-posed problems with ill-determined numerical rank, SIAM J. Sci. Stat. Comput. 11 (1990) 503\u2013518.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02139475_CR21","doi-asserted-by":"crossref","unstructured":"P.C. Hansen, T. Sekii and H. Shibahashi, The modified truncated SVD-method for regularization in general form, SIAM J. Sci. Stat. Comput. (1992), to appear.","DOI":"10.1137\/0913066"},{"key":"BF02139475_CR22","first-page":"213","volume":"58","author":"Y.P. Hong","year":"1992","unstructured":"Y.P. Hong and C.-T. Pan, The rank revealing QR decomposition and SVD, Math. Comp. 58 (1992) 213\u2013232.","journal-title":"Math. Comp."},{"key":"BF02139475_CR23","unstructured":"S.F. Hsieh, K.J.R. Liu and K. Yao,Comparisons of Truncated QR and SVD Methods for AR Spectral Estimations (Elsevier Science, 1991) pp. 403\u2013418."},{"key":"BF02139475_CR24","doi-asserted-by":"crossref","unstructured":"J. Mor\u00e9, The Levenberg-Marquardt algorithm: Implementation and theory, in:Proc. Dundee Conf. on Numerical Analysis, ed. G.A. Watson (Springer, 1978).","DOI":"10.1007\/BFb0067700"},{"key":"BF02139475_CR25","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1137\/0910005","volume":"10","author":"R. Schreiber","year":"1989","unstructured":"R. Schreiber and C. Van Loan, A storage efficient WY representation for products of Householder transformations, SIAM J. Sci. Stat. Comput. 10 (1989) 53\u201357.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02139475_CR26","unstructured":"G.M. Shroff and C.H. Bischof, Adaptive condition estimation for rank-one updates of QR factorizations, Preprint MCS-P166-0790, Argonne National Laboratory, Mathematics and Computer Science Division (1990)."},{"key":"BF02139475_CR27","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1109\/78.139256","volume":"40","author":"G.W. Stewart","year":"1992","unstructured":"G.W. Stewart, An updating algorithm for subspace tracking, IEEE Trans. Signal Proc. SP-40 (1992) 1535\u20131541.","journal-title":"IEEE Trans. Signal Proc. SP"},{"key":"BF02139475_CR28","doi-asserted-by":"crossref","unstructured":"B. Wald\u00e9n, Using a fast signal processor to solve the inverse kinematic problem with special emphasis on the singularity problem, PhD thesis, Link\u00f6ping University, Dept. of Mathematics (1991).","DOI":"10.1007\/978-3-7091-4433-6_42"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02139475.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02139475\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02139475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T14:22:37Z","timestamp":1586442157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02139475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["BF02139475"],"URL":"https:\/\/doi.org\/10.1007\/bf02139475","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}