{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:05:01Z","timestamp":1766066701067,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T00:00:00Z","timestamp":1493164800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s11075-017-0328-7","type":"journal-article","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T03:55:38Z","timestamp":1493178938000},"page":"559-576","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["RankRev: aMatlab package for computing the numerical rank and updating\/downdating"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4131-4140","authenticated-orcid":false,"given":"Tsung-Lin","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tien-Yien","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhonggang","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,26]]},"reference":[{"key":"328_CR1","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1145\/290200.287638","volume":"24","author":"CH Bischof","year":"1998","unstructured":"Bischof, C. H., Quintana-Orti, G.: Algorithm 782: Codes for rank-revealing QR factorizations of dense matrices. ACM Trans. Math. Software 24, 254\u2013257 (1998)","journal-title":"ACM Trans. Math. Software"},{"key":"328_CR2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0024-3795(87)90103-0","volume":"88\/89","author":"TR Chan","year":"1987","unstructured":"Chan, T. R.: Rank revealing QR factorizations. Linear Algebra Appl. 88\/89, 67\u201382 (1987)","journal-title":"Linear Algebra Appl."},{"key":"328_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/nla.1680010105","volume":"1","author":"TR Chan","year":"1994","unstructured":"Chan, T. R., Hansen, P. C.: Low-rank revealing QR factorizations. Numer. Linear Algebra Appl. 1, 33\u201344 (1994)","journal-title":"Numer. Linear Algebra Appl."},{"key":"328_CR4","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S Deerwester","year":"1990","unstructured":"Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., Harshman, R.: Indexing by latent semantic analysis. J. Amer. Soc. Inform. Sci. 41, 391\u2013407 (1990)","journal-title":"J. Amer. Soc. Inform. Sci."},{"issue":"3","key":"328_CR5","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1137\/S0895479893246005","volume":"16","author":"RD Fierro","year":"1995","unstructured":"Fierro, R. D., Bunch, J. R.: Bounding the subspaces from rank revealing two-sided orthogonal decompositions. SIAM J. Matrix Anal. Appl. 16(3), 743\u2013759 (1995)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"328_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/A:1019254318361","volume":"15","author":"RD Fierro","year":"1997","unstructured":"Fierro, R. D., Hansen, P. C.: Low-rank revealing UTV decompositions. Numer. Algorithms 15, 37\u201355 (1997)","journal-title":"Numer. Algorithms"},{"key":"328_CR7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1019112103049","volume":"20","author":"RD Fierro","year":"1999","unstructured":"Fierro, R. D., Hansen, P. C., Hansen, P. S. K.: UTV tools: MATLAB templates for rank-revealing UTV decompositions. Numer. Algorithms 20, 165\u2013194 (1999)","journal-title":"Numer. Algorithms"},{"key":"328_CR8","volume-title":"Rank degeneracy and least squares problems. Tech. rep. TR 456","author":"GH Golub","year":"1976","unstructured":"Golub, G. H., Klema, V., Stewart, G. W.: Rank degeneracy and least squares problems. Tech. rep. TR 456. University of Maryland, Baltimore (1976)"},{"key":"328_CR9","unstructured":"Golub, G. H., Van Loan, C. F.: Matrix Computations, 4th edn. Johns Hopkins University Press, Baltimore (2013)"},{"key":"328_CR10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0024-3795(92)90305-T","volume":"175","author":"TM Hwang","year":"1992","unstructured":"Hwang, T. M., Lin, W. W., Yang, E. K.: Rank-revealing LU Factorization. Linear Algebra Appl. 175, 115\u2013141 (1992)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"328_CR11","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1109\/20.996112","volume":"38","author":"S Kurz","year":"2002","unstructured":"Kurz, S., Rain, O., Rjasanow, S.: The adaptive cross approximation technique for the 3D boundary element method. IEEE Trans. Magnetics 38(2), 421\u2013424 (2002)","journal-title":"IEEE Trans. Magnetics"},{"key":"328_CR12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/07068179X","volume":"31","author":"TL Lee","year":"2009","unstructured":"Lee, T. L., Li, T. Y., Zeng, Z.: A rank-revealing method with updating, downdating, and applications. Part II. SIAM J. Matrix Anal. Appl. 31, 503\u2013525 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"328_CR13","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1137\/S0895479803435282","volume":"26","author":"TY Li","year":"2005","unstructured":"Li, T. Y., Zeng, Z.: A rank-revealing method with updating, downdating, and applications. SIAM J. Matrix Anal. Appl. 26, 918\u2013946 (2005)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"328_CR14","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1093\/qmath\/11.1.50","volume":"11","author":"L Mirsky","year":"1960","unstructured":"Mirsky, L.: Symmetric gauge functions and unitarily invariant norms. Quart. J. Math. Oxford Ser. (2) 11, 50\u201359 (1960)","journal-title":"Quart. J. Math. Oxford Ser. (2)"},{"key":"328_CR15","first-page":"28","volume-title":"International Association Boundary Element Methods Conference, IABEM","author":"S Rjasanow","year":"2002","unstructured":"Rjasanow, S.: Adaptive cross approximation of dense matrices International Association Boundary Element Methods Conference, IABEM, pp 28\u201330 (2002)"},{"key":"328_CR16","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1109\/78.139256","volume":"40","author":"GW Stewart","year":"1992","unstructured":"Stewart, G. W.: An updating algorithm for subspace tracking. IEEE Trans. Signal Processing 40, 1535\u20131541 (1992)","journal-title":"IEEE Trans. Signal Processing"},{"key":"328_CR17","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1137\/0614034","volume":"14","author":"GW Stewart","year":"1993","unstructured":"Stewart, G. W.: Updating a rank-revealing ULV decompositions. SIAM J. Matrix Anal. Appl. 14, 494\u2013499 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"328_CR18","volume-title":"SVD and Signal Processing, II, Algorithms, Applications, and Architectures","author":"R Vaccaro","year":"1991","unstructured":"Vaccaro, R.: SVD and Signal Processing, II, Algorithms, Applications, and Architectures. Elsevier, Amsterdam (1991)"},{"key":"328_CR19","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1090\/S0025-5718-04-01692-8","volume":"74","author":"Z Zeng","year":"2005","unstructured":"Zeng, Z.: Computing multiple roots of inexact polynomials. Math. Comp. 74, 869\u2013903 (2005)","journal-title":"Math. Comp."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0328-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0328-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0328-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T01:42:21Z","timestamp":1516412541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0328-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,26]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["328"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0328-7","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2017,4,26]]}}}