9,190 research outputs found
Adaptive boundary element methods with convergence rates
This paper presents adaptive boundary element methods for positive, negative,
as well as zero order operator equations, together with proofs that they
converge at certain rates. The convergence rates are quasi-optimal in a certain
sense under mild assumptions that are analogous to what is typically assumed in
the theory of adaptive finite element methods. In particular, no
saturation-type assumption is used. The main ingredients of the proof that
constitute new findings are some results on a posteriori error estimates for
boundary element methods, and an inverse-type inequality involving boundary
integral operators on locally refined finite element spaces.Comment: 48 pages. A journal version. The previous version (v3) is a bit
lengthie
Large negative velocity gradients in Burgers turbulence
We consider 1D Burgers equation driven by large-scale white-in-time random
force. The tails of the velocity gradients probability distribution function
(PDF) are analyzed by saddle-point approximation in the path integral
describing the velocity statistics. The structure of the saddle-point
(instanton), that is velocity field configuration realizing the maximum of
probability, is studied numerically in details. The numerical results allow us
to find analytical solution for the long-time part of the instanton. Its
careful analysis confirms the result of [Phys. Rev. Lett. 78 (8) 1452 (1997)
[chao-dyn/9609005]] based on short-time estimations that the left tail of PDF
has the form ln P(u_x) \propto -|u_x|^(3/2).Comment: 10 pages, RevTeX, 10 figure
Multilevel methods for the h-, p-, and hp-versions of the boundary element method
AbstractIn this paper we give an overview on the definition of finite element spaces for the h-, p-, and hp-version of the BEM along with preconditioners of additive Schwarz type. We consider screen problems (with a hypersingular or a weakly singular integral equation of first kind on an open surface Γ) as model problems. For the hypersingular integral equation and the h-version with piecewise bilinear functions on a coarse and a fine grid we analyze a preconditioner by iterative substructuring based on a non-overlapping decomposition of Γ. We prove that the condition number of the preconditioned linear system behaves polylogarithmically in H/h. Here H is the size of the subdomains and h is the size of the elements. For the hp-version and the hypersingular integral equation we comment in detail on an additive Schwarz preconditioner which uses piecewise polynomials of high degree on the fine grid and yields also a polylogarithmically growing condition number. For the weakly singular integral equation, where no continuity of test and trial functions across the element boundaries has to been enforced, the method works for nonuniform degree distributions as well. Numerical results supporting our theory are reported
Fast integral equation methods for the modified Helmholtz equation
We present a collection of integral equation methods for the solution to the
two-dimensional, modified Helmholtz equation, u(\x) - \alpha^2 \Delta u(\x) =
0, in bounded or unbounded multiply-connected domains. We consider both
Dirichlet and Neumann problems. We derive well-conditioned Fredholm integral
equations of the second kind, which are discretized using high-order, hybrid
Gauss-trapezoid rules. Our fast multipole-based iterative solution procedure
requires only O(N) or operations, where N is the number of nodes
in the discretization of the boundary. We demonstrate the performance of the
methods on several numerical examples.Comment: Published in Computers & Mathematics with Application
- …