{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T11:16:08Z","timestamp":1743160568306,"version":"3.37.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319780238"},{"type":"electronic","value":"9783319780245"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-78024-5_3","type":"book-chapter","created":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T12:28:25Z","timestamp":1521721705000},"page":"24-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Evaluation of Matrix Polynomials"],"prefix":"10.1007","author":[{"given":"Niv","family":"Hoffman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Schwartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivan","family":"Toledo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,23]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"1382","DOI":"10.1137\/15M1032168","volume":"37","author":"G Ballard","year":"2016","unstructured":"Ballard, G., Benson, A.R., Druinsky, A., Lipshitz, B., Schwartz, O.: Improving the numerical stability of fast matrix multiplication. SIAM J. Matrix Anal. Appl. 37, 1382\u20131418 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1137\/090769156","volume":"32","author":"G Ballard","year":"2011","unstructured":"Ballard, G., Demmel, J., Holtz, O., Schwartz, O.: Minimizing communication in linear algebra. SIAM J. Matrix Anal. Appl. 32, 866\u2013901 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/2395116.2395121","volume":"59","author":"G Ballard","year":"2012","unstructured":"Ballard, G., Demmel, J., Holtz, O., Schwartz, O.: Graph expansion and communication costs of fast matrix multiplication. J. ACM 59, 32 (2012)","journal-title":"J. ACM"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Benson, A.R., Ballard, G.: A framework for practical parallel fast matrix multiplication. In: ACM SIGPLAN Notices, vol. 50, pp. 42\u201353 (2015)","DOI":"10.1145\/2688500.2688513"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01395989","volume":"36","author":"D Bini","year":"1980","unstructured":"Bini, D., Lotti, G.: Stability of fast algorithms for matrix multiplication. Numer. Math. 36, 63\u201372 (1980)","journal-title":"Numer. Math."},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/S0895479802410815","volume":"25","author":"PI Davies","year":"2003","unstructured":"Davies, P.I., Higham, N.J.: A Schur-Parlett algorithm for computing matrix functions. SIAM J. Matrix Anal. Appl. 25, 464\u2013485 (2003)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-36803-5_12","volume-title":"Applied Parallel and Scientific Computing","author":"E Deadman","year":"2013","unstructured":"Deadman, E., Higham, N.J., Ralha, R.: Blocked schur algorithms for computing the matrix square root. In: Manninen, P., \u00d6ster, P. (eds.) PARA 2012. LNCS, vol. 7782, pp. 171\u2013182. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36803-5_12"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s00211-007-0061-6","volume":"106","author":"J Demmel","year":"2007","unstructured":"Demmel, J., Dumitriu, I., Holtz, O., Kleinberg, R.: Fast matrix multiplication is stable. Numer. Math. 106, 199\u2013224 (2007)","journal-title":"Numer. Math."},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/77626.79170","volume":"16","author":"JJ Dongarra","year":"1990","unstructured":"Dongarra, J.J., Cruz, J.D., Hammarling, S., Duff, I.: A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1\u201317 (1990)","journal-title":"ACM Trans. Math. Softw."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: Proceedings of the 40th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 285\u2013297 (1999)","DOI":"10.1109\/SFFCS.1999.814600"},{"key":"3_CR11","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"G Golub","year":"2013","unstructured":"Golub, G., Loan, C.V.: Matrix Computations, 4th edn. Johns Hopkins, Baltimore (2013)","edition":"4"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Higham, N.J.: Functions of matrices: theory and algorithm. In: SIAM (2008)","DOI":"10.1137\/1.9780898717778"},{"key":"3_CR13","unstructured":"Huang, J., Smith, T.M., Henry, G.M., van de Geijn, R.A.: Implementing Strassen\u2019s algorithm with BLIS. arXiv preprint arXiv:1605.01078 (2016)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Huang, J., Smith, T.M., Henry, G.M., van de Geijn, R.A.: Strassen\u2019s algorithm reloaded. In: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis (SC), pp. 690\u2013701. IEEE (2016)","DOI":"10.1109\/SC.2016.58"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1016\/j.jpdc.2004.03.021","volume":"64","author":"D Irony","year":"2004","unstructured":"Irony, D., Toledo, S., Tiskin, A.: Communication lower bounds for distributed-memory matrix multiplication. J. Par. Dist. Comput. 64, 1017\u20131026 (2004)","journal-title":"J. Par. Dist. Comput."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Jia-Wei, H., Kung, H.T.: I\/o complexity: the red-blue pebble game. In: Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing (STOC), pp. 326\u2013333, ACM, New York (1981)","DOI":"10.1145\/800076.802486"},{"key":"3_CR17","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1145\/592843.592846","volume":"28","author":"I Jonsson","year":"2002","unstructured":"Jonsson, I., K\u00e5gstr\u00f6m, B.: Recursive blocked algorithms for solving triangular systems: Part II: two-sided and generalized Sylvester and Lyapunov matrix equations. ACM Trans. Math. Softw. 28, 416\u2013435 (2002)","journal-title":"ACM Trans. Math. Softw."},{"key":"3_CR18","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1145\/1186785.1186787","volume":"32","author":"D Kressner","year":"2006","unstructured":"Kressner, D.: Block algorithms for reordering standard and generalized Schur forms. ACM Trans. Math. Softw. 32, 521\u2013532 (2006)","journal-title":"ACM Trans. Math. Softw."},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1109\/TAC.1979.1102005","volume":"24","author":"CFV Loan","year":"1979","unstructured":"Loan, C.F.V.: A note on the evaluation of matrix polynomials. IEEE Trans. Autom. Control AC 24, 320\u2013321 (1979)","journal-title":"IEEE Trans. Autom. Control AC"},{"key":"3_CR20","unstructured":"Parlett, B.N.: Computation of functions of triangular matrices. Memorandum ERL-M481, Electronics Research Laboratory, UC Berkeley, November 1974"},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/0202007","volume":"2","author":"MS Paterson","year":"1973","unstructured":"Paterson, M.S., Stockmeyer, L.J.: On the number of nonscalar multiplications necessary to evaluate polynomials. SIAM J. Comput. 2, 60\u201366 (1973)","journal-title":"SIAM J. Comput."},{"key":"3_CR22","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Num. Math. 13, 354\u2013356 (1969)","journal-title":"Num. Math."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Toledo, S.: A survey of out-of-core algorithms in numerical linear algebra. In: Abello, J.M., Vitter, J.S. (eds.), External Memory Algorithms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 161\u2013179. American Mathematical Society (1999)","DOI":"10.1090\/dimacs\/050\/09"},{"key":"3_CR24","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0024-3795(71)90009-7","volume":"4","author":"S Winograd","year":"1971","unstructured":"Winograd, S.: On multiplication of 2-by-2 matrices. Linear Algebra Appl. 4, 381\u2013388 (1971)","journal-title":"Linear Algebra Appl."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78024-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T18:50:13Z","timestamp":1693594213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-78024-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319780238","9783319780245"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78024-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}