A low-complexity divide-and-conquer method for computing eigenvalues and eigenvectors of symmetric band matrices

BIT Numerical Mathematics

Volumn 41, Issue 5, 2001, Pages 967-976

  Gansterer, W N ^a  

^a University of Tennessee   (United States)

Author keywords

Banded symmetric eigenproblem; Complexity analysis; Divide and conquer method

Indexed keywords

EID: 0040609750     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021933127041     Document Type: Article

References (1)

1. P. Arbenz, W. Gander, and G. H. Golub, Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations, Linear Algebra Appl., 104 (1988), pp. 75-95.