IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-8176-8406-8_12.html

Least Squares and Chebyshev Systems

In: Thinking in Problems

Author

Listed:
  • Alexander A. Roytvarf

Abstract

As readers know, polynomials of degree n, in other words linear combinations of n + 1 monomials 1,…, t n , may have at most n real zeros. A far-reaching generalization of this fact raises a fundamental concept of Chebyshev systems, briefly, T-systems. Those systems are defined as follows. For a set (or system) of functions F = {f 0,…}, a linear combination of a finite number of elements, f = ∑c i f i , is called a polynomial on F (considered nonzero when ∃i: c i ≠ 0). A system of n + 1 function F = {f 0,…,f n } on an interval (or a half-interval, or a non-one-point segment) I ⊆ ℝ is referred to as T-system, when nonzero polynomials on F may have at most n distinct zeros in I (zeros of extensions outside I are not counted). The basic ideas of the theory of T-systems may be understood by readers with relatively limited experience. In this chapter we focus both on these ideas and on some nice applications of this theory such as estimation of numbers of zeros and critical points of functions (in analysis and geometry), a real-life problem in tomography, interpolation theory, approximation theory, and least squares. We provide a comprehensive discussion of the linear least-squares technique and present its analytic, algebraic, and geometric versions. We examine its links to linear algebra and combinatorial analysis (in this connection we discuss some problems, previously considered in “ A Combinatorial Algorithm in Multiexponential Analysis ” and “ Convexity and Related Classic Inequalities ” chapters, from a different point of view). We also discuss some features of the least-squares solutions (e.g., passing through determinate points, asymptotic properties). In addition, we outline the connections between least squares and probability theory and statistics. Finally, we discuss real-life applications to polynomial interpolation (such as finding the best polynomial fitting for two-dimensional surfaces) and signal processing in nuclear magnetic resonance (NMR) technology (such as finding covariance matrices for maximal likelihood estimating parameters).

Suggested Citation

  • Alexander A. Roytvarf, 2013. "Least Squares and Chebyshev Systems," Springer Books, in: Thinking in Problems, edition 127, pages 319-387, Springer.
  • Handle: RePEc:spr:sprchp:978-0-8176-8406-8_12
    DOI: 10.1007/978-0-8176-8406-8_12
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-0-8176-8406-8_12. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.