求解线性矩问题的一个修正方法

1．引言许多问题都可化为线性矩问题的求解,最典型的例子就是求解第一类线性积分方程的配置法．第一类算子方程在不同国数空间的离散化得到不同形式的线性矩问题．1968年,地质学家GBackusandFGilbert给出了一种求解线性矩问题的方法,用来求解地球物理反问题,后来称之为B－G方法,山从理论上严格论证了其收敛性．问给出了一种求解线形矩问题的光顺方法,门讨论了再生核空间的rG方法,并将其用于信号处理．以上方法的核心思想是在某类函数空间寻求对利一函数的逼近,从而得到线性矩问题的近似解．本交给出了一种求解线性矩问题的修正方…     

关于一个次线性逼近定理的新证法

Ｄｅｍｙａｎｏｖ和Ｒｕｂｉｎｏｖ在［１］中给出了一个次线性逼近定理．本文对该定理的证明进行了修正．     

线性过程的强逼近

该文对由独立同分布随机变量序列所生成的线性过程建立了泛函重对数律和用Wiener过程对线性过程的强逼近结果.     

线性流形上的矩阵最佳逼近

令Ｓ＝｛Ａ∈Ｒｎ×ｍ｜ｆ１（Ａ）＝‖ＡＸ１－Ｚ１‖２＋‖ＹＴ１Ａ－ＷＴ１‖２＝ｍｉｎ｝，其中Ｘ１∈Ｒｍ×ｋ１，Ｚ１∈Ｒｎ×ｋ１，Ｙ１∈Ｒｎ×１１和Ｗ１∈Ｒｍ×１１均为给定的矩阵，‖·‖是Ｆｒｏｂｅｎｉｕｓ范数。本文考虑如下问题：问题Ⅰ给定Ｘ２∈Ｒｍ×ｋ２，Ｚ２∈Ｒｎ×ｋ２，Ｙ２∈Ｒｎ×ｌ２，Ｗ２∈Ｒｍ×ｌ２，求Ａ∈Ｓ，使得ｆ２（Ａ）＝‖ＡＸ２－Ｚ２‖２＋‖ＹＴ２Ａ－ＷＴ２‖２＝ｍｉｎ．问题Ⅱ给定Ａ∈Ｒｎ×ｍ，求Ａ∈ＳＡ，使得‖Ａ－Ａ‖＝ｉｎｆＡ∈ＳＡ‖Ａ－Ａ‖，其中ＳＡ是问题Ｉ的解集合。本文给出问题Ｉ解集合ＳＡ的通式和问题Ⅱ的解Ａ的表达式，提出了求解问题Ⅰ与Ⅱ的数值方法。许多文献的结果都是本文结果的特例。     

线性算子σ（L^∞,L^1）逼近的Korovkin定理

本文给出并证明了拓扑σ（Ｌ＾∞，Ｌ＾１）下线性算子逼近Ｌ＾∞函数的Ｋｏｒｏｖｋｉｎ定理。     

线性流形上的两类矩阵最佳逼近问题

1．引言设R”””表示所有实mxn阶矩阵的全体，OR”””表示所有n阶正交阵的全体，对于A＝（ail）eR”””，B＝（b；j）eRP”’，用A＠BeR’”“”’表示矩阵A与B的Kronecker积，用A二（all，ala，…，al。，aal，…aa。，…；a＿l，…，a＿＊“表m矩阵A拉直算子，l］·IF表示矩阵的Frobenius范数，11·11。表示向量的2一范数．设S＝｛X，X6R”””f（X）二llAIXBI—Dlll》＋IIAZXBZ—D。股一Zill｝其中AlER”X”，BIERPXq，DIER”XqAZERtX”BZERPXIDZERtXI考虑下列两类问题：问题I．给定CIERll“”．FIE…     

分段线性神经网络的逼近理论

随着分段线性函数的广泛应用,本文尝试研究浅层和深层的分段线性神经网络的逼近理论.作者将应用于三层感知机模型的万能逼近定理拓展到分段线性神经网络中,并给出与隐藏神经元个数相关的逼近误差估计.利用分段线性函数构造锯齿函数的显式方法,证明解析函数可以通过分段线性神经网络的深度堆叠以指数速率逼近,并辅以相应的数值实验.     

线性流形上中心对称矩阵的最佳逼近

1 引 言令Rn×m表示所有n×m阶实矩阵集合;ORn×n表示所有n×n阶正交矩阵之集;A+表示矩阵A的Moore-Penrose广义逆;Iκ表示κ阶单位阵;||·||表示矩阵的Frobenius范数;rank（A）表示矩阵A的秩.设ei为n阶单位矩阵In的第i列（i=1,2,…,n）,记Sn=（en,en-1,…,e1）,易知     

带有线性惩罚的鲁棒k-种产品设施选址问题的近似算法

$k$-种产品设施选址问题是指存在一组客户和一组可以建设设施的地址。现有$k$种不同的产品,每一客户均需要$k$种不同的产品,且每一设施最多只能生产一种产品。问题的要求是从若干地址中选择一组地址来建立设施,对所要建立的设施指定其生产的产品,并为每一个客户提供一组指派确保每一客户都有$k$个设施来为其提供$k$种不同的产品,使得设施建设费用与运输费用之和最小。对于$k$-种产品设施选址问题,我们通常简写为$k$-PUFLP,其中,当所有设施建设费用为0时,记为$k$-PUFLPN。本文对$k$-PUFLPN进行线性舍入,通过分析最优分数解特殊结构,当$k\geq 3$时分析算法将$k$-PUFLPN的近似比从$\frac{3k}{2}-1$提升到了$\frac{3k}{2}-\frac{3}{2}$。鲁棒$k$-种产品设施选址问题是指在该问题中,最多有$q$个客户可以不被服务。我们首次对无容量限制下建设费用为0时的鲁棒$k$-种产品选址问题建立模型,当$k\geq 3$,得到了$\frac{3k}{2}-\frac{3}{2}$近似算法。对顾客伴有线性惩罚的鲁棒$k$-种产品设施选址问题,本文同时考虑异常值与惩罚性,利用$k$-PUFLPN中最优整数解与最优分数解的关系,得到了$\frac{3k}{2}-\frac{3}{2}$近似算法。     

Stability of the linear inequality method for rational Chebyshev approximation

The linear inequality method is an algorithm for discrete Chebyshev approximation by generalized rationals. Stability of the method with respect to uniform convergence is studied. Analytically, the method appears superior to all others in reliability.     

A new algorithm for the solution of the linear minimax approximation problem

This paper introduces an efficient approach to the solution of the linear mini-max approximation problem. The classical nonlinear minimax problem is cast into a linear formulation. The proposed optimization procedure consists of specifying first a feasible point belonging to the feasible boundary surface. Next, feasible directions of decreasing values of the objective function are determined. The algorithm proceeds iteratively and terminates when the absolute minimum value of the objective function is reached. The initial point May be selected arbitrarily or it May be optimally determined through a linear method to speed up algorithmic convergence. The algorithm was applied to a number of approximation problems and results were compared to those derived using the revised simplex method. The new algorithm is shown to speed up the problem solution by at least on order of magnitude.     

An effective linear approximation method for separable programming problems

Among the numerous applications of piecewise linearization methods include data fitting, network analysis, logistics, and statistics. In the early 1950s, a concave function was found to be able to be linearized by introducing 0-1 variables. Most textbooks in Operations Research offer such methods for expressing linear approximations. Various methods of linearization have also been developed in recent literature. Nevertheless, the transformed linear scheme has a severe shortcoming: most standard procedures for linearizing typically involve a large increase in the number of binary variables. Consequently, the gains to be derived from dealing with linear functions are quite likely to be nullified by the increase in the size of the problem.Conventional methods for linearizing a concave function with m break points require m-1 binary variables. However, when m becomes large, the computation will be very time-consuming and may cause a heavy computational burden.This study proposes an effective approach in which only ⌈log₂(m-1)⌉ binary variables are used. The proposed method has the following features: (i) it offers more convenient and efficient means of expressing a piecewise linear function; (ii) fewer 0-1 variables are used; (iii) the computational results show that the proposed method is much more efficient and faster than the conventional one, especially when the number of break points becomes large.     

关于可靠性设施布局问题的近似算法

设施布局问题的研究始于20世纪60年代,主要研究选择修建设施的位置和数量,以及与需要得到服务的城市之间的分配关系,使得设施的修建费用和设施与城市之间的连接费用之和达到最小.现实生活中, 受自然灾害、工人罢工、恐怖袭击等因素的影响,修建的设施可能会出现故障, 故连接到它的城市无法得到供应,这就直接影响到了整个系统的可靠性.针对如何以相对较小的代价换取设施布局可靠性的提升,研究人员提出了可靠性设施布局问题.参考经典设施布局问题的贪婪算法、原始对偶算法和容错性问题中分阶段分层次处理的思想,设计了可靠性设施布局问题的一个组合算法.该算法不仅在理论上具有很好的常数近似度,而且还具有运算复杂性低的优点.这对于之前的可靠性设施布局问题只有数值实验算法, 是一个很大的进步.     

Boundary element-Landweber method for the Cauchy problem in linear elasticity

In this paper, an iterative algorithm based on the Landwebermethod in combination with the boundary element method is developedfor solving the Cauchy problem in isotropic linear elasticity.An efficient regularizing stopping criterion is also employed.The numerical results obtained confirm that the iterative methodproduces a convergent and stable numerical solution with respectto increasing the number of boundary elements and decreasingthe amount of noise added into the input data, respectively.     

An approximation problem of the finite rank operator in Banach spaces

By the method of geometry of Banach spaces, we have proven that a bounded linear operator in Banach space is a compact linear one iff it can be uniformly approximated by a sequence of the finite rank bounded homogeneous operators, which reveals the essence of the counter example given by Enflo.     

关于解线性系统的一个有效的贝叶斯迭代方法

This paper concerns with the statistical methods for solving general linear systems. After a brief review of Bayesian perspective for inverse problems,a new and efficient iterative method for general linear systems from a Bayesian perspective is proposed.The convergence of this iterative method is proved,and the corresponding error analysis is studied.Finally, numerical experiments are given to support the efficiency of this iterative method,and some conclusions are obtained.     

An interior point algorithm for semi-infinite linear programming

We consider the generalization of a variant of Karmarkar's algorithm to semi-infinite programming. The extension of interior point methods to infinite-dimensional linear programming is discussed and an algorithm is derived. An implementation of the algorithm for a class of semi-infinite linear programs is described and the results of a number of test problems are given. We pay particular attention to the problem of Chebyshev approximation. Some further results are given for an implementation of the algorithm applied to a discretization of the semi-infinite linear program, and a convergence proof is given in this case.     

An approximation method for the efficiency set of multiobjective programming problems

In this paper so-called ε-approximations for the efficiency set of vector minimization problems are defined. A general generating algorithm for such E-approximations is given which will be modified for linear continuous problems by means of the Dual Simplex Method.