In this paper, a primal-dual interior point method is proposed for general constrained optimization, which incorporated a penalty function and a kind of new identification technique of the active set. At each iteration, the proposed algorithm only needs to solve two or three reduced systems of linear equations with the same coefficient matrix. The size of systems of linear equations can be decreased due to the introduction of the working set, which is an estimate of the active set. The penalty parameter is automatically updated and the uniformly positive definiteness condition on the Hessian approximation of the Lagrangian is relaxed. The proposed algorithm possesses global and superlinear convergence under some mild conditions. Finally, some preliminary numerical results are reported.

In this paper, a local multilevel algorithm is investigated for solving linear systems arising from adaptive finite element approximations of second order elliptic problems with smooth complex coefficients. It is shown that the abstract theory for local multilevel algorithm can also be applied to elliptic problems whose dominant coefficient is complex valued. Assuming that the coarsest mesh size is sufficiently small, we prove that this algorithm with Gauss-Seidel smoother is convergent and optimal on the adaptively refined meshes generated by the newest vertex bisection algorithm. Numerical experiments are reported to confirm the theoretical analysis.

The mathematical model for semiconductor devices in three space dimensions are numerically discretized. The system consists of three quasi-linear partial differential equations about three physical variables: the electrostatic potential, the electron concentration and the hole concentration. We use standard mixed finite element method to approximate the elliptic electrostatic potential equation. For the two convection-dominated concentration equations, a characteristics-mixed finite element method is presented. The scheme is locally conservative. The optimal $L^2$-norm error estimates are derived by the aid of a post-processing step. Finally, numerical experiments are presented to validate the theoretical analysis.

In this paper, a multilevel correction scheme is proposed to solve the Steklov eigenvalue problem by nonconforming finite element methods. With this new scheme, the accuracy of eigenpair approximations can be improved after each correction step which only needs to solve a source problem on finer finite element space and an Steklov eigenvalue problem on the coarsest finite element space. This correction scheme can increase the overall efficiency of solving eigenvalue problems by the nonconforming finite element method. Furthermore, as same as the direct eigenvalue solving by nonconforming finite element methods, this multilevel correction method can also produce the lower-bound approximations of the eigenvalues.

A new algorithm for the removal of additive uncorrelated Gaussian noise from a digital image is presented. The algorithm is based on a data driven methodology for the adaptive thresholding of wavelet coefficients. This methodology is derived from higher order statistics of the residual image, and requires no a priori estimate of the level of noise contamination of an image.

The paper presents results on piecewise polynomial approximations of tensor product type in Sobolev-Slobodecki spaces by various interpolation and projection techniques, on error estimates for quadrature rules and projection operators based on hierarchical bases, and on inverse inequalities.