{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:28:54Z","timestamp":1743154134232,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030504168"},{"type":"electronic","value":"9783030504175"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50417-5_8","type":"book-chapter","created":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T20:09:52Z","timestamp":1592510992000},"page":"101-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Preconditioning Jacobian Systems by\u00a0Superimposing Diagonal Blocks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6154-4464","authenticated-orcid":false,"given":"M. Ali","family":"Rostami","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5210-0789","authenticated-orcid":false,"given":"H. Martin","family":"B\u00fccker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"issue":"2","key":"8_CR1","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."},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Bischof, C.H., B\u00fccker, H.M., Lang, B., Rasch, A., Vehreschild, A.: Combining source transformation and operator overloading techniques to compute derivatives for MATLAB programs. In: Proceedings of 2nd IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2002), pp. 65\u201372. IEEE Computer Society, Los Alamitos (2002). https:\/\/doi.org\/10.1109\/SCAM.2002.1134106","DOI":"10.1109\/SCAM.2002.1134106"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"B\u00fccker, H.M., L\u00fclfesmann, M., Rostami, M.A.: Enabling implicit time integration for compressible flows by partial coloring: a case study of a semi-matrix-free preconditioning technique. In: 2016 Proceedings of 7th SIAM Workshop on Combinatorial Scientific Computing, pp. 23\u201332. SIAM, Philadelphia (2016). DOI: https:\/\/doi.org\/10.1137\/1.9781611974690.ch3","DOI":"10.1137\/1.9781611974690.ch3"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s10543-006-0094-8","volume":"46","author":"KJ Cullum","year":"2006","unstructured":"Cullum, K.J., T\u016fma, M.: Matrix-free preconditioning using partial matrix estimation. BIT Numer. Math. 46(4), 711\u2013729 (2006). https:\/\/doi.org\/10.1007\/s10543-006-0094-8","journal-title":"BIT Numer. Math."},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1137\/S0036144504444711","volume":"47","author":"AH Gebremedhin","year":"2005","unstructured":"Gebremedhin, A.H., Manne, F., Pothen, A.: What color is your Jacobian? Graph coloring for computing derivatives. SIAM Rev. 47(4), 629\u2013705 (2005). https:\/\/doi.org\/10.1137\/S0036144504444711","journal-title":"SIAM Rev."},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Griewank, A., Walther, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. No. 105 in Other Titles in App. Math. 2nd edn. SIAM, Philadelphia (2008). https:\/\/doi.org\/10.1137\/1.9780898717761","DOI":"10.1137\/1.9780898717761"},{"key":"8_CR7","unstructured":"L\u00fclfesmann, M.: Partielle Berechnung von Jacobi-Matrizen mittels Graphf\u00e4rbung. In: Informatiktage 2007, Fachwissenschaftlicher Informatik-Kongress. Lecture Notes in Informatics - Seminars, vol. S-5, pp. 21\u201324. Gesellschaft f\u00fcr Informatik e.V. (2007). http:\/\/dl.gi.de\/handle\/20.500.12116\/4920"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s00287-007-0199-8","volume":"31","author":"M L\u00fclfesmann","year":"2008","unstructured":"L\u00fclfesmann, M.: Graphf\u00e4rbung zur Berechnung ben\u00f6tigter Matrixelemente. Informatik-Spektrum 31(1), 50\u201354 (2008). https:\/\/doi.org\/10.1007\/s00287-007-0199-8","journal-title":"Informatik-Spektrum"},{"key":"8_CR9","unstructured":"L\u00fclfesmann, M.: Full and partial Jacobian computation via graph coloring: Algorithms and applications. Dissertation, Dept. Computer Science, RWTH Aachen University (2012). https:\/\/d-nb.info\/1023979144\/34"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Petera, M., L\u00fclfesmann, M., B\u00fccker, H.M.: Partial Jacobian computation in the domain-specific program transformation system ADiCape. In: Proceedings of Internat. Multiconference on Computer Science and Information Technology, vol. 4, pp. 595\u2013599. IEEE Computer Society, Los Alamitos (2009). https:\/\/doi.org\/10.1109\/IMCSIT.2009.5352778","DOI":"10.1109\/IMCSIT.2009.5352778"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10861-0","volume-title":"Automatic Differentiation: Techniques and Applications","year":"1981","unstructured":"Rall, L.B. (ed.): Automatic Differentiation: Techniques and Applications. LNCS, vol. 120. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10861-0"},{"key":"8_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. SIAM, Philadelphia (2003). https:\/\/doi.org\/10.1137\/1.9780898718003","edition":"2"},{"issue":"3","key":"8_CR13","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."},{"issue":"5\/6","key":"8_CR14","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1504\/IJCSE.2014.064526","volume":"9","author":"J Willkomm","year":"2014","unstructured":"Willkomm, J., Bischof, C.H., B\u00fccker, H.M.: A new user interface for ADiMat: toward accurate and efficient derivatives of Matlab programs with ease of use. Int. J. Comput. Sci. Eng. 9(5\/6), 408\u2013415 (2014). https:\/\/doi.org\/10.1504\/IJCSE.2014.064526","journal-title":"Int. J. Comput. Sci. Eng."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50417-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T23:10:51Z","timestamp":1718665851000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-50417-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030504168","9783030504175"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50417-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"3 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2020\/","order":11,"name":"conference_url","label":"Conference URL","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"230","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":"98","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":"3","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":"43% - 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":"2.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":"4","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)"}},{"value":"248 workshop papers were selected from 489 submissions to the thematic tracks. The conference was canceled due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}