Solve Nonlinear System of Equations

phil0stine
Messages
5
Reaction score
0
Hi, I have a set of vectors that I would like to solve for in a nonlinear system of equations.

I have tried to use scipy.fsolve to solve the system, but without success. I believe the problem is that scipy expects the same number of inputs as outputs. I have a 12x1 input vector, but I can only generate 9 independent equations.

I would appreciate any help with this, for example how I could over-constrain the problem, or am I missing something?

The vectors {C,R1,R2,R3} are all (3x1). There are also a set of (3x1) vectors {S1,S2,S3} that are known.

The equations are as follows:

CTR1=S1 (1)

CTR2=S2 (2)

CTR3=S3 (3)

and finally

[R1 R2 R3]T[R1 R2 R3]=I

which can be reduced to

R1TR1=R2TR2=R3TR3=1 (4,5,6)

R1TR2=R2TR3=R3TR1=0 (7,8,9)

R2TR1=R3TR2=R1TR3=0 Would give me 12 equations, but they are exactly the same as Equations 7,8,9.

So I don't know how to proceed. I would appreciate if anybody could point me in a direction, or to a matlab/scipy routine.
 
Mathematics news on Phys.org
I think I have it, I cannot solve the system without an additional set of constraints.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top