A discontinuous finite volume element method for second‐order elliptic problems

In this article, we propose a new discontinuous finite volume element (DFVE) method for the second‐order elliptic problems. We treat the DFVE method as a perturbation of the interior penalty method and get a superapproximation estimate in a mesh dependent norm between the solution of the DFVE method and that of the interior penalty method. This reveals that the DFVE method is much closer to the interior penalty method than we have known. By using this superapproximation estimate, we can easily get the optimal order error estimates in the L² ‐norm and in the maximum norms of the DFVE method.© 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 425–440, 2012     

On the convergence of a new trust region algorithm

Summary. In this paper we present a new trust region algorithm for general nonlinear constrained optimization problems. The algorithm is based on the exact penalty function. Under very mild conditions, global convergence results for the algorithm are given. Local convergence properties are also studied. It is shown that the penalty parameter generated by the algorithm will be eventually not less than the norm of the Lagrange multipliers at the accumulation point. It is proved that the method is equivalent to the sequential quadratic programming method for all large , hence superlinearly convergent results of the SQP method can be applied. Numerical results are also reported. Received March 21, 1993     

A weak Galerkin finite element method for the second order elliptic problems with mixed boundary conditions

In this paper, a weak Galerkin finite element method is proposed and analyzed for the second-order elliptic equation with mixed boundary conditions. Optimal order error estimates are established in both discrete $H^1$ norm and the standard $L^2$ norm for the corresponding WG approximations. The numerical experiments are presented to verify the efficiency of the method.     

A new model for sparse and low-rank matrix decomposition

The robust principal component analysis (RPCA) model is a popular method for solving problems with the nuclear norm and $\ell_1$ norm. However, it is time-consuming since in general one has to use the singular value decomposition in each iteration. In this paper, we introduce a novel model to reformulate the existed model by making use of low-rank matrix factorization to surrogate the nuclear norm for the sparse and low-rank decomposition problem. In such case we apply the Penalty Function Method (PFM) and Augmented Lagrangian Multipliers Method (ALMM) to solve this new non-convex optimization problem. Theoretically, corresponding to our methods, the convergence analysis is given respectively. Compared with classical RPCA, some practical numerical examples are simulated to show that our methods are much better than RPCA.     

Convergence and stability of two-level penalty mixed finite element method for stationary Navier-Stokes equations

The two-level penalty mixed finite element method for the stationary Navier-Stokes equations based on Taylor-Hood element is considered in this paper. Two algorithms are proposed and analyzed. Moreover, the optimal stability analysis and error estimate for these two algorithms are provided. Finally, the numerical tests confirm the theoretical results of the presented algorithms.     

��������ѡ���Isingģ�͵ķǰ��ͷ�����

In this paper, we put non-concave penalty on the local conditional likelihood. We obtain the oracle property and asymptotic normal distribution property of the parameters in Ising model. With a union band, we obtain the sign consistence for the estimator of parameter matrix, and the convergence speed under the matrix $L_1$ norm. The results of the simulation studies and a real data analysis show that the non-concave penalized estimator has larger sensitivity.     

带惩罚μ-相似Bregman散度k-均值问题的初始化算法

$k$-均值问题是聚类中的经典问题,亦是NP-难问题。如果允许数据点不聚类,而是支付惩罚费用,则引出带惩罚的$k$-均值问题。本文将带惩罚的$k$-均值问题从欧氏距离推广到更一般的$\mu$-相似Bregman散度,研究了带惩罚$\mu$-相似Bregman散度$k$-均值问题的初始化算法。本文给出的初始化算法,近似比与$\mu$和数据点惩罚最大值与最小值的比例$r$相关。     

Superconvergence and stability for boundary penalty techniques of finite difference methods

The finite difference method (FDM) is used for Dirichlet problems of Poisson's equation, and the Dirichlet boundary condition is dealt with by boundary penalty techniques. Two penalty techniques, penalty‐integrals and penalty‐collocations (i.e., fixing), are proposed in this paper. The error bounds in the discrete H¹ norm and the infinite norms are derived. The stability analysis is based on the new effective condition number (Cond_eff) but not on the traditional condition number (Cond). The bounds of Cond_eff are explored to display that both the penalty‐integral and the penalty‐collocation techniques have good stability; the huge Cond is misleading. Since the penalty‐collocation technique (i.e., the fixing technique) is simpler, it has been applied in engineering problem for a long time. It is worthy to point out that this paper is the first time to provide a theoretical justification for such a popular penalty‐collocation (fixing) technique. Hence the penalty‐collocation is recommended for dealing with the complicated constraint conditions such as the clamped and the simply support boundary conditions of biharmonic equations. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

带惩罚μ-相似Bregman散度k-均值问题的初始化算法

$k$-均值问题是聚类中的经典问题,亦是NP-难问题。如果允许数据点不聚类,而是支付惩罚费用,则引出带惩罚的$k$-均值问题。本文将带惩罚的$k$-均值问题从欧氏距离推广到更一般的$\mu$-相似Bregman散度,研究了带惩罚$\mu$-相似Bregman散度$k$-均值问题的初始化算法。本文给出的初始化算法,近似比与$\mu$和数据点惩罚最大值与最小值的比例$r$相关。     

求解定常不可压Stokes方程的两层罚函数方法

借助于两套有限元网格空间提出了一种求解定常不可压Stokes方程的两层罚函数方法.该方法只需要求解粗网格空间上的Stokes方程和细网格空间上的两个易于求解的罚参数方程（离散后的线性方程组具有相同的对称正定系数矩阵）.收敛性分析表明粗网格空间相对于细网格空间可以选择很小，并且罚参数的选取只与粗网格步长和问题的正则性有关.因此罚参数不必选择很小仍能够得到最优解.最后通过数值算例验证了上述理论结果，并且数值对比可知两层罚函数方法对于求解定常不可压Stokes方程具有很好的效果.     

$\beta$-Homogeneous次的$F$-空间上正交可加的稳定性

在本文中我们研究了正交?程的稳定性, 其与Wlodzimierz Fechner和Justyna Sikorska在2010年得出的结果密切相关. 本文的差异性在于考虑目标空间赋予$\beta$-齐次范数和拟范数. 通过克服$\beta$-齐次范数和拟范数的瓶颈,得到了新的结果.     

A TWO-GRID METHOD FOR THE C0 INTERIOR PENALTY DISCRETIZATION OF THE MONGE-AMP(E)RE EQUATION

The purpose of this paper is to analyze an efficient method for the solution of the nonlinear system resulting from the discretization of the elliptic Monge-Ampère equation by a $C^0$ interior penalty method with Lagrange finite elements. We consider the two-grid method for nonlinear equations which consists in solving the discrete nonlinear system on a coarse mesh and using that solution as initial guess for one iteration of Newton's method on a finer mesh. Thus both steps are inexpensive. We give quasi-optimal $W^{1,\infty}$ error estimates for the discretization and estimate the difference between the interior penalty solution and the two-grid numerical solution. Numerical experiments confirm the computational efficiency of the approach compared to Newton's method on the fine mesh.     

A priori error estimates for interior penalty versions of the local discontinuous Galerkin method applied to transport equations

The local discontinuous Galerkin method has been developed recently by Cockburn and Shu for convection‐dominated convection‐diffusion equations. In this article, we consider versions of this method with interior penalties for the numerical solution of transport equations, and derive a priori error estimates. We consider two interior penalty methods, one that penalizes jumps in the solution across interelement boundaries, and another that also penalizes jumps in the diffusive flux across such boundaries. For the first penalty method, we demonstrate convergence of order k in the L^∞(L²) norm when polynomials of minimal degree k are used, and for the second penalty method, we demonstrate convergence of order k+1/2. Through a parabolic lift argument, we show improved convergence of order k+1/2 (k+1) in the L²(L²) norm for the first penalty method with a penalty parameter of order one (h^?1). © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 545–564, 2001     

Regularization of Steffensen's method with inexactly specified initial data

A minimization problem is considered for the case when the minimand function and the functions defining the set of equality and inequality constraints are known with an error. A regularized Steffensen's method for the solution of this problem is proposed. It is shown that, when the variation of the regularization and penalty parameters is compatible with the errors, the sequence generated by this method converges in norm to the minimum point with minimum norm.Translated from Metody Matematicheskogo Modelirovaniya, Avtomatizatsiya Obrabotki Nablyudenii i Ikh Primeneniya, pp. 15–23, 1986.     

LOCAL PRESSURE CORRECTION FOR THE STOKES SYSTEM

Pressure correction methods constitute the most widely used solvers for the timedependent Navier-Stokes equations.There are several different pressure correction methods,where each time step usually consists in a predictor step for a non-divergence-free velocity,followed by a Poisson problem for the pressure(or pressure update),and a final velocity correction to obtain a divergence-free vector field.In some situations,the equations for the velocities are solved explicitly,so that the numerical most expensive step is the elliptic pressure problem.We here propose to solve this Poisson problem by a domain decomposition method which does not need any communication between the sub-regions.Hence,this system is perfectly adapted for parallel computation.We show under certain assumptions that this new scheme has the same order of convergence as the original pressure correction scheme(with global projection).Numerical examples for the Stokes system show the effectivity of this new pressure correction method.The convergence order O(k^2)for resulting velocity fields can be observed in the norm l^2(0,T;L^2(Ω)).     

A Fast Conservative Scheme for the Space Fractional Nonlinear Schrödinger Equation with Wave Operator

A new efficient compact difference scheme is proposed for solving a space fractional nonlinear Schrödinger equation with wave operator. The scheme is proved to conserve the total mass and total energy in a discrete sense. Using the energy method, the proposed scheme is proved to be unconditionally stable and its convergence order is shown to be of $ \mathcal{O}( h^6 + \tau^2) $ in the discrete $ L_2 $ norm with mesh size $ h $ and the time step $ \tau $. Moreover, a fast difference solver is developed to speed up the numerical computation of the scheme. Numerical experiments are given to support the theoretical analysis and to verify the efficiency, accuracy, and discrete conservation laws.     

裂缝-孔隙介质中地下水污染问题的Galerkin交替方向有限元方法

考虑裂缝 孔隙介质中地下水污染问题均匀化模型的数值模拟．对压力方程采用混合元方法,对浓度方程采用Ｇａｌｅｒｋｉｎ交替方向有限元方法,对吸附浓度方程采用标准Ｇａｌｅｒｋｉｎ方法,证明了交替方向有限元格式具有最优犔２ 和犎１ 模误差估计．     

Multigrid methods for the symmetric interior penalty method on graded meshes

The symmetric interior penalty (SIP) method on graded meshes and its fast solution by multigrid methods are studied in this paper. We obtain quasi‐optimal error estimates in both the energy norm and the L₂ norm for the SIP method, and prove uniform convergence of the W‐cycle multigrid algorithm for the resulting discrete problem. The performance of these methods is illustrated by numerical results. Copyright © 2009 John Wiley & Sons, Ltd.     

给定零点的最近复系数多项式计算问题

Nearest polynomial with given properties has many applications in control theory and applied mathematics. Given a complex univariate polynomial f(z) and a zero α, in this paper we explore the problem of computing a complex polynomial f(z) such that f(α) = 0 and the distance ∥f-f ∥ is minimal. Considering most of the existing works focus on either certain polynomial basis or certain vector norm, we propose a common computation framework based on both general polynomial basis and general vector norm, and summarize the computing process into a four-step algorithm. Further, to find the explicit expression of f(z), we focus on two specific norms which generalize the familiar lp-norm and mixed norm studied in the existing works, and then compute f(z) explicitly based on the proposed algorithm. We finally give a numerical example to show the effectiveness of our method.     

The Schwarzian Derivative of Harmonic Mappings in the Plane

In this paper, the authors introduce a definition of the Schwarzian derivative of any locally univalent harmonic mapping defined on a simply connected domain in the complex plane. Using the new definition, the authors prove that any harmonic mapping f which maps the unit disk onto a convex domain has Schwarzian norm ■≤ 6. Furthermore, any locally univalent harmonic mapping f which maps the unit disk onto an arbitrary regular n-gon has Schwarzian norm■.