{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:44:04Z","timestamp":1787510644230,"version":"build-2736575974"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1007\/bf02310101","type":"journal-article","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T04:19:11Z","timestamp":1139977151000},"page":"111-132","source":"Crossref","is-referenced-by-count":7,"title":["Efficient solutions of hierarchical systems of linear equations","Effiziente L\u00f6sungen hierarchischer linearer Gleichungssysteme"],"prefix":"10.1007","volume":"39","author":[{"given":"Th.","family":"Lengauer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ch.","family":"Wieners","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02310101_CR1","series-title":"A.E.R.E. Report R. 8730","volume-title":"MA28\u2014a set of FORTRAN subroutines for sparse unsymmetric linear equations","author":"I. S. Duff","year":"1977","unstructured":"Duff, I. S.: MA28\u2014a set of FORTRAN subroutines for sparse unsymmetric linear equations. A.E.R.E. Report R. 8730. HMSO, London (1977)."},{"key":"BF02310101_CR2","unstructured":"FORTRAN NAG Manual. Numerical Algorithms Group Ltd, NAG Central Office, Oxford."},{"key":"BF02310101_CR3","doi-asserted-by":"crossref","unstructured":"Gallagher, R. H.: Finite-Element-Analysis. Springer (1976).","DOI":"10.1007\/978-3-642-49312-6"},{"key":"BF02310101_CR4","unstructured":"Lengauer, T., Wanke, E.: Efficient solution of connectivity problems on hierarchically defined graphs. TR No. 39, Fachbereich 17, Univ. Paderborn (1987). To appear in SIAM J. Comput."},{"key":"BF02310101_CR5","first-page":"346","volume":"16\/2","author":"R. J. Lipton","year":"1976","unstructured":"Lipton, R. J., Rose, D. J., Tarjan, R. E.: Generalized nested dissection. SIAM J. Numer. Anal.16\/2, 346\u2013358 (1976).","journal-title":"SIAM J. Numer. Anal."},{"key":"BF02310101_CR6","series-title":"Mathematical Centre Tracts","volume-title":"Sparse matrices and substructures","author":"F. J. Peters","year":"1980","unstructured":"Peters, F. J.: Sparse matrices and substructures. Mathematical Centre Tracts 119, Mathematisch Centrum, Amsterdam (1980)."},{"key":"BF02310101_CR7","unstructured":"Przemieniecki, J. S.: Theory of matrix structural analysis. McGraw-Hill Book Company 1968."},{"key":"BF02310101_CR8","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5\/2","author":"D. J. Rose","year":"1976","unstructured":"Rose, D. J., Tarjan, R. E., Lueker, G. S.: Algorithmic aspects of vertex elimination. SIAM J. Comput.5\/2, 266\u2013283 (1976).","journal-title":"SIAM J. Comput."},{"key":"BF02310101_CR9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1093\/qjmam\/24.3.285","volume":"24","author":"F. W. Williams","year":"1971","unstructured":"Williams, F. W.: Natural frequencies of repetitive structures. Q.J.M.A.M.24, 285\u2013310 (1971).","journal-title":"Q.J.M.A.M."},{"key":"BF02310101_CR10","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1002\/nme.1620050309","volume":"5","author":"F. W. Williams","year":"1973","unstructured":"Williams, F. W.: Comparison between sparse stiffness matrix and substructure methods. Int J. Num. Methods in Engineering5, 363\u2013394 (1973).","journal-title":"Int J. Num. Methods in Engineering"},{"key":"BF02310101_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP complete. SIAM J. Algebraic Discrete Methods2, 77\u201379 (1981).","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02310101.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02310101\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02310101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:11:52Z","timestamp":1558012312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02310101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["BF02310101"],"URL":"https:\/\/doi.org\/10.1007\/bf02310101","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}