Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.soft-sys.math.mathematica > #16272 > unrolled thread

Re: Solving complicated matrix equations

Started byRay Koopman <koopman@sfu.ca>
First post2013-11-26 04:57 +0000
Last post2013-11-26 04:57 +0000
Articles 1 — 1 participant

Back to article view | Back to comp.soft-sys.math.mathematica


Contents

  Re: Solving complicated matrix equations Ray Koopman <koopman@sfu.ca> - 2013-11-26 04:57 +0000

#16272 — Re: Solving complicated matrix equations

FromRay Koopman <koopman@sfu.ca>
Date2013-11-26 04:57 +0000
SubjectRe: Solving complicated matrix equations
Message-ID<l719nt$brc$1@smc.vnet.net>
The difference between * and . does matter. If we change the * to a . then we have M.(v-m1) - u.M = 0, which is a form of the Sylvester equation AX + XB = C for which efficient methods are known.

----- Dmitry Smirnov <dsmirnov90@gmail.com> wrote:
> 
> I do really mean M*m1, not M.m1 . However, I believe that this is not
> crucial for my example . Let, for simplicity, m1, u, v be real full rank
> matrices.
> 
> The only way, that I know, to solve the problem is to define every element
> of M as a variable and then to solve a huge system of linear equations.
> 
> 2013/11/23 Ray Koopman <koopman@sfu.ca>
> 
>> Do you really mean M*m1, or should that be M.m1 ?
>> Also, what can you  tell us about m1, u, v ?
>> Are they Real?  Full rank?  Etc.
>>
>> ----- dsmirnov90@gmail.com wrote:
>>> Hi!
>>>
>>> I have to solve analytically an equation like this:
>>>
>>> M*m1 = M.v - u.M,
>>>
>>> where m1, v, u are the given matrices and M should be found. Is there
>>> any standard function in Mathematica to do this?
>>>
>>> Thanks,
>>> Dmitry.

[toc] | [standalone]


Back to top | Article view | comp.soft-sys.math.mathematica


csiph-web