Error bounds for analytic systems and their applications

Using a 1958 result of Lojasiewicz, we establish an error bound for analytic systems consisting of equalities and inequalities defined by real analytic functions. In particular, we show that over any bounded region, the distance from any vectorx in the region to the solution set of an analytic system is bounded by a residual function, raised to a certain power, evaluated atx. For quadratic systems satisfying certain nonnegativity assumptions, we show that this exponent is equal to 1/2. We apply the error bounds to the Karush—Kuhn—Tucker system of a variational inequality, the affine variational inequality, the linear and nonlinear complementarity problem, and the 0–1 integer feasibility problem, and obtain new error bound results for these problems. The latter results extend previous work for polynomial systems and explain why a certain square-root term is needed in an error bound for the (monotone) linear complementarity problem.The research of this author is based on work supported by the Natural Sciences and Engineering Research Council of Canada under grant OPG0090391.The research of this author is based on work supported by the National Science Foundation under grants DDM-9104078 and CCR-9213739 and by the Office of Naval Research under grant 4116687-01.     

A PRECONDITIONER FOR COUPLING SYSTEM OF NATURAL BOUNDARY ELEMENT AND COMPOSITE GRID FINITE ELEMENT

1. IntroductionThe coupling of boundary elemellts and finite elements is of great imPortance for the nu-mercal treatment of boundary value problems posed on unbounded domains. It permits us tocombine the advanages of boundary elements for treating domains extended to infinity withthose of finite elemenis in treating the comP1icated bounded domains.The standard procedure of coupling the boundary elemeni and finite elemeni methods isdescribed as follows. First, the (unbounded) domain is divided…     

ON THE CONVERGENCE OF KING-WERNER ITERATION METHOD IN BANACH SPACE ON THE CONVERGENCE OF KING-WERNER ITERATION METHOD IN BANACH SPACE

1. IntroductionLetf(x) = 0 (1.1)where j: X - Y is a norilineax operator which maps Banach space X into Baaedspace Y. The well-known iteration methods for solving (1.1) are the Nixon methodaam very ldnds of its improvement methods. One of them is the so called King-Wernerm6thod denned bykw(p, x03 yo):which is established by King in [7], Werner in [12] in d~nt formulas, respectively.It is interesting that the method (1.2) is of order 1 fi with the same functioncompotatinn coSt and twO ti…     

上海市电力需求的协整与误差修正分析

本文采用协整与误差修正模型技术研究了上海市电力需求的决定因素,建立了上海电力需求函数,检验了电力需求与国内生产总值、电力价格、经济结构、电力使用效率之间的长期均衡关系及短期波动关系。     

非线性约束优化问题的一个修正 Lagrangian 算法

基于一个含有控制参数的修正Lagrangian函数,该文建立了一个求解非线性约束优化问题的修正Lagrangian算法.在一些适当的条件下,证明了控制参数存在一个阀值,当控制参数小于这一阀值时,由这一算法产生的序列解局部收敛于问题的Kuhn-Tucker点,并且建立了解的误差上界.最后给出一些约束优化问题的数值结果.     

一类求解抛物型方程侧边值问题的最优滤波方法

该文考虑一类特殊的抛物型方程侧边值问题,即一类含有对流项的非标准逆热传导问题. 给定在x=1处的温度测量值来确定区间(0,1)上的未知解u(x, t). 这是一类不适定问题,即问题的解(如果解存在)不连续依赖于数据.为了求解这一问题, 必须采用某些正则化技巧. 该文给出了一种最优滤波方法, 使得问题的真实解和近似解之间的误差估计达到了Hölder型最优. 同时还证明了问题的解在x=0处的收敛性.     

基于辛格式的深度哈密尔顿神经网络

HNN是一类基于物理先验学习哈密尔顿系统的神经网络.本文通过误差分析解释使用不同积分器作为超参数对HNN的影响.如果我们把网络目标定义为在任意训练集上损失为零的映射,那么传统的积分器无法保证HNN存在网络目标.我们引进反修正方程,并严格证明基于辛格式的HNN具有网络目标,且它与原哈密尔顿量之差依赖于数值格式的精度.数值实验表明,由辛HNN得到的哈密尔顿系统的相流不能精确保持原哈密尔顿量,但保持网络目标;网络目标在训练集、测试集上的损失远小于原哈密尔顿量的损失;在预测问题上辛HNN较非辛HNN具备更强大的泛化能力和更高的精度.因此,辛格式对于HNN是至关重要的.     

一类非线性Schr(o)dinger方程的非协调有限元分析

在半离散格式下研究一类带幂次非线性项的Schr(o)dinger方程的非协调矩形EQrot1元方法.直接利用插值技巧和该单元的两个特殊性质(相容误差比插值误差高一阶及其插值算子与传统的Ritz投影是一致的),给出相应的收敛性分析及误差估计.     

Aggregate error locator and error value computation in AG codes

The aggregate error locator is defined and a computation method is given. The aggregate error locator is then used in a type of Forney algorithm to compute the error values in the received words of a Ca,b algebraic geometry code.     

Euler–Goursat-like formula via Laplace–Borel duality

The Goursat formula for the hypergeometric function extends the Euler–Gauss relation to the case of logarithmic singularities.