메뉴 건너뛰기




Volumn 3461, Issue , 1998, Pages 249-256

A fast eigenvalue algorithm for Hankel matrices

Author keywords

Circulant matrix; Complex orthogonal transformations; Complex symmetric matrix; Eigenvalue decomposition; Fast Fourier transform; Hankel matrix; Lanczos tridiagonalization; Toeplitz matrix

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; FOURIER TRANSFORMS; MATRIX ALGEBRA; VECTORS;

EID: 0032224822     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.325685     Document Type: Conference Paper
Times cited : (1)

References (7)
  • 4
    • 0031289998 scopus 로고    scopus 로고
    • Using complex-orthogonal transformations to diagonalize a complex symmetric matrix
    • Advanced Signal Processing: Algorithms, Architectures, and Implementations VII, F.T. Luk, Ed.
    • (1997) Proc. SPIE , vol.3162 , pp. 418-425
    • Luk, F.T.1    Qiao, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.