Revision as of 13:45, 29 August 2017 edit KolbertBot (talk \| contribs) Bots 1,166,042 edits m Bot: HTTP→HTTPS ← Previous edit		Revision as of 11:59, 10 January 2018 edit undo Keepssouth (talk \| contribs) Extended confirmed users 622 edits m →H2-matrices Next edit →
Line 134: <ref name="BOSA05">{{cite journal\|last=Börm\|first=Steffen\|last2=Sauter\|first2=Stefan\|date=2005\|title=BEM with linear complexity for the classical boundary integral operators\|journal=Math. Comp.\|volume=74\|pages=1139–1177\|url=http://www.ams.org/journals/mcom/2005-74-251/S0025-5718-04-01733-8}}</ref> Arithmetic operations like multiplication, inversion, and Cholesky or LR factorization of H<sup>2</sup>-matrices can be implemented based on two fundamental operations: the matrix-vector multiplication with submatrices and the low-rank update of submatrices. While the matrix-vector multiplication is straightforward, implementing efficient low-rank updates with adaptively optimized cluster bases poses a significant challenge.<ref name="HARE14">{{cite journal\|last=Börm\|first=Steffen\|last2=Reimer\|first2=Knut\|date=2015\|title=Efficient arithmetic operations for rank-structured matrices based on hierarchical low-rank updates\|journal=Comp. Vis. Sci.\|volume=16\|issue=6\|pages=247–258\|url=http://www.arxiv.org/abs/1402.5056}}</ref> == Literature ==

Hierarchical matrix: Difference between revisions