[Trilinos-Users] Sparse Cholesky complexity for several structured stencils

[Alberto F. Martín-Huertas]

 Dear Trilinos-Users,

 do you know whether is there available the spatial and arithmetic
 complexity of the sparse direct Cholesky factorization when it
 is applied to the following structured stencils:

 a) A = 2D square mesh of Q1 finite elements (i.e., bilinear finite 
 elements)
 b) A^2 (i.e., the stencil corresponding to the Q1-element sparse
               coefficient matrix squared).
 c) 2D square mesh of Q2 finite elements (i.e., bicuadratic finite 
 elements)

 Thanks in advance for your help.

 Best regards,
  Alberto.

-- 
 Alberto F. Martín-Huertas
 Centre Internacional de Mètodes Numèrics a l'Enginyeria (CIMNE)
 Parc Mediterrani de la Tecnologia, UPC
 Esteve Terrades 5, Building C3, Office 210,
 08860 Castelldefels (Barcelona, Spain)
 Tel.: (+34) 9341 34223
 e-mail: amartin at cimne.upc.edu

 ________________
 IMPORTANT NOTICE
 All personal data contained on this mail will be processed 
 confidentially and registered in a file property of CIMNE in
 order to manage corporate communications. You may exercise the rights 
 of access, rectification, erasure and object by
 letter sent to Ed. C1 Campus Norte UPC. Gran Capitán s/n Barcelona.