### Abstract

Original language | English |
---|---|

Pages (from-to) | 111-129 |

Number of pages | 19 |

Journal | Computing (Vienna/New York) |

Volume | 88 |

Issue number | 3 |

DOIs | |

Publication status | Published - Jun 9 2010 |

### Fingerprint

### Cite this

*Computing (Vienna/New York)*,

*88*(3), 111-129. https://doi.org/10.1007/s00607-010-0087-y

**On the QR decomposition of backslashfancyscript H -matrices.** / Benner, Peter; Mach, Thomas.

Research output: Contribution to journal › Article

*Computing (Vienna/New York)*, vol. 88, no. 3, pp. 111-129. https://doi.org/10.1007/s00607-010-0087-y

}

TY - JOUR

T1 - On the QR decomposition of backslashfancyscript H -matrices

AU - Benner, Peter

AU - Mach, Thomas

PY - 2010/6/9

Y1 - 2010/6/9

N2 - The hierarchical ( backslashfancyscriptH -) matrix format allows storing a variety of dense matrices from certain applications in a special data-sparse way with linear-polylogarithmic complexity. Many operations from linear algebra like matrix--matrix and matrix--vector products, matrix inversion and LU decomposition can be implemented efficiently using the backslashfancyscriptH -matrix format. Due to its importance in solving many problems in numerical linear algebra like least-squares problems, it is also desirable to have an efficient QR decomposition of backslashfancyscriptH -matrices. In the past, two different approaches for this task have been suggested in Bebendorf (Hierarchical matrices: a means to efficiently solve elliptic boundary value problems. Lecture notes in computational science and engineering (LNCSE), vol 63. Springer, Berlin, 2008) and Lintner (Dissertation, Fakultät für Mathematik, TU München. http://tumb1.biblio.tu-muenchen.de/publ/diss/ma/2002/lintner.pdf , 2002). We will review the resulting methods and suggest a new algorithm to compute the QR decomposition of an backslashfancyscriptH -matrix. Like other backslashfancyscriptH -arithmetic operations, the backslashfancyscriptH QR decomposition is of linear-polylogarithmic complexity. We will compare our new algorithm with the older ones by using two series of test examples and discuss benefits and drawbacks of the new approach.

AB - The hierarchical ( backslashfancyscriptH -) matrix format allows storing a variety of dense matrices from certain applications in a special data-sparse way with linear-polylogarithmic complexity. Many operations from linear algebra like matrix--matrix and matrix--vector products, matrix inversion and LU decomposition can be implemented efficiently using the backslashfancyscriptH -matrix format. Due to its importance in solving many problems in numerical linear algebra like least-squares problems, it is also desirable to have an efficient QR decomposition of backslashfancyscriptH -matrices. In the past, two different approaches for this task have been suggested in Bebendorf (Hierarchical matrices: a means to efficiently solve elliptic boundary value problems. Lecture notes in computational science and engineering (LNCSE), vol 63. Springer, Berlin, 2008) and Lintner (Dissertation, Fakultät für Mathematik, TU München. http://tumb1.biblio.tu-muenchen.de/publ/diss/ma/2002/lintner.pdf , 2002). We will review the resulting methods and suggest a new algorithm to compute the QR decomposition of an backslashfancyscriptH -matrix. Like other backslashfancyscriptH -arithmetic operations, the backslashfancyscriptH QR decomposition is of linear-polylogarithmic complexity. We will compare our new algorithm with the older ones by using two series of test examples and discuss benefits and drawbacks of the new approach.

U2 - 10.1007/s00607-010-0087-y

DO - 10.1007/s00607-010-0087-y

M3 - Article

VL - 88

SP - 111

EP - 129

JO - Computing (Vienna/New York)

JF - Computing (Vienna/New York)

SN - 0010-485X

IS - 3

ER -