BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UNIFR/WEBMASTER//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTSTART;VALUE=DATE:20131126T171500
DTEND;VALUE=DATE:20131126T171500
UID:5682@agenda.unifr.ch
DESCRIPTION:The Method of Alternating Projections (MAP)\n [R. Escalante, M. Raydan, {\it Alternating Projection Methods},\n SIAM, Philadelphia, 2011] is an iterative procedure for finding the projection of a\n point on the intersection of closed subspaces of an Hilbert space. The convergence\n of this method is usually slow, and several methods for its acceleration have\n already been proposed.\n<br>\n In this work, we consider a special MAP, namely Kaczmarz'\n method for solving systems of linear equations\n [S. Kaczmarz, Angen\""aherte Aufl\""osung von Systemen linearer Gleichungen,\nBull. Acad. Polon. Sci., A35 (1937), pp. 355--357. English translation:\nApproximate solution of systems of linear equations,\nInt. J. Control, 57 (1993), pp. 1269--1271].\n  The convergence of this method is discussed. After\n  giving its matrix formulation and its projection properties,\n  we consider several procedures for accelerating its convergence.\n  They are based on sequence transformations whose kernels contain\n  sequences of the same form as the sequence of vectors generated by\n  Kaczmarz' method. Acceleration can be achieved either directly,\n  that is without modifying the sequence obtained by the method (AK algorithm),\n  or by restarting it from the vector obtained by acceleration (RK algorithm).\n  Numerical examples show the effectiveness of both procedures.\n\nThis is a joint work with Claude Brezinski (University of Lille,\nFrance).\n
SUMMARY:Michela Redivo Zaglia (Università di Padova): Acceleration of Kaczmarz's method for solving linear systems
CATEGORIES:Colloque / Congrès / Forum
LOCATION:PER 08\, Phys 2.52\, Chemin du Musée 3\, 1700 Fribourg
URL;VALUE=URI:https://agenda.unifr.ch/e/fr/5682
END:VEVENT
END:VCALENDAR