In this paper we develop a plane wave type method for discretization of homogeneous Helmholtz equations with variable wave numbers. In the proposed method, local basis functions (on each element) are constructed by the geometric optics ansatz such that they approximately satisfy a homogeneous Helmholtz equation without boundary condition. More precisely, each basis function is expressed as the product of an exponential plane wave function and a polynomial function, where the phase function in the exponential function approximately satisfies the eikonal equation and the polynomial factor is recursively determined by transport equations associated with the considered Helmholtz equation. We prove that the resulting plane wave spaces have high order $h$-approximations as the standard plane wave spaces (which are available only to the case with constant wave number). We apply the proposed plane wave spaces to the discretization of nonhomogeneous Helmholtz equations with variable wave numbers and establish the corresponding error estimates of their finite element solutions. We report some numerical results to illustrate the efficiency of the proposed method.
Various nonparametric approaches for Bayesian spectral density estimation of stationary time series have been suggested in the literature, mostly based on the Whittle likelihood approximation. A generalization of this approximation has been proposed in Kirch et al. who prove posterior consistency for spectral density estimation in combination with the Bernstein-Dirichlet process prior for Gaussian time series. In this paper, we will extend the posterior consistency result to non-Gaussian time series by employing a general consistency theorem of Shalizi for dependent data and misspecified models. As a special case, posterior consistency for the spectral density under the Whittle likelihood as proposed by Choudhuri, Ghosal and Roy is also extended to non-Gaussian time series. Small sample properties of this approach are illustrated with several examples of non-Gaussian time series.
In this contribution we derive and analyze a new numerical method for kinetic equations based on a variable transformation of the moment approximation. Classical minimum-entropy moment closures are a class of reduced models for kinetic equations that conserve many of the fundamental physical properties of solutions. However, their practical use is limited by their high computational cost, as an optimization problem has to be solved for every cell in the space-time grid. In addition, implementation of numerical solvers for these models is hampered by the fact that the optimization problems are only well-defined if the moment vectors stay within the realizable set. For the same reason, further reducing these models by, e.g., reduced-basis methods is not a simple task. Our new method overcomes these disadvantages of classical approaches. The transformation is performed on the semi-discretized level which makes them applicable to a wide range of kinetic schemes and replaces the nonlinear optimization problems by inversion of the positive-definite Hessian matrix. As a result, the new scheme gets rid of the realizability-related problems. Moreover, a discrete entropy law can be enforced by modifying the time stepping scheme. Our numerical experiments demonstrate that our new method is often several times faster than the standard optimization-based scheme.
The objective of this research is the development of a geometrically exact model for the analysis of arbitrarily curved spatial Bernoulli-Euler beams. The complete metric of the beam is utilized in order to include the effect of curviness on the nonlinear distribution of axial strain over the cross section. The exact constitutive relation between energetically conjugated pairs is employed, along with four reduced relations. The isogeometric approach, which allows smooth connections between finite elements, is used for the spatial discretization of the weak form. Two methods for updating the local basis are applied and discussed in the context of finite rotations. All the requirements of geometrically exact beam theory are satisfied, such as objectivity and path-independence. The accuracy of the formulation is verified by a thorough numerical analysis. The influence of the curviness on the structural response is scrutinized for two classic examples. If the exact response of the structure is sought, the curviness must be considered when choosing the appropriate beam model.
In this paper, we consider the problem of jointly performing online parameter estimation and optimal sensor placement for a partially observed infinite dimensional linear diffusion process. We present a novel solution to this problem in the form of a continuous-time, two-timescale stochastic gradient descent algorithm, which recursively seeks to maximise the log-likelihood with respect to the unknown model parameters, and to minimise the expected mean squared error of the hidden state estimate with respect to the sensor locations. We also provide extensive numerical results illustrating the performance of the proposed approach in the case that the hidden signal is governed by the two-dimensional stochastic advection-diffusion equation.
We study approximation theorems for the Euler characteristic of the Vietoris-Rips and Cech filtration. The filtration is obtained from a Poisson or binomial sampling scheme in the critical regime. We apply our results to the smooth bootstrap of the Euler characteristic and determine its rate of convergence in the Kantorovich-Wasserstein distance and in the Kolmogorov distance.
We present a new numerical approach for wave induced dynamic fracture. The method is based on a discontinuous Galerkin approximation of the first-order hyperbolic system for elastic waves and a phase-field approximation of brittle fracture driven by the maximum tension. The algorithm is staggered in time and combines an implicit midpoint rule for the wave propagation followed by an implicit Euler step for the phase-field evolution. At fracture, the material is degraded, and the waves are reflected at the diffusive interfaces. Two and three-dimensional examples demonstrate the advantages of the proposed method for the computation of crack growth and spalling initiated by reflected and superposed waves.
The subject of this work is a new stochastic Galerkin method for second-order elliptic partial differential equations with random diffusion coefficients. It combines operator compression in the stochastic variables with tree-based spline wavelet approximation in the spatial variables. Relying on a multilevel expansion of the given random diffusion coefficient, the method is shown to achieve optimal computational complexity up to a logarithmic factor. In contrast to existing results, this holds in particular when the achievable convergence rate is limited by the regularity of the random field, rather than by the spatial approximation order. The convergence and complexity estimates are illustrated by numerical experiments.
A convergence theory for the $hp$-FEM applied to a variety of constant-coefficient Helmholtz problems was pioneered in the papers [Melenk-Sauter, 2010], [Melenk-Sauter, 2011], [Esterhazy-Melenk, 2012], [Melenk-Parsania-Sauter, 2013]. This theory shows that, if the solution operator is bounded polynomially in the wavenumber $k$, then the Galerkin method is quasioptimal provided that $hk/p \leq C_1$ and $p\geq C_2 \log k$, where $C_1$ is sufficiently small, $C_2$ is sufficiently large, and both are independent of $k,h,$ and $p$. The significance of this result is that if $hk/p= C_1$ and $p=C_2\log k$, then quasioptimality is achieved with the total number of degrees of freedom proportional to $k^d$; i.e., the $hp$-FEM does not suffer from the pollution effect. This paper proves the analogous quasioptimality result for the heterogeneous (i.e. variable-coefficient) Helmholtz equation, posed in $\mathbb{R}^d$, $d=2,3$, with the Sommerfeld radiation condition at infinity, and $C^\infty$ coefficients. We also prove a bound on the relative error of the Galerkin solution in the particular case of the plane-wave scattering problem. These are the first ever results on the wavenumber-explicit convergence of the $hp$-FEM for the Helmholtz equation with variable coefficients.
Trefftz methods are high-order Galerkin schemes in which all discrete functions are elementwise solution of the PDE to be approximated. They are viable only when the PDE is linear and its coefficients are piecewise constant. We introduce a 'quasi-Trefftz' discontinuous Galerkin method for the discretisation of the acoustic wave equation with piecewise-smooth wavespeed: the discrete functions are elementwise approximate PDE solutions. We show that the new discretisation enjoys the same excellent approximation properties as the classical Trefftz one, and prove stability and high-order convergence of the DG scheme. We introduce polynomial basis functions for the new discrete spaces and describe a simple algorithm to compute them. The technique we propose is inspired by the generalised plane waves previously developed for time-harmonic problems with variable coefficients; it turns out that in the case of the time-domain wave equation under consideration the quasi-Trefftz approach allows for polynomial basis functions.
We consider unconstrained optimization problems with nonsmooth and convex objective function in the form of mathematical expectation. The proposed method approximates the objective function with a sample average function by using different sample size in each iteration. The sample size is chosen in an adaptive manner based on the Inexact Restoration. The method uses line search and assumes descent directions with respect to the current approximate function. We prove the almost sure convergence under the standard assumptions. The convergence rate is also considered and the worst-case complexity of $\mathcal{O} (\varepsilon^{-2})$ is proved. Numerical results for two types of problems, machine learning hinge loss and stochastic linear complementarity problems, show the efficiency of the proposed scheme.