𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


-Orthogonal matrices
✍ Ma. Nerissa M. Abara; Dennis I. Merino; Agnes T. Paras πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 231 KB

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

Computing with sparse matrices
✍ T. S. Chow; J. S. Kowalik πŸ“‚ Article πŸ“… 1973 πŸ› John Wiley and Sons 🌐 English βš– 866 KB
Orthogonality of matrices
✍ Carlos BenΓ­tez; Manuel FernΓ‘ndez; MarΓ­a L. Soriano πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 239 KB
Assembling sparse matrices in MATLAB
✍ Sergio Zlotnik; Pedro DΓ­ez πŸ“‚ Article πŸ“… 2010 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 323 KB

## 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