2×2矩阵的平方根

２×２矩阵的平方根［美］ＤＯＮＡＬＤＳＵＬＬＶＡＮ在Ｍａｃｋｉｎｎｏｎ最近的论文［１］里，叙述了求２×２矩阵平方根的四种方法．这些方法的第一个方法要求那些求平方根的矩阵是可以对角化的．后来，这个方法被Ｓｃｏｔ用来求２×２矩阵的全部平方根［２］．一个奇...     

双代数余循环的余同调变换

在［８］中,作者讨论余循环交叉积和扭积之间的关系（见定理 ５．３）．设 Ａ＃ＸＨ为余循环交叉积,ｒ∈Ｈｏｍ（Ｈ,Ａ）,是卷积可逆的,且ｒ（１）＝１．在］［６］中,Ｓ．Ｍａｊｉｄ对任意地余循环Ｘ定义了余同调变换 ｘｒ·在本文中,首先证明了［８］中的定理 ５．３以及它的对偶在一般情况下成立． Ｓ． Ｍａｊｉｄ在［５］中给出了余循环交叉积和余循环交叉余积形成双代数的充要条件,这种结构称为Ｂｉｃｒｏｓｓｐｒｏｄｕｃｔ积．这里讨论了余循环余同调变换如何具体地保持这种双代数结构．     

HORSESHOE EFFECT AND TOPOLOGICAL ENTROPYOFONE－DIMENSIONALMAPS

ＨＯＲＳＥＳＨＯＥＥＦＦＥＣＴＡＮＤＴＯＰＯＬＯＧＩＣＡＬＥＮＴＲＯＰＹＯＦＯＮＥ－ＤＩＭＥＮＳＩＯＮＡＬＭＡＰＳ＊ＸＩＬＩＦＥＮＧＡｂｓｔｒａｃｔ．Ｉｎｔｈｉｓｐａｐｅｒ，ｆｏｒａｎｙｃｏｎｔｉｎｕｏｕｓｆｕｎｃｔｉｏｎｆ：［０，１］→［０，１］，...     

修正的LMS方法

ＢｉｔｍｅａｄＲ．Ｒ和ＡｎｄｅｒｓｏｎＤ．Ｏ在文献［１］中为任意线性方程组的求解提出了一种颇为有效的算法，称为ＬＭＳ方法．文献［２］详细地论述了算法的收敛性，指出收敛极限是方程组的最小二乘解．本文为使解线性方程组的ＬＭＳ算法具有更广泛、更方便的应用性．对文献［２］中的ＬＭＳ算法作了修正．理论和实践证明修正后的算法是成功的．     

广义严格对角占优矩阵与非奇M矩阵的判定

１引言Ｍ矩阵是计算数学中应给极其广泛的矩阵类,它出现于经济价值模型矩阵和反网络系统分析的系数矩阵及解某类确定微分方程问题的数值解法中．由于Ｍ矩阵的重要性,讨论Ｍ矩阵及相关的广义对角占优矩阵的判定及性质有着十分重要的意义．本文则是在文［１］～［３］基础上,给出了广义严格对角占优矩阵与非奇Ｍ矩阵几则新的充分条件．拓广了文［１］～［３］的相关结果．２主要结果定义１设Ａ＝（ａｉｊ）,如果存在正对角阵Ｄ,使得ＡＤ为严格对角占优阵,则称Ａ为广义严格对角占优阵．定义２设Ａ＝,Ｍ（Ａ）＝（Ｍｉｊ）,其中,则称Ｓ…     

代数Riccati方程可稳解的条件数

１．引言 关于代数Ｒｉｃｃａｔｉ方程（ＡＲＥ）的研究是大量的．从数值角度看,有关数值方法,扰动理论的研究已比较深入．而关于条件数理论的研究则还不多［３］,［６］． Ｒｙｅｒｓ［１］研究了时连续代数 Ｒｉｃｃａｔｉ方程可稳解的条件数; Ｋｅｎｎｅｙ和 Ｈｅｗｅｒ［３］讨论了时连续代数 Ｒｉｃｃａｔｉ方程（以下简称 ＣＴＡＲＥ）可稳解的敏度分析,给出了一阶扰动界,引进了条件数; Ｓｕｎ［６］从最佳向后扰动理论角度研究了时离散代数Ｒｉｃｃａｔｉ方程（以下简称ＤＴＡＲＥ）可稳解的条件数;徐树方［８］针对 ＣＴＡ…     

Variational Inclusions for Fuzzy Mappings

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＳｉｄｄｉｑｉａｎｄＡｎｓａｒｉ［４］ｄｅｖｅｌｏｐｅｄｉｔｅｒａｔｉｖｅａｌｇｏｒｉｔｈｍｓｆｏｒｆｉｎｄｉｎｇａｐｐｒｏｘｉｍａｔｅｓｏｌｕｔｉｏｎｔｏｎｅｗｃｌａｓｓｅｓｏｆｑｕａｓｉｖａｒｉａｔｉｏｎａｌｉｎｅｑｕａｌｉｔｉｅｓｉｎＨｉｌｂｅｒｔｓｐａｃｅｓ，ＨａｓｓｏｕｎｉａｎｄＭｏｕｄａｆｉ［１］ｅｘｔｅｎｄｔｈｅｍａｉｎｉｄｅａｓｏｆｐａｐｅｒ［４］ｔｏｍｏｒｅｇｅｎｅｒａｌｃａｓｅｓ，ｗｈｉｃｈｃｏｎｓｉｄｅｒｅｄａｃｌａｓｓｏｆｖａｒｉａｔｉｏｎ…     

有理样条不可约解的行列式表示

１引言在文［１］中,对于剖分ａ＝ｘ０＜ｘ１＜…＜ｍｎ＝ｂ及给定的ｙ０,ｙ１,…,　…,Ｌ＋Ｍ－１,我们构造了有理样条Ｓ［Ｌ,Ｍ（ｘ）Ｑ［Ｌ,Ｍ］为次数不超过ｍ的多项式全体．在［１］中,已经讨论了Ｓ［Ｌ,Ｍ］（ｘ）的存在性,并指出：若问题（１）（２）（３）可解,则解唯一这里总假设问题（１）（２）（３）可解．２有理样条解不可约的充要条件由Ｓ［Ｌ,Ｍ］（ｘ）的依区间递推算法（见［１］）,我们只需讨论［ｘ０,ｘ１］上的情形．当［Ｘ０,ｘ１］时,将Ｓ［Ｌ,Ｍ］　（ｘ）,Ｐ［Ｌ,Ｍ］　（ｘ）和Ｑ［Ｌ,Ｍ］（…     

可压缩格子Boltzmann模型的启示性稳定理论

１引言格子Ｂｏｌｔｚｍａｎｎ方法（ＬＢＭ）是近几年发展起来的一种模拟复杂系统的新方法［１］［２］［３］这种方法已经在流体力学各领域得到应用．最近,许多研究工作集中于用ＬＢＭ模型计算可压缩流体流动．Ａｌｅｘａｎｄｅｒ和Ｃｈｅｎ等［４］提出了可以计算激波的等温模型,模型中的音速是可以选择的．Ｑｉａｎ和Ｏｒｓｚａｇ［５］分析了ＬＢＧＫ模型在可压缩区域内的非线性偏差,给出了激波结构的ＬＢＭ结果．Ｑｉａｎ和Ｏｒｓｚａｇ［６］也计算了弱可压缩的高Ｒｅ数问题,并用于计算Ｋｏｌ－ｍｏｇｏｒｏｖ流．Ａｎｃｏｎａ［…     

关于一类自由作业机器排序问题

文章研究文［１］中提出的加工时间依赖于机器的自由作业排序问题。Ｍ．Ｄｏｒｏｒ在［１］中提出了一个算法（算法３．４）。最近，Ａ．Ｊ．Ｖａｋｈａｒｉａ、Ｂ．Ｃａｔａｙ［２］及项思明、唐国春［３］均指出Ｍ．Ｄｏｒｏｒ的算法不是最优的。项思明和唐国春提出对这类问题在机器连续加工情形下的一种求解方法，即将排序问题化成指派问题。本文对这种解法作了简化，并回答文［３］中提出的几个问题。     

Objective function approximations in mathematical programming

Mathematical programming applications often require an objective function to be approximated by one of simpler form so that an available computational approach can be used. An a priori bound is derived on the amount of error (suitably defined) which such an approximation can induce. This leads to a natural criterion for selecting the best approximation from any given class. We show that this criterion is equivalent for all practical purposes to the familiar Chebyshev approximation criterion. This gains access to the rich legacy on Chebyshev approximation techniques, to which we add some new methods for cases of particular interest in mathematical programming. Some results relating to post-computational bounds are also obtained.This paper was partially supported by the National Science Foundation and by the Office of Naval Research, and was the basis for a plenary lecture delivered at the IX International Symposium on Mathematical Programming in Budapest, Hungary, August 1976.     

A Note on Redundancy and Linear Parametric Programming

A simple redundancy criterion for a system of linear inequalities is given. Considering a linear programming problem with linear inequality constraints the sensitivity analysis of the optimal solution of the right-hand side in combination with the redundancy criterion can help to identify redundant inequalities (constraints). The redundancy criterion is applied to a linear parametric problem which is enlarged by an auxiliary condition such as "stop the parametric procedure when a chosen constraint becomes redundant".     

Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness

This paper studies a hierarchical optimization problem on an unbounded parallel-batching machine, in which two objective functions are maximum lateness induced by two sets of due dates, representing different purposes of two decision-makers. By a hierarchical optimization problem, we mean the problem of optimizing the secondary criterion under the constraint that the primary criterion is optimized. A parallel-batching machine is a machine that can handle several jobs in a batch in which all jobs start and complete respectively at the same time. We present an \(O(n\log P)\)-time algorithm and an \(O(n^3)\)-time algorithm for this hierarchical scheduling problem, where P is the total processing time of all jobs.     

Recurrence properties of hypercyclic operators

We generalize the notions of hypercyclic operators, \(\mathfrak {U}\)-frequently hypercyclic operators and frequently hypercyclic operators by introducing a new concept in linear dynamics, namely \(\mathcal {A}\)-hypercyclicity. We then state an \(\mathcal {A}\)-hypercyclicity criterion, inspired by the hypercyclicity criterion and the frequent hypercyclicity criterion, and we show that this criterion characterizes the \(\mathcal {A}\)-hypercyclicity for weighted shifts. We also investigate which density properties can the sets \({N(x, U)=\{n\in \mathbb {N}\ ; \ T^nx\in U\}}\) have for a given hypercyclic operator, and we study the new notion of reiteratively hypercyclic operators.     

The Problem of Eigenvalue on Noncompact Complete Riemannian Manifold

Let M be an n-dimensional noncompact complete Riemannian manifold, "Δ" is the Laplacian of M. It is a negative selfadjoint operator in L²(M). First, we give a criterion of non-existence of eigenvalue by the heat kernel. Applying the criterion yields that the Laplacian on noncompact constant curvature space form has no eigenvalue. Then, we give a geometric condition of M under which the Laplacian of M has eigenvalues. It implies that changing the metric on a compact domain of constant negative curvature space form may yield eigenvalues.     

<Emphasis Type="Italic">S</Emphasis>-units in hyperelliptic fields and periodicity of continued fractions

Given a polynomial f of odd degree, the nontrivial S-units can be effectively related to the continued fraction expansions of the elements associated with \(\sqrt f \) only in the case where S contains an infinite valuation and a finite valuation determined by first-degree polynomial. A quasi-periodicity criterion for any element of the field of formal power series in a first-degree polynomial is obtained. For key elements, a more accurate criterion is found. The criterion is used to show that, for S specified above, in the presence of a nontrivial S-unit, the expansion of \(\sqrt f \) can be both nonperiodic and periodic. Estimates relating the quasi-period to the degree of the fundamental S-unit are obtained. Examples in which the bounds of these estimates are attained are given.     

Robustness and Optimality as Criteria for Strategic Decisions

The use of "optimality" as an operational research criterion is insufficiently discriminating. Ample evidence exists that for many problems simple optimization (particularly profit maximization) does not represent the aims of management. In this paper we discuss the nature of the problem situations for which alternative decision criteria are more appropriate. In particular the structure of strategic planning problems is analysed. The provisional commitment involved in a plan (in contrast to the irrevocable commitment of a decision) leads to the development of a particular criterion, robustness—a measure of the flexibility which an initial decision of a plan maintains for achieving near-optimal states in conditions of uncertainty. The robustness concept is developed through the case study of a sequential factory location problem.     

Geometry of Multiplicity-Free Representations of GL(n), Visible Actions on Flag Varieties, and Triunity

We analyze the criterion of the multiplicity-free theorem of representations [5, 6] and explain its generalization. The criterion is given by means of geometric conditions on an equivariant holomorphic vector bundle, namely, the visibility of the action on a base space and the multiplicity-free property on a fiber.Then, several finite-dimensional examples are presented to illustrate the general multiplicity-free theorem, in particular, explaining that three multiplicity-free results stem readily from a single geometry in our framework. Furthermore, we prove that an elementary geometric result on Grassmann varieties and a small number of multiplicity-free results give rise to all the cases of multiplicity-free tensor product representations of GL(n,C), for which Stembridge [12] has recently classified by completely different and combinatorial methods.     

Optimal Criterion Weights in Repetitive Multicriteria Decision-Making

In repetitive judgmental discrete decision-making with multiple criteria, the decision maker usually behaves as if there is a set of appropriate criterion weights such that the decisions chosen are based on the weighted sum of all the criteria. Many different procedures for estimating these implied criterion weights have been proposed. Most of these procedures emphasize the preference trade-off among the multiple criteria of the decision maker, and thus the criterion weights obtained are not directly related to the hit ratio of matching decisions. Based on past data, statistical discriminant analysis can be used to determine the implied criterion weights that would reflect the past decisions. The most interesting performance measure is the hit ratio. In this work, we use the integer linear goal-programming technique to determine optimal criterion weights which minimize the number of misclassification of decisions. The linear goal-programming formulation has m constraints and m + k + 1 variables, where m is the number of cases and k is the number of criteria. Empirical study is done by using two different procedures on the actual past admission data of an M.B.A. programme. The hit ratios of the different procedures are compared.     

An Augmented Galerkin Method for First Kind Fredholm Equations

We describe an augmented Galerkin technique for the numericalsolution of first kind Fredholm equations, which is simple touse and which has the considerable advantage of providing acheaply computed numerical criterion for the existence of asolution of the equations under study. The method has guaranteedstability, and leads to a standard linear programming problem(when posed in the l₁ or l norms). It is much faster than themethod recommended in a recent review by Lewis (1975); numericalcomparisons indicate that it achieves comparable accuracy. Theexistence criterion also appears effective in practice.