{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T05:28:11Z","timestamp":1698125291409},"reference-count":11,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2005,6,21]],"date-time":"2005-06-21T00:00:00Z","timestamp":1119312000000},"content-version":"vor","delay-in-days":4158,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Commun. Numer. Meth. Engng."],"published-print":{"date-parts":[[1994,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the paper the use of a truncated envelope technique is discussed as a preconditioning for the conjugate gradient method for solving large linear systems of equations with symmetric positive\u2010definite matrices. An algorithm to generate a truncated envelope is introduced. Computational experience with systems of linear equations from the Harwell\u2010Boeing collection is presented to highlight the efficiency of this approach.<\/jats:p>","DOI":"10.1002\/cnm.1640100206","type":"journal-article","created":{"date-parts":[[2005,8,9]],"date-time":"2005-08-09T08:39:53Z","timestamp":1123576793000},"page":"149-154","source":"Crossref","is-referenced-by-count":2,"title":["Truncated envelope peconditioning technique"],"prefix":"10.1002","volume":"10","author":[{"given":"J. J.","family":"J\u00fadice","sequence":"first","affiliation":[]},{"given":"J. M.","family":"Patr\u00edcio","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2005,6,21]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Computer Solution of Large Sparse Symmetric Positive Definite Systems","author":"George A.","year":"1981"},{"key":"e_1_2_1_3_2","volume-title":"Matrix Computations for Engineers and Scientists","author":"Jennings A.","year":"1977"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/0713020"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0713023"},{"key":"e_1_2_1_6_2","unstructured":"J. M.Patr\u00edcio \u2018A study of the envelope method for sparse symmetric positive definite matrices\u2019 Master's Thesis Departamento de Matem\u00e1tica Universidade de Coimbra June1991(in Portuguese)."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.044"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1980-0559197-0"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-2112-3"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1137\/0716029"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/62038.62043"},{"key":"e_1_2_1_12_2","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Eguations","author":"Dennis J. E.","year":"1983"}],"container-title":["Communications in Numerical Methods in Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcnm.1640100206","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cnm.1640100206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T01:56:23Z","timestamp":1698112583000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cnm.1640100206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["10.1002\/cnm.1640100206"],"URL":"https:\/\/doi.org\/10.1002\/cnm.1640100206","archive":["Portico"],"relation":{},"ISSN":["1069-8299","1099-0887"],"issn-type":[{"value":"1069-8299","type":"print"},{"value":"1099-0887","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}