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

Approximation properties of wavelets and relations among scaling moments II

100%
Finěk V.
Open Mathematics
|
2004
|
tom 2
|
nr 4
605-613
EN
A new orthonormality condition for scaling functions is derived. This condition shows a close connection between orthonormality and relations among discrete scaling moments. This new condition in connection with certain approximation properties of scaling functions enables to prove new relations among discrete scaling moments and consequently the same relations for continuous scaling moments.
2
Content available remote

Approximate multiplication in adaptive wavelet methods

63%
Č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

On the computation of scaling coefficients of Daubechies' wavelets

63%
Černá D., Finěk V.
Open Mathematics
|
2004
|
tom 2
|
nr 3
399-419
EN
In the present paper, Daubechies' wavelets and the computation of their scaling coefficients are briefly reviewed. Then a new method of computation is proposed. This method is based on the work [7] concerning a new orthonormality condition and relations among scaling moments, respectively. For filter lengths up to 16, the arising system can be explicitly solved with algebraic methods like Gröbner bases. Its simple structure allows one to find quickly all possible solutions.
4
Content available remote

On the exact values of coefficients of coiflets

51%
Černá D., Finěk V., Najzar K.
Open Mathematics
|
2008
|
tom 6
|
nr 1
159-169
EN
In 1989, R. Coifman suggested the design of orthonormal wavelet systems with vanishing moments for both scaling and wavelet functions. They were first constructed by I. Daubechies [15, 16], and she named them coiflets. In this paper, we propose a system of necessary conditions which is redundant free and simpler than the known system due to the elimination of some quadratic conditions, thus the construction of coiflets is simplified and enables us to find the exact values of the scaling coefficients of coiflets up to length 8 and two further with length 12. Furthermore for scaling coefficients of coiflets up to length 14 we obtain two quadratic equations, which can be transformed into a polynomial of degree 4 for which there is an algebraic formula to solve them.
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ć.