Advances in Computational Mathematics最新文献

For h-FEM discretisations of the Helmholtz equation with wavenumber k, we obtain k-explicit analogues of the classic local FEM error bounds of Nitsche and Schatz (Math. Comput. 28(128), 937–958 1974), Wahlbin (1991, §9), Demlow et al.(Math. Comput. 80(273), 1–9 2011), showing that these bounds hold with constants independent of k, provided one works in Sobolev norms weighted with k in the natural way. We prove two main results: (i) a bound on the local (H^1) error by the best approximation error plus the (L^2) error, both on a slightly larger set, and (ii) the bound in (i) but now with the (L^2) error replaced by the error in a negative Sobolev norm. The result (i) is valid for shape-regular triangulations, and is the k-explicit analogue of the main result of Demlow et al. (Math. Comput. 80(273), 1–9 2011). The result (ii) is valid when the mesh is locally quasi-uniform on the scale of the wavelength (i.e., on the scale of (k^{-1})) and is the k-explicit analogue of the results of Nitsche and Schatz (Math. Comput. 28(128), 937–958 1974), Wahlbin (1991, §9). Since our Sobolev spaces are weighted with k in the natural way, the result (ii) indicates that the Helmholtz FEM solution is locally quasi-optimal modulo low frequencies (i.e., frequencies (lesssim k)). Numerical experiments confirm this property, and also highlight interesting propagation phenomena in the Helmholtz FEM error.

For the iterative decoupling of elliptic–parabolic problems such as poroelasticity, we introduce time discretization schemes up to order five based on the backward differentiation formulae. Its analysis combines techniques known from fixed-point iterations with the convergence analysis of the temporal discretization. As the main result, we show that the convergence depends on the interplay between the time step size and the parameters for the contraction of the iterative scheme. Moreover, this connection is quantified explicitly, which allows for balancing the single error components. Several numerical experiments illustrate and validate the theoretical results, including a three-dimensional example from biomechanics.

This paper is concerned with near-optimal approximation of a given univariate function with elements of a polynomially enriched wavelet frame, a so-called quarklet frame. Inspired by hp-approximation techniques of Binev, we use the underlying tree structure of the frame elements to derive an adaptive algorithm that, under standard assumptions concerning the local errors, can be used to create approximations with an error close to the best tree approximation error for a given cardinality. We support our findings by numerical experiments demonstrating that this approach can be used to achieve inverse-exponential convergence rates.

This work deals with the numerical solution of systems of oscillatory second-order differential equations which often arise from the semi-discretization in space of partial differential equations. Since these differential equations exhibit (pronounced or highly) oscillatory behavior, standard numerical methods are known to perform poorly. Our approach consists in directly discretizing the problem by means of Gautschi-type integrators based on sinc matrix functions. The novelty contained here is that of using a suitable rational approximation formula for the sinc matrix function to apply a rational Krylov-like approximation method with suitable choices of poles. In particular, we discuss the application of the whole strategy to a finite element discretization of the wave equation.

We investigate Sobolev regularity of bivariate functions obtained in Isogeometric Analysis when using geometry maps that are degenerate in the sense that the first partial derivatives vanish at isolated points. In particular, we show how the known (C^1)-conditions for D-patches have to be tightened to guarantee square integrability of second partial derivatives, as required when computing finite element approximations of elliptic fourth order PDEs like the biharmonic equation.

We revisit the moving least squares (MLS) approximation scheme on the sphere (mathbb S^{d-1} subset {mathbb R}^d), where (d>1). It is well known that using the spherical harmonics up to degree (L in {mathbb N}) as ansatz space yields for functions in (mathcal {C}^{L+1}(mathbb S^{d-1})) the approximation order (mathcal {O}left( h^{L+1} right) ), where h denotes the fill distance of the sampling nodes. In this paper, we show that the dimension of the ansatz space can be almost halved, by including only spherical harmonics of even or odd degrees up to L, while preserving the same order of approximation. Numerical experiments indicate that using the reduced ansatz space is essential to ensure the numerical stability of the MLS approximation scheme as (h rightarrow 0). Finally, we compare our approach with an MLS approximation scheme that uses polynomials on the tangent space of the sphere as ansatz space.

In this work, we propose and analyze a new stabilized virtual element method for the coupled Stokes-Darcy problem with Beavers-Joseph-Saffman interface condition on polygonal meshes. We derive two variants of local projection stabilization methods for the coupled Stokes-Darcy problem. The significance of local projection-based stabilization terms is that they provide reasonable control of the pressure component of the Stokes flow without involving higher-order derivative terms. The discrete inf-sup condition of the coupled Stokes-Darcy problem is established for the equal-order virtual element triplets involving velocity, hydraulic head, and pressure. The optimal error estimates are derived using the equal-order virtual elements in the energy and (L^2) norms. The proposed methods have several advantages: mass conservative, avoiding the coupling of the solution components, more accessible to implement, and performing efficiently on hybrid polygonal elements. Numerical experiments are conducted to depict the flexibility of the proposed methods, validating the theoretical results.

With local pressure-residual stabilizations as an augmentation to the classical Galerkin/least-squares (GLS) stabilized method, a new locally evaluated residual-based stabilized finite element method is proposed for a type of Stokes equations from the incompressible flows. We focus on the study of a type of nonstandard boundary conditions involving the mixed tangential velocity and pressure Dirichlet boundary conditions. Unexpectedly, in sharp contrast to the standard no-slip velocity Dirichlet boundary condition, neither the discrete LBB inf-sup stable elements nor the stabilized methods such as the classical GLS method could certainly ensure a convergent finite element solution, because the velocity solution could be very weak with its gradient not being square integrable. The main purpose of this paper is to study the error estimates of the new stabilized method for approximating the very weak velocity solution; with the local pressure-residual stabilizations, we can manage to prove the error estimates with a reasonable convergence order. Numerical results are provided to illustrate the performance and the theoretical results of the proposed method.

The perturbation of the QR decompostion is analyzed from the probalistic point of view. The perturbation error is approximated by a first-order perturbation expansion with high probability where the perturbation is assumed to be random. Different from the previous normwise perturbation bounds using the Frobenius norm, our techniques are used to develop the spectral norm, as well as the entry-wise perturbation bounds for the stochastic perturbation of the QR decomposition. The statistics tends to be tighter (in the sense of the expectation) and more realistic than the classical worst-case perturbation bounds. The novel perturbation bounds are applicable to a wide range of problems in statistics and communications. In this paper, we consider the perturbation bound of the leverage scores under the Gaussian perturbation, the probability guarantees and the error bounds of the low rank matrix recovery, and the upper bound of the errors of the tensor CUR-type decomposition. We also apply our perturbation bounds to improve the robust design of the Tomlinson-Harashima precoding in the Multiple-Input Multiple-Output (MIMO) system.

We look at computational physics from an electrical engineering perspective and suggest that several concepts of mathematics, not so well-established in computational physics literature, present themselves as opportunities in the field. We discuss elliptic complexes and highlight the category theoretical background and its role as a unifying language between algebraic topology, differential geometry, and modelling software design. In particular, the ubiquitous concept of naturality is central. Natural differential operators have functorial analogues on the cochains of triangulated manifolds. In order to establish this correspondence, we derive formulas involving simplices and barycentric coordinates, defining discrete vector fields and a discrete Lie derivative as a result of a discrete analogue of Cartan’s magic formula. This theorem is the main mathematical result of the paper.