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.

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, by means 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.

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, the second order convergence of the interpolation based on $Q^c_1$-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.

We introduce a multiple interval Chebyshev-Gauss-Lobatto spectral collocation method for the initial value problems of the nonlinear ordinary differential equations (ODES). This method is easy to implement and possesses the high order accuracy. In addition, it is very stable and suitable for long time calculations. We also obtain the $hp$-version bound on the numerical error of the multiple interval collocation method under $H^1$-norm. Numerical experiments confirm the theoretical expectations.

The computation of integrals in higher dimensions and on general domains, when no explicit cubature rules are known, can be "easily" addressed by means of the quasi-Monte Carlo method. The method, simple in its formulation, becomes computationally inefficient when the space dimension is growing and the integration domain is particularly complex. In this paper we present two new approaches to the quasi-Monte Carlo method for cubature based on  nonnegative least squares and  approximate Fekete points. The main idea is to use less points and especially  good points for solving the system of the moments.  Good points are here intended as points with good interpolation properties, due to the strict connection between interpolation and cubature. Numerical experiments show that, in average, just a tenth of the points should be used to maintain the same approximation order of the quasi-Monte Carlo method. The method has been satisfactorily applied to 2- and 3-dimensional problems on quite complex domains.

We study the convergence of an Ulm-like Cayley transform method for solving inverse eigenvalue problems which avoids solving approximate Jacobian equations. Under the nonsingularity assumption of the relative generalized Jacobian matrices at the solution, a convergence analysis covering both the distinct and multiple eigenvalues cases is provided and the quadratical convergence is proved. Moreover, numerical experiments are given in the last section to illustrate our results.

A moving mesh method is proposed for solving reaction-diffusion equations. The finite element method is used to solving the partial different equation system, and an efficient scheme is applied to implement mesh moving. In the practical calculations, the moving mesh step and the problem equation solver are performed alternatively. Serveral numerical examples are presented, including the Gray-Scott, the Activator-Inhibitor and a case with a growing domain. It is illustrated numerically that the moving mesh method costs much lower, compared with the numerical schemes on a fixed mesh. Even in the case of complex pattern dynamics described by the reaction-diffusion systems, the adapted meshes can capture the details successfully.