Description

Book Synopsis
This monograph is concerned with the qualitative theory of best L1-approximation from finite-dimensional subspaces. It presents a survey of recent research that extends 'classical' results concerned with best uniform approximation to the L1 case. The work is organized in such a way as to be useful for self-study or as a text for advanced courses. It begins with a basic introduction to the concepts of approximation theory before addressing one- or two-sided best approximation from finite-dimensional subspaces and approaches to the computation of these. At the end of each chapter is a series of exercises; these give the reader an opportunity to test understanding and also contain some theoretical digressions and extensions of the text.

Trade Review
"A clearly written, friendly, and enthusiastic introduction to the qualitative theory of best approximation..." American Mathematical Monthly
"...an excellent compendium of the current best known qualitative results on best approximations from finite-dimensional subspaces of L1 spaces....could easily be used in a graduate topics course, and surely will be a standard reference work." Mathematical Reviews

Table of Contents
Preface; 1. Preliminaries; 2. Approximation from finite-dimensional subspaces of L1; 3. Approximation from finite-dimensional subspaces in C1 (K, µ); 4. Unicity subspaces and property A; 5. One-sided L1-approximation; 6. Discrete lm1 - approximation; 7. Algorithms; Appendices; References; Author index; Subject index.

On L1 Approximation 93 Cambridge Tracts in Mathematics Series Number 93

    Product form

    £41.79

    Includes FREE delivery

    RRP £43.99 – you save £2.20 (5%)

    Order before 4pm tomorrow for delivery by Fri 3 Jul 2026.

    A Paperback by Allan M. Pinkus

    15 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of On L1 Approximation 93 Cambridge Tracts in Mathematics Series Number 93 by Allan M. Pinkus

      Publisher: Cambridge University Press
      Publication Date: 1/28/2008 12:00:00 AM
      ISBN13: 9780521057691, 978-0521057691
      ISBN10: 0521057698

      Description

      Book Synopsis
      This monograph is concerned with the qualitative theory of best L1-approximation from finite-dimensional subspaces. It presents a survey of recent research that extends 'classical' results concerned with best uniform approximation to the L1 case. The work is organized in such a way as to be useful for self-study or as a text for advanced courses. It begins with a basic introduction to the concepts of approximation theory before addressing one- or two-sided best approximation from finite-dimensional subspaces and approaches to the computation of these. At the end of each chapter is a series of exercises; these give the reader an opportunity to test understanding and also contain some theoretical digressions and extensions of the text.

      Trade Review
      "A clearly written, friendly, and enthusiastic introduction to the qualitative theory of best approximation..." American Mathematical Monthly
      "...an excellent compendium of the current best known qualitative results on best approximations from finite-dimensional subspaces of L1 spaces....could easily be used in a graduate topics course, and surely will be a standard reference work." Mathematical Reviews

      Table of Contents
      Preface; 1. Preliminaries; 2. Approximation from finite-dimensional subspaces of L1; 3. Approximation from finite-dimensional subspaces in C1 (K, µ); 4. Unicity subspaces and property A; 5. One-sided L1-approximation; 6. Discrete lm1 - approximation; 7. Algorithms; Appendices; References; Author index; Subject index.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account