Estimation of uTƒ(A)v for large‐scale unsymmetric matrices

DOI10.1002/NLA.334MaRDI QIDQ3538836zbMATH OpenOpenAlexFDO

Authors Hongbin Guo, R. A. Renaut

Publication date 24 November 2008

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.334

zbMATH Keywords

Arnoldi methoderror estimatesfast algorithmsfunctionallarge-scale unsymmetric matrixlook-ahead Lanczos methodmatrix functionnumerical examples

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Enhanced matrix function approximation
• Matrices, moments, and rational quadrature
• A computable error bound for matrix functionals
• scientific article; zbMATH DE number 4215273
• A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices

Cited in

(6)

• Computing project makespan distributions: Markovian PERT networks revisited
• A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices
• The Lanczos algorithm and complex Gauss quadrature
• Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\)
• A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
• The Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realization

This page was built for publication: Estimation of u^Tƒ(A)v for large‐scale unsymmetric matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3538836)