I Logarithmic terms in a system of equations

Dilon
Messages
3
Reaction score
0
(I hope this is not a double posting) I want to solve this system of equations, containing logarithmic terms:

##7\ln(a/b)+A = 7\ln(d/e)+D = 7\ln(g/h)+G##
##7\ln(a/c)+B = 7\ln(d/f)+E = 7\ln(g/i)+H##
##7\ln(b/c)+C = 7\ln(e/f)+F = 7\ln(h/i)+I##
##a\phi_1+d\phi_2+g\phi_3=X##
##b\phi_1+e\phi_2+h\phi_3=Y##
##c\phi_1+f\phi_2+i\phi_3=Z##
a+b+c=1
d+e+f=1
g+h+i=1

where the uppercase and \phi coefficients are known and a,b,c...i are the unknown coefficients.

The following are also true, but might not be important since the values are known:
\phi_1+\phi_2+\phi_3=1
X+Y+Z=1

My strategy so far:

I introduce the unknowns n_1,n_2, n_3 to link the equations as:

##7\ln(a)-7\ln(b)-n_1 = -A##
##7\ln(a)-7\ln(c)-n_2 = -B##
##7\ln(b)-7\ln(c)-n_3 = -C##
##7\ln(d)-7\ln(e)-n_1=-D##
##7\ln(d)-7\ln(f)-n_2=-E##
##7\ln(e)-7\ln(f)-n_3=-F##
##7\ln(g)-7\ln(h)-n_1=-G##
##7\ln(g)-7\ln(i)-n_2=-H##
##7\ln(h)-7\ln(i)-n_3=-I##

The corresponding system of equations maybe looks like this:

<br /> \begin{bmatrix}<br /> 7L &amp; -7L &amp; &amp; &amp; &amp; &amp; &amp; &amp; &amp; -1 &amp; &amp; \\<br /> 7L &amp; &amp; -7L &amp; &amp; &amp; &amp; &amp; &amp; &amp; &amp; -1 &amp; \\<br /> &amp; 7L &amp; -7L &amp; &amp; &amp; &amp; &amp; &amp; &amp; &amp; &amp; -1\\<br /> &amp; &amp; &amp; 7L &amp; -7L &amp; &amp; &amp; &amp; &amp; -1 &amp; &amp; \\<br /> &amp; &amp; &amp; 7L &amp; &amp; -7L &amp; &amp; &amp; &amp; &amp; -1 &amp; \\<br /> &amp; &amp; &amp; &amp; 7L &amp; -7L &amp; &amp; &amp; &amp; &amp; &amp; -1\\<br /> &amp; &amp; &amp; &amp; &amp; &amp; 7L &amp; -7L &amp; &amp; -1 &amp; &amp; \\<br /> &amp; &amp; &amp; &amp; &amp; &amp; 7L &amp; &amp; -7L &amp; &amp; -1 &amp; \\<br /> &amp; &amp; &amp; &amp; &amp; &amp; &amp; 7L &amp; -7L &amp; &amp; &amp; -1\\<br /> \phi_1 &amp; &amp; &amp; \phi_2 &amp; &amp; &amp; \phi_3 &amp; &amp; &amp; &amp; &amp; \\<br /> &amp; \phi_1 &amp; &amp; &amp; \phi_2 &amp; &amp; &amp; \phi_3 &amp; &amp; &amp; &amp; \\<br /> &amp; &amp; \phi_1 &amp; &amp; &amp; \phi_2 &amp; &amp; &amp; \phi_3 &amp; &amp; &amp; \\<br /> 1 &amp; 1 &amp; 1 &amp; &amp; &amp; &amp; &amp; &amp; &amp; &amp; &amp; \\<br /> &amp; &amp; &amp; 1 &amp; 1 &amp; 1 &amp; &amp; &amp; &amp; &amp; &amp; \\<br /> &amp; &amp; &amp; &amp; &amp; &amp; 1 &amp; 1 &amp; 1 &amp; &amp; &amp; \\<br /> \end{bmatrix}<br /> <br /> \begin{bmatrix}<br /> a\\<br /> b\\<br /> c\\<br /> d\\<br /> e\\<br /> f\\<br /> g\\<br /> h\\<br /> i\\<br /> n_1\\<br /> n_2\\<br /> n_3<br /> \end{bmatrix}<br /> =<br /> \begin{bmatrix}<br /> -A\\<br /> -B\\<br /> -C\\<br /> -D\\<br /> -E\\<br /> -F\\<br /> -G\\<br /> -H\\<br /> -I\\<br /> X\\<br /> Y\\<br /> Z\\<br /> 1\\<br /> 1\\<br /> 1<br /> \end{bmatrix}<br />
where the "L" terms indicate that there is actually a natural log of the variable.

My main problem is: What do I do with the logarithmic terms (the 7L terms indicate 7*ln(unknown))? I want something that can use computer solvers so I need to build a system kind of like I've done, but I'm not sure how to do it even if I am on the right track. Do I need to decompose the system into a logarithmic part and a linear part first? or what?
 
Last edited:
Physics news on Phys.org
I don't know if it helps much, but you could divide the first 3 equations by 7 and take exponential of each term such as: ##7 ln(a/b)+A \to (a/b)e^{A/7}##.
 
Dilon said:
I want something that can use computer solvers
If you mean computer solvers for systems of simultaneous linear equations, I think you are out of luck. What other types of solvers would you consider?

A teacher once told me "Every problem can be phrased as an optimization problem". For example, we can use an equation ##f(a,b,c) = g(a,b,c)## to define a term in a penality function given by ##(f(a,b,c) - g(a,b,c))^2##. We can state the problem of solving simultaneous equations as a different problem involving minimizing the penalty function created from some equations subject to constraints given by other equations. There are all sorts of computer programs that solve optimization problems.
 
The system is overdetermined, because there are nine unknowns and twelve equations.

The two equations in the third line are redundant and can be discarded, as they can be derived from those in the first two, although they reveal a relationship between some of the constants, viz, that:
B-C-A = E-D-F = H-G-I

So we have ten equations in nine unknowns.

What about the following strategy?

Temporarily treat three of the unknowns as knowns ('known unknowns'), so that you have six 'unknown unknowns', and solve the system comprising the last six equations, which is linear and hence easy to work with. That will give you formulas for each of the six unknown unknowns in terms of the constants and the three known unknowns. Substituting those formulas into the four equations in the first two lines gives us four equations in the three known unknowns. That's a much smaller system that may be more amenable to numerical approaches. The search space is only three-dimensional rather than nine-dimensional. The system is still overdetermined, so either there will be no solutions or one of the equations will be redundant.

The trick would be to select our three 'known unknowns' in a way that doesn't make any of the last six equations redundant by not containing any unknowns. For instance choosing a, b, c would make the 3rd last equation redundant. Choosing a, d, g makes the 6th last equation redundant. Perhaps try choosing a, e, i.
 
Could you solve this system with Newton's method?
 
##\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