1
$\begingroup$

Given a matrix $A$, let us assume there is a equation: $Ax = b$

To solve for $x$, we can write:

$x = A^{-1} b$

One way to obtain the inverse of A is by single value decomposition:

Decomposition of $A$: $US(V^T)$, where $S$ is a diagonal matrix of singular values.

Therefore:

$Ax=b$

$US(V^T)x=b$

$x=(VW(U^T))b$, where $W=1/S$ along the diagonals.

Is there any other way instead of SVD to find the transpose of $A$.

| cite | improve this question | |
$\endgroup$
  • 2
    $\begingroup$ If it's invertible, you can augment A with an identity matrix and then put A into row reduced echelon form though Gaussian Elimination applying each operation to the augmented matrix. Once in reduced echelon form, the identity matrix will be the inverse. You can use LU decomposition too. Your question is confusing. Are you trying to find the inverse or the transpose or both? $\endgroup$ – StatsStudent Apr 7 '16 at 2:23
  • $\begingroup$ And I'm not sure what you mean by "in an equation setting." Finding an inverse of a matrix is no different than finding one "in an equation setting." An inverse in an inverse. $\endgroup$ – StatsStudent Apr 7 '16 at 2:31
  • $\begingroup$ @Analyst1 I changed the title. Basically, what I am asking is while solving the equation (i.e., obtain x), I need to have the inverse of A. And instead of using single value decomposition, is there any other representation that I can use to solve the equation. $\endgroup$ – RockTheStar Apr 7 '16 at 2:41
  • 1
    $\begingroup$ Why did you change the title then? You have "Is there any other way instead of SVD to find the transpose of A." You can use Gaussian Elimination to do what you are asking. $\endgroup$ – StatsStudent Apr 7 '16 at 2:45
  • 1
    $\begingroup$ You never, never, never want to explicitly calculate an inverse of a matrix. It's slow, and it can go horribly wrong numerically. To solve an equation, use Gaussian Elimination, which is covered in any elementary Linear Algebra textbook. To transpose a matrix, simply exchange elements, or indices - this is just a question of data structures. $\endgroup$ – Stephan Kolassa Apr 7 '16 at 6:56
2
$\begingroup$

I think there are lots of way to solve the linear equation problem based on matrix decomposition. For equation $Ax=b$, there are LU decomposition and QR decomposition as well. For example, when using LU decomposition $ X = LU $, you can perform forward substitute with $L$ then backward substitute using $U$. If you want use QR decomposition, $Ax=b$ means $QRx = b$ and get the result as $x = bQ ^ T R ^ {-1} $.

| cite | improve this answer | |
$\endgroup$
  • $\begingroup$ Thanks! Is there any other ways? $\endgroup$ – RockTheStar Apr 7 '16 at 17:59
  • $\begingroup$ I do not aware any other computational method for computing the inverse of a matrix. You mean manually? $\endgroup$ – Yu Zhang Apr 21 '16 at 4:23
  • $\begingroup$ YuZhang, according to @Analyst1, there are many other ones, but I am not sure what are those though $\endgroup$ – RockTheStar Apr 22 '16 at 19:02

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.