In this paper, we investigate the use of ultra weak variational formulation to solve a wave scattering problem in near field optics. In order to capture the sub-scale features of waves, we utilize evanescent wave functions together with plane wave functions to approximate the local properties of the field. We analyze the global convergence and give an error estimation of the method. Numerical examples are also presented to demonstrate the effectiveness of the strategy.

The numerical solution of flow problems usually requires bounded domains although the physical problem may take place in an unbounded or substantially larger domain. In this case, artificial boundaries are necessary. A well established artificial boundary condition for the Navier-Stokes equations discretized by finite elements is the "do-nothing" condition. The reason for this is the fact that this condition appears automatically in the variational formulation after partial integration of the viscous term and the pressure gradient. This condition is one of the most established outflow conditions for Navier-Stokes but there are very few analytical insight into this boundary condition. We address the question of existence and stability of weak solutions for the Navier-Stokes equations with a "directional do-nothing" condition. In contrast to the usual "do-nothing" condition this boundary condition has enhanced stability properties. In the case of pure outflow, the condition is equivalent to the original one, whereas in the case of inflow a dissipative effect appears. We show existence of weak solutions and illustrate the effect of this boundary condition by computation of steady and non-steady flows.

A new technique of residual-type a posteriori error analysis is developed for the lowest-order Raviart-Thomas mixed finite element discretizations of convection-diffusion-reaction equations in two- or three-dimension. Both centered mixed scheme and upwind-weighted mixed scheme are considered. The a posteriori error estimators, derived for the stress variable error plus scalar displacement error in $L^2$-norm, can be directly computed with the solutions of the mixed schemes without any additional cost, and are proven to be reliable. Local efficiency dependent on local variations in coefficients is obtained without any saturation assumption, and holds from the cases where convection or reaction is not present to convection- or reaction-dominated problems. The main tools of the analysis are the postprocessed approximation of scalar displacement, abstract error estimates, and the property of modified Oswald interpolation. Numerical experiments are carried out to support our theoretical results and to show the competitive behavior of the proposed posteriori error estimates.

In this paper, a new Schwarz method called restricted additive Schwarz method (RAS) is presented and analyzed for a kind of nonlinear complementarity problem (NCP). The method is proved to be convergent by using weighted maximum norm. Besides, the effect of overlap on RAS is also considered. Some preliminary numerical results are reported to compare the performance of RAS and other known methods for NCP.

In this paper, we formulate interface problem and Neumann elliptic boundary value problem into a form of linear operator equations with self-adjoint positive definite operators. We prove that in the discrete level the condition number of these operators is independent of the mesh size. Therefore, given a prescribed error tolerance, the classical conjugate gradient algorithm converges within a fixed number of iterations. The main computation task at each iteration is to solve a Dirichlet Poisson boundary value problem in a rectangular domain, which can be furnished with fast Poisson solver. The overall computational complexity is essentially of linear scaling.

In this paper, we investigate the adjoint equation in photoacoustic tomography with variable sound speed, and propose three variational iterative algorithms. The basic idea of these algorithms is to compute the original equation and the adjoint equation iteratively. We present numerical examples and show the well performance of these variational iterative algorithms.