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 Mario Bebendorf, Fri, 11.30-12.00 Previous Contents Next  
  Why the LU Decomposition of Discretizations of Second Order Elliptic Operators can be Computed with Almost Linear Complexity
Mario Bebendorf (Univ. Leipzig)

Although the asymptotic complexity of direct methods for the solution of large sparse finite element systems arising from second-order elliptic partial differential operators is far from being optimal, these methods are often preferred over modern iterative methods. This is mainly due to their robustness. In this article it is shown that an (approximate) LU decomposition can be computed in the algebra of hierarchical matrices with almost linear complexity and with the same robustness as the classical LU decomposition.
 

 
    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!