Skyline storage is only for symetric matrices?

  • Thread starter Thread starter Ronankeating
  • Start date Start date
  • Tags Tags
    Matrices Storage
Ronankeating
Messages
62
Reaction score
0
hi all,

Is that skyline storage,which is been widely used in FEM problems, is only for symetric matrices?

What if I have non-standardized matrices, that is , which can not be made symettric, has pretty randomly oriented inner products, which can not be put into any computerized manner for storage, so I have to store all of it. What is the general solution for such kind of problems?

Regards,
 
Physics news on Phys.org
Ronankeating said:
Is that skyline storage,which is been widely used in FEM problems, is only for symetric matrices?
There are two meanings of "symmetric" that are relevant to that question.

(1) The pattern of zeros in the matrix is symmetric, i.e. there are many pairs of elements where a_{i,j} = a_{j,i} = 0. (There may be some unpaired zero elements as well, but they are treated the same way as non-zero terms.)

(2) The stronger condition that a_{i,j} = a^*_{j,i} for all values i and j. (Real symmetric matrices are just a special case of complex Hermitian matrices, for most numerical methods).

The basic idea of skyline storage usually refers to (2).

You can use skyline storage for (1) by splitting the matrix in two along the diagonal, and storing the data in two identical shaped "skylines", one vertical and one horizontal. This works well for many purposes when the non-zero data in the matrix is not symmetric.

What if I have non-standardized matrices, that is , which can not be made symettric, has pretty randomly oriented inner products, which can not be put into any computerized manner for storage, so I have to store all of it. What is the general solution for such kind of problems?

The answer depends what you want to do with the sparse matrix. There isn't really a "one size fits all" general solution.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top