期刊
LINEAR ALGEBRA AND ITS APPLICATIONS
卷 428, 期 11-12, 页码 2455-2467出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.laa.2007.11.025
关键词
block QR factorization; orthogonal factorization; hierarchical matrices
In this paper, we propose a new method to efficiently compute a representation of an orthogonal basis of the nullspace of a sparse matrix operator B-T With B is an element of R-nxm, n > m. We assume that B has full rank, i.e., rank(B) = m. It is well known that the last n - m columns of the orthogonal matrix Q in a QR factorization B = QR form such a desired null basis. The orthogonal matrix Q can be represented either explicitly as a matrix, or implicitly as a matrix H of Householder vectors. Typically, the matrix H represents the orthogonal factor much more compactly than Q. We will employ this observation to design an efficient block algorithm that computes a sparse representation of the nullspace basis in almost optimal complexity. This new algorithm may, e.g., be used to construct a null space basis of the discrete divergence operator in the finite element context, and we will provide numerical results for this particular application. (c) 2007 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据