Finding Roots
Program Name |
Register |
Contents |
---|---|---|
Q-D and Bairstow |
000 | used |
… | … | |
003 | used | |
004 | r | |
005 | s | |
006 | delta | |
007 | 1st root | |
008 | 2nd root | |
009 | G if Bairstow | |
010 | #it. if Q-D | |
011 | used | |
012 | used | |
013 | #it. if Bairstow | |
014 | used | |
… | … | |
017 | used | |
018 | n | |
019 | used | |
020 | A(0) | |
… | … | |
045 | A(i) | |
046 | Q(0,0) | |
… | … | |
071 | Q(0,i) | |
072 | Q(1,0) | |
… | … | |
097 | Q(1,i) | |
098 | Q(2,0) | |
… | … | |
123 | Q(2,i) | |
Bisection |
000 | x |
001 | LO | |
002 | used | |
003 | HI | |
004 | used | |
009 | error limit | |
Newton |
000 | x |
001 | used | |
005 | used | |
006 | delta | |
009 | error limit | |
010 | iteration limit |
☚ Back