Is this possible or am I dumb - Solving for u

  • Context: Undergrad 
  • Thread starter Thread starter Skatch
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on the equation u + LuL^T = v and the challenge of rewriting it in the form u = B_1 v B_2, where L is an invertible matrix. The user expresses frustration over the complexity of the problem, questioning their understanding. A solution is suggested involving the multiplication of u by LL^-1 on both sides to simplify the equation and collect terms, indicating a structured approach to solving matrix equations.

PREREQUISITES
  • Understanding of matrix operations, specifically multiplication and inversion.
  • Familiarity with linear algebra concepts, particularly matrix transposition.
  • Knowledge of matrix notation and dimensions, specifically n x n matrices.
  • Experience with mathematical problem-solving in programming contexts.
NEXT STEPS
  • Research matrix inversion techniques and their applications in linear algebra.
  • Explore the properties of transpose matrices and their implications in equations.
  • Learn about matrix factorization methods, including LU decomposition.
  • Study advanced matrix manipulation techniques in programming languages such as Python or MATLAB.
USEFUL FOR

Mathematicians, data scientists, and software engineers who work with linear algebra and matrix equations, particularly those involved in algorithm development and optimization.

Skatch
Messages
18
Reaction score
0
I've got something like
[tex]u + LuL^T = v[/tex]
and I want to write it like
[tex]u = B_1 v B_2[/tex]
for some B_1 and B_2. Assume L is nice and invertible.

Is this impossible or am I just not seeing it? This is making me feel dumb. Too much programming and its getting late.
 
Physics news on Phys.org
I assume all the letters you wrote are n x n matrices...

Try multiplicating the first u on the left by LL^-1 and on the right by (LL^-1)^T, then collect terms...
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 35 ·
2
Replies
35
Views
5K
Replies
1
Views
2K
  • · Replies 20 ·
Replies
20
Views
1K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K