Estimating the condition number of \(f(A)b\)
type: Item
instance of: scholarly article
title: Estimating the condition number of \(f(A)b\)
zbMATH Open document ID: 1326.65058
author: Edvin Deadman
published in: Numerical Algorithms
publication date: 2015-10-19T00:00:00Z
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 65F60
zbMATH DE Number: 6495730
zbMATH Keywords: matrix function
zbMATH Keywords: matrix exponential
zbMATH Keywords: condition number estimation
zbMATH Keywords: Fréchet derivative
zbMATH Keywords: power iteration
zbMATH Keywords: block 1-norm estimator
zbMATH Keywords: Python
zbMATH Keywords: algorithm
zbMATH Keywords: matrix-vector multiplications
zbMATH Keywords: numerical experiment
describes a project that uses: SciPy
describes a project that uses: mctoolbox
describes a project that uses: Expokit
describes a project that uses: SparseMatrix
describes a project that uses: mftoolbox
MaRDI profile type: Publication
full work available at URL: s11075-014-9947-4
OpenAlex ID: W2089119833
cites work: Computing the Fréchet Derivative of the Matrix Exponential, with an Application to Condition Number Estimation
cites work: Computing the Action of the Matrix Exponential, with an Application to Exponential Integrators
cites work: Improved Inverse Scaling and Squaring Algorithms for the Matrix Logarithm
cites work: Computing the Fréchet derivative of the matrix logarithm and estimating the condition number
cites work: A Schur method for the square root of a matrix
cites work: An Efficient Implicit FEM Scheme for Fractional-in-Space Reaction-Diffusion Equations
cites work: Balancing sparse matrices for computing eigenvalues
cites work: A Schur-Parlett Algorithm for Computing Matrix Functions
cites work: Q5701672
cites work: The university of Florida sparse matrix collection
cites work: Testing matrix function algorithms using identities
cites work: On the stability of some algorithms for computing the action of the matrix exponential
cites work: Q3530191
cites work: Efficient Solution of Parabolic Equations by Krylov Approximation Methods
cites work: Rational Krylov approximation of matrix functions: numerical methods and optimal pole selection
cites work: Computing $A^\alpha, \log(A)$, and Related Matrix Functions by Contour Integrals
cites work: Accuracy and Stability of Numerical Algorithms
cites work: Functions of Matrices
cites work: An improved Schur-Padé algorithm for fractional powers of a matrix and their Fréchet derivatives
cites work: A Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra
cites work: Exponential integrators
cites work: Talbot quadratures and rational approximations
cites work: Condition Estimates for Matrix Functions
cites work: Small-Sample Statistical Condition Estimates for General Matrix Functions
cites work: Calculation of functions of unsymmetric matrices using Arnoldi's method
cites work: Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
cites work: A Theory of Condition
cites work: Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
cites work: Computing \(exp(-\tau A) b\) with Laguerre polynomials
cites work: Expokit
cites work: An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
DOI: 10.1007/S11075-014-9947-4
description: scientific article; zbMATH DE number 6495730