Minerva  

21st GAMM-Seminar Leipzig on
Robust Fast Solvers

Max-Planck-Institute for Mathematics in the Sciences
Inselstr. 22-26, D-04103 [O->]Leipzig
Phone: +49.341.9959.752, Fax: +49.341.9959.999


     
  Homepage  
     
  21st GAMM-Seminar
January, 26th-28th, 2005
 
     
  Announcement  
  Registration  
  Participants  
  Programme  
  Abstracts ->
  Proceedings  
     
  Archive  
     
  All seminars  
  All proceedings  
     
 
  Abstract Stefan Kunis, Wed, 14.00-14.30 Previous Contents Next  
  Iterative Fourier Reconstruction
Stefan Kunis (Univ. Lübeck)

(joint work with Daniel Potts)

Without doubt, the fast Fourier transform belongs to most popular algorithms in applied mathematics. Due to the fact that sampling nodes in many applications are not equally spaced, these fast algorithms for the particular matrix-vector-multiplication with the Fourier matrix
displaymath3
have been generalised for arbitrary nodes tex2html_wrap_inline22.

Here, we consider consistent linear systems and their minimal norm solutions, i.e.,
displaymath11
We show that the condition number of A is uniformly bounded for norms with smooth weights tex2html_wrap_inline26 under the condition that the sampling nodes tex2html_wrap_inline28 are separated with respect to the polynomial degree N.
 

 
    Previous Contents Next  


Last updated:
28.01.2005 Impressum
 
Concept, Design and Realisation
[O->]Jens Burmeister (Uni Kiel), Kai Helms (MPI Leipzig)
Valid HTML 4.0!