Salvatore D. Morgera

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with coauthor community group 4

> Home > Persons > Salvatore D. Morgera

Publications

1993
[j25]
- view
  authority control:
- export record
  dblp key:
  - journals/tsp/NoorM93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsp/NoorM93
Fazal Noor, Salvatore D. Morgera:
Recursive and iterative algorithms for computing eigenvalues of Hermitian Toeplitz matrices. IEEE Trans. Signal Process. 41(3): 1272-1280 (1993)
1992
[j23]
- view
  authority control:
- export record
  dblp key:
  - journals/tsp/NoorM92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsp/NoorM92
Fazal Noor, Salvatore D. Morgera:
Construction of a Hermitian Toeplitz matrix from an arbitrary set of eigenvalues. IEEE Trans. Signal Process. 40(8): 2093-2094 (1992)
1991
[j21]
- view
  authority control:
- export record
  dblp key:
  - journals/tsp/WilkesMNH91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsp/WilkesMNH91
D. Mitchell Wilkes, Salvatore D. Morgera, Fazal Noor, Monson H. Hayes III:
A Hermitian Toeplitz matrix is unitarily similar to a real Toeplitz-plus-Hankel matrix. IEEE Trans. Signal Process. 39(9): 2146-2148 (1991)
1988
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/icassp/MorgeraN88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icassp/MorgeraN88
Salvatore D. Morgera, Fazal Noor:
An eigenvalue recursion for Hermitian Toeplitz matrices. ICASSP 1988: 1647-1650

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.