Hi,
I want to solve a 3x3 system of linear equations (with a the gaussian elimination method?) of the type:
1 2 3 | 1
4 2 6 | 1
1 0 1 | 1
Any help would be appreciated. M.
Added by Mecky Reuss at 10:46am on August 15, 2015
1:
{0} N=5
{1} N=6
and a tree 2:
{0;0} N=1
{0;1} N=1
...
{0;18} N=1
{1;0} N=1
{1;1} N=1
...
{1;19} N=1
I want to basically modify Tree 1 in order to get
{0;0} N=5
{0;1} N=5
...
{0;18} N=5
{1;0} N=6
{1;1} N=6
...
{1;19} N=6
which is the Tree 1 with the structure of Tree 2 and the items of Tree 1 {0} branch populated at each {0;*} branch of Tree 2 and the items of Tree 1 {1} branch populated at each {1;*} branch of Tree 2.
…
E.g.:
0 2 (A) = 2
1 2+4 (A+B) = 6 (AB)
2 6+4 (AB+C) = 10 (ABC)
3 10+6 (ABC+D) = 16 (ABCD)
etc.
Into a new list numbers:
{2,6,10,16, etc} that adding the previous number with the next number.
Thanks,
daniel
…
etc.
Group 2 - 1, 6, 11, 16, 21 etc.
Group 3 - 2, 7, 12, 17, 22 etc.
Group 4 - 3, 8, 13, 18, 23 etc.
Group 5 - 4, 9, 14, 19, 24 etc. "
except in data, the branches start at 0, so 'group 1' is branch 0
as for the order of your points, that depends on the input prior sorting...
yrs …
zed like this:
{0}
0 Surface 1
{1}
0 Surface 2
1 Surface 3
2 Surface 4
{2}
0 Surface 5
1 Surface 6
{3}
0 Surface 7
1 Surface 8
2 Surface 9
And not like this (which is what i have when select tehm with "multiple surfaces")
{0}
0 Surface 1
1 Surface 2
.....
7 Surface 8
8 Surface 9
Thanks a lot for your help: it is a very frequent issue and i would like to fix it.
Regards
…