Contraction map methods for discrete rational Chebychev approximation
DF McAllister - Proceedings of the ACM annual conference, 1973 - dl.acm.org
DF McAllister
Proceedings of the ACM annual conference, 1973•dl.acm.orgGeneralizations of HL Loeb's dynamic programming algorithm'for rational Chebychev
approximation are discussed and conditions for monotone convergence of the sequence of
deviations are derived. Implementation strategies to insure feasibility and possible
modifications to produce super linear convergence are included.
approximation are discussed and conditions for monotone convergence of the sequence of
deviations are derived. Implementation strategies to insure feasibility and possible
modifications to produce super linear convergence are included.
Generalizations of H. L. Loeb's dynamic programming algorithm' for rational Chebychev approximation are discussed and conditions for monotone convergence of the sequence of deviations are derived. Implementation strategies to insure feasibility and possible modifications to produce super linear convergence are included.
ACM Digital LibraryShowing the best result for this search. See all results
