Need resources for solving nonlinear matrix equations

Kosh Naranek
Messages
4
Reaction score
0
In my work I've encountered equations of the type:

(Ax).*(Bx) + Cx = d

Where A,B and C are non-unitary square matrices, x and d column vectors and .* denote component-wise multiplication.

I have a few books which discuss nonlinear matrix equations, but not of this kind. Any suggestions?
 
Physics news on Phys.org
Kosh Naranek said:
(Ax).*(Bx) + Cx = d

Where A,B and C are non-unitary square matrices, x and d column vectors and .* denote component-wise multiplication.

If you want to solve for the vector x, I wouldn't call the equation a "matrix" equation since there is no unknown matrix. It would be equivalent to a system of multivariate quadratic equations in the components x1,x2,.. of the vector x.

Systematic ways to find symbolic solutions to multivariate polynomial equations are Buchberger's algorithm and Wu's method (called "Wu's method of the characteristic set" in the Wikipedia and "Wu's method of elimination" in other sources).

Of course it's an interesting mathematical question whether the fact that your equation is compactly stated as an equation with matrix coefficients implies that there is something special about the simultaneous quadratic equations, something that would make their solutions have a special form, perhaps a form that could be expressed concisely using matrices. I don't know whether that's the case.
 
Thank you. Perhaps I should mention that I can find a solution using linearization and iteration. The physical origins is in a branch of fluid dynamics. Typically one assume only one solution. However I think that there should be several solutions, at least if |C| is small compared to |A| and |B|.
 
Hi, Kosh.

That equation looks very similar to a Quadratic Programming problem:
minimize F(x) = (1/2) xT[H]x + cT x + α .
Except in your case you are trying to zero the function, not minimize it.
I wonder if it could be turned into such a problem with a little manipulation.

Alternately, it might be a problem appropriate for multi-dimensional root-finding.
Given N equations in N unknowns, in which the equations are non-linear, find a zero.
Do a search for "multi-dimensional root-finding". You will find a lot of information, and several algorithms.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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