Quasi-optimal elimination trees for 2D grids with singularities

Quasi-optimal elimination trees for 2D grids with singularities

We construct quasi-optimal elimination trees for 2D finite element meshes with singularities.These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution of the multifrontal algorithms in serial and in par...

Full description

Bibliographic Details
Main Authors: Paszynska, A., Paszynski, M., Jopek, K., Wofniak, M., Goik, D., Gurgul, P., Aboueisha, H., Moshkov, M., Calo, Victor, Lenharth, A., Nguyen, D., Pingali, K.
Format: Journal Article
Published: 2015
Online Access:http://hdl.handle.net/20.500.11937/48957

Internet

http://hdl.handle.net/20.500.11937/48957

Similar Items