ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    BIT 39 (1999), S. 579-584 
    ISSN: 1572-9125
    Keywords: Markov system ; Gaussian formulas ; Lagrange interpolation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Consider a Markov system of functions whose linear span is dense with respect to the uniform norm in the space of the continuous functions on a finite interval. Gaussian rules are those which correctly integrate as many successive basis functions as possible with the lesser number of nodes. In this paper we provide a simple proof of the fact that such rules converge for all bounded Riemann-Stieltjes integrable functions. The proposed proof is also valid for any sequence of quadrature rules with positive coefficients which converge for the basis functions. Taking the nodes of the Gaussian rules as nodes for Lagrange interpolation, we give a sufficient condition for the convergence in L 2-norm of such processes for bounded Riemann-Stieltjes integrable functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 3 (1992), S. 235-244 
    ISSN: 1572-9265
    Keywords: AMS 65D ; 33C ; Neumann series ; Bessel functions ; Padé approximation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract LetJ n (z) be the Bessel function of the first kind and ordern, and letf(z) be an analytic function in|z|≤r (r〉0); then it is known that the Bessel expansion $$f(z) = \sum\limits_{n = 0}^\infty {a_n J_n (z) (Neumann series)} $$ converges for|z|≤r. In this paper, we shall be concerned with the construction of “approximating” functions to (1) which are easily computable (rational functions). Namely, making use of the generating function for the family {J n (z)}, a rational functionf k (z) with prescribed poles can be obtained such thatf k (z) “approximates” tof(z) in the following sense: $$f_k (z) = \sum\limits_{n = 0}^\infty {\bar a_n J_n (z)} with \bar a_n = a_n , n = 0,1,...,k - 1;$$ and it will be said thatf k is an “approximant” of orderk. When orthogonality conditions with respect to a linear functional defined from the sequence {a n} are used, then the order of approximation may be increased up to2k. An algebraic approach of these approximants is carried out.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Publication Date: 1994-05-01
    Print ISSN: 0893-9659
    Electronic ISSN: 1873-5452
    Topics: Mathematics
    Published by Elsevier
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...