{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:32:49Z","timestamp":1767141169824,"version":"build-2238731810"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T00:00:00Z","timestamp":1543363200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["671633"],"award-info":[{"award-number":["671633"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["671633"],"award-info":[{"award-number":["671633"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["671633"],"award-info":[{"award-number":["671633"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-15-CE23-0017-01"],"award-info":[{"award-number":["ANR-15-CE23-0017-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10915-018-0885-5","type":"journal-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T04:48:45Z","timestamp":1543380525000},"page":"1135-1160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["ALORA: Affine Low-Rank Approximations"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7952-4568","authenticated-orcid":false,"given":"Alan","family":"Ayala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Claeys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura","family":"Grigori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,28]]},"reference":[{"key":"885_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK Users\u2019 Guide","author":"E Anderson","year":"1999","unstructured":"Anderson, E., Bai, Z., Bischof, C.H., Blackford, S., Demmel, J.W., Dongarra, J.J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.C.: LAPACK Users\u2019 Guide. SIAM, Philadelphia (1999)"},{"issue":"4","key":"885_CR2","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/PL00005410","volume":"86","author":"M Bebendorf","year":"2000","unstructured":"Bebendorf, M.: Approximation of boundary element matrices. Numer. Math. 86(4), 565\u2013589 (2000)","journal-title":"Numer. Math."},{"key":"885_CR3","volume-title":"Hierarchical Matrices","author":"M Bebendorf","year":"2008","unstructured":"Bebendorf, M.: Hierarchical Matrices. Springer, Leipzig (2008)"},{"key":"885_CR4","first-page":"36","volume":"12","author":"CH Bischof","year":"1991","unstructured":"Bischof, C.H.: A parallel QR factorization algorithm with controlled local pivoting. SIAM J. Matrix Anal. Appl. 12, 36\u201357 (1991)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"885_CR5","doi-asserted-by":"crossref","unstructured":"Boutsidis, C., Mahoney, M., Drineas, P.: An improved approximationalgorithm for the column subset selection problem. In: Proceedingsof the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 968\u2013977 (2009)","DOI":"10.1137\/1.9781611973068.105"},{"key":"885_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1137\/13092157X","volume":"36","author":"JW Demmel","year":"2015","unstructured":"Demmel, J.W., Grigori, L., Gu, M., Xiang, H.: Communication avoiding rank revealing QR factorization with column pivoting. SIAM J. Matrix Anal. Appl. 36, 55\u201389 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"885_CR7","first-page":"28","volume":"35(2):12:1\u201312","author":"Z Drma\u010d","year":"2008","unstructured":"Drma\u010d, Z., Bujanovi\u0107, Z.: On the failure of rank-revealing QR factorization software\u2014a case study. ACM Trans. Math. Softw. 35(2):12:1\u201312, 28 (2008)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"885_CR8","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1137\/050639193","volume":"29","author":"Z Drma\u010d","year":"2008","unstructured":"Drma\u010d, Z., Veseli\u0107, K.: New fast and accurate Jacobi SVD algorithm. I. SIAM J. Matrix Anal. Appl. 29(4), 1322\u20131342 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"885_CR9","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1137\/05063920X","volume":"29","author":"Z Drma\u010d","year":"2008","unstructured":"Drma\u010d, Z., Veseli\u0107, K.: New fast and accurate Jacobi SVD algorithm. II. SIAM J. Matrix Anal. Appl. 29(4), 1343\u20131362 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"885_CR10","doi-asserted-by":"publisher","first-page":"C263","DOI":"10.1137\/15M1044680","volume":"39","author":"J Duersch","year":"2017","unstructured":"Duersch, J., Gu, M.: Randomized QR with column pivoting. SIAM J. Sci. Comput. 39(4), C263\u2013C291 (2017)","journal-title":"SIAM J. Sci. Comput."},{"key":"885_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02288367","volume":"1","author":"G Eckart","year":"1936","unstructured":"Eckart, G., Young, G.: The approximation of one matrix by another of lower rank. Psychometrica 1, 211\u2013218 (1936)","journal-title":"Psychometrica"},{"issue":"4","key":"885_CR12","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/0609045","volume":"9","author":"A Edelman","year":"1988","unstructured":"Edelman, A.: Eigenvalues and condition numbers of random matrices. SIAM J. Matrix Anal. Appl. 9(4), 543\u2013560 (1988)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"6","key":"885_CR13","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1145\/1039488.1039494","volume":"51","author":"A Frieze","year":"2004","unstructured":"Frieze, A., Kannan, R., Vempala, S.: Fast monte-carlo algorithms for finding low-rank approximations. J. ACM 51(6), 1025\u20131041 (2004)","journal-title":"J. ACM"},{"key":"885_CR14","doi-asserted-by":"crossref","unstructured":"Golub, G.H., Klema, V., Stewart, G.W.: Rank degeneracy and least squares problems. Tech. Report TR-456, Department of. Computer Science, University of Maryland, College Park, MD (1976)","DOI":"10.3386\/w0165"},{"key":"885_CR15","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Jonhs Hopkins University Press, Baltimore (1996)","edition":"3"},{"issue":"2","key":"885_CR16","doi-asserted-by":"publisher","first-page":"C181","DOI":"10.1137\/16M1074527","volume":"40","author":"L Grigori","year":"2018","unstructured":"Grigori, L., Cayrols, S., Demmel, J.: Low rank approximation of a sparse matrix based on lu factorization with column and row tournament pivoting. SIAM J. Sci. Comput. 40(2), C181\u2013C209 (2018)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"885_CR17","doi-asserted-by":"publisher","first-page":"A1139","DOI":"10.1137\/130938700","volume":"37","author":"M Gu","year":"2015","unstructured":"Gu, M.: Subspace iteration randomization and singular value problems. SIAM J. Sci. Comput. 37(3), A1139\u2013A1173 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"885_CR18","first-page":"848","volume":"17","author":"M Gu","year":"1996","unstructured":"Gu, M., Eisenstat, S.: Efficient algorithms for computing a strong rank-revealing QR factorization. SIAM J. Matrix Anal. Appl. 17(4), 848\u2013869 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"885_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko, N., Martinsson, P.G., Tropp, J.A.: Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53(2), 217\u2013288 (2011)","journal-title":"SIAM Rev."},{"key":"885_CR20","unstructured":"Hansen, P.C.: Regularization tools version 4.1 for MATLAB 7.3.\n                           \n                    http:\/\/www.imm.dtu.dk\/~pcha\/Regutools\n                    \n                  . Accessed 10 Oct (2018)"},{"key":"885_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371","volume-title":"Topics in Matrix Analysis","author":"R Horn","year":"1991","unstructured":"Horn, R., Johnson, C.: Topics in Matrix Analysis. Cambridge University Press, New York (1991)"},{"issue":"4","key":"885_CR22","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/nla.404","volume":"12","author":"DA Huckaby","year":"2005","unstructured":"Huckaby, D.A., Chan, T.F.: Stewart\u2019s pivoted QLP decomposition for low-rank matrices. Numer. Linear Algebra Appl. 12(4), 153\u2013159 (2005)","journal-title":"Numer. Linear Algebra Appl."},{"key":"885_CR23","doi-asserted-by":"publisher","first-page":"757","DOI":"10.4153\/CMB-1966-083-2","volume":"9","author":"W Kahan","year":"1966","unstructured":"Kahan, W.: Numerical linear algebra. Can. Math. Bull 9, 757\u2013801 (1966)","journal-title":"Can. Math. Bull"},{"issue":"2","key":"885_CR24","doi-asserted-by":"publisher","first-page":"C96","DOI":"10.1137\/16M1081270","volume":"39","author":"PG Martinsson","year":"2017","unstructured":"Martinsson, P.G., Quintana, G., Heavner, N., Van de Geijn, R.: Householder qr factorization with randomization for column pivoting (hqrrp). SIAM J. Sci. Comput. 39(2), C96\u2013C115 (2017)","journal-title":"SIAM J. Sci. Comput."},{"key":"885_CR25","doi-asserted-by":"crossref","unstructured":"Martinsson, P.G., Rokhlin, V., Tygert, M.: A randomized algorithm for the approximation of matrices. Technical Report Yale CS research report YALEU\/DCS\/RR-1361. Yale University, Computer Science Department (2006)","DOI":"10.21236\/ADA458927"},{"issue":"2","key":"885_CR26","doi-asserted-by":"publisher","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. Q. J. Math. Oxf. Ser. 11(2), 50\u201359 (1960)","journal-title":"Q. J. Math. Oxf. Ser."},{"key":"885_CR27","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.jcta.2016.06.008","volume":"144","author":"S O\u2019Rourke","year":"2016","unstructured":"O\u2019Rourke, S., Vu, V., Wang, K.: Eigenvectors of random matrices: a survey. J. Comb. Theory Ser. A 144, 361\u2013442 (2016)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"4","key":"885_CR28","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1023\/A:1022395308695","volume":"39","author":"C-T Pan","year":"1999","unstructured":"Pan, C.-T., Tang, P.T.P.: Bounds on singular values revealed by QR factorizations. BIT Numer. Math. 39(4), 740\u2013756 (1999)","journal-title":"BIT Numer. Math."},{"key":"885_CR29","doi-asserted-by":"publisher","first-page":"575","DOI":"10.4007\/annals.2008.168.575","volume":"168","author":"M Rudelson","year":"2008","unstructured":"Rudelson, M.: Invertibility of random matrices: norm of the inverse. Ann. Math. 168, 575\u2013600 (2008)","journal-title":"Ann. Math."},{"key":"885_CR30","volume-title":"Geometric Tools for Computer Graphics","author":"P Schneider","year":"2003","unstructured":"Schneider, P., Eberly, D.H.: Geometric Tools for Computer Graphics. Morgan Kaufmann Publishers Inc., San Francisco, CA (2003)"},{"issue":"4","key":"885_CR31","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1137\/S1064827597319519","volume":"20","author":"GW Stewart","year":"1999","unstructured":"Stewart, G.W.: The QLP approximation to the singular value decomposition. SIAM J. Sci. Comput. 20(4), 1336\u20131348 (1999)","journal-title":"SIAM J. Sci. Comput."},{"key":"885_CR32","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0885-064X(91)90002-F","volume":"7","author":"SJ Szarek","year":"1991","unstructured":"Szarek, S.J.: Condition numbers of random matrices. J. Complex. 7, 131\u2013149 (1991)","journal-title":"J. Complex."},{"issue":"1","key":"885_CR33","doi-asserted-by":"publisher","first-page":"1150001","DOI":"10.1142\/S2010326311500018","volume":"1","author":"T Tao","year":"2012","unstructured":"Tao, T., Vu, V.: Random matrices: universal properties of eigenvectors. Random Matrices Theory Appl. 1(1), 1150001 (2012)","journal-title":"Random Matrices Theory Appl."},{"issue":"3","key":"885_CR34","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10444-016-9494-8","volume":"43","author":"S Voronin","year":"2017","unstructured":"Voronin, S., Martinsson, P.G.: Efficient algorithms for cur and interpolative matrix decompositions. Adv. Comput. Math. 43(3), 495\u2013516 (2017)","journal-title":"Adv. Comput. Math."}],"updated-by":[{"DOI":"10.1007\/s10915-019-00910-9","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T00:00:00Z","timestamp":1550102400000}}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10915-018-0885-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-018-0885-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-018-0885-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T19:13:55Z","timestamp":1574882035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10915-018-0885-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,28]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["885"],"URL":"https:\/\/doi.org\/10.1007\/s10915-018-0885-5","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,28]]},"assertion":[{"value":"15 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2019","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original version of the article contained a mistake in Acknowledgement section.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}