Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Some variants of the method of fundamental solutions: regularization using radial and nearly radial basis functions

100%
Gáspár C.
Open Mathematics
|
2013
|
tom 11
|
nr 8
1429-1440
EN
The method of fundamental solutions and some versions applied to mixed boundary value problems are considered. Several strategies are outlined to avoid the problems due to the singularity of the fundamental solutions: the use of higher order fundamental solutions, and the use of nearly fundamental solutions and special fundamental solutions concentrated on lines instead of points. The errors of the approximations as well as the problem of ill-conditioned matrices are illustrated via numerical examples.
2
Content available remote

Approximate multiplication in adaptive wavelet methods

76%
Černá D., Finěk V.
Open Mathematics
|
2013
|
tom 11
|
nr 5
972-983
EN
Cohen, Dahmen and DeVore designed in [Adaptive wavelet methods for elliptic operator equations: convergence rates, Math. Comp., 2001, 70(233), 27–75] and [Adaptive wavelet methods II¶beyond the elliptic case, Found. Comput. Math., 2002, 2(3), 203–245] a general concept for solving operator equations. Its essential steps are: transformation of the variational formulation into the well-conditioned infinite-dimensional l 2-problem, finding the convergent iteration process for the l 2-problem and finally using its finite dimensional approximation which works with an inexact right-hand side and approximate matrix-vector multiplication. In our contribution, we pay attention to approximate matrix-vector multiplication which is enabled by an off-diagonal decay of entries of the wavelet stiffness matrices. We propose a more efficient technique which better utilizes actual decay of matrix and vector entries and we also prove that this multiplication algorithm is asymptotically optimal in the sense that storage and number of floating point operations, needed to resolve the problem with desired accuracy, remain proportional to the problem size when the resolution of the discretization is refined.
3
Content available remote

Implicit a posteriori error estimation using patch recovery techniques

76%
Horváth T., Izsák F.
Open Mathematics
|
2012
|
tom 10
|
nr 1
55-72
EN
We develop implicit a posteriori error estimators for elliptic boundary value problems. Local problems are formulated for the error and the corresponding Neumann type boundary conditions are approximated using a new family of gradient averaging procedures. Convergence properties of the implicit error estimator are discussed independently of residual type error estimators, and this gives a freedom in the choice of boundary conditions. General assumptions are elaborated for the gradient averaging which define a family of implicit a posteriori error estimators. We will demonstrate the performance and the favor of the method through numerical experiments.
4
Content available remote

Generalizations of the Finite Element Method

76%
Schweitzer M.
Open Mathematics
|
2012
|
tom 10
|
nr 1
3-24
EN
This paper is concerned with the generalization of the finite element method via the use of non-polynomial enrichment functions. Several methods employ this general approach, e.g. the extended finite element method and the generalized finite element method. We review these approaches and interpret them in the more general framework of the partition of unity method. Here we focus on fundamental construction principles, approximation properties and stability of the respective numerical method. To this end, we consider meshbased and meshfree generalizations of the finite element method and the use of smooth, discontinuous, singular and numerical enrichment functions.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.