{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,22]],"date-time":"2026-10-22T17:12:49Z","timestamp":1792689169687,"version":"4.5.0"},"reference-count":15,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Numer. Anal."],"published-print":{"date-parts":[[1975,9]]},"abstract":"<jats:p>The method of conjugate gradients for solving systems of linear equations with a symmetric positive definite matrix A is given as a logical development of the Lanczos algorithm for tridiagonalizing A. This approach suggests numerical algorithms for solving such systems when A is symmetric but indefinite. These methods have advantages when A is large and sparse.<\/jats:p>","DOI":"10.1137\/0712047","type":"journal-article","created":{"date-parts":[[2005,2,28]],"date-time":"2005-02-28T01:34:47Z","timestamp":1109554487000},"page":"617-629","source":"Crossref","is-referenced-by-count":1299,"title":["Solution of Sparse Indefinite Systems of Linear Equations"],"prefix":"10.1137","volume":"12","author":[{"given":"C. C.","family":"Paige","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. A.","family":"Saunders","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,14]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(63)90412-9"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.044"},{"key":"R3","unstructured":"Alston S. Householder, The theory of matrices in numerical analysis, Blaisdell Publishing Co. Ginn and Co.  New York-Toronto-London, 1964, 139\u2013141MR0175290"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.6028\/jres.045.026"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.006"},{"key":"R6","unstructured":"C. L. Lawson,  Sparse matrix methods based on orthogonality and conjugacy, Tech. Memo., 33\u2013627, Jet Propulsion Laboratory, Pasadena, Calif.,  1973"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/0117118"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1137\/0707032"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/10.3.373"},{"key":"R10","unstructured":"C. C. Paige, M. A. Saunders,  Solution of sparse indefinite systems of equations and least squares problems, Tech. Rep., CS 399, Computer Science Dept., Stanford Univ., Stanford, Calif.,  1973"},{"key":"R11","first-page":"231","volume-title":"Large sparse sets of linear equations (Proc. Conf., St. Catherine's Coll., Oxford, 1970)","author":"Reid J. K.","year":"1971"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.2307\/2003361"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/12.3.329"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/13.2.215"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932964"}],"container-title":["SIAM Journal on Numerical Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0712047","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:51:41Z","timestamp":1787334701000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0712047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,9]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1975,9]]}},"alternative-id":["10.1137\/0712047"],"URL":"https:\/\/doi.org\/10.1137\/0712047","relation":{},"ISSN":["0036-1429","1095-7170"],"issn-type":[{"value":"0036-1429","type":"print"},{"value":"1095-7170","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975,9]]}}}