Finding the spectral radius of a large sparse non-negative matrix

Robert Wood; Michael O'Neill

Finding the spectral radius of a large sparse non-negative matrix

Robert Wood
, Michael O'Neill

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

Abstract

The Arnoldi method is compared with a suggested competitor method which is always convergent when finding the spectral radius of a non-negative matrix. The advantages and disadvantages of both methods are discussed, as well as a comparison with the methods of orthogonal iteration and simultaneous iteration.

Original language	English
Pages (from-to)	C330-C345
Journal	ANZIAM Journal
Volume	48
Issue number	CTAC2006
Publication status	Published - 2007

Cite this

@article{e49058a139004d629b92d760645020e0,

title = "Finding the spectral radius of a large sparse non-negative matrix",

abstract = "The Arnoldi method is compared with a suggested competitor method which is always convergent when finding the spectral radius of a non-negative matrix. The advantages and disadvantages of both methods are discussed, as well as a comparison with the methods of orthogonal iteration and simultaneous iteration.",

keywords = "Arnoldi method, Inverse power method, Non-negative matrices, Orthogonal iteration, Power method, Simultaneous iteration, Spectral radius",

author = "Robert Wood and Michael O'Neill",

note = "Imported on 12 Apr 2017 - DigiTool details were: Journal title (773t) = ANZIAM Journal. ISSNs: 1446-1811; ",

year = "2007",

language = "English",

volume = "48",

pages = "C330--C345",

journal = "ANZIAM Journal",

issn = "1446-1811",

publisher = "Cambridge University Press",

number = "CTAC2006",

}

TY - JOUR

T1 - Finding the spectral radius of a large sparse non-negative matrix

AU - Wood, Robert

AU - O'Neill, Michael

N1 - Imported on 12 Apr 2017 - DigiTool details were: Journal title (773t) = ANZIAM Journal. ISSNs: 1446-1811;

PY - 2007

Y1 - 2007

N2 - The Arnoldi method is compared with a suggested competitor method which is always convergent when finding the spectral radius of a non-negative matrix. The advantages and disadvantages of both methods are discussed, as well as a comparison with the methods of orthogonal iteration and simultaneous iteration.

AB - The Arnoldi method is compared with a suggested competitor method which is always convergent when finding the spectral radius of a non-negative matrix. The advantages and disadvantages of both methods are discussed, as well as a comparison with the methods of orthogonal iteration and simultaneous iteration.

KW - Arnoldi method

KW - Inverse power method

KW - Non-negative matrices

KW - Orthogonal iteration

KW - Power method

KW - Simultaneous iteration

KW - Spectral radius

M3 - Article

SN - 1446-1811

VL - 48

SP - C330-C345

JO - ANZIAM Journal

JF - ANZIAM Journal

IS - CTAC2006

ER -

Finding the spectral radius of a large sparse non-negative matrix

Abstract

Fingerprint

Cite this