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

We consider an inverse problem of recovering a time-dependent factor of an unknown source on some subboundary for a diffusion equation with time fractional derivative by nonlocal measurement data. Such fractional-order equations describe anomalous diffusion of some contaminants in heterogeneous media such as soil and model the contamination process from an unknown source located on a part of the boundary of the concerned domain. For this inverse problem, we firstly establish the well-posedness in some Sobolev space. Then we propose two regularizing schemes in order to reconstruct an unknown boundary source stably in terms of the noisy measurement data. The first regularizing scheme is based on an integral equation of the second kind which an unknown boundary source solves, and we prove a convergence rate of regularized solutions with a suitable choice strategy of the regularizing parameter. The second regularizing scheme relies directly on discretization by the radial basis function for the initial-boundary value problem for fractional diffusion equation, and we carry out numerical tests, which show the validity of our proposed regularizing scheme.

In this paper, we develop an adaptive generalized multiscale discontinuous Galerkin method (GMsDGM) for a class of high-contrast flow problems and derive a priori and a posteriori error estimates for the method. Based on the a posteriori error estimator, we develop an adaptive enrichment algorithm for our GMsDGM and prove its convergence. The adaptive enrichment algorithm gives an automatic way to enrich the approximation space in regions where the solution requires more basis functions, which are shown to perform well compared with a uniform enrichment. We also discuss an approach that adaptively selects multiscale basis functions by correlating the residual to multiscale basis functions (cf. [S. S. Chen, D. L. Donoho, and M. A. Saunders, <i>SIAM Rev.</i>, 43 (2001), pp. 129--159]). The proposed error indicators are L_2-based and can be inexpensively computed, which makes our approach efficient

For the steady-state solution of a differential equation from a one-dimensional multistate model in transport theory, we shall derive and study a nonsymmetric algebraic Riccati equation <i>B</i> <i>XF</i> <i>F</i>⁺<i>X</i> + <i>XB</i>⁺<i>X</i> = 0, where <i>F</i> (<i>I</i> <i>F</i>)<i>D</i> and <i>B</i> <i>BD</i> with positive diagonal matrices <i>D</i> and possibly low-ranked matrices <i>F</i> and <i>B</i>. We prove the existence of the minimal positive solution <i>X</i>^* under a set of physically reasonable assumptions and study its numerical computation by fixed-point iteration, Newtons method and the doubling algorithm. We shall also study several special cases. For example when <i>B</i> and <i>F</i> are low ranked then X*=(i=14UiViT) with low-ranked <i>U_i</i> and <i>V_i</i> that can be computed using more efficient iterative processes. Numerical examples will be given to illustrate our theoretical results.

No abstract uploaded!