Numerical approximation of the product of the square root of a matrix with a vector
From MaRDI portal
Publication:1978127
DOI10.1016/S0024-3795(00)00068-9zbMath0972.65029WikidataQ126819159 ScholiaQ126819159MaRDI QIDQ1978127
S. K. Boyd, James Baglama, Edward J. Allen
Publication date: 11 November 2001
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
convergenceNewton's methodLanczos methoditerative methodinitial value problemmatrix square rootHilbert matrixRunge-Kutta-Fehlberg methodKrylov subspace procedure
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
The structure of matrices in rational Gauss quadrature ⋮ A black-box rational Arnoldi variant for Cauchy-Stieltjes matrix functions ⋮ Iterative numerical methods for sampling from high dimensional Gaussian distributions ⋮ A rational Arnoldi process with applications ⋮ Recursion relations for the extended Krylov subspace method ⋮ Convergence rates for inverse-free rational approximation of matrix functions ⋮ Vector estimates for \(f(A)\mathbf b\) via extrapolation ⋮ Rational Lanczos approximations to the matrix square root and related functions ⋮ Extended and rational Hessenberg methods for the evaluation of matrix functions ⋮ A fast convergent numerical method for matrix sign function with application in SDEs ⋮ Numerically solving an equation for fractional powers of elliptic operators ⋮ Spectral Ewald acceleration of Stokesian dynamics for polydisperse suspensions ⋮ Construction of Equivalent Stochastic Differential Equation Models ⋮ Statistical mechanics of holonomic systems as a Brownian motion on smooth manifolds ⋮ The extended Krylov subspace method and orthogonal Laurent polynomials ⋮ Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection ⋮ High-Dimensional Gaussian Sampling: A Review and a Unifying Approach Based on a Stochastic Proximal Point Algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing real square roots of a real matrix
- A Schur method for the square root of a matrix
- A fast method for computing the principal \(n\)-th roots of complex matrices
- Roots of real matrices
- A faster, more stable method for comuting the pth roots of positive definite matrices
- Stable iterations for the matrix square root
- A power method for computing square roots of complex matrices
- Matrix Analysis
- On the Matrix Square Root
- A Padé Approximation Method for Square Roots of Symmetric Positive Definite Matrices
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
- Newton's Method for the Matrix Square Root
This page was built for publication: Numerical approximation of the product of the square root of a matrix with a vector