In this paper, we analyze the Bregman iterative model using the G-norm. Firstly, we show the convergence of the iterative model. Secondly, using the source condition and the symmetric Bregman distance, we consider the error estimations between the iterates and the exact image both in the case of clean and noisy data. The results show that the Bregman iterative model using the G-norm has the similar good properties as the Bregman iterative model using the L2-norm.

Offline computation is an essential component in most multiscale model reduction techniques. However, there are multiscale problems in which offline procedure is insufficient to give accurate representations of solutions, due to the fact that offline computations are typically performed locally and global information is missing in these offline information. To tackle this difficulty, we develop an online local adaptivity technique for local multiscale model reduction problems. We design new online basis functions within Discontinuous Galerkin method based on local residuals and some optimally estimates. The resulting basis functions are able to capture the solution efficiently and accurately, and are added to the approximation iteratively. Moreover, we show that the iterative procedure is convergent with a rate independent of physical scales if the initial space is chosen carefully. Our analysis also gives

No abstract uploaded!

In this paper, we propose a model reduction method for solving multiscale elliptic PDEs with random coefficients in the multiquery setting using an optimization approach. The optimization approach enables us to construct a set of localized multiscale data-driven stochastic basis functions that give an optimal approximation property of the solution operator. Our method consists of the offline and online stages. In the offline stage, we construct the localized multiscale data-driven stochastic basis functions by solving an optimization problem. In the online stage, using our basis functions, we can efficiently solve multiscale elliptic PDEs with random coefficients with relatively small computational costs. Therefore, our method is very efficient in solving target problems with many different force functions. The convergence analysis of the proposed method is also presented and has been verified by the numerical simulations.

We begin a systematical study on the effect of numerical viscosities. In this paper we investigate the behavior of shock-capturing methods for slowly moving shocks. It is known that for slowly moving shocks even a first-order scheme, such as the Godunov or Roe type methods, will generate downstream oscillatory wave patterns that cannot be effectively damped by the dissipation of these first-order schemes. The purpose of this paper is to understand the formation and behavior of these downstream patterns. Our study shows that the downstream errors are generated by the unsteady nature of the viscous shock profiles and behave diffusively. The scenario is as follows. When solving the compressible Euler equations by shock capturing methods, the smeared density profile introduces a momentum spike at the shock location if the shock moves slowly. Downstream waves will necessarily emerge in order to balance the momentum mass carried by the spike for the momentum conservation. Although each family of waves decays inl∞andl2while they preserve the same mass, the perturbing nature of the viscous or spike profile is a constant source for the generation of new downstream waves, causing spurious solutions foralltime. Higher order TVD or ENO type interpolations accentuate this problem.