{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:50:39Z","timestamp":1743033039299,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811618765"},{"type":"electronic","value":"9789811618772"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-981-16-1877-2_7","type":"book-chapter","created":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T06:03:53Z","timestamp":1617861833000},"page":"87-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimal Residual Based Iterative Methods and Its Parallel Implementation for Sparse Linear Systems"],"prefix":"10.1007","author":[{"given":"Jiang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Jin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,9]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.jcp.2016.05.053","volume":"321","author":"J Adsuara","year":"2016","unstructured":"Adsuara, J., Cordero-Carri\u00f3n, I., Cerd\u00e1-Dur\u00e1n, P., Aloy, M.: Scheduled relaxation Jacobi method: improvements and applications. J. Comput. Phys. 321, 369\u2013413 (2016). https:\/\/doi.org\/10.1016\/j.jcp.2016.05.053","journal-title":"J. Comput. Phys."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Ascher, U.M., Greif, C.: A first course on numerical methods. Computational Science and Engineering, vol. 7. SIAM (2011)","DOI":"10.1137\/9780898719987"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1137\/S0895479801395458","volume":"24","author":"ZZ Bai","year":"2003","unstructured":"Bai, Z.Z., Golub, G.H., Ng, M.K.: Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems. J. Matrix Anal. Appl. 24(3), 603\u2013626 (2003). https:\/\/doi.org\/10.1137\/S0895479801395458","journal-title":"J. Matrix Anal. Appl."},{"issue":"2\u20133","key":"7_CR4","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.laa.2007.02.018","volume":"428","author":"ZZ Bai","year":"2008","unstructured":"Bai, Z.Z., Golub, G.H., Ng, M.K.: On inexact Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems. Linear Algebr. Appl. 428(2\u20133), 413\u2013440 (2008). https:\/\/doi.org\/10.1016\/j.laa.2007.02.018","journal-title":"Linear Algebr. Appl."},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00211-004-0521-1","volume":"98","author":"ZZ Bai","year":"2004","unstructured":"Bai, Z.Z., Golub, G.H., Pan, J.Y.: Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hermitian positive semidefinite linear systems. Numerische Mathematik 98(1), 1\u201332 (2004). https:\/\/doi.org\/10.1007\/s00211-004-0521-1","journal-title":"Numerische Mathematik"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Barrett, R., et al.: Templates for the solution of linear systems: building blocks for iterative methods. Society for Industrial and Applied Mathematics (1994). https:\/\/doi.org\/10.1137\/1.9781611971538, https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611971538","DOI":"10.1137\/1.9781611971538"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1006\/jcph.2002.7176","volume":"182","author":"M Benzi","year":"2002","unstructured":"Benzi, M.: Preconditioning techniques for large linear systems: a survey. J. Comput. Phys. 182(2), 418\u2013477 (2002). https:\/\/doi.org\/10.1006\/jcph.2002.7176","journal-title":"J. Comput. Phys."},{"issue":"1\u20132","key":"7_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0377-0427(96)00121-5","volume":"77","author":"C Brezinski","year":"1997","unstructured":"Brezinski, C.: Projection methods for linear systems. J. Comput. Appl. Math. 77(1\u20132), 35\u201351 (1997). https:\/\/doi.org\/10.1016\/S0377-0427(96)00121-5","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1080\/03081087.2018.1498061","volume":"68","author":"M Chae","year":"2020","unstructured":"Chae, M., Walker, S.G.: An EM-based iterative method for solving large sparse linear systems. Linear Multilinear Algebr. 68(1), 45\u201362 (2020). https:\/\/doi.org\/10.1080\/03081087.2018.1498061","journal-title":"Linear Multilinear Algebr."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1017\/S0962492916000076","volume":"25","author":"TA Davis","year":"2016","unstructured":"Davis, T.A., Rajamanickam, S., Sid-Lakhdar, W.M.: A survey of direct methods for sparse linear systems. Acta Numerica 25, 383\u2013566 (2016). https:\/\/doi.org\/10.1017\/S0962492916000076","journal-title":"Acta Numerica"},{"issue":"3","key":"7_CR11","first-page":"1","volume":"4","author":"S Dragomir","year":"2003","unstructured":"Dragomir, S.: A survey on Cauchy-Bunyakovsky-Schwarz type discrete inequality. JIPAM J. Inequal. Pure Appl. Math. 4(3), 1\u2013142 (2003)","journal-title":"JIPAM J. Inequal. Pure Appl. Math."},{"key":"7_CR12","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BFb0080116","volume-title":"Numerical Analysis","author":"R Fletcher","year":"1976","unstructured":"Fletcher, R.: Conjugate gradient methods for indefinite systems. In: Watson, G.A. (ed.) Numerical Analysis. LNM, vol. 506, pp. 73\u201389. Springer, Heidelberg (1976). https:\/\/doi.org\/10.1007\/BFb0080116"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Frankel, S.P.: Convergence rates of iterative treatments of partial differential equations. Math. Tables Other Aids Comput. 4(30), 65\u201375 (1950). https:\/\/doi.org\/10.2307\/2002770, www.jstor.org\/stable\/2002770","DOI":"10.2307\/2002770"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01385726","volume":"60","author":"RW Freund","year":"1991","unstructured":"Freund, R.W., Nachtigal, N.M.: QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numerische Mathematik 60(1), 315\u2013339 (1991). https:\/\/doi.org\/10.1007\/BF01385726","journal-title":"Numerische Mathematik"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Gutknecht, M.H.: A brief introduction to Krylov space methods for solving linear systems. In: Kaneda, Y., Kawamura, H., Sasai, M. (eds.) Frontiers of Computational Science. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-46375-7_5","DOI":"10.1007\/978-3-540-46375-7_5"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems, vol. 49. NBS, Washington, DC (1952). https:\/\/doi.org\/10.6028\/jres.049.044","DOI":"10.6028\/jres.049.044"},{"key":"7_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis, 2nd edn. Cambridge University Press, USA (2012)","edition":"2"},{"issue":"20","key":"7_CR18","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/asna.18450222002","volume":"22","author":"CG Jacobi","year":"1845","unstructured":"Jacobi, C.G.: Ueber eine neue aufl\u00f6sungsart der bei der methode der kleinsten quadrate vorkommenden line\u00e4ren gleichungen. Astronomische Nachrichten 22(20), 297\u2013306 (1845). https:\/\/doi.org\/10.1002\/asna.18450222002","journal-title":"Astronomische Nachrichten"},{"key":"7_CR19","unstructured":"Osadcha, O., Marszalek, Z.: Comparison of steepest descent method and conjugate gradient method (2017). http:\/\/ceur-ws.org\/Vol-1853\/p01.pdf"},{"issue":"459\u2013470","key":"7_CR20","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1098\/rsta.1911.0009","volume":"210","author":"LF Richardson","year":"1911","unstructured":"Richardson, L.F.: The approximate arithmetical solution by finite differences of physical problems involving differential equations, with an application to the stresses in a masonry dam. Philos. Trans. R. Soc. Lond. Ser. A 210(459\u2013470), 307\u2013357 (1911). https:\/\/doi.org\/10.1098\/rsta.1911.0009","journal-title":"Philos. Trans. R. Soc. Lond. Ser. A"},{"issue":"3","key":"7_CR21","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1137\/0907058","volume":"7","author":"Y Saad","year":"1986","unstructured":"Saad, Y., Schultz, M.H.: GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7(3), 856\u2013869 (1986). https:\/\/doi.org\/10.1137\/0907058","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Saad, Y.: Iterative methods for sparse linear systems, vol. 82. SIAM (2003). https:\/\/doi.org\/10.1137\/1.9780898718003","DOI":"10.1137\/1.9780898718003"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1155\/2009\/794589","volume":"2009","author":"X Sheng","year":"2009","unstructured":"Sheng, X., Su, Y., Chen, G.: A modification of minimal residual iterative method to solve linear systems. Math. Probl. Eng. 2009, 9 (2009). https:\/\/doi.org\/10.1155\/2009\/794589","journal-title":"Math. Probl. Eng."},{"key":"7_CR24","unstructured":"Shewchuk, J.R.: An introduction to the conjugate gradient method without the agonizing pain. Report, Carnegie Mellon University (1994)"},{"issue":"11","key":"7_CR25","first-page":"11","volume":"1","author":"GL Sleijpen","year":"1993","unstructured":"Sleijpen, G.L., Fokkema, D.R.: BiCGstab(l) for linear equations involving unsymmetric matrices with complex spectrum. Electron. Trans. Numer. Anal. 1(11), 11\u201332 (1993)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"7_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05156-2","volume-title":"Matrix Iterative Analysis","author":"RS Varga","year":"1962","unstructured":"Varga, R.S.: Matrix Iterative Analysis. Springer, Heidelberg (1962). https:\/\/doi.org\/10.1007\/978-3-642-05156-2"},{"issue":"2","key":"7_CR27","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1137\/0913035","volume":"13","author":"HA Van der Vorst","year":"1992","unstructured":"Van der Vorst, H.A.: Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 13(2), 631\u2013644 (1992). https:\/\/doi.org\/10.1137\/0913035","journal-title":"SIAM J. Sci. Stat. Comput."}],"container-title":["Communications in Computer and Information Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-1877-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T06:18:08Z","timestamp":1617862688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-16-1877-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811618765","9789811618772"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-1877-2_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NCTCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"National Conference of Theoretical Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanning","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nctcs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"https:\/\/conf.ccf.org.cn\/TCS2020","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}