Show simple item record

dc.contributor.authorLitvinenko, Alexander
dc.date.accessioned2017-12-17T06:46:51Z
dc.date.available2017-12-17T06:46:51Z
dc.date.issued2017-12-14
dc.identifier.urihttp://hdl.handle.net/10754/626387
dc.description.abstractThe H-matrix format has a log-linear computational cost and storage O(kn log n), where the rank k is a small integer and n is the number of locations (mesh points). The H-matrix technique allows us to work with general class of matrices (not only structured or Toeplits or sparse). H-matrices can keep the H-matrix data format during linear algebra operations (inverse, update, Schur complement).
dc.description.sponsorshipKAUST
dc.subjectHierarchical matrices
dc.subjectlow-rank matrices
dc.subjectHLIB
dc.subjectHLIBPro
dc.titleMini-lecture course: Introduction into hierarchical matrix technique
dc.typePresentation
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.conference.date19 December 2017
dc.conference.nameInvited talk at Advanced Computing Laboratory, Institute of Computational Science, Faculty of Informatics University della Svizzera italiana, Lugano, Switzerland
dc.conference.locationInstitute of Computational Science, Faculty of Informatics University della Svizzera italiana, Lugano, Switzerland
refterms.dateFOA2018-06-13T19:11:45Z


Files in this item

Thumbnail
Name:
Hmatrix_talk1.pdf
Size:
3.228Mb
Format:
PDF
Description:
A small lecture course about H-matrices

This item appears in the following Collection(s)

Show simple item record