For a comparative low polynomial degree
the system
(3.2) is over-determined, so that in general the given data
will be only approximated up to the residual
.
One considers the weighted approximation problem
![]() |
Applying the Landweber (also known as Richardson, ...), the steepest descent,
or the conjugate gradient scheme to (3.3) yields the following
Algorithms 5-7.