Asymptotic Correction of More Sturm–Liouville Eigenvalue Estimates

The asymptotic correction technique of Paine, de Hoog and Anderssen can dramatically improve the accuracy of finite difference or finite element eigenvalues at negligible extra cost if closed form expressions are available for the errors in a simpler related problem. This paper gives closed form expressions for the errors in the eigenvalues of certain Sturm–Liouville problems obtained by various methods, thereby increasing the range of problems for which asymptotic correction can achieve maximum efficiency. It also investigates implementation of the method for more general problems.     

Asymptotic Methods Applied to Contact Problems

Asymptotic methods for contact problems are expounded. Some typical integral equations are considered     

Balanced contributions for TU games with awards and applications

Calleja et al. [Calleja, P., Borm, P., Hendrickx, R., 2005. Multi-issue allocation situations. European Journal of Operational Research 164, 730–747] introduced multi-issue allocation situations with awards. In this paper, we extend the classical model of cooperative games with transferable utility to the cooperative games with transferable utility and awards. We define a run-to-the-bank rule for cooperative games with transferable utility and awards and characterise it in terms of a property of balanced contributions. We apply our main result to bankruptcy problems and multi-issue allocation situations with awards.     

关于《一类奇异边值问题的正解》的注记

文[4]通过构造反例断言文[1]中定理的必要性证明有误,本文首先指出文[4] 的这个断言不正确,然后对文[4]中定理2.1作了本质性的改进.     

Constraint incorporation in optimization

Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations) cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods, barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework relies on addition and chain rules for constraint incorporation which we develop here.     

An exponentially fitted special second-order finite difference method for solving singular perturbation problems

An exponentially fitted special second-order finite difference method is presented for solving singularly perturbed two-point boundary value problems with the boundary layer at one end (left or right) point. A fitting factor is introduced in a tri-diagonal finite difference scheme and is obtained from the theory of singular perturbations. Thomas Algorithm is used to solve the system and its stability is investigated. To demonstrate the applicability of the method, we have solved several linear and non-linear problems. From the results, it is observed that the present method approximates the exact solution very well.     

Separable anisotropic differential operators and applications

The nonlocal boundary value problems for anisotropic partial differential-operator equations with a dependent coefficients are studied. The principal parts of the appropriate generated differential operators are nonself-adjoint. Several conditions for the maximal regularity and the fredholmness in Banach-valued Lp-spaces of these problems are given. These results permit us to establish that the inverse of corresponding differential operators belongs to Schatten q-class. Some spectral properties of the operators are investigated. In applications, the nonlocal BVP's for quasielliptic partial differential equations and for systems of quasielliptic equations on cylindrical domain are studied.     

Field-of-values analysis of preconditioned iterative methods for nonsymmetric elliptic problems

Summary. The convergence rate of Krylov subspace methods for the solution of nonsymmetric systems of linear equations, such as GMRES or FOM, is studied. Bounds on the convergence rate are presented which are based on the smallest real part of the field of values of the coefficient matrix and of its inverse. Estimates for these quantities are available during the iteration from the underlying Arnoldi process. It is shown how these bounds can be used to study the convergence properties, in particular, the dependence on the mesh-size and on the size of the skew-symmetric part, for preconditioners for finite element discretizations of nonsymmetric elliptic boundary value problems. This is illustrated for the hierarchical basis and multilevel preconditioners which constitute popular preconditioning strategies for such problems. Received May 3, 1996