{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T18:16:47Z","timestamp":1732040207017},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T00:00:00Z","timestamp":1644278400000},"content-version":"am","delay-in-days":191,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1720259"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1016\/j.cam.2021.113442","type":"journal-article","created":{"date-parts":[[2021,1,28]],"date-time":"2021-01-28T18:27:51Z","timestamp":1611858471000},"page":"113442","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["New matrix function approximations and quadrature rules based on the Arnoldi process"],"prefix":"10.1016","volume":"391","author":[{"given":"Nasim","family":"Eshghi","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Mach","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1729-6816","authenticated-orcid":false,"given":"Lothar","family":"Reichel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2021.113442_b1","series-title":"Matrix Computations","author":"Golub","year":"2013"},{"key":"10.1016\/j.cam.2021.113442_b2","series-title":"Iterative Methods for Sparse Linear Systems","author":"Saad","year":"2003"},{"key":"10.1016\/j.cam.2021.113442_b3","series-title":"Functions of Matrices","author":"Higham","year":"2008"},{"key":"10.1016\/j.cam.2021.113442_b4","doi-asserted-by":"crossref","first-page":"1911","DOI":"10.1137\/S0036142995280572","article-title":"On Krylov subspace approximations to the matrix exponential operator","volume":"34","author":"Hochbruck","year":"1997","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/j.cam.2021.113442_b5","first-page":"1","article-title":"Total communicability as a centrality measure","volume":"1","author":"Benzi","year":"2013","journal-title":"J. Complex Netw."},{"key":"10.1016\/j.cam.2021.113442_b6","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1137\/S0895479803423822","article-title":"Quadrature rules based on the Arnoldi process","volume":"26","author":"Calvetti","year":"2005","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.cam.2021.113442_b7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1023\/A:1014899604567","article-title":"Lanczos-based exponential filtering for discrete ill-posed problems","volume":"29","author":"Calvetti","year":"2002","journal-title":"Numer. Algorithms"},{"key":"10.1016\/j.cam.2021.113442_b8","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/j.cam.2019.01.015","article-title":"Analysis of directed networks vis the matrix exponential","volume":"355","author":"De\u00a0la Cruz\u00a0Cabrera","year":"2019","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2021.113442_b9","doi-asserted-by":"crossref","first-page":"3760","DOI":"10.1137\/080742403","article-title":"Solution of large scale evolutionary problems using rational Krylov subspaces with optimized shifts","volume":"31","author":"Druskin","year":"2009","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.cam.2021.113442_b10","doi-asserted-by":"crossref","first-page":"1236","DOI":"10.1137\/0913071","article-title":"Efficient solution of parabolic equations by Krylov approximation methods","volume":"13","author":"Gallopoulos","year":"1992","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"10.1016\/j.cam.2021.113442_b11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/0729014","article-title":"Analysis of some Krylov subspace approximations to the matrix exponential operator","volume":"29","author":"Saad","year":"1992","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/j.cam.2021.113442_b12","doi-asserted-by":"crossref","first-page":"3848","DOI":"10.1137\/080741744","article-title":"Error estimation and evaluation of matrix functions vis the Faber transform","volume":"47","author":"Beckermann","year":"2009","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/j.cam.2021.113442_b13","series-title":"Linear Algebra for Large Scale and Real Time Application","first-page":"377","article-title":"Gauss quadratures associated with the Arnoldi process and the Lanczos algorithm","author":"Freund","year":"1993"},{"key":"10.1016\/j.cam.2021.113442_b14","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/S0041-5553(89)80020-5","article-title":"Two polynomial methods for the computation of functions of symmetric matrices","volume":"29","author":"Druskin","year":"1989","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"10.1016\/j.cam.2021.113442_b15","series-title":"Efficient Numerical Methods for Non-Local Operators: H2-Matrix Compression, Algorithms and Analysis. Vol. 14","author":"B\u00f6rm","year":"2010"},{"key":"10.1016\/j.cam.2021.113442_b16","unstructured":"H2Lib, http:\/\/www.h2lib.org\/, 2015\u20132020."},{"key":"10.1016\/j.cam.2021.113442_b17","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1137\/090753723","article-title":"On efficient numerical approximation of the bilinear form c\u2217A\u22121b","volume":"33","author":"Strako\u0161","year":"2011","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.cam.2021.113442_b18","first-page":"70","article-title":"Estimates for the bilinear form xTA\u22121y with applications to linear algebra problems","volume":"43","author":"Fika","year":"2014","journal-title":"Electron. Trans. Numer. Anal."},{"key":"10.1016\/j.cam.2021.113442_b19","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/s11075-017-0329-6","article-title":"Simplified anti-Gauss quadrature rules with applications in linear algebra","volume":"77","author":"Alqahtani","year":"2018","journal-title":"Numer. Algorithms"},{"key":"10.1016\/j.cam.2021.113442_b20","first-page":"197","article-title":"Enhanced matrix function approximation","volume":"47","author":"Eshghi","year":"2017","journal-title":"Electron. Trans. Numer. Anal."},{"key":"10.1016\/j.cam.2021.113442_b21","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1137\/120886261","article-title":"Block Gauss and anti-Gauss quadrature with application to networks","volume":"34","author":"Fenu","year":"2013","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.cam.2021.113442_b22","series-title":"Matrices, Moments and Quadrature with Applications","author":"Golub","year":"2010"},{"key":"10.1016\/j.cam.2021.113442_b23","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1002\/nla.803","article-title":"Moments of a linear operator on a Hilbert space, with applications to the trace of the inverse of matrices and the solution of equations","volume":"19","author":"Brezinski","year":"2012","journal-title":"Numer. Linear Algebra Appl."},{"key":"10.1016\/j.cam.2021.113442_b24","first-page":"144","article-title":"Estimations of the trace of powers of positive self-adjoint operators by extrapolation of the moments","volume":"39","author":"Brezinski","year":"2012","journal-title":"Electron. Trans. Numer. Anal."},{"key":"10.1016\/j.cam.2021.113442_b25","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1017\/S0962492900002725","article-title":"A new version of the fast multipole method for the Laplace equation in three dimensions","volume":"6","author":"Greengard","year":"1997","journal-title":"Acta Numer."},{"key":"10.1016\/j.cam.2021.113442_b26","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1002\/nla.1680020205","article-title":"Approximate solutions and eigenvalue bounds from Krylov subspaces","volume":"2","author":"Paige","year":"1995","journal-title":"Numer. Linear Algebra Appl."},{"key":"10.1016\/j.cam.2021.113442_b27","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0010-4655(02)00455-1","article-title":"Numerical methods for the QCD overlap operator, I. Sign-function and error bounds","volume":"146","author":"van\u00a0den Eshof","year":"2002","journal-title":"Comput. Phys. Comm."},{"key":"10.1016\/j.cam.2021.113442_b28","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1137\/19M1255847","article-title":"Block Krylov subspace methods for functions of matrices II: Modified block FOM","volume":"41","author":"Frommer","year":"2020","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.cam.2021.113442_b29","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/16M1072565","article-title":"The Radau\u2013Lanczos method for matrix functions","volume":"38","author":"Frommer","year":"2017","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.cam.2021.113442_b30","series-title":"Linear Multivariate Control: A Geometric Approach","author":"Wonham","year":"1985"},{"key":"10.1016\/j.cam.2021.113442_b31","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0024-3795(99)00123-8","article-title":"On the selection of poles in the single input pole placement problem","volume":"302\u2013303","author":"Calvetti","year":"1999","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.cam.2021.113442_b32","first-page":"89","article-title":"An analysis of the pole placement problem. I. The single-input case","volume":"4","author":"Mehrmann","year":"1996","journal-title":"Electron. Trans. Numer. Anal."},{"key":"10.1016\/j.cam.2021.113442_b33","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1109\/9.406","article-title":"Projection and deflation methods for partial pole assignment in linear state feedback","volume":"AC-33","author":"Saad","year":"1988","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/j.cam.2021.113442_b34","doi-asserted-by":"crossref","DOI":"10.1002\/gamm.202000012","article-title":"Matrix functions in network analysis","volume":"43","author":"Benzi","year":"2020","journal-title":"GAMM-Mitt."},{"key":"10.1016\/j.cam.2021.113442_b35","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1137\/090761070","article-title":"Network properties revealed through matrix functions","volume":"52","author":"Estrada","year":"2010","journal-title":"SIAM Rev."},{"key":"10.1016\/j.cam.2021.113442_b36","unstructured":"Biological Networks Data Sets of Newcastle University. Available at http:\/\/www.biological-networks.org\/."},{"key":"10.1016\/j.cam.2021.113442_b37","doi-asserted-by":"crossref","DOI":"10.1371\/4f8c9a2e1fca8","article-title":"Critical paths in a metapopulation model of H1N1: Effiently delaying influenza spreading through flight cancellation","volume":"4","author":"Marcelino","year":"2012","journal-title":"PLoS Curr."},{"key":"10.1016\/j.cam.2021.113442_b38","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1553\/etna_vol47s37","article-title":"Any admissible harmonic Ritz value set is possible for GMRES","volume":"47","author":"Du","year":"2017","journal-title":"Electron. Trans. Numer. Anal."},{"key":"10.1016\/j.cam.2021.113442_b39","first-page":"133","article-title":"Any finite convergence curve is possible in the initial iterations of restarted FOM","volume":"45","author":"Schweitzer","year":"2016","journal-title":"Electron. Trans. Numer. Anal."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042721000613?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042721000613?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T09:55:38Z","timestamp":1697709338000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042721000613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":39,"alternative-id":["S0377042721000613"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2021.113442","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2021,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"New matrix function approximations and quadrature rules based on the Arnoldi process","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2021.113442","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"113442"}}