Band 19, Heft 4

Solving the Stokes equation by an optimal domain decomposition method derived algebraically involves the use of nonstandard interface conditions whose discretisation is not trivial. For this reason the use of approximation methods such as hybrid discontinuous Galerkin appears as an appropriate strategy: on the one hand they provide the best compromise in terms of the number of degrees of freedom in between standard continuous and discontinuous Galerkin methods, and on the other hand the degrees of freedom used in the nonstandard interface conditions are naturally defined at the boundary between elements. In this paper, we introduce the coupling between a well chosen discretisation method (hybrid discontinuous Galerkin) and a novel and efficient domain decomposition method to solve the Stokes system. We present the detailed analysis of the hybrid discontinuous Galerkin method for the Stokes problem with nonstandard boundary conditions. The full stability and convergence analysis of the discretisation method is presented, and the results are corroborated by numerical experiments. In addition, the advantage of the new preconditioners over more classical choices is also supported by numerical experiments.

We devise a Hybrid High-Order (HHO) method for highly oscillatory elliptic problems that is capable of handling general meshes. The method hinges on discrete unknowns that are polynomials attached to the faces and cells of a coarse mesh; those attached to the cells can be eliminated locally using static condensation. The main building ingredient is a reconstruction operator, local to each coarse cell, that maps onto a fine-scale space spanned by oscillatory basis functions. The present HHO method generalizes the ideas of some existing multiscale approaches, while providing the first complete analysis on general meshes. It also improves on those methods, taking advantage of the flexibility granted by the HHO framework. The method handles arbitrary orders of approximation k≥0{k\geq 0}. For face unknowns that are polynomials of degree k , we devise two versions of the method, depending on the polynomial degree (k-1){(k-1)} or k of the cell unknowns. We prove, in the case of periodic coefficients, an energy-error estimate of the form (ε12+Hk+1+(εH)12){(\varepsilon^{\frac{1}{2}}+H^{k+1}+(\frac{\varepsilon}{H})^{\frac{1}{2}})}, and we illustrate our theoretical findings on some test-cases.

In photoacoustic tomography, one is interested to recover the initial pressure distribution inside a tissue from the corresponding measurements of the induced acoustic wave on the boundary of a region enclosing the tissue. In the limited view problem, the wave boundary measurements are given on the part of the boundary, whereas in the full view problem, the measurements are known on the whole boundary. For the full view problem, there exist various fast and robust reconstruction methods. These methods give severe reconstruction artifacts when they are applied directly to the limited view data. One approach for reducing such artefacts is trying to extend the limited view data to the whole region boundary, and then use existing reconstruction methods for the full view data. In this paper, we propose an operator learning approach for constructing an operator that gives an approximate extension of the limited view data. We consider the behavior of a reconstruction formula on the extended limited view data that is given by our proposed approach. Approximation errors of our approach are analyzed. We also present numerical results with the proposed extension approach supporting our theoretical analysis.

In this paper, we deal with nonlinear ill-posed operator equations involving a monotone operator in the setting of Hilbert scales. Our convergence analysis of the proposed derivative-free method is based on the simple property of the norm of a self-adjoint operator. Using a general Hölder-type source condition, we obtain an optimal order error estimate. Also we consider the adaptive parameter choice strategy proposed by Pereverzev and Schock (2005) for choosing the regularization parameter. Finally, we applied the proposed method to the parameter identification problem in an elliptic PDE in the setting of Hilbert scales and compare the results with the corresponding method in Hilbert space.

We derive the well-posedness and maximal regularity of the fractional Cauchy problem in Hölder space C0γ⁢(E){C_{0}^{\gamma}(E)}. We also obtain the existence and stability of new implicit difference schemes for the general approximation to the nonhomogeneous fractional Cauchy problem. Our analysis is based on the approaches of the theory of β-resolvent families, functional analysis and numerical analysis.

In this paper, we consider control systems for which the underlying semigroup is analytic, and the resolvent of its generator is compact. In that case we give a characterization of the stabilizability of such control systems. When the stabilizability condition is satisfied the system is also stabilizable by finite-dimensional controls. We end the paper by giving an application of this result to the stabilizability of the Oseen equations with mixed boundary conditions.

In this paper, the distributed-order time fractional sub-diffusion equation on the bounded domains is studied by using the finite-point-type meshless method. The finite point method is a point collocation based method which is truly meshless and computationally efficient. To construct the shape functions of the finite point method, the moving least square reproducing kernel approximation is employed. Two implicit discretisation of order O⁢(τ){O(\tau)} and O⁢(τ1+12⁢σ){O(\tau^{1+\frac{1}{2}\sigma})} are derived, respectively. Stability and L2{L^{2}} norm convergence of the obtained difference schemes are proved. Numerical examples are provided to confirm the theoretical results.

In this work we study the numerical solution to the Volterra integro-differential algebraic equation. Two numerical examples based on the Legendre collocation scheme are designed. It follows from the convergence proof and numerical experiments that the errors of the approximate solution and the errors of the approximate derivative of the solution decay exponentially.

The embedded discontinuous Galerkin (EDG) method by Cockburn, Gopalakrishnan and Lazarov [B. Cockburn, J. Gopalakrishnan and R. Lazarov, Unified hybridization of discontinuous Galerkin, mixed, and continuous Galerkin methods for second-order elliptic problems, SIAM J. Numer. Anal. 47 2009, 2, 1319–1365] is obtained from the hybridizable discontinuous Galerkin method by changing the space of the Lagrangian multiplier from discontinuous functions to continuous ones, and adopts piecewise polynomials of equal degrees on simplex meshes for all variables. In this paper, we analyze a new EDG method for second-order elliptic problems on polygonal/polyhedral meshes. By using piecewise polynomials of degrees k+1{k+1}, k+1{k+1}, k (k≥0{k\geq 0}) to approximate the potential, numerical trace and flux, respectively, the new method is shown to yield optimal convergence rates for both the potential and flux approximations. Numerical experiments are provided to confirm the theoretical results.