The truncation method for a two-dimensional nonhomogeneous backward heat problem

We consider the backward heat problem

     

Notes on a new approximate solution of 2-D heat equation backward in time

In this paper, we consider a backward heat problem that appears in many applications. This problem is ill-posed. The solution of the problem as the solution exhibits unstable dependence on the given data functions. Using a new regularization method, we regularize the problem and get some new error estimates. Some numerical tests illustrate that the proposed method is feasible and effective. This work is a generalization of many recent papers, including the earlier paper [A new regularized method for two dimensional nonhomogeneous backward heat problem, Appl. Math. Comput. 215(3) (2009) 873–880] and some other authors such as Chu-Li Fu et al. ,  and , Campbell et al. [4].     

关于可靠性设施布局问题的近似算法

设施布局问题的研究始于20世纪60年代,主要研究选择修建设施的位置和数量,以及与需要得到服务的城市之间的分配关系,使得设施的修建费用和设施与城市之间的连接费用之和达到最小.现实生活中, 受自然灾害、工人罢工、恐怖袭击等因素的影响,修建的设施可能会出现故障, 故连接到它的城市无法得到供应,这就直接影响到了整个系统的可靠性.针对如何以相对较小的代价换取设施布局可靠性的提升,研究人员提出了可靠性设施布局问题.参考经典设施布局问题的贪婪算法、原始对偶算法和容错性问题中分阶段分层次处理的思想,设计了可靠性设施布局问题的一个组合算法.该算法不仅在理论上具有很好的常数近似度,而且还具有运算复杂性低的优点.这对于之前的可靠性设施布局问题只有数值实验算法, 是一个很大的进步.     

位移障碍下四阶变分不等式问题的非协调有限元一般误差估计式

1.引 言 关于二阶变分不等式问题的非协调有限元逼近已有大量研究[1-5].但是,对于四阶变分不等式的研究相对而言较少[6-7].[8,9,10]给出了位移障碍问题的非协调有限元,包括C0元(如Zienkiewicz元及Adini元)和非C0元(如Morley元及De Veubeke元)逼近的理论分析及最优误差估计.经过仔细分析发现,其成功的关键技巧是充分利用上述单元的一个     

Convergence analysis of an upwind mixed element method for advection diffusion problems

We consider a upwinding mixed element method for a system of first order partial differential equations resulting from the mixed formulation of a general advection diffusion problem. The system can be used to model the transport of a contaminant carried by a flow. We use the lowest order Raviart-Thomas mixed finite element space. We show the first order convergence both for concentration and concentration flux in L²(Ω).     

四阶障碍问题的稳定化混合有限元方法

本文讨论了四阶障碍问题的稳定化混合有限元方法.首先,引入网格依赖范数,通过加罚方法得到了与四阶障碍问题的等价的混合变分形式.随后给出了基于C~0协调有限元空间(W_h,V_h)的混合有限元逼近,例如P_k-P_k三角形有限元.在网格依赖范数下,(W_h,V_h)满足离散的inf-sup条件.最后,我们在不同的假设下,得到了一些误差估计.     

一类带有铁磁材料参数的非线性涡流问题的A-φ有限元法

针对带有铁磁材料的非线性涡流问题,其非线性性通常体现在磁场强度和磁感应强度的关系上.本文提出了一种全离散的有限元A-φ格式,分别在时间和空间上采用向后欧拉公式以及节点有限元进行离散.首先,在合适的函数空间里给出时间上的半离散格式,通过考察其弱形式建立相应的适定性理论,并证明近似解收敛于弱解.其次,给出全离散格式并讨论其误差估计.最后,给出两个数值算例以验证理论结果.     

Optimal L ∞-Error Estimate of a Finite Element Method for Hamilton–Jacobi–Bellman Equations

This paper is concerned with the piecewise linear finite element approximation of Hamilton–Jacobi–Bellman equations. We establish the optimal L ^∞-error estimate, combining the concepts of subsolution and discrete regularity.     

Application of the dual active set algorithm to quadratic network optimization

A new algorithm, the dual active set algorithm, is presented for solving a minimization problem with equality constraints and bounds on the variables. The algorithm identifies the active bound constraints by maximizing an unconstrained dual function in a finite number of iterations. Convergence of the method is established, and it is applied to convex quadratic programming. In its implementable form, the algorithm is combined with the proximal point method. A computational study of large-scale quadratic network problems compares the algorithm to a coordinate ascent method and to conjugate gradient methods for the dual problem. This study shows that combining the new algorithm with the nonlinear conjugate gradient method is particularly effective on difficult network problems from the literature.     

CONVERGENCE OF AN ALTERNATING A-φ SCHEME FOR QUASI-MAGNETOSTATIC EDDY CURRENT PROBLEM

We propose in this paper an alternating A-$\phi$ method for the quasi-magnetostatic eddy current problem by means of finite element approximations. Bounds for continuous and discrete error in finite time are given. And it is verified that provided the time step $\tau$ is sufficiently small, the proposed algorithm yields for finite time $T$ an error of $O(h+\tau^{1/2})$ in the $L^2$-norm for the magnetic field $H(= \mu^{-1} \nabla \times A)$, where $h$ is the mesh size, $\mu$ the magnetic permeability.     

A “build-down” scheme for linear programming

We propose a build-down scheme for Karmarkar's algorithm and the simplex method for linear programming. The scheme starts with an optimal basis candidate set including all columns of the constraint matrix, then constructs a dual ellipsoid containing all optimal dual solutions. A pricing rule is developed for checking whether or not a dual hyperplane corresponding to a column intersects the containing ellipsoid. If the dual hyperplane has no intersection with the ellipsoid, its corresponding column will not appear in any of the optimal bases, and can be eliminated from. As these methods iterate, is eventually built-down to a set that contains only the optimal basic columns.     

An infeasible (exterior point) simplex algorithm for assignment problems

The so called Modified Hung—Rom Algorithm, based upon theoretical considerations of Hirsch-paths, seems to be one of the most efficient algorithms for assignment problems. Since any two basic feasible solutions to a linear problem can always be connected with a short simplex path passing through the infeasible region, development of algorithms based upon theoretical considerations on infeasible paths seems to be of great practical interest. This paper presents an algorithm of this kind for assignment problems.     

The Dual Active Set Algorithm and Its Application to Linear Programming

The Dual Active Set Algorithm (DASA), presented in Hager, Advances in Optimization and Parallel Computing, P.M. Pardalos (Ed.), North Holland: Amsterdam, 1992, pp. 137–142, for strictly convex optimization problems, is extended to handle linear programming problems. Line search versions of both the DASA and the LPDASA are given.