{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T11:03:16Z","timestamp":1776423796778,"version":"3.51.2"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031427527","type":"print"},{"value":"9783031427534","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-42753-4_14","type":"book-chapter","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T06:02:35Z","timestamp":1693375355000},"page":"206-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Verified Correctness, Accuracy, and\u00a0Convergence of\u00a0a\u00a0Stationary Iterative Linear Solver: Jacobi Method"],"prefix":"10.1007","author":[{"given":"Mohit","family":"Tekriwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew W.","family":"Appel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel E.","family":"Kellison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Bindel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Baptiste","family":"Jeannin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,28]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1137\/0111007","volume":"11","author":"JH Ahlberg","year":"1963","unstructured":"Ahlberg, J.H., Nilson, E.N.: Convergence properties of the spline fit. J. Soc. Indust. Appl. Math. 11, 95\u2013104 (1963)","journal-title":"J. Soc. Indust. Appl. Math."},{"issue":"1","key":"14_CR2","first-page":"1","volume":"13","author":"AW Appel","year":"2020","unstructured":"Appel, A.W., Bertot, Y.: C-language floating-point proofs layered with VST and Flocq. J. Formalized Reason. 13(1), 1\u201316 (2020)","journal-title":"J. Formalized Reason."},{"key":"14_CR3","unstructured":"Appel, A.W., Kellison, A.E.: VCFloat2: floating-point error analysis in Coq (2022). https:\/\/github.com\/VeriNum\/vcfloat\/blob\/master\/doc\/vcfloat2.pdf"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Barrett, R., et al.: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM (1994)","DOI":"10.1137\/1.9781611971538"},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10817-012-9255-4","volume":"50","author":"S Boldo","year":"2013","unstructured":"Boldo, S., Cl\u00e9ment, F., Filli\u00e2tre, J.C., Mayero, M., Melquiond, G., Weis, P.: Wave equation numerical resolution: a comprehensive mechanized proof of a C program. J. Autom. Reason. 50(4), 423\u2013456 (2013)","journal-title":"J. Autom. Reason."},{"issue":"3","key":"14_CR6","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.camwa.2014.06.004","volume":"68","author":"S Boldo","year":"2014","unstructured":"Boldo, S., Cl\u00e9ment, F., Filli\u00e2tre, J.C., Mayero, M., Melquiond, G., Weis, P.: Trusting computations: a mechanized proof from partial differential equations to actual program. Comput. Math. Appl. 68(3), 325\u2013352 (2014)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11786-014-0181-1","volume":"9","author":"S Boldo","year":"2015","unstructured":"Boldo, S., Lelay, C., Melquiond, G.: Coquelicot: a user-friendly library of real analysis for Coq. Math. Comput. Sci. 9(1), 41\u201362 (2015)","journal-title":"Math. Comput. Sci."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Boldo, S., Melquiond, G.: Flocq: a unified library for proving floating-point algorithms in Coq. In: 2011 IEEE 20th Symposium on Computer Arithmetic, pp. 243\u2013252. IEEE (2011)","DOI":"10.1109\/ARITH.2011.40"},{"key":"14_CR9","unstructured":"Cano, G., D\u00e9n\u00e8s, M.: Matrices \u00e0 blocs et en forme canonique. In: Pous, D., Tasson, C. (eds.) JFLA - Journ\u00e9es francophones des langages applicatifs. Aussois, France (2013). https:\/\/hal.inria.fr\/hal-00779376"},{"issue":"1\u20134","key":"14_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10817-018-9457-5","volume":"61","author":"Q Cao","year":"2018","unstructured":"Cao, Q., Beringer, L., Gruetter, S., Dodds, J., Appel, A.W.: VST-Floyd: a separation logic tool to verify correctness of C programs. J. Autom. Reason. 61(1\u20134), 367\u2013422 (2018)","journal-title":"J. Autom. Reason."},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-03359-9_23","volume-title":"Theorem Proving in Higher Order Logics","author":"F Garillot","year":"2009","unstructured":"Garillot, F., Gonthier, G., Mahboubi, A., Rideau, L.: Packaging mathematical structures. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 327\u2013342. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_23"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1137\/140976649","volume":"57","author":"DF Gleich","year":"2015","unstructured":"Gleich, D.F.: Pagerank beyond the web. SIAM Rev. 57(3), 321\u2013363 (2015)","journal-title":"SIAM Rev."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms. SIAM (2002)","DOI":"10.1137\/1.9780898718027"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-1-4613-8351-2_3","volume-title":"Linear Algebra, Markov Chains, and Queueing Models","author":"NJ Higham","year":"1993","unstructured":"Higham, N.J., Knight, P.A.: Componentwise error analysis for stationary iterative methods. In: Meyer, C.D., Plemmons, R.J. (eds.) Linear Algebra, Markov Chains, and Queueing Models, pp. 29\u201346. Springer, New York (1993). https:\/\/doi.org\/10.1007\/978-1-4613-8351-2_3"},{"key":"14_CR15","unstructured":"Immler, F.: A Verified ODE Solver and Smale\u2019s 14th Problem. Dissertation, Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen (2018)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-32347-8_26","volume-title":"Interactive Theorem Proving","author":"F Immler","year":"2012","unstructured":"Immler, F., H\u00f6lzl, J.: Numerical analysis of ordinary differential equations in Isabelle\/HOL. In: Beringer, L., Felty, A. (eds.) ITP 2012. LNCS, vol. 7406, pp. 377\u2013392. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32347-8_26"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10817-018-9449-5","volume":"62","author":"F Immler","year":"2019","unstructured":"Immler, F., Traut, C.: The flow of ODEs: formalization of variational equation and Poincar\u00e9 map. J. Autom. Reason. 62(2), 215\u2013236 (2019)","journal-title":"J. Autom. Reason."},{"issue":"1","key":"14_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Kellison, A., Tekriwal, M., Jeannin, J.B., Hulette, G.: Towards verified rounding error analysis for stationary iterative methods. In: 2022 IEEE\/ACM Sixth International Workshop on Software Correctness for HPC Applications (Correctness), pp. 10\u201317 (2022). https:\/\/doi.org\/10.1109\/Correctness56720.2022.00007","DOI":"10.1109\/Correctness56720.2022.00007"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Kellison, A.E., Appel, A.W.: Verified numerical methods for ordinary differential equations. In: 15th International Workshop on Numerical Software Verification (2022)","DOI":"10.1007\/978-3-031-21222-2_9"},{"key":"14_CR21","unstructured":"Kellison, A.E., Appel, A.W., Tekriwal, M., Bindel, D.: LAProof: a library of formal accuracy and correctness proofs for sparse linear algebra programs (2023). https:\/\/www.cs.princeton.edu\/~appel\/papers\/LAProof.pdf"},{"key":"14_CR22","unstructured":"Mahboubi, A., Tassi, E.: Mathematical components. Online book (2021)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Martin-Dorel, \u00c9., Rideau, L., Th\u00e9ry, L., Mayero, M., Pasca, I.: Certified, efficient and sharp univariate Taylor models in Coq. In: 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 193\u2013200. IEEE (2013)","DOI":"10.1109\/SYNASC.2013.33"},{"key":"14_CR24","unstructured":"McKenzie, L.: Matrices with dominant diagonals and economic theory. In: Arroa, K., Karlin, S., Puppes, S. (eds.) Mathematical Methods in the Social Sciences, pp. 47\u201360. Stanford University Press (1960)"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-71067-7_21","volume-title":"Theorem Proving in Higher Order Logics","author":"R O\u2019Connor","year":"2008","unstructured":"O\u2019Connor, R.: Certified exact transcendental real number computation in Coq. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 246\u2013261. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71067-7_21"},{"key":"14_CR26","unstructured":"Pasca, I.: Formal verification for numerical methods. Ph.D. thesis, Universit\u00e9 Nice Sophia Antipolis (2010)"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM (2003)","DOI":"10.1137\/1.9780898718003"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-030-76384-8_20","volume-title":"NASA Formal Methods","author":"M Tekriwal","year":"2021","unstructured":"Tekriwal, M., Duraisamy, K., Jeannin, J.-B.: A formal proof of the lax equivalence theorem for finite difference schemes. In: Dutle, A., Moscato, M.M., Titolo, L., Mu\u00f1oz, C.A., Perez, I. (eds.) NFM 2021. LNCS, vol. 12673, pp. 322\u2013339. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76384-8_20"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Tekriwal, M., Miller, J., Jeannin, J.B.: Formal verification of iterative convergence of numerical algorithms (2022). https:\/\/doi.org\/10.48550\/arXiv.2202.05587","DOI":"10.48550\/arXiv.2202.05587"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Thiemann, R.: A Perron-Frobenius theorem for deciding matrix growth. J. Log. Algebraic Methods Program. 100699 (2021)","DOI":"10.1016\/j.jlamp.2021.100699"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42753-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T10:47:43Z","timestamp":1703069263000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42753-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031427527","9783031427534"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42753-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computer Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2023\/cicm.php","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":"31","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":"16","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":"6","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":"52% - 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","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","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)"}}]}}