{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:40:32Z","timestamp":1767926432626,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030851644","type":"print"},{"value":"9783030851651","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-3-030-85165-1_21","type":"book-chapter","created":{"date-parts":[[2021,8,15]],"date-time":"2021-08-15T23:03:01Z","timestamp":1629068581000},"page":"370-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Exact Real Computation of Solution Operators for Linear Analytic Systems of Partial Differential Equations"],"prefix":"10.1007","author":[{"given":"Svetlana","family":"Selivanova","sequence":"first","affiliation":[]},{"given":"Florian","family":"Steinberg","sequence":"additional","affiliation":[]},{"given":"Holger","family":"Thies","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Ziegler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,16]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-22993-0_18","volume-title":"Mathematical Foundations of Computer Science 2011","author":"O Bournez","year":"2011","unstructured":"Bournez, O., Gra\u00e7a, D.S., Pouly, A.: Solving analytic differential equations in polynomial time over unbounded domains. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 170\u2013181. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22993-0_18"},{"key":"21_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68546-5_18","volume-title":"New Computational Paradigms","author":"V Brattka","year":"2008","unstructured":"Brattka, V., Hertling, P., Weihrauch, K.: A tutorial on computable analysis. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) New Computational Paradigms. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-68546-5_18"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-41579-6_6","volume-title":"Perspectives of System Informatics","author":"F Brau\u00dfe","year":"2016","unstructured":"Brau\u00dfe, F., Korovina, M., M\u00fcller, N.T.: Towards using exact real arithmetic for initial value problems. In: Mazzara, M., Voronkov, A. (eds.) PSI 2015. LNCS, vol. 9609, pp. 61\u201374. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41579-6_6"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.entcs.2008.12.010","volume":"221","author":"P Collins","year":"2008","unstructured":"Collins, P., Gra\u00e7a, D.: Effective computability of solutions of ordinary differential equations the thousand monkeys approach. Electron. Notes Theoret. Comput. Sci. 221, 103\u2013114 (2008)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"21_CR5","series-title":"Graduate Studies in Mathematics","volume-title":"Partial Differential Equations","author":"L Evans","year":"1998","unstructured":"Evans, L.: Partial Differential Equations. Graduate Studies in Mathematics, vol. 19. American Mathematical Society, Providence (1998)"},{"key":"21_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61497-2","volume-title":"The Analysis of Linear Partial Differential Operators I","author":"L H\u00f6rmander","year":"2003","unstructured":"H\u00f6rmander, L.: The Analysis of Linear Partial Differential Operators I. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-642-61497-2"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/S0097539794263452","volume":"25","author":"BM Kapron","year":"1996","unstructured":"Kapron, B.M., Cook, S.A.: A new characterization of type-2 feasibility. SIAM J. Comput. 25(1), 117\u2013132 (1996)","journal-title":"SIAM J. Comput."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Kawamura, A., Cook, S.: Complexity theory for operators in analysis. In: Proceedings of the 42nd ACM Symposium on Theory of Computing. STOC 2010, pp. 495\u2013502. ACM, New York (2010)","DOI":"10.1145\/1806689.1806758"},{"issue":"5","key":"21_CR9","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.jco.2015.05.001","volume":"31","author":"A Kawamura","year":"2015","unstructured":"Kawamura, A., M\u00fcller, N., R\u00f6snick, C., Ziegler, M.: Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey\u2019s hierarchy. J. Complex. 31(5), 689\u2013714 (2015). https:\/\/doi.org\/10.1016\/j.jco.2015.05.001","journal-title":"J. Complex."},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-662-57669-4_13","volume-title":"Logic, Language, Information, and Computation","author":"A Kawamura","year":"2018","unstructured":"Kawamura, A., Steinberg, F., Thies, H.: Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving. In: Moss, L.S., de Queiroz, R., Martinez, M. (eds.) WoLLIC 2018. LNCS, vol. 10944, pp. 223\u2013236. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-57669-4_13"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Kawamura, A., Steinberg, F., Ziegler, M.: Complexity theory of (functions on) compact metric spaces. In: Proceedings of the 31st Annual Symposium on Logic in Computer Science, LICS, pp. 837\u2013846. ACM (2016)","DOI":"10.1145\/2933575.2935311"},{"key":"21_CR12","unstructured":"Kawamura, A., Thies, H., Ziegler, M.: Average-case polynomial-time computability of Hamiltonian dynamics. In: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"21_CR13","series-title":"Progress in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"KI Ko","year":"1991","unstructured":"Ko, K.I.: Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkh\u00e4user, Boston (1991)"},{"key":"21_CR14","unstructured":"Kone\u010dn\u00fd, M., Duracz, J., Farjudian, A., Taha, W.: Picard method for enclosing odes with uncertain initial values. In: Proceedings of the 11th International Conference on Computability and Complexity in Analysis, 21\u201324 July 2014, pp. 41\u201342 (2014)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-030-79416-3_13","volume-title":"Computer Science \u2013 Theory and Applications","author":"I Koswara","year":"2021","unstructured":"Koswara, I., Pogudin, G., Selivanova, S., Ziegler, M.: Bit-complexity of solving systems of linear evolutionary partial differential equations. In: Santhanam, R., Musatov, D. (eds.) CSR 2021. LNCS, vol. 12730, pp. 223\u2013241. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79416-3_13"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-19955-5_19","volume-title":"Computer Science \u2013 Theory and Applications","author":"I Koswara","year":"2019","unstructured":"Koswara, I., Selivanova, S., Ziegler, M.: Computational complexity of real powering and improved solving linear differential equations. In: van Bevern, R., Kucherov, G. (eds.) CSR 2019. LNCS, vol. 11532, pp. 215\u2013227. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19955-5_19"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(85)90208-7","volume":"38","author":"C Kreitz","year":"1985","unstructured":"Kreitz, C., Weihrauch, K.: Theory of representations. Theoret. Comput. Sci. 38, 35\u201353 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45335-0_14","volume-title":"Computability and Complexity in Analysis","author":"NT M\u00fcller","year":"2001","unstructured":"M\u00fcller, N.T.: The iRRAM: exact arithmetic in C++. In: Blanck, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, pp. 222\u2013252. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45335-0_14"},{"key":"21_CR19","unstructured":"Park, S., et al.: Foundation of computer (algebra) analysis systems: semantics, logic, programming, verification. https:\/\/arxiv.org\/abs\/1608.05787 (2020)"},{"issue":"2\u20133","key":"21_CR20","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/BF03186542","volume":"26","author":"M Plum","year":"2009","unstructured":"Plum, M.: Computer-assisted proofs for semilinear elliptic boundary value problems. Japan J. Indust. Appl. Math. 26(2\u20133), 419\u2013442 (2009). https:\/\/doi.org\/10.1007\/BF03186542","journal-title":"Japan J. Indust. Appl. Math."},{"key":"21_CR21","unstructured":"Thies, H.: Complexity theory and practice of integrating lipschitz-continuous functions in exact real arithmetic. Master\u2019s thesis, TU Darmstadt, September 2011"},{"key":"21_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Berlin (2000). https:\/\/doi.org\/10.1007\/978-3-642-56999-9"},{"issue":"1","key":"21_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/malq.200310001","volume":"49","author":"K Weihrauch","year":"2003","unstructured":"Weihrauch, K.: Computational complexity on computable metric spaces. Math. Logic Q. 49(1), 3\u201321 (2003)","journal-title":"Math. Logic Q."}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85165-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T21:51:01Z","timestamp":1640901061000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85165-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030851644","9783030851651"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85165-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/casc-conference.org\/","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":"40","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":"24","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":"1","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":"60% - 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.41","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":"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)"}}]}}