Sparse orthogonal matrices
β Scribed by Gi-Sang Cheon; Suk-Geun Hwang; Seog-Hoon Rim; Bryan L. Shader; Seok-Zun Song
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 115 KB
- Volume
- 373
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
The minimum number of nonzero entries in an n by n orthogonal matrix which has a column of nonzeros is known to be
In this note the sparsity of orthogonal matrices which have both a column and a row of nonzeros is studied. For each integer n 2 we construct an n by n orthogonal matrix which has both a row and column of nonzeros and has
π SIMILAR VOLUMES
Let S β M n (R) be such that S 2 = I or S 2 = -I. is unitary, and both factors are Ο S -orthogonal. We show that if A is Ο Sorthogonal and normal, and if -1 is not an eigenvalue of A, then there exists a normal Ο S -skew symmetric N (that is, Ο S (N) = -N) such that A = e iN . We also take a look a
## Abstract The assembly of sparse matrices is a key operation in finite element methods. In this study we analyze several factors that may have an influence on the efficiency of the assembly procedure. Different insertion strategies are compared using two metrics: a Cost function (the number of m