利用函数的映射意义解惑

在函数f:A→B的定义中,“对于集合A 中的每一个x,在集合B中都有唯一确定的值 f(x)与x对应”这句话还蕴含了一个重要的“对应”意义:f(x)为定义域A中的x在f作用下所对应的函数值,且f(x)若存在,则x必属于定义域A．利用这一对应意义,可帮助我们理解很多重要的函数问题．     

半导体物理中的一个两点边值问题

本文研究了半导体流的表面张力进行区域提纯问题中提出的两点边值问题解的存在性 ,我们用上、下解方法和 Schauder不动点定理证明了如果 Q=2 A3 Re,其中 A是表面速率 ,Re是 Reynolds数 ,则当 0 Q 1 3.2 1时 ,该问题有解 ,对最近的结果 ( 0 Q 1 2 .6 8时 ,此问题的解存在 )进行了重要的改进     

关于反循环矩阵的对角化问题

反循环矩阵是一种特殊类型的矩阵，它本身有许多重要的性质,而且与矩阵的对角化问题有联系,本文拟探讨反循环矩阵的对角化问题,以及任一n阶方阵A可对角化时，A与反循环矩阵之间的关系。     

线性流形上对称正交反对称矩阵反问题的最小二乘解

设P是n阶对称正交矩阵,如果n阶矩阵A满足AT=A和(PA)T=-PA,则称A为对称正交反对称矩阵,所有n阶对称正交反对称矩阵的全体记为SARnp.令S={A∈SARnp f(A)=‖AX-B‖=m in,X,B〗∈Rn×m本文讨论了下面两个问题问题Ⅰ给定C∈Rn×p,D∈Rp×p,求A∈S使得CTAC=D问题Ⅱ已知A~∈Rn×n,求A∧∈SE使得‖A~-A∧‖=m inA∈SE‖A~-A‖其中SE是问题Ⅰ的解集合.文中给出了问题Ⅰ有解的充要条件及其通解表达式.进而,指出了集合SE非空时,问题Ⅱ存在唯一解,并给出了解的表达式,从而得到了求解A∧的数值算法.     

线性流形上实对称半正定阵的一类反问题

1　引　　言文中记Rn×m为所有n×m阶实阵集合,SRn×n为所有n阶实对称阵集合,Pn表示所有n阶实对称半正定阵集合,A≥0表示方阵A对称半正定.A+、R(A)、N(A)分别表示矩阵A的Moore-Penrose广义逆,列空间和零空间,‖·‖表示Froblnius范数.对于Z.Y∈Rn×k,令S={A∈Pn|AZ=Y,ZTY∈PK,R(YT)=R(YTZ)}(1.1)　　现考虑如下问题:问题　给定X.B∈Rn×m,找A∈S,使得AX=B(1.2)　　问题　给定A∈Rn×n,找A∈SE,使得‖A-A‖=infA∈SE‖A-A‖(1.3)其中SE是问题的解集合.问题与具有重要的应用背景,当Y=ZΛ,Λ=diag(λ1,λ2,…     

Householder矩阵的又一特性

给出了Householder矩阵的其它若干性质,利用本文中得到的正交向量组所对应的Householder矩阵的重要性质,解决了形如A=k1H1 k2H2 … knHn(ki∈R,Hi为n阶Householder矩阵,i=1,2,…n)的实对称阵的特性值与特征向量的问题,且任一实对称矩阵A均可表示为上述形式.     

求解一类不连续的Sturm-Liouville问题

研究一类边界条件中有谱参数的不连续的Sturm-Liouville问题.首先在Hilbert空间中定义了一个自共轭的线性算子A,使得该类Sturm-Liouville问题的特征值与算子A的特征值相一致.进一步证明了算子A是自共轭的,且这类Sturm-Liouville问题特征值是解析单的.最后展示了一个具体问题的特征值以及特征函数的逼近解.     

一类极小问题解的存在性

在Luminita A.Vese文章中给出的一个重要泛函算法的基础上,讨论了此泛函的一些其它理论结论,即利用Γ-收敛的性质得到该泛函极小点存在问题,泛函的变量空间的弱＊列紧等性质.同时讨论了在图像处理中一个相关泛函的极小点存在问题.     

集合关系中蕴涵的辨证关系及其对我们的启迪

集合是近代数学的一个重要概念 ,集合元素的任意性使得集合有着深刻的内涵 ,从而使集合的思想能渗透到数学的方方面面 .高中数学主要介绍了集合的五种关系“子集、相等、交集、并集、补集” .这些关系对于解决数学问题时有一定的启迪 .在此基础上进一步深化 ,还能发现其包含着丰富的数学思想和深刻的哲学原理 .1　子集关系中的特殊和一般集合中若A B 任意x∈A都有x∈B .所以探求具有A的性质的问题 ,可以利用子集的关系在B中加以讨论 .从哲学的观点来看 ,一般中包含着特殊 ,解决了一般的问题 ,特殊问题就迎刃而解 .这是数学解题的一种重…     

一类反对称正交反对称矩阵逆特征值问题

设P为一给定的对称正交矩阵,记AARnP={A∈Rn×n‖AT=-A,(PA)T=-PA}.讨论了下列问题:问题给定X∈Cn×m,Λ=diag(λ1,λ2,…,λm).求A∈AARPn使AX=XΛ.问题设A~∈Rn×n,求A*∈SE使‖A~-A*‖=infA∈SE‖A~-A‖,其中SE为问题的解集合,‖.‖表示Frobenius范数.研究了AARPn中元素的通式,给出了问题解的一般表达式,证明了问题存在唯一逼近解A*,且得到了此解的具体表达式.     

Approximation of optimal control problems with state constraints

We study the approximation of control problems governed by elliptic partial differential equations with pointwise state constraints. For a finite dimensional approximation of the control set and for suitable perturbations of the state constraints, we prove that the corresponding sequence of discrete control problems converges to a relaxed problem. A similar analysis is carried out for problems in which the state equation is discretized by a finite element method.     

On the Inverse Problem for Robust Capture Zone Construction

An interception problem with variable velocities and variable lateral acceleration boundaries is considered. Two problems, inverse to constructing the capture zone for a given linear strategy, are formulated. In the first (weak) formulation, a linear strategy is derived forcing its capture zone to contain a given set. In the second (strong) formulation, the capture zone of such a linear strategy is forced to coincide with a given set. A step-by-step algorithm, solving these problems, is derived. This algorithm is based on a detailed differential-geometrical analysis of the capture zone boundary. Illustrative examples are presented.     

不确定性理论集对分析在海水水质富营养化评价中的应用

集对分析是处理不确定性问题的新的系统理论方法.利用该理论,建立了进行海水水质富营养化综合评价的新方法.实例研究表明,集对分析评价海水水质的富营养化程度是切实可行的,与人工神经网络方法和支持向量机方法相比,集对分析方法概念清晰,计算简便、快捷、精度高,具有较高的分辨率和较大的实用性,减少了评价过程中的人为主观因素;具有不遗失数据中间信息、评价结果与实际情况更为相符的优点,为海水环境质量综合评价提供了一种简单而适用的评价方法.     

An augmented Lagrangian fish swarm based method for global optimization

This paper presents an augmented Lagrangian methodology with a stochastic population based algorithm for solving nonlinear constrained global optimization problems. The method approximately solves a sequence of simple bound global optimization subproblems using a fish swarm intelligent algorithm. A stochastic convergence analysis of the fish swarm iterative process is included. Numerical results with a benchmark set of problems are shown, including a comparison with other stochastic-type algorithms.     

一种基于集对分析的模糊多属性决策方法

针对属性权重和决策矩阵的属性值均为梯形模糊数的模糊多属性决策问题,提出了一种基于集对分析的决策方法.方法具有如下特点:通过借鉴集对分析理论和论域三划分的思想,把梯形模糊数属性值转化成联系数的形式,能有效处理决策过程中的不确定因素;对于权重向量和决策矩阵中的梯形模糊数采取不同的处理方法;用联系数决策理论的概念来刻画备选方案与正、负理想方案组成集对的同一对立程度;基于可能势的联系数排序能够准确反映联系数间的同一对立程度,方法直观,概念明确,易于实际操作.实例计算表明,方法是求解模糊多属性决策问题的一种有效工具.     

Partial Pricing Rule Simplex Method with Deficient Basis

A new partial pricing column rule is proposed to the basis-deficiency-allowing simplex method developed by Pan.Computational results obtained with a set of small problems and a set of standard NETLIB problems show its promise of success.     

On the explicit,purely analytic solution of Von Kármán swirling viscous flow

A new analytic method for highly nonlinear problems, namely the homotopy analysis method, is applied to solve the Von Kármán swirling viscous flow, governed by a set of two fully coupled differential equations with strong nonlinearity. An explicit, purely analytic and uniformly valid solution is given, which agrees well with numerical results.     

Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions

We use surrogate analysis and constraint pairing in multidimensional knapsack problems to fix some variables to zero and to separate the rest into two groups – those that tend to be zero and those that tend to be one, in an optimal integer solution. Using an initial feasible integer solution, we generate logic cuts based on our analysis before solving the problem with branch and bound. Computational testing, including the set of problems in the OR-library and our own set of difficult problems, shows our approach helps to solve difficult problems in a reasonable amount of time and, in most cases, with a fewer number of nodes in the search tree than leading commercial software.     

On the Monotonicity of the Compromise Set in Multicriteria Problems

This paper discusses the extension of results on monotonicity of the compromise set valid for bicriteria problems to general multicriteria problems under a very general condition, which is assumable in compromise programming problems coming from economics. Mainly, the problem that we treat is the following: find and describe the compromise set when the feasible set is a convex set in the positive cone, limited by a level hypersurface of a differentiable production–transformation function. This scenario is usual in many economic applications, chiefly in production analysis.