Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Computing 27 (1981), S. 319-337 
    ISSN: 1436-5057
    Keywords: Linear inequalities ; inequalities ; polyhedral cones ; positivity of functions ; Jacobi polynomials ; approximation ; 15 A 39 ; 33 A 65 ; 65 D 99
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Funktionenreihen der Form $$f(x) = \sum\limits_{n = 0}^N {c_n f_n (x)} $$ werden im Intervalla≤x≤b unter der Nebenbedingungf(x)≥0 betrachtet. Der durch diese Bedingung bestimmte Kegel der Koeffizientenc n imR N+1 wird numerisch durch einen polyedrischen Kegel angenähert. Numerische Werte für die entstehenden Fehler und Wege zu ihrer Verbesserung werden angegeben. Die Diskussion einer speziellen Reihe mit Jakobipolynomen führt zu neuen Aussagen über Koeffizientenbereiche für welche die Reihe nicht-negativ ist.
    Notes: Abstract Function series of the form $$f(x) = \sum\limits_{n = 0}^N {c_n f_n (x)} $$ are considered under the constraintf(x)≥0 in a given intervala≤x≤b. The cone in teh spaceR N+1 of the coefficientsc n which is determined by the positivity constraint is approximated numerically by a polyhedral cone. A numerical estimate for the error involved is given and it is shown how it may be reduced. A special series of Jacobi polynomials is discussed and new estimates for the range of parameters for which this series is non-negative are obtained.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...