메뉴 건너뛰기




Volumn 826, Issue , 1988, Pages 143-145

Determination Of Pisarenko Frequency Estimates As Eigenvalues Of An Orthogonal Matrix

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; EIGENVALUES AND EIGENFUNCTIONS; SIGNAL PROCESSING; WHITE NOISE;

EID: 84957527611     PISSN: 0277786X     EISSN: 1996756X     Source Type: Conference Proceeding    
DOI: 10.1117/12.942026     Document Type: Conference Paper
Times cited : (20)

References (15)
  • 1
    • 84984520202 scopus 로고
    • The Retrieval of Harmonics from a Covariance Function
    • V. F. Pisarenko, “The Retrieval of Harmonics from a Covariance Function,” Geophys. J. R. Astr. Soc. 33, 347-366 (1973).
    • (1973) Geophys. J. R. Astr. Soc , vol.33 , pp. 347-366
    • Pisarenko, V.F.1
  • 3
    • 0001459395 scopus 로고
    • Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix
    • G. Cybenko and C. Van Loan, “Computing the Minimum Eigenvalue of a Symmetric Positive Definite Toeplitz Matrix,” SIAM J. Sci. Stat. Comput. 7, 123-131 (1986).
    • (1986) SIAM J. Sci. Stat. Comput , vol.7 , pp. 123-131
    • Cybenko, G.1    Van Loan, C.2
  • 6
    • 0022739760 scopus 로고
    • An Efficient Algorithm for Computing Pisarenko’s Harmonic Decomposition Using Levinson’s Recursion
    • M. H. Hayes and M. A. Clements, “An Efficient Algorithm for Computing Pisarenko’s Harmonic Decomposition Using Levinson’s Recursion,” IEEE Trans. Acoust. Speech Signal Process. 34, 485-491 (1986).
    • (1986) IEEE Trans. Acoust. Speech Signal Process , vol.34 , pp. 485-491
    • Hayes, M.H.1    Clements, M.A.2
  • 7
    • 0001866910 scopus 로고
    • The Perfidious Polynomial
    • G. H. Golub, ed., Studies in Mathematics, Mathematical Association of America
    • J. H. Wilkenson, “The Perfidious Polynomial,” in Studies in Numerical Analysis, G. H. Golub, ed., Studies in Mathematics Vol. 24, Mathematical Association of America, 1-28 (1984).
    • (1984) Studies in Numerical Analysis , vol.24 , pp. 1-28
    • Wilkenson, J.H.1
  • 8
    • 0012411229 scopus 로고
    • Questions on Numerical Condition Related to Polynomials
    • G. H. Golub, ed., Studies in Mathematics, Mathematical Association of America
    • W. Gautschi, “Questions on Numerical Condition Related to Polynomials,” in Studies in Numerical Analysis, G. H. Golub, ed., Studies in Mathematics Vol. 24, Mathematical Association of America, 140-177 (1984).
    • (1984) Studies in Numerical Analysis , vol.24 , pp. 140-177
    • Gautschi, W.1
  • 9
    • 0003384422 scopus 로고
    • Positive Definite Toeplitz Matrices, the Arnoldi Process for Isometric Operators, and Gaussian Quadrature on the Unit Circle (In Russian)
    • E. S. Nikolaev, ed., Moscow University Press
    • W. B. Gragg, “Positive Definite Toeplitz Matrices, the Arnoldi Process for Isometric Operators, and Gaussian Quadrature on the Unit Circle (in Russian),” in Numerical Methods in Linear Algebra, E. S. Nikolaev, ed., Moscow University Press, 16-32 (1982).
    • (1982) Numerical Methods in Linear Algebra , pp. 16-32
    • Gragg, W.B.1
  • 10
    • 0021570911 scopus 로고
    • Computing Pisarenko Frequency Estimates
    • Princeton Univ.
    • G. Cybenko, “Computing Pisarenko Frequency Estimates,” in Proc. 1984 Conf. Inform. Syst. Sci., Princeton Univ., 587-591 (1984).
    • (1984) Proc. 1984 Conf. Inform. Syst. Sci , pp. 587-591
    • Cybenko, G.1
  • 11
    • 38249042117 scopus 로고
    • The QR Algorithm for Unitary Hessenberg Matrices
    • W. B. Gragg, “The QR Algorithm for Unitary Hessenberg Matrices,” J. Comput. Appl. Math. 16, 1-8 (1986).
    • (1986) J. Comput. Appl. Math , vol.16 , pp. 1-8
    • Gragg, W.B.1
  • 12
    • 0016484946 scopus 로고
    • Global Convergence of the QR Algorithm for Unitary Matrices with some Results for Normal Matrices
    • P. J. Eberlein and C. P. Huang, “Global Convergence of the QR Algorithm for Unitary Matrices with some Results for Normal Matrices,” SIAM J. Numer. Anal. 12, 97-104 (1975).
    • (1975) SIAM J. Numer. Anal , vol.12 , pp. 97-104
    • Eberlein, P.J.1    Huang, C.P.2
  • 14
    • 0000516088 scopus 로고
    • A Divide and Conquer Algorithm for the Unitary Eigenproblem
    • SIAM, Philadelphia
    • W. B. Gragg and L. Reichel, “A Divide and Conquer Algorithm for the Unitary Eigenproblem,” in Proc. Second Conf. Hypercube Multiprocessors, SIAM, Philadelphia (1987).
    • (1987) Proc. Second Conf. Hypercube Multiprocessors
    • Gragg, W.B.1    Reichel, L.2
  • 15
    • 0000417182 scopus 로고    scopus 로고
    • A Fully Parallel Algorithm for the Symmetric Eigenproblem
    • J. Dongerra and D. Sorensen, “A Fully Parallel Algorithm for the Symmetric Eigenproblem,” SIAM J. Sci. Stat. Comput. 8, sl 39-sl54 (1987).
    • SIAM J. Sci. Stat. Comput , vol.8
    • Dongerra, J.1    Sorensen, D.2


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