W. Dahmen, S. Prodorf, and R. Schneider. Multiscale methods for pseudodifferential equations. In L.L. Schumaker and G. Webb, editors, Wavelet Analysis and its Applications, volume 3, pages 191--235, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....but this has to be studied in detail in the future. Recent results concerning general multiscale transforms and their stability were obtained by Wolfgang Dahmen and his collaborators. They have been working (independently from [26, 27] on a scheme which is very similar to the lifting scheme [2, 8]. In particular, Dahmen shows in [7] which properties in addition to invertibility of the transform are needed to assure stable bases. Whether this result can be applied to the bases constructed here needs to be studied in the future. 2.12 Outlook So far we have only discussed the construction ....

W. Dahmen, S. Prossdorf, and R. Schneider. Multiscale methods for pseudo-differential equations on smooth manifolds. In [4], pages 385--424.

....of integral equations. In fact, a Galerkin discretization based on wavelet bases results in numerically sparse matrices, i.e. many matrix entries are negligible and can be treated as zero. Discarding these nonrelevant matrix entries is called matrix compression. In accordance with Dahmen et al. [7, 10, 9, 28], this can be performed without compromising the accuracy of the underlying Galerkin scheme. As shown by Dahmen, Harbrecht and Schneider in [7, 23, 28] the wavelet Gelerkin scheme has an optimal over all complexity. The paper is organized as follows. Section 1 is dedicated to the modeling, shape ....

.... in accordance with [7, 23] the over all complexity of compressing and assembling the system matrices is O(2 L ) Moreover, based on the well known norm equivalences of wavelet bases, diag(V L ) provides an simple preconditioner of the system matrix corresponding to the single layer operator [6, 8, 10, 28]. Observing that the single scale matrix G OE L and the wavelet matrix G L are related by a wavelet transform G L = T L G OE L T L , we deduce (G L ) Gamma1 = T Gamma L (G OE L ) Gamma1 T Gamma1 L . Herein, the solution of the system G OE L x = y requires only O(2 J ....

W. Dahmen, S. Prodorf, and R. Schneider. Multiscale methods for pseudodifferential equations on smooth manifolds. In C.K. Chui, L. Montefusco, and L. Puccio, editors, Proceedings of the International Conference on Wavelets: Theory, Algorithms, and Applications, pages 385--424, 1994.

....in the first generation setting. It turns out that the same lemma was also used for the construction of filter banks in [49] and in [31] ffl Dahmen and collaborators, independently of lifting, worked on stable completions of multiscale transforms, a setting similar to second generation wavelets [9, 17]. Again independently, both of Dahmen and of lifting, Harten developed a general multiresolution approximation framework based on prediction [26] ffl In [16] Dahmen and Micchelli propose a construction of compactly supported wavelets that generate complementary spaces in a multiresolution ....

W. Dahmen, S. Prossdorf, and R. Schneider. Multiscale methods for pseudo-differential equations on smooth manifolds. In [11], pages 385--424. 1994.

.... progress has been achieved in the theoretical understanding of multilevel and multigridmethods as well as of other subspace correction methods for finite element discretizations (cf. Xu, Ys, DSW, GO2, O1] The underlying theory also applies to various wavelet discretizations, see, e.g. [DmK, Ja, JaL, DmPS] for some papers dealing with wavelet solvers for elliptic problems that are related to our approach. In this paper we deal with anisotropic elliptic problems. We consider the simple model problem Gamma d X k=1 c k u x k x k c 0 u = f ; c k 0 ; c 0 0 ; k = d (1) in its ....

W. Dahmen, S. Prossdorf, R. Schneider, Multiscale methods for pseudodifferential equations, In: L. L. Schumaker, G. Webb (eds.): Recent advances in wavelet analysis, Acad. Press, New York 1994, 191-235.

....theoretical understanding of multilevel and multigrid methods as well as of other subspace correction methods for finite element discretizations (cf. 65, 67, 11, 60] We survey some of these results in Section 2. The underlying theory also applies to various wavelet discretizations, see, e.g. [26, 44, 45, 29] for some papers that deal with wavelet solvers for elliptic problems and are related to our approach. Roughly speaking, in these algorithms suitable detail spaces W j ae V j are constructed, together with their algebraic bases, such that V j = V j Gamma1 W j provides a stable splitting of V ....

Dahmen, W., S. Prossdorf and R. Schneider, Multiscale methods for pseudodifferential equations, in Recent advances in wavelet analysis, L. L. Schumaker, G. Webb (eds.), Academic Press, New York, 1994, pp. 191--235.

....in strongly elliptic boundary 4 T. von Petersdorff and Ch. Schwab integral equations (for the general theory we refer to [4] The description and the analysis of the multiscale Galerkin discretization schemes is divided into two parts, Sections 3 and 4. In Section 3 we present, following [6, 24, 27] (all motivated by the seminal paper [5] a multiwavelet Galerkin discretization for strongly elliptic boundary integral operators of order zero. This class includes in particular all examples presented in Section 2. We give a consistency analysis showing that most of the O( NL ) 2 ) entries in ....

W. Dahmen, S. Prossdorf and R. Schneider, Multiscale Methods for pseudo-differential equations on manifolds, in C.K. Chui (ed.) Wavelet Analysis and its Applications, 5, (1995), Academic Press.

....to domains Omega ae R 3 . The fundamental solution becomes E(x; y) Gamma 1 8 jx Gamma yj; and the results of section 2 can be adapted. Using a patch representation of the surface Omega , one can construct a system of biorthogonal wavelets on the two dimensional boundary Gamma (see [15]) In R 3 , our system is allways uniquely solvable, for any curve Gamma. 7 Integral formulation of Hsiao MacCamy In order to give a strongly elliptic variational formulation of the problem, for any value of cap Gamma, several authors studied a modified system of equations, by adding three ....

W. Dahmen, S. Prodorf, R. Schneider, Multiscale methods for pseudo-differential equations on manifolds, Wavelet Analysis and its Applications 5, Academic Press, 1995, 385-424.

No context found.

W. Dahmen, S. Prodorf, and R. Schneider. Multiscale methods for pseudodifferential equations. In L.L. Schumaker and G. Webb, editors, Wavelet Analysis and its Applications, volume 3, pages 191--235, 1993.

....sequence norms for the coefficients in their wavelet expansions. II) The wavelets have cancellation properties that are usually expressed in terms of vanishing polynomial moments. I) has immediate important consequences for preconditioning systems stemming from elliptic operator equations [17, 15, 27] of positive or even nonnegative order depending on the range of the norm equivalences. In particular, when dealing with operators of negative order it is important to realize the validity of such norm equivalences also for negative Sobolev indices which is closely related to handling duality. ....

.... interplay between the range of norm equivalences and the order of vanishing moments one can, in principle, design efficient solvers which produce approximate solutions with asymptotically optimal accuracy at the expense of computational and storage cost that stays proportional to the problem size [17, 21, 38]. Again the combination of (I) and (II) respectively the consequences with regard to matrix compression) also provides the basis for a rigorous analysis of adaptive schemes for elliptic equations. In fact, the analysis of refinement strategies based on a posteriori error estimates for residuals ....

[Article contains additional citation context not shown here]

W. Dahmen, S. Prodorf, R. Schneider, Multiscale methods for pseudodifferential equations on smooth manifolds, in: Proceedings of the International Conference on Wavelets: Theory, Algorithms, and Applications, C.K. Chui, L. Montefusco, L. Puccio (eds.), Academic Press, 1994, pp. 385-424.

.... solution of BEM reduce the complexity to a suboptimal rate, i.e. O(N J log N J ) or even an optimal rate, i.e. O(N J ) Prominent examples for such methods are the fast multipole method [16] the panel clustering [19] or hierarchical matrices [18, 30] As introduced by [1] and improved in [9, 10, 11, 12, 28], wavelet bases offer a further tool for the fast solution of integral equations. In fact, a Galerkin discretization with wavelet bases results in quasi sparse matrices, i.e. the most matrix entries are negligible and can be treated as zero. Discarding these nonrelevant matrix entries is called ....

....these basis functions j;k are local with respect to the corresponding scale j, i.e. diam supp j;k 2 and we will normalize them such that k j;k k L 2 ( 1. We note that at first glance it would be very convenient to deal with a single orthonormal system of wavelets. But it was shown in [12, 28] that orthogonal wavelets are not completely appropriate for the efficient solution of boundary integral equations. For that reason we use biorthogonal wavelet bases. Then, we have also a biorthogonal, or dual, multiresolution analysis, i.e. dual single scale bases e j = f e j;k : k 2 j g ....

W. Dahmen, S. Prodorf, and R. Schneider. Multiscale methods for pseudodifferential equations on smooth manifolds. In C.K. Chui, L. Montefusco, and L. Puccio, editors, Proceedings of the International Conference on Wavelets: Theory, Algorithms, and Applications, pages 385--424, 1995.

.... solution of BEM reduce the complexity to a suboptimal rate, i.e. O(N J log N J ) or even an optimal rate, i.e. O(N J ) Prominent examples for such methods are the fast multipole method [16] the panel clustering [19] or hierarchical matrices [18, 30] As introduced by [1] and improved in [9, 10, 11, 12, 28], wavelet bases offer a further tool for the fast solution of integral equations. In fact, a Galerkin discretization with wavelet bases results in quasi sparse matrices, i.e. the most matrix entries are negligible and can be treated as zero. Discarding these nonrelevant matrix entries is called ....

W. Dahmen, S. Prodorf, and R. Schneider. Multiscale methods for pseudodifferential equations. In L.L. Schumaker and G. Webb, editors, Wavelet Analysis and its Applications, volume 3, pages 191--235, 1993.

.... fast solution of BEM reduce the complexity to a suboptimal rate, i.e. J log N J ) or even an optimal rate, i.e. J ) Prominent examples for such methods are the fast multipole method [16] the panel clustering [19] or hierarchical matrices [18, 30] As introduced by [1] and improved in [9, 10, 11, 12, 28], wavelet bases offer a further tool for the fast solution of integral equations. In fact, a Galerkin discretization with wavelet bases results in quasi sparse matrices, i.e. the most matrix entries are negligible and can be treated as zero. Discarding these nonrelevant matrix entries is called ....

....that these basis functions # j,k are local with respect to the corresponding scale j, i.e. 2 j and we will normalize them such that j,k L 2 (#) 1. We note that at first glance it would be very convenient to deal with a single orthonormal system of wavelets. But it was shown in [12, 28] that orthogonal wavelets are not completely appropriate for the efficient solution of boundary integral equations. For that reason we use biorthogonal wavelet bases. Then, we have also a biorthogonal, or dual, multiresolution analysis, i.e. dual single scale bases and wavelets ....

W. Dahmen, S. Pr odorf, and R. Schneider. Multiscale methods for pseudodifferential equations on smooth manifolds. In C.K. Chui, L. Montefusco, and L. Puccio, editors, Proceedings of the International Conference on Wavelets: Theory, Algorithms, and Applications, pages 385--424, 1995.

.... fast solution of BEM reduce the complexity to a suboptimal rate, i.e. J log N J ) or even an optimal rate, i.e. J ) Prominent examples for such methods are the fast multipole method [16] the panel clustering [19] or hierarchical matrices [18, 30] As introduced by [1] and improved in [9, 10, 11, 12, 28], wavelet bases offer a further tool for the fast solution of integral equations. In fact, a Galerkin discretization with wavelet bases results in quasi sparse matrices, i.e. the most matrix entries are negligible and can be treated as zero. Discarding these nonrelevant matrix entries is called ....

W. Dahmen, S. Pr odorf, and R. Schneider. Multiscale methods for pseudodifferential equations. In L.L. Schumaker and G. Webb, editors, Wavelet Analysis and its Applications, volume 3, pages 191--235, 1993.

....that A B and B A where the latter relation is to express that B can be bounded by a constant times A uniformly in any parameters on which A and B may depend. Norm equivalences of the type (1. 4) play a key role in several contexts such as preconditioning, matrix compression (see e.g. [19]) and the design of adaptive strategies for elliptic problems [15] However, these applications naturally arise in connection with bounded domains. The simplest model to which the above machinery extends without much difficulty are periodic problems where IR is replaced by the torus . In ....

....A : hA Psi ; Psi i grow increasingly ill conditioned when # gets larger. However, as a consequence of (1. 4) one can show that when jtj fl; fl the operator B : D D (1:7) is boundedly invertible on 2 (r) i.e. the corresponding sections B are uniformly well conditioned [19] kB kkB k = O(1) # 1; 1:8) where k Delta k denotes the spectral norm. Roughly speaking the norm equivalence (1.4) allows one to undo the shift in the Sobolev scale caused by the operator A. The continuous problem is thereby transformed into a discrete one which is well posed with ....

[Article contains additional citation context not shown here]

W. Dahmen, S. Prodorf, R. Schneider, Multiscale methods for pseudodifferential equations on smooth manifolds, in: Proceedings of the International Conference on Wavelets: Theory, Algorithms, and Applications, C.K. Chui, L. Montefusco, L. Puccio (eds.), Academic Press, 1994, 385--424.

.... solution of BEM reduce the complexity to a suboptimal rate, i.e. O(N J log ff N J ) or even an optimal rate, i.e. O(N J ) Prominent examples for such methods are the fast multipole method [17] the panel clustering [20] or hierarchical matrices [19, 32] As introduced by [1] and improved in [9, 10, 11, 12, 30], wavelet bases offer a further tool for the fast solution of integral equations. In fact, a Galerkin discretization with wavelet bases results in quasi sparse matrices, i.e. the most matrix entries are negligible and can be treated as zero. Discarding these nonrelevant matrix entries is called ....

....functions j;k are local with respect to the corresponding scale j, i.e. diam supp j;k 2 Gammaj and we will normalize them such k j;k k L 2( Omega Gamma 1. We note that at first glance it would be very convenient to deal with a single orthonormal system of wavelets. But it was shown in [12, 30] that orthogonal wavelets are not completely appropriate for the efficient solution of boundary integral equations. For that reason we use biorthogonal wavelet bases. Then, we have also a biorthogonal, or dual, multiresolution analysis, i.e. dual single scale bases e Phi j = f e OE j;k : k 2 ....

W. Dahmen, S. Prodorf, and R. Schneider. Multiscale methods for pseudodifferential equations on smooth manifolds. In C.K. Chui, L. Montefusco, and L. Puccio, editors, Proceedings of the International Conference on Wavelets: Theory, Algorithms, and Applications, pages 385--424, 1995. 36

.... solution of BEM reduce the complexity to a suboptimal rate, i.e. O(N J log ff N J ) or even an optimal rate, i.e. O(N J ) Prominent examples for such methods are the fast multipole method [17] the panel clustering [20] or hierarchical matrices [19, 32] As introduced by [1] and improved in [9, 10, 11, 12, 30], wavelet bases offer a further tool for the fast solution of integral equations. In fact, a Galerkin discretization with wavelet bases results in quasi sparse matrices, i.e. the most matrix entries are negligible and can be treated as zero. Discarding these nonrelevant matrix entries is called ....

W. Dahmen, S. Prodorf, and R. Schneider. Multiscale methods for pseudodifferential equations. In L.L. Schumaker and G. Webb, editors, Wavelet Analysis and its Applications, volume 3, pages 191--235, 1993.

....in our current approach. At the moment, some of the blocks of the matrices in (38) possess the wavelet typical finger structure while others are diagonal. The finger structure has O(N log N) non zero entries, where N denotes the dimension of each block. With known matrix compression techniques [19] the block finger structure can be represented by only O(N) entries without significant loss of accuracy. The underlying linear system of the QP subproblem can be solved either by factorization or by iterative techniques. Only the latter may allow for a reasonable order of complexity roughly ....

....Only the latter may allow for a reasonable order of complexity roughly proportional to the number of variables. Fast convergence of the iterative algorithm is a key issue. Convergence acceleration can be established through efficient preconditioning. For J 1 diagonal preconditioners exist [8, 19] in a sense that the condition number will be independent from the number of trial functions used to discretize the system. However, more work remains to be done to develop efficient iterative solution approaches for the problem considered here. Since we do not assume that the second order ....

W. Dahmen, S. Pr ossdorf, and R. Schneider. Multiscale methods for pseudodifferential equations on smooth manifolds. In C.K. Chui, L. Montefusco, and L. Puccio, editors, Proceedings of the International Conference on Wavelets: Theory, Algorithms, and Applications, pages 385--424. Academic Press, San Diego, 1994.

....some negative and half integer Sobolev norms, such as the norms of H Gamma1 ( Omega Gamma and H Gamma1=2 ( Gamma) which seem to be difficult to compute in practice. However, due to recent results in multilevel preconditioning [7] and multiscale methods or wavelet approximations (see [14] [16], 36] these norms are computable in suitable finite dimensional subspaces. Moreover, in the framework of multiscale methods or biorthogonal wavelets, these computations are fairly simple and can be carried out within optimal complexity. We like to mention that these approaches gives rise to ....

....16 operators. Wavelet bases facilitate the computation of the Sobolev norms. In fact, one can exploit several features simultaneously, namely the computation of the half integer Sobolev norms [15] the preconditioning [14] 36] together with a sparse discretization by matrix compression [16], 36] 38] and the use of wavelet bases for an adaptive approximation [11] The matrix compression accelerates computation with the boundary element matrices enormously. In fact, it reduces the quadratic complexity dealing with full matrices of size N to order N or N log a N , cf. 36] This ....

Dahmen, W., Pr odorf, S. and Schneider, R.: Multiscale methods for pseudo-differential equations on smooth manifolds. In: Proceedings of the International Conference on Wavelets: Theory, Algorithms, and Applications, C.K. Chui, L. Montefusco, L. Puccio (eds.), Academic Press, 1994, pp. 385-424.

....however, are easier to obtain, see e.g. D1] 4 3. Stability and convergence of wavelet based Galerkin schemes Popular methods for solving (1.1) numerically are projection schemes. For the case when the right hand side f is given without any noise these schemes have been investigated in [DPS] [DPS1], Sch] in the context of multiresolution analysis. Here we confine ourselves to the case of the Galerkin scheme, i.e. we seek for a solution u j 2 V j of the variational problem hAu j ; v j i = hf; v j i for all v j 2 V j . It is convenient to reformulate the Galerkin method as a ....

....(3.2) means that the finite dimensional operators A j = Q j AQ j have left inverses A Gamma1 j : H t r H t which are bounded uniformly in j. An establishment of the (t; r) stability for wavelet based projection schemes and elliptic pseudodifferential equations have been given in [DPS] [DPS1], Sch] Combining stability (3.2) with the approximation properties (2.5) 2.6) yields the following canonical error estimates for the unique solution u j of (4.1) Theorem 3.1 [DPS] Sch] Suppose that for t 2 [ Gammafl 1 Gamma r; fl 0 ] 0 r 2 fl 0 , the scheme (4.1) is (t; ....

[Article contains additional citation context not shown here]

Dahmen, W., Prossdorf, S., Schneider, R., Multiscale methods for pseudodifferential equations. in: Recent Advances in Wavelet Analysis, L. L. Schumacher, G. Webb (eds.), Academic Press, 191--235, 1994.

....write a b if there holds a . b and b . a. The typical examples included in the above assumptions are given by integral operators A arising from the reformulation of elliptic boundary value problems as boundary integral equations, when the boundary is smooth, see e.g. McL] At] YS] SS] [DPS], BPV] PP] In most of these examples the order is Gamma1, i.e. r = 1. By duality, an elliptic pseudodifferential operator of negative order Gammar; r 0, defines an isomorphism from H Gamma r 2 onto H r 2 . Thus, the equation Au = f (1.1) 1 has a unique solution u = A Gamma1 ....

....however, are easier to obtain, see e.g. D1] 4 3. Stability and convergence of wavelet based Galerkin schemes Popular methods for solving (1.1) numerically are projection schemes. For the case when the right hand side f is given without any noise these schemes have been investigated in [DPS], DPS1] Sch] in the context of multiresolution analysis. Here we confine ourselves to the case of the Galerkin scheme, i.e. we seek for a solution u j 2 V j of the variational problem hAu j ; v j i = hf; v j i for all v j 2 V j . It is convenient to reformulate the Galerkin method as a ....

[Article contains additional citation context not shown here]

Dahmen, W., Prossdorf, S., Schneider, R., Multiscale methods for pseudo--differential equations on smooth closed manifolds. in: Proceedings of the International Conference on Wavelets: Theory, Algorithms and Applications, C. K. Chui, L. Mentefusco, L. Puccio (eds.), Academic Press, 385--424, 1994.

....y K(x; y)j c ; dist (x; y) Gamma(d ae jj jj) 2.12) holds with constants c ; depending only on the multi indices ; 2 ZZ d . Estimates of the type (2. 12) are known to hold for a wide range of cases including classical pseudo differential operators and Calder on Zygmund operators (see e.g. [18, 50]) Thus the single and double layer potential operator above as well as classical differential operators fall into this category. 6 3 Smoothness spaces and wavelet decompositions We wish to treat the above type of problems by means of wavelet methods. To this end, we have to explain first what ....

....and sparsity) We shall see in the following sections how the accuracy of the approximation of u S to u depends on the regularity of u. The properties of the stiffness matrix including its amenability to preconditioning is a central theme in Finite Element Methods amply reported on e.g. in [16, 18, 48, 49]. Wavelet discretizations offer the following advantages with regard to (ii) To describe this let for ae r as above P f : X ( I)2 hf; I i I : 3.6.57) Note that under the assumption (2.3) which we will quantify as, c 0 1 kAvkH Gammat kvkH t c 0 2 kAvkH Gammat ; v 2 H ....

[Article contains additional citation context not shown here]

Dahmen, W., S. Prodorf and R. Schneider, Multiscale methods for pseudo-differential equations on smooth manifolds, in Proceedings of the International Conference on Wavelets: Theory, Algorithms, and Applications, C. K. Chui, L. Montefusco, and L. Puccio (eds.), Academic Press, 1994, 385--424.

....diagonal preconditioning the wavelet Galerkin matrices are well conditioned. A new strategy has been introduced to retain the convergence behaviour of the corresponding Galerkin scheme without compromising the complexity of the compression. These early results have been improved by several authors [11, 12, 35] and [30, 31, 33, 34] Concerning boundary integral equations a strong effort has been spent on the construction of appropriate wavelet bases on surfaces [6, 13, 14, 30, 35] Furthermore, the efficient computation of the relevant 2 matrix coefficients turned out to be an important task for the ....

....in the two dimensional case which have no counterpart in three dimensions. A proper realization has also to exploit the special properties of the two dimensional case. One purpose of the present paper is to focus on these particular properties, whereas for the theoretical foundations we refer to [5, 11, 12, 24, 31, 35]. The present paper is organized as follows. As typical examples for boundary integral equations, we consider in section 2. the indirect formulations for the Dirichlet problem. Then, only a single function appears on the right hand side of the integral equation. We employ all kind of integral ....

W. Dahmen, S. Prodorf, and R. Schneider. Multiscale methods for pseudodifferential equations on smooth manifolds. In C.K. Chui, L. Montefusco, and L. Puccio, editors, Proceedings of the International Conference on Wavelets: Theory, Algorithms, and Applications, pages 385--424, 1995.

....error has been estimated in L 2 . It has been shown that, for any 0, a sparse matrix exists such that the compression introduces an error . The article [1] has initiated the investigation of wavelet methods for integral equations, pseudodifferential equations and boundary integral equations [8, 9, 10]. These papers written by Siegfried Prodorf and coauthors considered also operators of nonzero order by an appropriate preconditioning. Based on norm equivalences [7, 17, 27] it has been shown that for strongly elliptic operators after a diagonal preconditioning the wavelet Galerkin matrices are ....

....one [12, 32, 35] i.e. the computation of the relevant matrix entries requires numerical integration. There are two approximating steps: The first one is the matrix compression, the other one results from numerical integration. 3 The proposed matrix compression strategy has been developed in [8, 12, 31, 35]. In order to avoid logarithmic terms in complexity a second compression step, introduced in [35] is applied to the matrix entries corresponding to wavelets with overlapping supports. Moreover, we briefly recall the wavelet preconditioning. We explain in section 4. concretely how to establish the ....

W. Dahmen, S. Prodorf, and R. Schneider. Multiscale methods for pseudodifferential equations. In L.L. Schumaker and G. Webb, editors, Wavelet Analysis and its Applications, volume 3, pages 191--235, 1993.

....in dual norms. Accordingly, the quantities in (3.2.1) involve coefficients like hv; i i which are expansion coefficients in the dual bases Psi i . The exploitation of (3.1. 4) for the evaluation of dual norms has been used before in several different contexts such as matrix compression [DPS1, DPS2], adaptive schemes [DDHS, CDD] or stabilization [Be2, Be2] Let us next express the inner products from (3.2.1) in terms of wavelet coefficients. Recall from (3.1.3) that D Gamma1 i Psi i is a Riesz basis in H i;0 . Thus using our compact notation c T Psi i = P 2J i c i for ....

....2; 2 Gammajj=2 as diagonal weights in (3.1.3) The decay of the entries j(A 2;2 ) 0 j = j2 Gammajj j 0 j=2 h 2 ; V 2 0 ij 2 Gammajjj Gammaj 0 jjoe (1 2 min(jj;j 0 j)dist( Omega i ; Omega l 0 ) d Gamma1 2 n 2 Gamma1 ; 4.3. 19) is well known, see e.g. [DPS2, S]. Here n 2 is the order of vanishing moments of the wavelets Psi 2 or, equivalently, the order of polynomial exactness of the multiresolution spaces induced by the dual wavelet basis Psi 2 . In this example the globality of the operator V (and similarly for the other integral operators) ....

W. Dahmen, S. Proßdorf, R. Schneider, Multiscale methods for pseudo-differential equations on smooth manifolds, in: Proceedings of the International Conference on Wavelets: Theory, Algorithms, and Applications, C.K. Chui, L. Montefusco, L. Puccio (eds.), Academic Press, 1994, 385-424.

....to the approximation order of the dual multiresolution (resp. the vanishing moments of the wavelets) and the order of the operator A. Estimates of the type (2. 28) are known to hold for a wide range of cases including classical pseudo differential operators and Calder on Zygmund operators (see e.g. [21, 36]) In particular, the single and double layer potential operators fall into this category. We refer the reader to [19] for a full discussion of settings where (2.28) is valid. We introduce the class A oe;fi of all matrices B = b ; 0 ) 0 2r which satisfy jb ; 0 j c B 2 Gammajjj Gammaj ....

....3.3 is of general interest, it does not tell us any additional information when applied to the matrix A of (2.17) since our ellipticity assumptions (A1) already implies that A is bounded on 2 (r) It is well known that decay estimates of the type (2. 30) form the basis of matrix compression [8, 21, 35, 36]. The following proposition employs a compression technique which is somewhat different from the results in these papers. Proposition 3.4 For each oe d=2, fi d let s : min ( oe d Gamma 1 2 ; fi d Gamma 1 ) 3.16) assume that B 2 A oe;fi . Then, given any s s , there exists ....

W. Dahmen, S. Proßdorf, and R. Schneider, Multiscale methods for pseudodifferential equations on smooth manifolds, in: Proceedings of the International Conference on Wavelets: Theory, Algorithms, and Applications, C.K. Chui, L. Montefusco, and L. Puccio (eds.), Academic Press, 1994, 385-424.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC