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
  • 1990-1994  (5)
  • 1993  (2)
  • 1992  (3)
Years
  • 1990-1994  (5)
Year
Keywords
Language
  • 1
    Publication Date: 2014-02-26
    Description: This paper throws light on the connection between the optimal condition number estimate for the BPX method and constructive approximation theory. We provide a machinery, which allows to understand the optimality as a consequence of an approximation property and an inverse inequality in $H^{1+\epsilon}$, $\epsilon 〉 0$. This machinery constructs so-called {\em approximation spaces}, which characterize a certain rate of approximation by finite elements and relates them with interpolation spaces, which characterize a certain smoothness.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 2014-02-26
    Description: Subspace decompositions of finite element spaces based on $L2$-like orthogonal projections play an important role for the construction and analysis of multigrid like iterative methods. Recently several authors proved the equivalence of the associated discrete norms with the $H^1$-norm. The present report gives an elementary, self-contained derivation of this result which is based on the use of $ K$-functionals known from the theory of interpolation spaces. {\bf Keywords:} multilevel methods, nonuniform meshes, optimal convergence rates. {\bf AMS(MOS) Subject classifications:} 65N55, 65N30, 65N50.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Publication Date: 2019-05-10
    Description: {\def\enorm {\mathop{\mbox{\boldmath{$|\!|$}}}\nolimits} Let $u \in H$ be the exact solution of a given self--adjoint elliptic boundary value problem, which is approximated by some $\tilde{u} \in {\cal S}$, $\cal S$ being a suitable finite element space. Efficient and reliable a posteriori estimates of the error $\enorm u - \tilde{u}\enorm $, measuring the (local) quality of $\tilde{u}$, play a crucial role in termination criteria and in the adaptive refinement of the underlying mesh. A well--known class of error estimates can be derived systematically by localizing the discretized defect problem using domain decomposition techniques. In the present paper, we provide a guideline for the theoretical analysis of such error estimates. We further clarify the relation to other concepts. Our analysis leads to new error estimates, which are specially suited to three space dimensions. The theoretical results are illustrated by numerical computations.}
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Publication Date: 2019-05-10
    Description: We consider the approximate solution of selfadjoint elliptic problems in three space dimensions by piecewise linear finite elements with respect to a highly non-uniform tetrahedral mesh which is generated adaptively. The arising linear systems are solved iteratively by the conjugate gradient method provided with a multilevel preconditioner. Here, the accuracy of the iterative solution is coupled with the discretization error. as the performance of hierarchical bases preconditioners deteriorate in three space dimensions, the BPX preconditioner is used, taking special care of an efficient implementation. Reliable a-posteriori estimates for the discretization error are derived from a local comparison with the approximation resulting from piecewise quadratic elements. To illustrate the theoretical results, we consider a familiar model problem involving reentrant corners and a real-life problem arising from hyperthermia, a recent clinical method for cancer therapy.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Publication Date: 2014-02-26
    Description: A new adaptive approach for one-dimensional scalar conservation laws with convex flux is proposed. The initial data are approximated on an adaptive grid by a problem dependent, monotone interpolation procedure in such a way, that the multivalued problem of characteristic transport can be easily and explicitly solved. The unique entropy solution is chosen by means of a selection criterion due to LAX. For arbitrary times, the solutions is represented by an adaptive monotone spline interpolation. The spatial approximation is controlled by local $L^1$-error estimated. As a distinctive feature of the approach, there is no discretization in time. The method is monotone on fixed grids. Numerical examples are included, to demonstrate the predicted behavior. {\bf Key words.} method of characteristics, adaptive grids, monotone interpolation, $L^1$-error estimates {\bf AMS(MOS) subject classification.} 65M15, 65M25, 65M50.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    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...