{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:28:39Z","timestamp":1743038919063,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030866525"},{"type":"electronic","value":"9783030866532"}],"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-86653-2_34","type":"book-chapter","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T21:45:47Z","timestamp":1631223947000},"page":"465-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Another Dubious Way to Compute the Exponential of a Matrix"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5621-3783","authenticated-orcid":false,"given":"Jerzy","family":"Respondek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"issue":"1","key":"34_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/S00361445024180","volume":"45","author":"C Moler","year":"2003","unstructured":"Moler, C., Van Loan, C.: Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later. SIAM Rev. 45(1), 3\u201349 (2003)","journal-title":"SIAM Rev."},{"key":"34_CR2","volume-title":"Controllability of Dynamical Systems","author":"J Klamka","year":"1991","unstructured":"Klamka, J.: Controllability of Dynamical Systems. Kluwer Academic Publishers, Dordrecht (1991)"},{"issue":"2","key":"34_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.2478\/v10006-008-0018-7","volume":"18","author":"J Respondek","year":"2008","unstructured":"Respondek, J.: Approximate controllability of infinite dimensional systems of the n-th order. Int. J. Appl. Math. Comput. Sci. 18(2), 199\u2013212 (2008)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.aml.2010.08.026","volume":"24","author":"J Respondek","year":"2011","unstructured":"Respondek, J.: On the confluent Vandermonde matrix calculation algorithm. Appl. Math. Lett. 24, 103\u2013106 (2011)","journal-title":"Appl. Math. Lett."},{"key":"34_CR5","volume-title":"Vibration Problems in Engineering","author":"S Timoshenko","year":"1955","unstructured":"Timoshenko, S.: Vibration Problems in Engineering, 3rd edn. D. Van Nostrand Company, London (1955)","edition":"3"},{"key":"34_CR6","first-page":"93","volume":"157","author":"SM El-Sayed","year":"2004","unstructured":"El-Sayed, S.M., Kaya, D.: An application of the ADM to seven order Sawada-Kotara equations. Appl. Math. Comput. 157, 93\u2013101 (2004)","journal-title":"Appl. Math. Comput."},{"key":"34_CR7","volume-title":"Numerical Analysis: Mathematics of Scientific Computing","author":"DR Kincaid","year":"2001","unstructured":"Kincaid, D.R., Cheney, E.W.: Numerical Analysis: Mathematics of Scientific Computing, 3rd edn. Brooks Cole, California (2001)","edition":"3"},{"issue":"1","key":"34_CR8","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1080\/00029890.1960.11989446","volume":"67","author":"A Spitzbart","year":"1960","unstructured":"Spitzbart, A.: A generalization of Hermite\u2019s interpolation formula. Am. Math. Mon. 67(1), 42\u201346 (1960)","journal-title":"Am. Math. Mon."},{"issue":"6","key":"34_CR9","doi-asserted-by":"publisher","first-page":"2587","DOI":"10.1109\/TIT.2010.2046208","volume":"56","author":"K Lee","year":"2010","unstructured":"Lee, K., O\u2019Sullivan, M.E.: Algebraic soft-decision decoding of Hermitian codes. IEEE Trans. Inf. Theory 56(6), 2587\u20132600 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"34_CR10","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. SIAM J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"SIAM J. Soc. Ind. Appl. Math."},{"key":"34_CR11","unstructured":"Gorecki, H: On switching instants in minimum time control problem. One dimensional case n-tuple eigenvalue. Bull. de L\u2019Acad. Pol. Des. Sci. 16, 23\u201330 (1968)"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF02575865","volume":"17","author":"D Bini","year":"1980","unstructured":"Bini, D.: Relations between exact and approximate bilinear algorithms. Applications. Calcolo 17, 87\u201397 (1980)","journal-title":"Calcolo"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Bini, D., Capovani, M., Lotti, G., Romani, F.: O(n2.7799) complexity for approximate matrix multiplication. Inform. Process. Lett. 8(5), 234\u2013235 (1979)","DOI":"10.1016\/0020-0190(79)90113-3"},{"issue":"3","key":"34_CR14","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/0210032","volume":"10","author":"A Sch\u00f6nhage","year":"1981","unstructured":"Sch\u00f6nhage, A.: Partial and total matrix multiplication. SIAM J. Comput. 10(3), 434\u2013455 (1981)","journal-title":"SIAM J. Comput."},{"key":"34_CR15","first-page":"1384","volume":"174","author":"A Eisinberg","year":"2006","unstructured":"Eisinberg, A., Fedele, G.: On the inversion of the Vandermonde matrix. Appl. Math. Comput. 174, 1384\u20131397 (2006)","journal-title":"Appl. Math. Comput."},{"key":"34_CR16","unstructured":"Yan, S., Yang, A.: Explicit algorithm to the inverse of Vandermonde matrix. In: International Conference on Test and Measurements, pp. 176\u2013179 (2009)"},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1080\/0020716021000059133","volume":"80","author":"MEA El-Mikkawy","year":"2003","unstructured":"El-Mikkawy, M.E.A.: Inversion of a generalized Vandermonde matrix. Int. J. Comput. Math. 80, 759\u2013765 (2003)","journal-title":"Int. J. Comput. Math."},{"key":"34_CR18","first-page":"12","volume":"1","author":"S Hou","year":"2007","unstructured":"Hou, S., Hou, E.: Recursive computation of inverses of confluent Vandermonde matrices. Electron. J. Math. Technol. 1, 12\u201326 (2007)","journal-title":"Electron. J. Math. Technol."},{"key":"34_CR19","first-page":"2044","volume":"218","author":"J Respondek","year":"2011","unstructured":"Respondek, J.: Numerical recipes for the high efficient inverse of the confluent Vandermonde matrices. Appl. Math. Comput. 218, 2044\u20132054 (2011)","journal-title":"Appl. Math. Comput."},{"key":"34_CR20","volume-title":"Optimization of the Dynamical Systems","author":"H Gorecki","year":"1993","unstructured":"Gorecki, H.: Optimization of the Dynamical Systems. PWN, Warsaw (1993)"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Hou, S., Hou, E.S.: A recursive algorithm for triangular factorization of inverse of confluent Vandermonde matrices. In: AIP Conference Proceedings, vol. 1089, no. 277, pp. 277\u2013288 (2009)","DOI":"10.1063\/1.3078136"},{"key":"34_CR22","unstructured":"Barbeau, E.J.: Polynomials, Problem Books in Mathematics. Springer, Berlin (1989). https:\/\/www.springer.com\/gp\/book\/9780387406275. ISBN 978-0-387-40627-5. Series ISSN 0941-3502"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Prasolov, V.: Polynomials, Algorithms and Computation in Mathematics. Springer, Berlin (2004). https:\/\/doi.org\/10.1007\/978-3-642-03980-5","DOI":"10.1007\/978-3-642-03980-5"},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"Pan, V.Ya: Strassen\u2019s algorithm is not optimal - trilinear technique of aggregating uniting and cancelling for constructing fast algorithms for matrix operations. In: Proceedings of 19th Annual Symposium on Foundations of Computer Science, Ann Arbor, Mich (1978)","DOI":"10.1109\/SFCS.1978.34"},{"issue":"3","key":"34_CR25","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 251\u2013280 (1990)","journal-title":"J. Symb. Comput."},{"key":"34_CR26","unstructured":"Williams, V.V.: Multiplying matrices in O(n2.373) time. Tech. rep. Stanford University (2014)"},{"key":"34_CR27","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/TAC.1970.1099568","volume":"15","author":"M Vidyasagar","year":"1970","unstructured":"Vidyasagar, M.: A novel method of evaluating eAt in closed form. IEEE Trans. Automatic Contr. AC 15, 600\u2013601 (1970)","journal-title":"IEEE Trans. Automatic Contr. AC"},{"key":"34_CR28","first-page":"91","volume":"18","author":"U Luther","year":"2004","unstructured":"Luther, U., Rost, K.: Matrix exponentials and inversion of confluent Vandermonde matrices. Electron. Trans. Numer. Anal. 18, 91\u2013100 (2004)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"34_CR29","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1109\/TAC.1964.1105716","volume":"9","author":"JT Tou","year":"1964","unstructured":"Tou, J.T.: Determination of the inverse Vandermonde matrix. IEEE Trans. Autom. Contr. AC 9, 314 (1964)","journal-title":"IEEE Trans. Autom. Contr. AC"},{"key":"34_CR30","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TAC.1966.1098464","volume":"11","author":"SH Wu","year":"1966","unstructured":"Wu, S.H.: On the inverse of Vandermonde matrix. IEEE Trans. Autom. Contr. AC 11, 769 (1966)","journal-title":"IEEE Trans. Autom. Contr. AC"},{"key":"34_CR31","unstructured":"Cormen, T.H., Leiserson, Ch.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)"},{"issue":"3","key":"34_CR32","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/S089547989630749X","volume":"19","author":"X Zhong","year":"1998","unstructured":"Zhong, X., Zhaoyong, Y.: A fast algorithm for inversion of confluent Vandermonde-like matrices involving polynomials that satisfy a three-term recurrence relation. SIAM J. Matrix Anal. Appl. 19(3), 797\u2013806 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"112","key":"34_CR33","doi-asserted-by":"publisher","first-page":"893","DOI":"10.2307\/2004623","volume":"24","author":"A Bjorck","year":"1970","unstructured":"Bjorck, A., Pereyra, V.: Solution of Vandermonde systems of equations. Math. Comp. 24(112), 893\u2013903 (1970)","journal-title":"Math. Comp."},{"key":"34_CR34","series-title":"Theory and Computation","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717778","volume-title":"Functions of Matrices","author":"NJ Higham","year":"2008","unstructured":"Higham, N.J.: Functions of Matrices. Theory and Computation, SIAM, Philadelphia (2008)"},{"key":"34_CR35","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"1996","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia (1996)"},{"issue":"5","key":"34_CR36","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/BF01408579","volume":"50","author":"NJ Higham","year":"1987","unstructured":"Higham, N.J.: Error analysis of the Bjorck-Pereyra algorithms for solving Vandermonde systems. Numer. Math. 50(5), 613\u2013632 (1987)","journal-title":"Numer. Math."},{"key":"34_CR37","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02575864","volume":"17","author":"F Romani","year":"1980","unstructured":"Romani, F.: Complexity measures for matrix multiplication algorithms. Calcolo 17, 77\u201386 (1980)","journal-title":"Calcolo"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86653-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T17:53:08Z","timestamp":1632505988000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86653-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030866525","9783030866532"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86653-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cagliari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"16 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.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":"Customed version of CyberChair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1588","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":"466","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":"18","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":"29% - 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":"8","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)"}}]}}