Can B Be Determined from Given A and C in Kronecker Product?

Click For Summary
SUMMARY

The discussion centers on the challenge of determining matrix B from given matrices A and C in the context of Kronecker products, specifically when A and C are known and B is sought. It is established that while B is not unique, there are methods to approximate B using algorithms such as the one referenced from MIT's website (krondecomp.m). The conversation highlights the relationship between the elements of C and the product of A and B, emphasizing that the uniqueness of B is constrained by the properties of the Kronecker product.

PREREQUISITES
  • Understanding of Kronecker products in linear algebra
  • Familiarity with matrix decomposition techniques
  • Knowledge of tensor products and their properties
  • Basic programming skills for implementing algorithms in MATLAB or similar tools
NEXT STEPS
  • Research the algorithm for matrix decomposition referenced at MIT (krondecomp.m)
  • Explore advanced properties of Kronecker products in linear algebra
  • Learn about unique and non-unique solutions in matrix equations
  • Investigate numerical methods for approximating matrix factors
USEFUL FOR

Mathematicians, data scientists, and engineers working with matrix computations, particularly those involved in linear algebra and tensor analysis.

umut_caglar
Messages
7
Reaction score
0
hi everybody

Today I have a question about Kronecker products, If you have a direct answer it is perfect but if not, any kind of paper reference might work as well.

now say I have to matrices A and B in general there is nothing special about them. They are not hermitian or triangular or what ever special.

then I calculate the Kronecker product between them A \otimes B = C

then assume that A and C is given to us and we want to figure out what B is. I know that B is not unique but is there anything that we can say about B? Do you know any algorithm that can give some predictions or guesses for B.

I know one stuff that can approximately decompose C into a A', B' pair. But in this algorithm you do not have any control on A or B.

http://www.mit.edu/~wingated/scripts/krondecomp.m

any idea is welcome, thank you.
 
Physics news on Phys.org
Given ##A## and ##C## makes ##B## unique. The elements of ##C## are pairs ##c_{ijkl}=a_{ij}b_{kl}##. Tensor products are not unique in the sense that ##\lambda A\oplus B = A \oplus \lambda B##. But as you nailed ##A##, there are no scalars ##\lambda \neq 1## which can be swapped. Also, as you have only a dyade, sums don't have any effect either, as there are simply none.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 4 ·
Replies
4
Views
989
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 19 ·
Replies
19
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 33 ·
2
Replies
33
Views
3K
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K