Application of hierarchical matrices for partial inverse

Handle URI:
http://hdl.handle.net/10754/623743
Title:
Application of hierarchical matrices for partial inverse
Authors:
Litvinenko, Alexander ( 0000-0001-5427-3598 )
Abstract:
In this work we combine hierarchical matrix techniques (Hackbusch, 1999) and domain decomposition methods to obtain fast and efficient algorithms for the solution of multiscale problems. This combination results in the hierarchical domain decomposition (HDD) method, which can be applied for solution multi-scale problems. Multiscale problems are problems that require the use of different length scales. Using only the finest scale is very expensive, if not impossible, in computational time and memory. Domain decomposition methods decompose the complete problem into smaller systems of equations corresponding to boundary value problems in subdomains. Then fast solvers can be applied to each subdomain. Subproblems in subdomains are independent, much smaller and require less computational resources as the initial problem.
KAUST Department:
CEMSE
Conference/Event name:
SRI UQ group meeting
Issue Date:
26-Nov-2013
Type:
Presentation
Appears in Collections:
Presentations

Full metadata record

DC FieldValue Language
dc.contributor.authorLitvinenko, Alexanderen
dc.date.accessioned2017-05-31T05:38:34Z-
dc.date.available2017-05-31T05:38:34Z-
dc.date.issued2013-11-26-
dc.identifier.urihttp://hdl.handle.net/10754/623743-
dc.description.abstractIn this work we combine hierarchical matrix techniques (Hackbusch, 1999) and domain decomposition methods to obtain fast and efficient algorithms for the solution of multiscale problems. This combination results in the hierarchical domain decomposition (HDD) method, which can be applied for solution multi-scale problems. Multiscale problems are problems that require the use of different length scales. Using only the finest scale is very expensive, if not impossible, in computational time and memory. Domain decomposition methods decompose the complete problem into smaller systems of equations corresponding to boundary value problems in subdomains. Then fast solvers can be applied to each subdomain. Subproblems in subdomains are independent, much smaller and require less computational resources as the initial problem.en
dc.subjectDomain Decompositionen
dc.subjectpartial inverseen
dc.subjecthierarchical domain decompositionen
dc.subjectoscillatory coefficientsen
dc.subjecthierarchical matricesen
dc.titleApplication of hierarchical matrices for partial inverseen
dc.typePresentationen
dc.contributor.departmentCEMSEen
dc.conference.date26th November 2013en
dc.conference.nameSRI UQ group meetingen
dc.conference.locationKAUSTen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.