On General Mixed Quasivariational Inequalities

In this paper, we suggest and analyze several iterative methods for solving general mixed quasivariational inequalities by using the technique of updating the solution and the auxiliary principle. It is shown that the convergence of these methods requires either the pseudomonotonicity or the partially relaxed strong monotonicity of the operator. Proofs of convergence is very simple. Our new methods differ from the existing methods for solving various classes of variational inequalities and related optimization problems. Various special cases are also discussed.     

Minimal expansions in redundant number systems: Fibonacci bases and Greedy algorithms

We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6].     

The long‐time behaviour of the thermoconvective flow in a porous medium

For the Boussinesq approximation of the equations of coupled heat and fluid flow in a porous medium we show that the corresponding system of partial differential equations possesses a global attractor. We give lower and upper bounds of the Hausdorff dimension of the attractor depending on a physical parameter of the system, namely the Rayleigh number of the flow. Numerical experiments confirm the theoretical findings and raise new questions on the structure of the solutions of the system. Copyright © 2004 John Wiley & Sons, Ltd.     

On a resolvent estimate of the Stokes equation with Neumann–Dirichlet‐type boundary condition on an infinite layer

This paper is concerned with the standard Lp estimate of solutions to the resolvent problem for the Stokes operator on an infinite layer with ‘Neumann–Dirichlet‐type’ boundary condition. Copyright © 2004 John Wiley & Sons, Ltd.     

On Optimality Condition for Vector Optimization Based on Convex Set-Valued Mapping

1.IntroductionTheoptimalityconditionsofmathematicalprogrammingisaveryimportantsubjectbecausetLeyprovideausefulanalyticaltoolforstudingthedualitytheoryandnonlinearprogrammingalgoirthms.Inrecelltyears,someauthorshavebeguntostudytheoptimalityconditionsforvectoroptimizationproblemofset-valuedmapping,suchas[4][51.Inthispaperlwedefinetheconceptofcone--weaklyefficientsubdifferentialofset-valuedmappinginthecaseofgeneralpartiallyorderedlocallyconvextopologicalvectorspaces.Thecone-weaklysubdifferential…     

Combination of mixed finite element and Dirichlet-to-Neumann methods in nonlinear plane elasticity

We study the solvability and Galerkin approximation of an exterior hyperelastic interface problem arising in plane elasticity. The weak formulation is obtained from an appropriate combination of a mixed finite element approach with a Dirichlet-to-Neumann method. The derivation of our results is based on some tools from nonlinear functional analysis and the Babuska-Brezzi theory for variational problems with constraints.     

线性常微分方程组解的特征数的估计

复数域上线性系统ｘ＝Ａ（ｔ）ｘ，当Ａ（ｔ）＝（ａｉｊ（ｔ））ｎ×ｎ具有（ｎ，Ｎ，ｒ） 差异性质且ｒｎ时，解的特征数ｊ有估计λｊ－ｌｉｍｔ→∞１ｔ∫ｔｔ０Ｒｅａｊ（τ）ｄτｎ－１ｒ＋１－ｎｌｉｍｔ→∞１ｔ∫ｔｔ０Ａ（τ）ｄτ，ｊ＝１，２，…，ｎ，其中Ａ（ｔ）＝ｍａｘ｛｜ａｉｊ（ｔ）｜：ｉ，ｊ＝１，２，…，ｎ，ｉ≠ｊ．｝     

Quadratic Functionals with General Boundary Conditions

The purpose of this paper is to give the Reid ``Roundabout Theorem' for quadratic functionals with general boundary conditions. In particular, we describe the so-called coupled point and regularity condition introduced in [16] in terms of Riccati equation solutions. Accepted 27 February 1996     

A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T,M,S)-Nets of Low Strength

The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.     

激光调Q CAI

从激光调Q速率方程出发,分析推导了激光调Q过程中,腔内光子数与工作物质内反转粒子数间的关系.再根据激光调Q的过程中,对腔Q值控制方式不同,将激光调Q技术分为:转镜调Q、声光调Q、电光调Q、饱和吸收调Q和脉冲透射式调Q.用C语言进行了激光调Q CAI软件的开发研制,获得了将文学、图形、动画和计算融为一体的,直观而生动地将调Q的理论和过程再现于屏幕的CAI课件.介绍了课件的内容、结构及其特点.