Estimation of uT f(A )v for large-scale unsymmetric matrices

Hongbin Guo, Rosemary Renaut

Research output: Contribution to journalArticle

6 Scopus citations

Abstract

Fast algorithms, based on the unsymmetric look-ahead Lanczos and the Arnoldi process, are developed for the estimation of the functional φ(f) = uTf(A)v for fixed u,v and A, where A ∈ Rn×n is a large-scale unsymmetric matrix. Numerical results are presented which validate the comparable accuracy of both approaches. Although the Arnoldi process reaches convergence more quickly in some cases, it has greater memory requirements, and may not be suitable for especially large applications.

Original languageEnglish (US)
Pages (from-to)75-89
Number of pages15
JournalNumerical Linear Algebra with Applications
Volume11
Issue number1
DOIs
StatePublished - Feb 1 2004

Keywords

  • Arnoldi
  • Large-scale unsymmetric matrix
  • Look-ahead Lanczos
  • Matrix function

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Estimation of u<sup>T</sup> f(A )v for large-scale unsymmetric matrices'. Together they form a unique fingerprint.

  • Cite this