《标准正交基的一种求法》的注记

贵刊1991年第3期《标准正交基的一种求法》一文,给出用矩阵的合同变换把R~n的一个基{α_1.α_2,…,α_n}化为标准正交基{β_1,β_2,…,β_n}的一种方法。这种方法是以向量α_1的分量作为第i列(i=1,2,…,n)作出矩阵A,A′A是一个n阶正定矩阵,所以存在n阶可逆矩阵T     

线性规划消耗系数矩阵灵敏度分析的某些探讨

讨论了线性规划模型中 ,消耗系数矩阵 A中某个基变量或某个约束方程的系数向量变化以及增减约束方程时 ,对最优基、最优解、目标函数值和影子价格的影响 .     

Woods定理的正确性

本文重新给出 Woods定理的证明 ,证明了 Woods定理是成立的 ,因此认为该定理不成立的论断是不正确的 .此外 ,还给出了投入产出模型中投入系数矩阵 A各元素有变化时各部门完全需要系数 (即 L eontief逆矩阵 B各列 )增长率相同或按指定速率增长的充分必要条件 ,以及 A中仅一行 (列 )变化时各部门产出乘数(总产出 )按指定速率增长的充分必要条件 .     

对《求标准正交基的技巧》一文的两点意见

对《求标准正交基的技巧》一文的两点意见徐彦明（山东临沂教育学院２７６００１）《求标准正交基的技巧》一文（本刊１９９７年第３期，以下简称《技巧》）给出了利用矩阵的列初等变换由ｎ元列向量空间Ｒｎ的任意一个基α１，α２，…，αｎ求出一个标准正交基的方法步骤...     

零化多项式的一个应用

利用矩阵的零化多项式 ,给出计算标准基解矩阵 e At的一个公式 .利用向量关于矩阵的零化多项式 ,给出常系数齐次线性微分方程组初值问题的一个求解公式 .相应地 ,可以推出常系数齐次线性差分方程组在给定的初始条件下的一个求解公式 .     

基于向量变换的DGM(1,1,k~α)模型的病态性

系数矩阵谱条件数是度量灰色预测模型病态性的重要工具,而向量的数乘变换和旋转变换是降低系数矩阵谱条件数的有效方法.首先,利用向量的数乘变换和旋转变换研究DGM(1,1,k~α)模型的病态性,结果显示,DGM(1,1,k~α)模型的病态性主要受系数矩阵列向量的长度之比、夹角大小及时间幂的影响;其次,给出了基于向量变换的DGM(1,1,k~α)模型病态性的解决步骤;最后,通过一个算例验证了向量变换在解决矩阵病态性问题时的有效性和实用性.     

线性方程组求解与向量组规范化的初等变换方法

本通过对线性方程组的系数矩阵的行与列的初等变换给出了求解线性方程组的方法，并通过对矩阵的初等变换给出了向量组正化的方法。     

(0,1)-矩阵类(?)(R,S)

我们把元素全部是1或0的矩阵称为(0,1)-矩阵。设A是一个m×n阶(0,1)-矩阵,其第ⅰ行全部元素之和为r_i(1≤i≤m),第j列全部元素之和为s_j(1≤j≤n)。那么称向量R=(r_1,r_2,…,r_m)为A的行和向量;S=(s_1,s_2,…,s_n)为A的列和向量。所谓具有行和向量R,列和向量S的(0,1)-矩阵类(R,S)是指:     

线形分式规划消耗系数矩阵灵敏度分析及应用

基于解非线形规划的凸单纯形法,对一类线形分式规划的消耗系数矩阵进行灵敏度分析.求出使最优解或最优基保持最优的消耗系数矩阵中列向量和行向量的可变范围.并进行了应用计算.     

模糊线性系统的扰动分析

使用谱范数分析了模糊线性系统在三种情形下的扰动: (1)右端模糊向量有扰动, 系数矩阵不变; (2)系数矩阵有扰动,右端模糊向量不变; (3)系数矩阵和右端模糊向量都有扰动,并通过数值实例验证给出的扰动界的估计.     

Generalized marginal homogeneity model and its relation to marginal equimoments for square contingency tables with ordered categories

For square contingency tables with ordered categories, Tomizawa (Calcutta Stat Assoc Bull 43:123–125, 1993a; Sankhyā Ser B 60:293–300, 1998) gave theorems that the marginal homogeneity (MH) model is equivalent to certain two or three models holding simultaneously. This paper proposes a generalized MH model, which describes a structure of the odds that an observation will fall in row category i or below and column category i + 1 or above, instead of in column category i or below and row category i + 1 or above. In addition, this paper gives the theorems that the MH model is equivalent to the generalized MH model and some models holding simultaneously whose each indicates: (1) the equality of m-order moment of row and column variables, (2) the equality of skewness of them and (3) the equality of kurtosis of them. When the MH model fits the data poorly, these may be useful for seeing the reason for the poor fit; for instance, the poor fit of the MH model is caused by the poor fit of the equality of row and column means rather than the generalized MH model. Examples are given.     

混水平列扩充设计的均匀性

在许多工业应用中,通常分步应用跟随设计来考察输入(因子)和产出(响应)间的关系.在许多跟随设计中,在跟随阶段可以加入一些另外的两水平或三水平因子,因为它们在初始阶段可能被忽略但又十分重要.文章在均匀性准则下,提出了中心化L2-偏差意义下的混水平列扩充均匀设计,给出了列扩充设计在中心化L2-偏差下的解析表达式及相应的下界,其可作为搜索均匀设计的基准.进一步,具有一个附加区组因子的列扩充设计是均匀的当且仅当未加区组因子时的列扩充设计是均匀的.     

Matrix pencils completion problems

In this paper we give a partial solution to the challenge problem posed by Loiseau et al. in [J. Loiseau, S. Mondié, I. Zaballa, P. Zagalak, Assigning the Kronecker invariants of a matrix pencil by row or column completion, Linear Algebra Appl. 278 (1998) 327-336], i.e. we assign the Kronecker invariants of a matrix pencil obtained by row or column completion. We have solved this problem over arbitrary fields.     

On cofactor expansion of determinants of Boolean matrices

We give necessary and sufficient conditions for cofactor expansibility of determinants along a row or column for Boolean square matrices over an arbitrary Boolean algebra. First of all we define a natural decomposition of an arbitrary Boolean matrix by interior, exterior, and determinate parts. The introduced notions allow us to establish the main result of this paper. It is shown that the formulas of the cofactor expansion along a row (column) of determinants of an arbitrary square Boolean matrix hold if and only if the formulas of the cofactor expansion along the corresponding row (column) hold for determinants of its interior part. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 13, No. 4, pp. 199–223, 2007.     

QR factorization for row or column symmetric matrix

The problem of fast computing the QR factorization of row or column symmetric matrix is considered. We address two new algorithms based on a correspondence of Q and R matrices between the row or column symmetric matrix and its mother matrix. Theoretical analysis and numerical evidence show that, for a class of row or column symmetric matrices, the QR factorization using the mother matrix rather than the row or column symmetric matrix per se can save dramatically the CPU time and memory without loss of any numerical precision.     

Conditional Inference on Tables With Structural Zeros

We develop a set of sequential importance sampling (SIS) strategies for sampling nearly uniformly from two-way zero-one or contingency tables with fixed marginal sums and a given set of structural zeros. The SIS procedure samples tables column by column or cell by cell by using appropriate proposal distributions, and enables us to approximate closely the null distributions of a number of test statistics involved in such tables. When structural zeros are on the diagonal or follow certain patterns, more efficient SIS algorithms are developed which guarantee that every generated table is valid. Examples show that our methods can be applied to make conditional inference on zero-one and contingency tables, and are more efficient than other existing Monte Carlo algorithms.     

Constructing integral matrices with given line sums

D. Gale, in 1957 and H.J. Ryser, in 1963, independently proved the famous Gale–Ryser theorem on the existence of (0, 1)–matrices with prescribed row and column sums. Around the same time, in 1968, Mirsky solved the more general problem of finding conditions for the existence of a nonnegative integral matrix with entries less than or equal to p and prescribed row and column sums. Using the results of Mirsky, Brualdi shows that a modified version of the domination condition of Gale–Ryser is still necessary and sufficient for the existence of a matrix under the same constraints. In this article we prove another extension of Gale–Ryser’s domination condition. Furthermore we present a method to build nonnegative integral matrices with entries less than or equal to p and prescribed row and column sums.     

Multiple Linear Curve Fitting

A technique for fitting a linear expression to data with errorsin all or any of the variables is described. The form of theerrors is restricted to the product of a row (data set) anda column (variable) error value. This form covers many practicalcases and allows the development of an efficient algorithm.     

Optimal design of multi-purpose structures

The paper presents the optimal (maximum transverse stiffness) design of an elastic, simply supported member of given volume that is to serve as a beam or as a column at different times during its design life. The optimal design can be interpreted in two ways. It is the design that has the maximum Euler buckling load in column action, subject to a prescribed maximum deflection in beam action under a uniformly distributed load; it is also the design that has the least deflection at midspan under a uniformly distributed load, subject to a lower limit on its buckling load in column action. The effectiveness of the optimal design is judged by comparing it with a prismatic bar of the same volume.The author is grateful to Professor W. Prager for suggesting several improvements to an earlier version of the paper.     

A column generation approach for determining optimal fleet mix,schedules, and transshipment facility locations for a vessel transportation problem

This paper presents a column generation approach for a storage replenishment transportation-scheduling problem. The problem is concerned with determining an optimal combination of multiple-vessel schedules to transport a product from multiple sources to different destinations based on demand and storage information at the destinations, along with cost-effective optimal strategic locations for temporary transshipment storage facilities. Such problems are faced by oil/trucking companies that own a fleet of vessels (oil tankers or trucks) and have the option of chartering additional vessels to transport a product (crude oil or gasoline) to customers (storage facilities or gas stations) based on agreed upon contracts. An integer-programing model that determines a minimum-cost operation of vessels based on implicitly representing feasible shipping schedules is developed in this paper. Due to the moderate number of constraints but an overwhelming number of columns in the model, a column generation approach is devised to solve the continuous relaxation of the model, which is then coordinated with a sequential fixing heuristic in order to solve the discrete problem. Computational results are presented for a range of test problems to demonstrate the efficacy of the proposed approach.