Best 𝐿_{𝑝} approximation

  • Kahng S
N/ACitations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

A new algorithm is presented for the best L p {L_p} approximation of a continuous function over a discrete set or a finite interval with 2 > p > ∞ 2 > p > \infty . Methods to accelerate the convergence of the Rice-Usow extension of Lawson’s algorithm as well as the new algorithm are presented, and the result of a numerical example is given.

Cite

CITATION STYLE

APA

Kahng, S. W. (1972). Best 𝐿_{𝑝} approximation. Mathematics of Computation, 26(118), 505–508. https://doi.org/10.1090/s0025-5718-1972-0309270-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free