Can Hexagonal Sampling Improve Efficiency of Kronecker Product Matrices?

  • Thread starter Thread starter 4real4sure
  • Start date Start date
  • Tags Tags
    Matrix
4real4sure
Messages
26
Reaction score
0
Hi everyone,

I have a general question regarding KPM. Since kronecker product matrices have cartesian tiling, I was wondering if these could be made more efficient by implementing hexagonal sampling instead of cartesian within kronecker matrices. Is it possible to do that? I'm confused since kronecker matrices are separable and I just wanted to have a clear theoretical idea on how could I switch to hexagonal sampling or blue noise sampling to increase the efficiency of kronecker product matrices.
Your ideas would be warmly appreciated.
 
Physics news on Phys.org
4real4sure said:
I was wondering if these could be made more efficient by implementing hexagonal sampling instead of cartesian within kronecker matrices.

You haven't explained any statistical context for your question. What are you trying to estimate by sampling? What kind of data is being sampled? If this is a complicated scenario, what are some links to places that describe it?
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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