Hybrid direct and iterative solvers for h refined grids with singularities

Handle URI:
http://hdl.handle.net/10754/581487
Title:
Hybrid direct and iterative solvers for h refined grids with singularities
Authors:
Paszyński, Maciej R.; Paszyńska, Anna; Dalcin, Lisandro; Calo, Victor M. ( 0000-0002-1805-4045 )
Abstract:
This paper describes a hybrid direct and iterative solver for two and three dimensional h adaptive grids with point singularities. The point singularities are eliminated by using a sequential linear computational cost solver O(N) on CPU [1]. The remaining Schur complements are submitted to incomplete LU preconditioned conjugated gradient (ILUPCG) iterative solver. The approach is compared to the standard algorithm performing static condensation over the entire mesh and executing the ILUPCG algorithm on top of it. The hybrid solver is applied for two or three dimensional grids automatically h refined towards point or edge singularities. The automatic refinement is based on the relative error estimations between the coarse and fine mesh solutions [2], and the optimal refinements are selected using the projection based interpolation. The computational mesh is partitioned into sub-meshes with local point and edge singularities separated. This is done by using the following greedy algorithm.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Physical Sciences and Engineering (PSE) Division
Conference/Event name:
Pan American Congresses on Computational Mechanics (PANACM) 2015
Issue Date:
27-Apr-2015
Type:
Presentation
Additional Links:
http://congress.cimne.com/panacm2015/admin/files/fileabstract/a134.pdf
Appears in Collections:
Physical Sciences and Engineering (PSE) Division; Presentations; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorPaszyński, Maciej R.en
dc.contributor.authorPaszyńska, Annaen
dc.contributor.authorDalcin, Lisandroen
dc.contributor.authorCalo, Victor M.en
dc.date.accessioned2015-10-31T22:48:52Zen
dc.date.available2015-10-31T22:48:52Zen
dc.date.issued2015-04-27en
dc.identifier.urihttp://hdl.handle.net/10754/581487en
dc.description.abstractThis paper describes a hybrid direct and iterative solver for two and three dimensional h adaptive grids with point singularities. The point singularities are eliminated by using a sequential linear computational cost solver O(N) on CPU [1]. The remaining Schur complements are submitted to incomplete LU preconditioned conjugated gradient (ILUPCG) iterative solver. The approach is compared to the standard algorithm performing static condensation over the entire mesh and executing the ILUPCG algorithm on top of it. The hybrid solver is applied for two or three dimensional grids automatically h refined towards point or edge singularities. The automatic refinement is based on the relative error estimations between the coarse and fine mesh solutions [2], and the optimal refinements are selected using the projection based interpolation. The computational mesh is partitioned into sub-meshes with local point and edge singularities separated. This is done by using the following greedy algorithm.en
dc.relation.urlhttp://congress.cimne.com/panacm2015/admin/files/fileabstract/a134.pdfen
dc.titleHybrid direct and iterative solvers for h refined grids with singularitiesen
dc.typePresentationen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentPhysical Sciences and Engineering (PSE) Divisionen
dc.conference.date27-29 April, 2015en
dc.conference.namePan American Congresses on Computational Mechanics (PANACM) 2015en
dc.conference.locationBuenos Airesen
dc.contributor.institutionAGH University of Science and Technology Al. Mickiewicya 30, 30+059 Krakow, Polanden
dc.contributor.institutionJagiellonian University Łojasiewicza 11, 30-348 Krakow, Polanden
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.