The above written set of equations is of a nonlinear type. Let us denote all of them as
Thus to solve it we have to employ the iterative Newton's method[1]. It means that we have to start from an initial guess of {ni0}Mi=1 values.
And during next iterations for k = 0, 1, …
nk+1 = nk - | { | F'(n1k, …, nMk) | } | -1 F(n1k, …, nMk) |
the solution should be achieved. F'(n1k, …, nMk) denotes the following matrix of partial derivatives:
F'(n1k, …, nMk) = | [ |
|
] |
where
where c ≠ a.