Left-invariant PDE-evolutions on the roto-translation group SE(2)(and their resolvent equations) have been widely studied in the fields of cortical modeling and image analysis. They include hypo-elliptic diffusion (for contour enhancement) proposed by Citti & Sarti, and Petitot, and they include the direction process (for contour completion) proposed by Mumford. This paper presents a thorough study and comparison of the many numerical approaches, which, remarkably, are missing in the literature. Existing numerical approaches can be classified into 3 categories: Finite difference methods, Fourier based methods (equivalent to SE(2)-Fourier methods), and stochastic methods (Monte Carlo simulations). There are also 3 types of exact solutions to the PDE-evolutions that were derived explicitly (in the spatial Fourier domain) in previous works by Duits and van Almsick in 2005. Here we provide an overview of these 3 types of exact solutions and explain how they relate to each of the 3 numerical approaches. We compute relative errors of all numerical approaches to the exact solutions, and the Fourier based methods show us the best performance with smallest relative errors. We also provide an improvement of Mathematica algorithms for evaluating Mathieu-functions, crucial in implementations of the exact solutions. Furthermore, we include an asymptotical analysis of the singularities within the kernels and we propose a probabilistic extension of underlying stochastic processes that overcomes the singular behavior in the origin of time-integrated kernels. Finally, we show retinal imaging applications of combining left-invariant PDE-evolutions with invertible orientation scores.

This paper presents a relatively simple numerical method to investigate the flow and heat transfer of laminar power-law fluids over a semi-infinite plate in the presence of viscous dissipation and anisotropy radiation. On one hand, unlike most classical works, the effects of power-law viscosity on velocity and temperature fields are taken into account when both the dynamic viscosity and the thermal diffusivity vary as a power-law function. On the other hand, boundary layer equations are derived by Taylor expansion, and a mixed analytical/numerical method (a pseudosimilarity method) is proposed to effectively solve the boundary layer equations. This method has been justified by comparing its results with those of the original governing equations obtained by a finite element method. These results agree very well especially when the Reynolds number is large. We also observe that the robustness and accuracy of the algorithm are better when thermal boundary layer is thinner than velocity boundary layer.

Sign truncated matching pursuit (STrMP) algorithm is presented in this paper. STrMP is a new greedy algorithm for the recovery of sparse signals from the sign measurement, which combines the principle of consistent reconstruction with orthogonal matching pursuit (OMP). The main part of STrMP is as concise as OMP and hence STrMP is simple to implement. In contrast to previous greedy algorithms for one-bit compressed sensing, STrMP only need to solve a convex and unconstrained subproblem at each iteration. Numerical experiments show that STrMP is fast and accurate for one-bit compressed sensing compared with other algorithms.

In this paper, we present two adaptive methods for the basis enrichment of the mixed Generalized Multiscale Finite Element Method (GMsFEM) for solving the flow problem in heterogeneous media. We develop an a-posteriori error indicator which depends on the norm of a local residual operator. Based on this indicator, we construct an offline adaptive method to increase the number of basis functions locally in coarse regions with large local residuals. We also develop an online adaptive method which iteratively enriches the function space by adding new functions computed based on the residual of the previous solution and special minimum energy snapshots. We show theoretically and numerically the convergence of the two methods. The online method is, in general, better than the offline method as the online method is able to capture distant effects (at a cost of online computations), and both methods have faster convergence than a uniform enrichment. Analysis shows that the online method should start with a certain number of initial basis functions in order to have the best performance. The numerical results confirm this and show further that with correct selection of initial basis functions, the convergence of the online method can be independent of the contrast of the medium. We consider cases with both very high and very low conducting inclusions and channels in our numerical experiments.

An adaptive multi-penalty discontinuous Galerkin method (AMPDG) for the diffusion problem is considered. Convergence and quasi-optimality of the AMPDG are proved. Compared with the analyses for the adaptive finite element method or the adaptive interior penalty discontinuous Galerkin method, extra works are done to overcome the difficulties caused by the additional penalty terms.

In this paper, a priori error estimates are derived for the mixed finite element discretization of optimal control problems governed by fourth order elliptic partial differential equations. The state and co-state are discretized by Raviart-Thomas mixed finite element spaces and the control variable is approximated by piecewise constant functions. The error estimates derived for the state variable as well as those for the control variable seem to be new. We illustrate with a numerical example to confirm our theoretical results.

In this paper, a new stopping rule is proposed for orthogonal multi-matching pursuit (OMMP). We show that, for ℓ2 bounded noise case, OMMP with the new stopping rule can recover the true support of any K-sparse signal x from noisy measurements y = Фx + e in at most K iterations, provided that all the nonzero components of x and the elements of the matrix Ф satisfy certain requirements. The proposed method can improve the existing result. In particular, for the noiseless case, OMMP can exactly recover any K-sparse signal under the same RIP condition.

This paper deals with numerical solution to the multi-term time fractional diffusion equation in a finite domain. An implicit finite difference scheme is established based on Caputo's definition to the fractional derivatives, and the upper and lower bounds to the spectral radius of the coefficient matrix of the difference scheme are estimated, with which the unconditional stability and convergence are proved. The numerical results demonstrate the effectiveness of the theoretical analysis, and the method and technique can also be applied to other kinds of time/space fractional diffusion equations.

The anisotropic perfectly matched layer (APML) defines a continuous vector field outside a rectangle domain and performs the complex coordinate stretching along the vector field. Inspired by [Z. Chen et al., Inverse Probl. Imag., 7, (2013):663–678] and based on the idea of the shortest distance, we propose a new approach to construct the vector field which still allows us to prove the exponential decay of the stretched Green function without the constraint on the thickness of the PML layer. Moreover, by using the reflection argument, we prove the stability of the PML problem in the PML layer and the convergence of the PML method. Numerical experiments are also included.

In this paper, a nonconforming mixed finite element method (FEM) is presented to approximate time-dependent Maxwell's equations in a three-dimensional bounded domain with absorbing boundary conditions (ABC). By employing traditional variational formula, instead of adding penalty terms, we show that the discrete scheme is robust. Meanwhile, with the help of the element's typical properties and derivative transfer skills, the convergence analysis and error estimates for semidiscrete and backward Euler fully-discrete schemes are given, respectively. Numerical tests show the validity of the proposed method.

In this paper, bymeans of a new recursive algorithm of non-tensor-product-typed divided differences, bivariate polynomial interpolation schemes are constructed over nonrectangular meshes firstly, which is converted into the study of scattered data interpolation. And the schemes are different as the number of scattered data is odd and even, respectively. Secondly, the corresponding error estimation is worked out, and an equivalence is obtained between high-order non-tensor-product-typed divided differences and high-order partial derivatives in the case of odd and even interpolating nodes, respectively. Thirdly, several numerical examples illustrate the recursive algorithms valid for the non-tensor-product-typed interpolating polynomials, and disclose that these polynomials change as the order of the interpolating nodes, although the node collection is invariant. Finally, from the aspect of computational complexity, the operation count with the bivariate polynomials presented is smaller than that with radial basis functions.

In order to suppress the failure of preserving positivity of density or pressure, a positivity-preserving limiter technique coupled with h-adaptive Runge-Kutta discontinuous Galerkin (RKDG) method is developed in this paper. Such a method is implemented to simulate flows with the large Mach number, strong shock/obstacle interactions and shock diffractions. The Cartesian grid with ghost cell immersed boundary method for arbitrarily complex geometries is also presented. This approach directly uses the cell solution polynomial of DG finite element space as the interpolation formula. The method is validated by the well documented test examples involving unsteady compressible flows through complex bodies over a large Mach numbers. The numerical results demonstrate the robustness and the versatility of the proposed approach.

Based on polyhedral splines, some multivariate splines of different orders with given supports over arbitrary topological meshes are developed. Schemes for choosing suitable families of multivariate splines based on pre-given meshes are discussed. Those multivariate splines with inner knots and boundary knots from the related meshes are used to generate rational spline shapes with related control points. Steps for up to C2-surfaces over the meshes are designed. The relationship among the meshes and their knots, the splines and control points is analyzed. To avoid any unexpected discontinuities and get higher smoothness, a heart-repairing technique to adjust inner knots in the multivariate splines is designed.

With the theory above, bivariate C1-quadratic splines over rectangular meshes are developed. Those bivariate splines are used to generate rational C1-quadratic surfaces over the meshes with related control points and weights. The properties of the surfaces are analyzed. The boundary curves and the corner points and tangent planes, and smooth connecting conditions of different patches are presented. The C1–continuous connection schemes between two patches of the surfaces are presented.

The fourth order average vector field (AVF) method is applied to solve the “Good” Boussinesq equation. The semi-discrete system of the “good” Boussinesq equation obtained by the pseudo-spectral method in spatial variable, which is a classical finite dimensional Hamiltonian system, is discretizated by the fourth order average vector field method. Thus, a new high order energy conservation scheme of the “good” Boussinesq equation is obtained. Numerical experiments confirm that the new high order scheme can preserve the discrete energy of the “good” Boussinesq equation exactly and simulate evolution of different solitary waves well.

We study the gradient superconvergence of bilinear finite volume element (FVE) solving the elliptic problems. First, a superclose weak estimate is established for the bilinear form of the FVE method. Then, we prove that the gradient approximation of the FVE solution has the superconvergence property:

where denotes the average gradient on elements containing point P and S is the set of optimal stress points composed of the mesh points, the midpoints of edges and the centers of elements.

In this paper, we propose a splitting positive definite mixed finite element method for the approximation of convex optimal control problems governed by linear parabolic equations, where the primal state variable y and its flux σ are approximated simultaneously. By using the first order necessary and sufficient optimality conditions for the optimization problem, we derive another pair of adjoint state variables z and ω, and also a variational inequality for the control variable u is derived. As we can see the two resulting systems for the unknown state variable y and its flux σ are splitting, and both symmetric and positive definite. Besides, the corresponding adjoint states z and ω are also decoupled, and they both lead to symmetric and positive definite linear systems. We give some a priori error estimates for the discretization of the states, adjoint states and control, where Ladyzhenkaya-Babuska-Brezzi consistency condition is not necessary for the approximation of the state variable y and its flux σ. Finally, numerical experiments are given to show the efficiency and reliability of the splitting positive definite mixed finite element method.

This paper presents a computational method for solving stochastic Ito-Volterra integral equations. First, Haar wavelets and their properties are employed to derive a general procedure for forming the stochastic operational matrix of Haar wavelets. Then, application of this stochastic operational matrix for solving stochastic Ito-Volterra integral equations is explained. The convergence and error analysis of the proposed method are investigated. Finally, the efficiency of the presented method is confirmed by some examples.

In this paper, the second order convergence of the interpolation based on -element is derived in the case of d=1, 2 and 3. Using the integral average on each element, the new basis functions of tensor product type is builded up and we can easily extend it to the higher dimensional case. Finally, some numerical tests are made to show the analytical results of the interpolation errors.

An explicit difference scheme is described, analyzed and tested for numerically approximating stochastic elastic equation driven by infinite dimensional noise. The noise processes are approximated by piecewise constant random processes and the integral formula of the stochastic elastic equation is approximated by a truncated series. Error analysis of the numerical method yields estimate of convergence rate. The rate of convergence is demonstrated with numerical experiments.

In this paper we explore the performance of the SIMPLER, augmented Lagrangian, ‘grad-div’ preconditioners and their new variants for the two-by-two block systems arising in the incompressible Navier-Stokes equations. The lid-driven cavity and flow over a finite flat plate are chosen as the benchmark problems. For each problem the Reynolds number varies from a low to the limiting number for a laminar flow.