Finding Inverse from Known Linear System

Blue2Sky
Messages
3
Reaction score
0
Hello All:
Suppose I have a completely known linear system: A*x=b. I know the matrix A, and an x and the associated RHS vector b (and it is non-trivial). Is there some tricky way to directly determine the inverse of A without performing an inversion by typical means (Gauss elimination, LU, etc) ?

Thanks much.
 
Physics news on Phys.org
True. But my situation is that it is a large system. To use Cramer's rule would be expensive. I was wondering if because I have a known transformation (a known X and its corresponding B vector), that there may be something else that could be done.
For example, if I write
x = A^-1 * b
Then perform a dyadic product with a known vector, d, (of my choosing):
xd = A^-1 * bd
Then:
(xd)((bd)^-1) = A^-1

Something like this. However I know that you can't take an inverse of a dyad. This was my idea, but I just haven't used tensors in a long while and don't even know if what I am asking is possible.
Thanks
 
hey Blue, try using the LaTeX feature here. it helps you express your mathematical thinking and it helps us read what you express accurately.do you simply want to solve for \mathbf{x}? or do you want \mathbf{A}^{-1}?
 
Sorry. Yes I want \mathbf{A}^{-1} (actually, particular entries in \mathbf{A}^{-1}) . I have A and an x,b pair. My math from earlier (which I know you can't do unless the dyad is complete... but it was my original thinking):

\mathbf{x} = \mathbf{A}^{-1}\mathbf{b}
Make dyadic product with clever vector \mathbf{d}:
\mathbf{xd} = \mathbf{A}^{-1}\mathbf{bd}
then,
\mathbf{(xd)}\mathbf{(bd)}^{-1} = \mathbf{A}^{-1}

My thought was that \mathbf{d} could be chosen so that \mathbf{(bd)}^{-1} might be simple. Again the tensor math here is not correct, I just wanted to throw out my thought.
Thanks.
 
##\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