On the solution of Maxwell's equations in polygonal domains

This paper is concerned with the structure of the singular and regular parts of the solution of time‐harmonic Maxwell's equations in polygonal plane domains and their effective numerical treatment. The asymptotic behaviour of the solution near corner points of the domain is studied by means of discrete Fourier transformation and it is proved that the solution of the boundary value problem does not belong locally to H² when the boundary of the domain has non‐acute angles. A splitting of the solution into a regular part belonging to the space H², and an explicitly described singular part is presented. For the numerical treatment of the boundary value problem, we propose a finite element discretization which combines local mesh grading and the singular field methods and derive a priori error estimates that show optimal convergence as known for the classical finite element method for problems with regular solutions. Copyright © 2006 John Wiley & Sons, Ltd.     

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.     

Classes polaires associées aux distributions holomorphes de sous-espaces tangents*

Résumé. Nous définissons des classes polaires associées à une distribution holomorphe singulière de sous-espaces tangents d’une variété projective lisse. Nous prouvons que ces classes polaires peuvent être calculées en fonction des classes de Chern-Mather du faisceau tangent de la distribution et réciproquement. Nous utilisons leurs degrés pour borner les degrés de certaines classes polaires associés à une variété invariante. *Ce travail a été soutenu par l’Accord de Coopération France-Brésil (CNRS/CNPq) et par la Fondation CAPES-Brésil.     

Studies on calcium‐containing poly(urethane ether)s

The calcium salt of mono(hydroxyethoxyethyl)phthalate [Ca(HEEP)₂] was synthesized by the reaction of diethylene glycol, phthalic anhydride, and calcium acetate. Calcium‐containing poly(urethane ether)s (PUEs) were synthesized by the reaction of hexamethylene diisocyanate (HMDI) or tolylene 2,4‐diisocyanate (TDI) with a mixture of Ca(HEEP)₂ and poly(ethylene glycol) (PEG₃₀₀ or PEG₄₀₀) with di‐n‐butyltin dilaurate as a catalyst. A series of calcium‐containing PUEs of different compositions were synthesized with Ca(HEEP)₂/PEG₃₀₀ (or PEG₄₀₀)/diisocyanate (HMDI or TDI) molar ratios of 2:2:4, 3:1:4, and 1:3:4 so that the coating properties of the PUEs could be studied. Blank PUEs without calcium‐containing ionic diols were also prepared by the reaction of PEG₃₀₀ or PEG₄₀₀ with HMDI or TDI. The PUEs were well characterized by Fourier transform infrared, ¹H and ¹³C NMR, solid‐state cross‐polarity/magic‐angle‐spinning ¹³C NMR, viscosity, solubility, and X‐ray diffraction studies. The thermal properties of the polymers were also studied with thermogravimetric analysis and differential scanning calorimetry. The PUEs were applied as top coats on acrylic‐coated leather, and their physicomechanical properties were also studied. The coating properties of PUEs, such as the tensile strength, elongation at break, tear strength, water vapor permeability, flexing endurance, cold crack resistance, abrasion resistance, color fastness, and adhesive strength, were better than the standard values. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 2865–2878, 2003     

Pearson-χ~2距离的若干性质

本文对数理统计中常用的 Pearson- χ2距离的分析特性进行了讨论 ,得到了这一距离的一些解析性质 ,最后我们还给出了几个常用距离的关系 .     

An approximate proximal-extragradient type method for monotone variational inequalities

Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method.     

CONSTRUCTION OF SOME KIESSWETTER-LIKE FUNCTIONS-THE CONTINUOUS BUT NON-DIFFERENTIABLE FUNCTION DEFINED BY QUINARY DECIMAL

In this paper, we construct some continuous but non-differentiable functions defined by quinary decimal, that are Kiesswetter-like functions. We discuss their properties, then investigate the Hausdorff dimensions of graphs of these functions and give a detailed proof.     

带有单模糊映射的一般变分不等式解的存在性

众所周知，在各种变分不等式问题中，解的存在性是最基础也是最重要的问题之一．本文的目的是在Hilbert空间中研究带有单模糊映射的一般变分不等式解的存在性．此外，还讨论了几种特殊情况．     

On quasi-solution to infeasible linear complementarity problem obtained by Lemke’s method

For a linear complementarity problem with inconsistent system of constraints a notion of quasi-solution of Tschebyshev type is introduced. It’s shown that this solution can be obtained automatically by Lemke’s method if the constraint matrix of the original problem is copositive plus or belongs to the intersection of matrix classes P ₀ and Q ₀.