Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Alternating Projection Algorithm for Toeplitz Matrix Approximation
 

Summary: 1
Alternating Projection Algorithm for Toeplitz Matrix
Approximation
Suliman Al-Homidan
Department of Mathematical Sciences, King Fahd University of Petroleum and
Minerals, Dhahran 31261, PO Box 119, Saudi Arabia
Abstract
Alternating projection onto convex sets is powerful tool for signal and image
restoration. The extensions of von Neumann's [3] alternating projection method
by Dykstra and Han [1, 2] permit the computation of proximity projection onto
certain convex sets. This paper exploits this fact in constructing a globally con-
vergent method for computing the closest positive definite symmetric Toeplitz
matrix to a specified matrix. Some applications to signal processing and control
problems are discussed. Comparative numerical results are also reported.
Key words : Alternating projections, least distance functions, non-smooth optimiza-
tion, positive semi-definite matrix, Toeplitz matrix.
AMS (MOS) subject classifications 65F99, 99C25, 65F30
References
[1] Dykstra, R. L. [1983]. An algorithm for restricted least squares regression, J.
Amer. Stat. Assoc. 78, pp. 839842.

  

Source: Al-Homidan, Suliman - Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals

 

Collections: Mathematics