Reducing Rank-3 Tensor Field into Matrix

  • Thread starter Thread starter Kreizhn
  • Start date Start date
  • Tags Tags
    Matrix
Kreizhn
Messages
714
Reaction score
1
I'm trying to find a way of reducing a rank-3 tensor field into a matrix, but am having trouble finding a good way to do it. The situation set up is as follows:

Let's say that I have a 3\times 3 matrix and a 5 \times 1 vector as follows

A(x) = \begin{pmatrix} a_{11}(x) & a_{12}(x) & a_{13}(x) \\ a_{21}(x) & a_{22}(x) & a_{23}(x) \\ a_{31}(x) & a_{32}(x) & a_{33}(x) \end{pmatrix}, \qquad \qquad x = \begin{pmatrix} x_1 \\ x_2\\ x_3 \\ x_4 \\ x_5 \end{pmatrix}

Now I want to find a tangent plane to a surface defined by A(x) at some point \bar x to create some constraints, namely, I want to do something of the form

\nabla A(x) (x - \bar x) = 0

Now the problem here is that \nabla A(x) is a rank 3 tensor. I need to find some what of ''matricizing'' this tensor into a matrix so that I can solve a linear programming problem with it. Any ideas?
 
Physics news on Phys.org
There is no way to match dimensions ##3## and ##5##. Otherwise, i.e. if appropriately reformulated, it is simply applying a linear function to a vector.
 
##\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