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
Filter
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Advances in computational mathematics 1 (1993), S. 1-37 
    ISSN: 1572-9044
    Keywords: Refinement equations ; up-function ; entire functions of exponential type ; subdivision algorithms ; cube spline ; (AMS) 34K99 ; 41A15 ; 41A25 ; 41A63
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper is concerned with the study of a general class of functional equations covering as special cases the relation which defines theup-function as well as equations which arise in multiresolution analysis for wavelet construction. We discuss various basic properties of solutions to these functional equations such as regularity, polynomial containment within the space spanned by their integer shifts and their computability by subdivision algorithms.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Advances in computational mathematics 4 (1995), S. III 
    ISSN: 1572-9044
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 60 (1991), S. 477-492 
    ISSN: 0945-3245
    Keywords: 65D15
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary A functionf ∈C (Ω), $$\Omega \subseteq \mathbb{R}^s $$ is called monotone on Ω if for anyx, y ∈ Ω the relation x − y ∈ ∝ + s impliesf(x)≧f(y). Given a domain $$\Omega \subseteq \mathbb{R}^s $$ with a continuous boundary ∂Ω and given any monotone functionf on ∂Ω we are concerned with the existence and regularity ofmonotone extensions i.e., of functionsF which are monotone on all of Ω and agree withf on ∂Ω. In particular, we show that there is no linear mapping that is capable of producing a monotone extension to arbitrarily given monotone boundary data. Three nonlinear methods for constructing monotone extensions are then presented. Two of these constructions, however, have the common drawback that regardless of how smooth the boundary data may be, the resulting extensions will, in general, only be Lipschitz continuous. This leads us to consider a third and more involved monotonicity preserving extension scheme to prove that, when Ω is the unit square [0, 1]2 in ∝2, strictly monotone analytic boundary data admit a monotone analytic extension.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 63 (1992), S. 315-344 
    ISSN: 0945-3245
    Keywords: 65F35 ; 65N30 ; 41A63 ; 41A17 ; 46E35
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary This paper is concerned with multilevel techniques for preconditioning linear systems arising from Galerkin methods for elliptic boundary value problems. A general estimate is derived which is based on the characterization of Besov spaces in terms of weighted sequence norms related to corresponding multilevel expansions. The result brings out clearly how the various ingredients of a typical multilevel setting affect the growth rate of the condition numbers. In particular, our analysis indicates how to realize even uniformly bounded condition numbers. For example, the general results are used to show that the Bramble-Pasciak-Xu preconditioner for piecewise linear finite elements gives rise to uniformly bounded condition numbers even when the refinements of the underlying triangulations are highly nonuniform. Furthermore, they are applied to a general multivariate setting of refinable shift-invariant spaces, in particular, covering those induced by various types of wavelets.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 82 (1999), S. 179-191 
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991):65N55, 65N30, 35Q30
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract. A variant of multigrid schemes for the Stokes problem is discussed. In particular, we propose and analyse a cascadic version for the Stokes problem. The analysis of the transfer between the grids requires special care in order to establish that the complexity is the same as that for classical multigrid algorithms.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 86 (2000), S. 49-101 
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991): 65D15,65D32, 65Y20, 41A25, 46E35
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary. This paper is concerned with the efficient evaluation of nonlinear expressions of wavelet expansions obtained through an adaptive process. In particular, evaluation covers here the computation of inner products of such expressions with wavelets which arise, for instance, in the context of Galerkin or Petrov Galerkin schemes for the solution of differential equations. The central objective is to develop schemes that facilitate such evaluations at a computational expense exceeding the complexity of the given expansion, i.e., the number of nonzero wavelet coefficients, as little as possible. The following issues are addressed. First, motivated by previous treatments of the subject, we discuss the type of regularity assumptions that are appropriate in this context and explain the relevance of Besov norms. The principal strategy is to relate the computation of inner products of wavelets with compositions to approximations of compositions in terms of possibly few dual wavelets. The analysis of these approximations finally leads to a concrete evaluation scheme which is shown to be in a certain sense asymptotically optimal. We conclude with a simple numerical example.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Mathematische Zeitschrift 148 (1976), S. 7-21 
    ISSN: 1432-1823
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Mathematische Zeitschrift 169 (1979), S. 93-98 
    ISSN: 1432-1823
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    facet.materialart.
    Unknown
    Frankfurt am Main : Periodicals Archive Online (PAO)
    Romanische Forschungen. 99:4 (1987) 438 
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Constructive approximation 1 (1985), S. 305-322 
    ISSN: 1432-0940
    Keywords: 41A15 ; Box spline ; Convergence rate ; Subdivision algorithms ; Control net
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Dahmen and Micchelli [8] have shown that in general the coefficients of the refined control nets of a box spline surface converge to the surface at (at least) the rate of the refinement. The purpose of this article is to show that under mild additional assumptions the convergence rate is even quadratic. Although this rate is in general best possible, we point out under what circumstances even higher rates are obtained (locally).
    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...