The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Solving N-1 equations in N unknowns with initial state?
Replies: 4   Last Post: May 9, 2013 1:23 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Don Del Grande

Posts: 1
Registered: 5/7/13
Solving N-1 equations in N unknowns with initial state?
Posted: May 7, 2013 11:56 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

I have a system of N-1 equations in N unknowns.

If I start by assigning values to the N unknowns and then recalculate the values recursively:

(a) Will they always reach a single solution (assuming there is a solution for the equations in the first place), and

(b) If a single solution can be reached, is there a way to determine it in terms of the initial values without having to go through the recursion, and if so, what is it?

3a - b - c - d = 9
-a + 3b - c - d = 3
-a - b + 3c - d = -3
-a - b - c + 3d = -9

If you combine the first three equations, you get a + b + c - 3d = 9, which is -1 times the fourth equation, so it is effectively 3 equations in 4 unknowns.

If the values are initially set to a = 3, b = 1, c = -1, and d = -3, and the equations repeated recalculated recursively, they eventually become a = 9/4, b = 3/4, c = -3/4, and d = -9/4.

Can those values be determined in a non-recursive method from the equations and the initial values?

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.