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

Hongbin Guo; Rosemary Renaut

doi:10.1002/nla.334

Estimation of u^T f(A )v for large-scale unsymmetric matrices

Hongbin Guo, Rosemary Renaut

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Contribution to journal › Article › peer-review

8 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) = u^Tf(A)v for fixed u,v and A, where A ∈ R^n×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 language	English (US)
Pages (from-to)	75-89
Number of pages	15
Journal	Numerical Linear Algebra with Applications
Volume	11
Issue number	1
DOIs	https://doi.org/10.1002/nla.334
State	Published - Feb 2004

Keywords

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

ASJC Scopus subject areas

Algebra and Number Theory
Applied Mathematics

Access to Document

10.1002/nla.334

Cite this

@article{09e5551feb754c16bdb65a26c408f5c9,

title = "Estimation of uT f(A )v for large-scale unsymmetric matrices",

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.",

keywords = "Arnoldi, Large-scale unsymmetric matrix, Look-ahead Lanczos, Matrix function",

author = "Hongbin Guo and Rosemary Renaut",

year = "2004",

month = feb,

doi = "10.1002/nla.334",

language = "English (US)",

volume = "11",

pages = "75--89",

journal = "Numerical Linear Algebra with Applications",

issn = "1070-5325",

publisher = "John Wiley and Sons Ltd",

number = "1",

}

TY - JOUR

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

AU - Guo, Hongbin

AU - Renaut, Rosemary

PY - 2004/2

Y1 - 2004/2

N2 - 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.

AB - 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.

KW - Arnoldi

KW - Large-scale unsymmetric matrix

KW - Look-ahead Lanczos

KW - Matrix function

UR - http://www.scopus.com/inward/record.url?scp=10044299432&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10044299432&partnerID=8YFLogxK

U2 - 10.1002/nla.334

DO - 10.1002/nla.334

M3 - Article

AN - SCOPUS:10044299432

SN - 1070-5325

VL - 11

SP - 75

EP - 89

JO - Numerical Linear Algebra with Applications

JF - Numerical Linear Algebra with Applications

IS - 1

ER -