{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T04:59:14Z","timestamp":1679547554564},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"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":[[2013,3]]},"DOI":"10.1007\/s11075-012-9599-1","type":"journal-article","created":{"date-parts":[[2012,5,31]],"date-time":"2012-05-31T06:42:53Z","timestamp":1338446573000},"page":"469-485","source":"Crossref","is-referenced-by-count":8,"title":["An efficient algorithm for sparse null space basis problem using ABS methods"],"prefix":"10.1007","volume":"62","author":[{"given":"M.","family":"Khorramizadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Mahdavi-Amiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,1]]},"reference":[{"key":"9599_CR1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01391414","volume":"45","author":"J Abaffy","year":"1984","unstructured":"Abaffy, J., Broyden, C.G., Spedicato, E.: A class of direct methods for linear equations. Numer. Math. 45, 361\u2013376 (1984)","journal-title":"Numer. Math."},{"key":"9599_CR2","volume-title":"ABS","author":"J Abaffy","year":"1989","unstructured":"Abaffy, J., Broyden, C.G., Spedicato, E.: ABS Projection Algorithms: Mathematical Techniques for Linear and Nonlinear Equations. Ellis Horwood, Chichester (1989)"},{"key":"9599_CR3","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/BF01389453","volume":"47","author":"MW Berry","year":"1985","unstructured":"Berry, M.W., Heath, M.T., Kaneko, I., Lawo, M., Plemmons, R.J.: An algorithm to compute a sparse basis of the null space. Numer. Math. 47, 483\u2013504 (1985)","journal-title":"Numer. Math."},{"key":"9599_CR4","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.laa.2007.11.025","volume":"428","author":"S Borne Le","year":"2008","unstructured":"Le Borne, S.: Block computation and representation of a sparse nullspace basis of a rectangular matrix. Linear Algebra Appl. 428, 2455\u20132467 (2008)","journal-title":"Linear Algebra Appl."},{"key":"9599_CR5","unstructured":"Chen, Z., Deng, N.Y., Xue, Y.: A general algorithm for underdetermined linear systems. In: The Proceedings of the First International Conference on ABS Algorithms, pp. 1\u201313 (1992)"},{"key":"9599_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0720013","volume":"20","author":"TS Coleman","year":"1983","unstructured":"Coleman, T.S., More, J.J.: Estimation of sparse Jacobian matrices and graph coloring problem. SIAM J. Numer. Anal. 20, 187\u2013209 (1983)","journal-title":"SIAM J. Numer. Anal."},{"key":"9599_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF02612334","volume":"28","author":"TS Coleman","year":"1984","unstructured":"Coleman, T.S., More, J.J.: Estimation of sparse Hessian matrices and graph coloring problem. Math. Program. 28, 243\u2013270 (1984)","journal-title":"Math. Program."},{"issue":"4","key":"9599_CR8","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1137\/0607059","volume":"7","author":"TF Coleman","year":"1986","unstructured":"Coleman, T.F., Pothen, A.: The null space problem I. complexity. SIAM J. Algebr. Discrete Methods 7(4), 527\u2013537 (1986)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"9599_CR9","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1137\/0608045","volume":"8","author":"TF Coleman","year":"1987","unstructured":"Coleman, T.F., Pothen, A.: The null space problem II. algorithms. SIAM J. Algebr. Discrete Methods 8, 544\u2013563 (1987)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"2","key":"9599_CR10","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/992200.992206","volume":"30","author":"TA Davis","year":"2004","unstructured":"Davis, T.A.: Algorithm 832: UMFPACK, an unsymmetric-pattern multifrontal method. ACM Trans. Math. Softw. 30(2), 196\u2013199 (2004)","journal-title":"ACM Trans. Math. Softw."},{"key":"9599_CR11","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718881","volume-title":"Direct Methods for Sparse Linear Systems","author":"TA Davis","year":"2006","unstructured":"Davis, T.A.: Direct Methods for Sparse Linear Systems. SIAM, Philadelphia (2006)"},{"key":"9599_CR12","first-page":"10","volume":"13","author":"DM Gay","year":"1985","unstructured":"Gay, D.M.: Electronic mail distribution of linear programming test problems. Mathematical Programming Society COAL Newsleter 13, 10\u20132 (1985)","journal-title":"Mathematical Programming Society COAL Newsleter"},{"issue":"3","key":"9599_CR13","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1137\/0608037","volume":"8","author":"JR Gilbert","year":"1987","unstructured":"Gilbert, J.R., Heath, M.T.: Computing a sparse basis for the null space. SIAM J. Algebr. Discrete Methods 8(3), 446\u2013459 (1987)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"9599_CR14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0024-3795(97)80024-9","volume":"262","author":"R Gilbert","year":"1997","unstructured":"Gilbert, R., Ng, E.G., Peyton, B.W.: Separators and structure prediction in sparse orthogonal factorization. Linear Algebra Appl. 262, 83\u201397 (1997)","journal-title":"Linear Algebra Appl."},{"key":"9599_CR15","volume-title":"Practical Optimization","author":"PE Gill","year":"1981","unstructured":"Gill, P.E., Murray, M., Wright, M.H.: Practical Optimization. Academic Press, New york (1981)"},{"key":"9599_CR16","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0024-3795(87)90112-1","volume":"88\/89","author":"PE Gill","year":"1987","unstructured":"Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H.: Maintaining LU factors of a general sparse matrix. Linear Algebra Appl. 88\/89, 239\u2013270 (1987)","journal-title":"Linear Algebra Appl."},{"key":"9599_CR17","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1137\/0606020","volume":"6","author":"C Hall","year":"1985","unstructured":"Hall, C.: Numerical solution of Navier\u2013Stokes problems by the dual variable method. SIAM J. Algebr. Discrete Methods 6, 220\u2013236 (1985)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"9599_CR18","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/0905038","volume":"5","author":"MT Heath","year":"1984","unstructured":"Heath, M.T., Plemmons, R.J., Ward, R.C.: Sparse orthogonal schemes for structural optimization using the force method. SIAM J. Sci. Statist. Comput. 5, 514\u2013532 (1984)","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"9599_CR19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/192115.192153","volume":"20","author":"K Kim","year":"1994","unstructured":"Kim, K., Nazareth, J.L.: A primal null-space affine-scaling method. ACM Trans. Math. Softw. 20, 373\u2013392 (1994)","journal-title":"ACM Trans. Math. Softw."},{"key":"9599_CR20","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1002\/nme.1620181004","volume":"19","author":"I Kaneko","year":"1982","unstructured":"Kaneko, I., Lawo, M., Thierauf, G.: On computational procedures for the force method. Int. J. Numer. Methods Eng. 19, 1469\u20131495 (1982)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"9599_CR21","first-page":"658","volume":"17","author":"SM Lu","year":"2006","unstructured":"Lu, S.M., Barlow, J.L.: Multifrontal computation with the orthogonal factors of sparse matrices. SIAM J. Matrix Anal. Appl. 17, 658\u2013679 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9599_CR22","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1287\/mnsc.3.3.255","volume":"3","author":"HM Markowitz","year":"1957","unstructured":"Markowitz, H.M.: The elimination form of the inverse and its application to linear programming. Manage. Sci. 3, 255\u2013269 (1957)","journal-title":"Manage. Sci."},{"key":"9599_CR23","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1145\/174603.174408","volume":"20","author":"P Matstoms","year":"1994","unstructured":"Matstoms, P.: Sparse QR factorization in MATLAB. ACM Trans. Math. Softw. 20, 136\u2013159 (1994)","journal-title":"ACM Trans. Math. Softw."},{"key":"9599_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0611001","volume":"11","author":"R Plemmons","year":"1990","unstructured":"Plemmons, R., White, R.: Substructuring methods for computing the nullspace of equilibrium matrices. SIAM J. Matrix Anal. Appl. 11, 1\u201322 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9599_CR25","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01585094","volume":"24","author":"JK Reid","year":"1982","unstructured":"Reid, J.K.: A sparsity exploiting variant of Bartels\u2013Golub decomposition for linear programming bases. Math. Program. 24, 55\u201369 (1982)","journal-title":"Math. Program."},{"issue":"1","key":"9599_CR26","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10100-009-0128-9","volume":"18","author":"E Spedicato","year":"2010","unstructured":"Spedicato, E., Bodon, E., Xia, E., Mahdavi-Amiri, N.: ABS method for continuous and integer linear equations and optimization. Cent. Eur. J. Oper. Res 18(1), 73\u201395 (2010)","journal-title":"Cent. Eur. J. Oper. Res"},{"issue":"1","key":"9599_CR27","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10288-002-0004-0","volume":"1","author":"E Spedicato","year":"2003","unstructured":"Spedicato, E., Bodon, E., Popolo, A., Mahdavi-Amiri, N.: ABS methods and ABSPACK for linear systems and optimization: a review. 4OR 1(1), 51\u201366 (2003)","journal-title":"4OR"},{"key":"9599_CR28","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/0614054","volume":"14","author":"JM Stern","year":"1993","unstructured":"Stern, J.M., Vavasis, S.A.: Nested dissection for sparse nullspace bases. SIAM J. Matrix Anal. Appl. 14, 766\u2013775 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9599_CR29","unstructured":"Topcu, A.: A contribution to the systematic analysis of finite element structures using the force method. Doctoral Dissertation, University of Essen, Essen, Federal Republic of Germany (1979, in German)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9599-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-012-9599-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9599-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:08:18Z","timestamp":1559351298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-012-9599-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,1]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9599"],"URL":"https:\/\/doi.org\/10.1007\/s11075-012-9599-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,1]]}}}