Similarly, a polynomial P3(x) is mapped to the following system
1 -x 0 0
yl P0
0 1 -x 0 y2 __ Pl
0 0 1 -x y3 P2
0 0 0 1 y4 P3
10.31
such that yl "- P3(x) =
p3 x3 + p2 x2 + plx + Po
Then, as mentioned above, the system L is solved by a digit recurrence
division algorithm applied to a divisor that is a matrix (A) and a dividend (b)
that is a vector. The solution vector y is computed most-significant digit first,
producing m significant digits in m steps.
b
y--m ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.