Numerical approximation of the product of the square root of a matrix with a vector
By Edward J. Allen, James Baglama, S. Boyd. 2000
47 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/6a953589e90e6b43af1b58e0b815525276658413
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Numerical Analysis
Citations in the corpus
- A black-box rational Arnoldi variant for Cauchy–Stieltjes matrix functions (2013, methodology): “Functions of this type also arise in the context of computation of Neumann-to-Dirichlet and Dirichlet-to-Neumann maps [16, 3], the solution of systems of stochastic differential equations [2], and in quantum chromodynamics [22].”
- The extended Krylov subspace method and orthogonal Laurent polynomials (2009, background): “An early discussion on the approximation of large-scale expressions of the form (1.1) is presented by van der Vorst [26]; see also [27, Chapter 11].”