Ackermann函数的三种计算方法

本文给出了Ａｃｋｅｒｍａｎｎ函数的若干性质和三种计算方法，满足教学和研究的需要．特别是文中的递推传值算法是计算Ａｃｋｅｒｍａｎｎ函数的有效算法之一．     

信赖域算法的修订算法

为了求得非线性优化问题的最优解,必须从收敛的可能性和收敛速度入手实现有效的计算方法.为此,通过改变作为搜索方向的下降方向,并适当修订信赖范围,在信赖域算法的基础上提出了一种修订的最优化问题的求解方法.计算方法的计算程序虽然有些复杂,但从整体收敛性和计算可行性方面来说是一个有效的方法.     

On the computation of an element of Clarke generalized Jacobian for a vector-valued max function

In this paper, we present an algorithm for calculating an element of Clarke generalized Jacobian for a vector-valued max-type function. The algorithm reduces the computational cost of an existing algorithm.     

一类微分代数系统的受控不变分布及其不变性

针对一类非线性微分代数系统,利用M导数方法,给出了受控不变分布的概念,并讨论了此类微分代数系统受控不变分布的一些性质.给出了一个计算包含在系统输出核(kerE(h))内的最大受控不变分布的算法,同时讨论了该算法的一些性质.最后,给出一个例子说明如何利用给出的算法计算微分代数系统的包含在系统输出核内的最大受控不变分布.     

考虑传输容量的通信网端到端可靠性指标算法

归一化传输容量加权通信网端到端可靠性指标,非常适合评价现代高速宽带通信网络.然而计算全过程易于在计算机上编程实现的算法尚未见到.研究出一整套可靠性指标的计算方法.由于,从路由计算、不交化网络状态集及其对应容量的求取,到最后获得可靠性指标结果等各个环节,均实现了代数化或逻辑代数化运算,因此,整套算法易于编写计算机程序.详细介绍了算法各环节的计算规则与步骤,并对正确性与合理性进行了论证.通过举例详细说明算法的计算过程,并检验算法的正确性.     

Improvements by analyzing the efficient frontier in DEA

In this paper, we suggest four types of improvements for making inefficient DMUs efficient in the CCR model with the minimal change of input and output values. Moreover, we propose an algorithm for calculating such improvements by applying quadratic programming techniques. Furthermore, since all equations constructing the efficient frontiers of the CCR and BCC models are necessary to execute the algorithm, we present a procedure for calculating them.     

求最优模糊等价矩阵的一个算法

本文说明了模糊等价矩阵的结构，然后提出求模糊相似矩阵的最优模糊等价矩阵的一个算法，最后指出最优模糊等价矩阵一定存在，但不唯一。     

Calculating a minimal sphere containing a polytope defined by a system of linear inequalities

We will propose an algorithm for calculating a minimal sphere containing a polytope defined by a system of linear inequalities in low dimensional Euclidean space. This algorithm is a straightforward application of the algorithm for maximizing a convex quadratic function over a polytope. It will be shown that this algorithm successfully generates a minimal sphere when the dimensions of the underlying space is up to five.International Digital Communication Inc.     

On one approach to finding eigenvalue curves of linear two-parameter spectral problems

We consider an iteration algorithm for calculating eigenvalue curves of the linear algebraic twoparameter spectral problem, which uses an algorithm for calculating all eigenvalues in a given domain of variation in spectral parameters based on an efficient numerical technique for calculating derivatives of the determinant of a matrix. Numerical examples are presented.     

求鳞状因子循环矩阵的逆阵及广义逆阵的快速付氏变换法

借助快速付立叶变换(FFT),本文给出一种求n阶鳞状因子循环矩阵的逆阵、自反g-逆、群逆、Moore-Penrose逆的快速算法,该算法的计算复杂性为O(nlog2n),最后给出的两个数值算例表明了该算法的有效性.     

求置换因子循环矩阵的逆阵及广义逆阵的快速算法

1 引 言 循环矩阵由于其应用非常广泛而成为一类重要的特殊矩阵,如在图象处理、编码理论、自回归滤波器设计等领域中经常会遇到以这类矩阵为系数的线性系统的求解问题.而对称循环组合系统也具有广泛的实际背景,例如造纸机的横向控制系统,具有平行结     

二次特征值问题中特征值和特征向量的可微性

二次特征值问题中特征值和特征向量的可微性,给出了其导数的计算公式及其算法.     

一类网络最优路径的双向模拟扩散算法

基于模拟扩散算法的基本原理,文中提出了一种双向寻求网络最优路径的扩散算法,并介绍了该算法原理和具体计算过程,验证了该算法的正确性和合理性。该算法具有并行计算的能力,适合于分布式计算机,寻求大型复杂网络的最优路径。     

动力系统实测数据的Lyapunov指数的矩阵算法

Lyapunov指数l是定量描述混沌吸引子的重要指标,自从1985年Wolf提出Lyapunov指数l的轨线算法以来,如何准确、快速地计算正的、最大的Lyapunov指数l_max便成为人们关注的问题,虽有不少成功计算的报导,但一般并不公开交流.在Zuo Bingwu理论算法的基础上,给出了Lyapunov指数l的具体的矩阵算法,并与Wolf的算法进行了比较,计算结果表明:算法能快速、准确地计算(主要是正的、最大的)Lyapunov指数l_max.并对Lyapunov指数l的大小所反应的吸引子的特性进行了分析,并得出了相应的结论.     

Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor

Consider the problem of computing the largest eigenvalue for nonnegative tensors. In this paper, we establish the Q-linear convergence of a power type algorithm for this problem under a weak irreducibility condition. Moreover, we present a convergent algorithm for calculating the largest eigenvalue for any nonnegative tensors.     

On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem

An algorithm for empirically calculating the expected number of optimal and near-optimal solutions in a random Euclidean travelling salesman problem is presented. The algorithm is based on well known geometric properties of the optimal tour. For problems involving up to 15 points uniformily distributed in the unit square, experiments show this expected number to be extremely small.     

Calculation of the discrepancy of a finite set of points in the unit n-cube

An algorithm for calculating the discrepancy of finitely many points in the unit n-cube [0, 1]ⁿ is suggested. This algorithm is easy to program. For 2 ≤ n ≤ 4, the suggested algorithm is significantly faster than Bundschuh and Zhu’s algorithm. For larger n, whether this algorithm is faster depends on the number of points.     

Spectral problem in a waveguide with homogeneous bi-isotropic filling

A vector spectral problem in a rectangular waveguide with homogeneous bi-isotropic filling is considered. A generalized statement of this problem is proposed, which is used to develop a finite-element algorithm for calculating propagation constants with spurious solutions eliminated.     

The discrete linear restricted Chebyshev approximation

A numerically stable simplex algorithm for calculating the restricted Chebyshev solution of overdetermined systems of linear equations is described. In this algorithm minimum computer storage is required and no conditions are imposed on the coefficient matrix or on the right hand side of the system of equations. Also a new way of implementing a triangular decomposition method to the basis matrix is used. The ordinary Chebyshev solution, the one-sided Chebyshev solutions and the Chebyshev approximation by non-negative functions are obtained as special cases in this algorithm. Numerical results are given.     

基于奇异谱分析的降噪方法及其在计算最大Liapunov指数中的应用

基于奇异谱分析对信号的自适应滤波特性,提出了一种降低混沌信号噪声的算法,这个算法首先求得信号的各阶经验正交函数（EOF）和主分量（PC）,然后用经验正交函数和主分量重构信号,根据重构信号的奇异谱选择最优的重构阶次以获得降噪后的信号．在计算动力系统最大Liapunov指数时,由于噪声的存在会降低计算的精度,因此将提出的降噪算法应用于最大Liapunov指数的计算中．通过对Henon映射和Logistic映射这两个典型混沌系统最大Liapunov指数的计算,结果表明该算法能有效提高最大Liapunov指数计算的精度．