Uniform convergence analysis of hybrid numerical scheme for singularly perturbed problems of mixed type

In this article, we consider a class of singularly perturbed mixed parabolic‐elliptic problems whose solutions possess both boundary and interior layers. To solve these problems, a hybrid numerical scheme is proposed and it is constituted on a special rectangular mesh which consists of a layer resolving piecewise‐uniform Shishkin mesh in the spatial direction and a uniform mesh in the temporal direction. The domain under consideration is partitioned into two subdomains. For the spatial discretization, the proposed scheme is comprised of the classical central difference scheme in the first subdomain and a hybrid finite difference scheme in the second subdomain, whereas the time derivative in the given problem is discretized by the backward‐Euler method. We prove that the method converges uniformly with respect to the perturbation parameter with almost second‐order spatial accuracy in the discrete supremum norm. Numerical results are finally presented to validate the theoretical results.© 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1931–1960, 2014     

Uniformly convergent C 0‐nonconforming triangular prism element for fourth‐order elliptic singular perturbation problem

In this article, we introduce a C ⁰‐nonconforming triangular prism element for the fourth‐order elliptic singular perturbation problem in three dimensions by using the bubble functions. The element is proved to be convergent in the energy norm uniformly with respect to the perturbation parameter. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1785–1796, 2014     

Estimating the ground state energy of the Schrödinger equation for convex potentials

In 2011, the fundamental gap conjecture for Schrödinger operators was proven. This can be used to estimate the ground state energy of the time-independent Schrödinger equation with a convex potential and relative error ε$\epsilon$. Classical deterministic algorithms solving this problem have cost exponential in the number of its degrees of freedom d$d$. We show a quantum algorithm, that is based on a perturbation method, for estimating the ground state energy with relative error ε$\epsilon$. The cost of the algorithm is polynomial in d$d$ and ε⁻¹${\epsilon }^{-1}$, while the number of qubits is polynomial in d$d$ and logε⁻¹$log{\epsilon }^{-1}$. In addition, we present an algorithm for preparing a quantum state that overlaps within 1−δ,δ∈(0,1)$1-\delta ,\delta \in (0,1)$, with the ground state eigenvector of the discretized Hamiltonian. This algorithm also approximates the ground state with relative error ε$\epsilon$. The cost of the algorithm is polynomial in d$d$, ε⁻¹${\epsilon }^{-1}$ and δ⁻¹${\delta }^{-1}$, while the number of qubits is polynomial in d$d$, logε⁻¹$log{\epsilon }^{-1}$ and logδ⁻¹$log{\delta }^{-1}$.     

A semilocal convergence result for Newton’s method under generalized conditions of Kantorovich

From Kantorovich’s theory we establish a general semilocal convergence result for Newton’s method based fundamentally on a generalization required to the second derivative of the operator involved. As a consequence, we obtain a modification of the domain of starting points for Newton’s method and improve the a priori error estimates. Finally, we illustrate our study with an application to a special case of conservative problems.     

A modified Bakhvalov mesh

We consider a few numerical methods for solving a one-dimensional convection–diffusion singularly perturbed problem. More precisely, we introduce a modified Bakvalov mesh generated using some implicitly defined functions. Properties of this mesh and convergence results for several methods on it are given. Numerical results are presented in support of the theoretical considerations.     

基于权值编码的组合拍卖竞胜标确定启发式算法研究

针对较大规模组合拍卖竞胜标确定问题(WDP),提出了基于权值编码的竞胜标确定启发式算法.改进了算法编码机制并嵌入基于WDP本质特点的启发式搜索规则,极大地提高了算法进化能力和求解效率.模拟实验结果表明该算法能够在较短时间内求出WDP最优解或满意近似解,为较大规模网上组合拍卖竞胜标确定问题提供了切实可行的求解算法.     

基于主子阵算法的n-2n型指派计算工具的实现

主要在研究周良泽的指派求解理论和主子阵算法基础上,设计一种n-2n指派问题求解的实现方案,最后用Java语言实现一个可视化的通用计算工具,并调试运行.结果证明,该实现方案效率高,结果易于理解.