一类正定复矩阵的谱特征

本文给出了一类正定复矩阵的特征值的分布，同时建立了稳定矩阵与正定矩阵之间的内在联系，确立了稳定矩阵的若干判定方法。     

关于稳定可逆矩阵的分解(英文)

证明了稳定可逆矩阵相似于两个循环矩阵的积.并且进一步地证明了稳定可逆矩阵可表成对角矩阵与换位子的积.     

置换环上的稳定矩阵

本文证明了置换环上的正则稳定矩阵是幂等矩阵和可逆矩阵的积,进一步证明了置换环上的正则稳定矩阵可以对角化。     

关于稳定矩阵分解定理的一个简单证明

一个矩阵称为稳定的,如果这个矩阵的特征值全包含在单位开圆盘内.利用Parker关于复方阵的分解定理给出了稳定矩阵分解定理的一个简单证明,并对奇异值全部严格小于1的矩阵给出了类似的结论.     

一类线性隐式A稳定的单步法

1.引言 对于Stiff方程组初值问题的数值解法,Dahlquist在[1]中引进了 A稳定的概念,并且证明了显式的线性多步法(包括显式的Runge-Kutta方法)不可能是A稳定的.现在已经有许许多多隐式A稳定或Stiff稳定的方法,但绝大多数在数值解的过程中必须解由于隐式方法所产生的非线性方程组,而非线性方程组的求解过程往往又要采用Newton-Raphson迭代方法,因此需要计算方程y’=f(x,y)的右函数f(x,y)的Jacobi矩阵以及与此有关的逆矩阵.本文的主要思想是:既然在数值解过程中要计算f(x,y)的Jacobi矩阵,那么不妨在数值公式中明显的出现f(x,y)的一阶偏导数.我们将A稳定公式     

矩阵的正定性与隐函数的极值

利用隐函数的导数和矩阵正定性在多元显函数极值方面的应用,给出隐函数极值存在的必要条件和充分条件,并实例说明如何根据矩阵的正定性判定隐函数的极值.     

一类A－稳定或L－稳定的经济隐式单块法

一类Ａ－稳定或Ｌ－稳定的经济隐式单块法赵双锁，张国凤（兰州大学数学系）ＡＣＬＡＳＳＯＦＡ－ＳＴＡＢＬＥＯＲＬ－ＳＴＡＢＬＥＥＣＯＮＯＭＩＣＡＬＩＭＰＬＩＣＩＴＳＩＮＧＬＥ－ＢＬＯＣＫＭＥＴＨＯＤＳ￥ＺｈａｏＳｈｕａｎｇ－ｓｕｏ；ＺｈａｎｇＧｕｏ－ｆｅ...     

求解一类隐线性互补问题的投影MAOR算法

用MAOR迭代算法求解一类L-矩阵的隐线性互补问题.证明了由此算法产生的迭代序列的聚点是隐线性互补问题的解.并且当问题中的矩阵是M-矩阵时,算法产生的迭代序列单调收敛于隐互补问题的解.     

几乎弱稳定秩的环

主要是介绍了非交换环的几乎弱稳定秩的概念,并利用它来研究非交换环上的右Hermite环,右Bezout环及初等因子环之间的关系.证明了具有几乎弱稳定秩的满足条件V的右(左)Hermite环是初等因子环;还证明了具有几乎弱稳定秩的满足条件V的右Bezout环是右Hermite环;除此之外还得到了几乎的Exchang环具有几乎弱稳定秩.最后,给出了在具有几乎弱稳定秩且J(R)不为零的右(左)Hermite环上的任意矩阵都可以分解成LUM的乘积,其中L,M为下三角矩阵,U为上三角矩阵.     

关于矩阵分解为稳定矩阵之和的讨论

要解决的问题是一个矩阵是否可以分解为若干稳定 (连续时间意义下 )矩阵的和 .通过推广Ito,Hattori and Maeda在文献 [2 ]中使用的方法并运用其中的成果 ,我们得到了更为准确的相关结论 .     

On approximating the nearest Ω‐stable matrix

In this paper, we consider the problem of approximating a given matrix with a matrix whose eigenvalues lie in some specific region Ω of the complex plane. More precisely, we consider three types of regions and their intersections: conic sectors, vertical strips, and disks. We refer to this problem as the nearest Ω‐stable matrix problem. This includes as special cases the stable matrices for continuous and discrete time linear time‐invariant systems. In order to achieve this goal, we parameterize this problem using dissipative Hamiltonian matrices and linear matrix inequalities. This leads to a reformulation of the problem with a convex feasible set. By applying a block coordinate descent method on this reformulation, we are able to compute solutions to the approximation problem, which is illustrated on some examples.     

Positive feedback may sometimes promote stability

Some sufficient conditions are given for a matrix to be potentially stable. These are used to furnish some counter-intuitive examples of stability behavior.     

Stability Robustness of LQ Optimal Regulators Based on Multirate Sampling of Plant Output

The stability robustness of stable feedback loops, designed on the basis of multirate-output controllers (MROCs), is analyzed in this paper. For MROC-based feedback loops, designed in order to achieve LQ optimal regulation, we characterize additive and multiplicative norm-bounded perturbations of the loop transfer function matrix which do not destabilize the closed-loop system. New sufficient conditions for stability robustness, in terms of elementary MROC matrices, are presented. Moreover, guaranteed stability margins for MROC-based LQ optimal regulators are suggested for the first time. These margins are obtained on the basis of a fundamental spectral factorization equality, called the modified return difference equality, and are expressed directly in terms of elementary cost and system matrices. Sufficient conditions in order to guarantee the suggested stability margins are established. Finally, the connection between the suggested stability margins and the selection of cost weighting matrices is investigated and useful guidelines for choosing proper weighting matrices are presented.     

树的稳定子集和稳定指标

一个实矩阵的符号稳定性问题在经济学、生态学等诸多领域中都有应用背景．本文利用[1]中给出的不可约矩阵的符号稳定性的有关结论，将一个实矩阵的符号稳定性判定问题转化为一个等价的图论问题，即判定无向树中一个点子集的稳定性问题．本文引入了树的稳定子集的概念并给出了稳定子集的递归判别方法．本文还提出井研究了树的稳定指标，即树中所有稳定子集的最小基数，证明了关于稳定指标的一个min—max型定理，井给出了n阶树的稳定指标的最好上界及达到上界的极树的完全刻划。     

分数阶时变广义系统稳定性分析

基于Caputo分数阶导数,研究了分数阶时变广义线性系统和分数阶时变广义非线性系统的稳定性问题.首先利用相关不等式,给出了一个时变广义线性系统无脉冲且稳定的充分条件.然后,通过慢子系统来判断快子系统的变化,并利用Riccati方程,建立了分数阶时变广义非线性系统是渐近稳定的判定准则.最后,给出了算例和Simulink仿真结果,以说明结论的正确性.     

STABLE DOUBLE LR ALGORITHM AND ITS ERROR ANALYSIS

In this paper, the normative matrices and their double LR transformation with origin shifts are defined, and the essential relationship between the double LR transformation of a normative matrix and the QR transformation of the related symmetric tridiagonal matrix is proved. We obtain a stable double LR algorithm for double LR transformation of normative matrices and give the error analysis of our algorithm. The operation number of the stable double LR algorithm for normative matrices is only four sevenths of the rational QR algorithm for reed symmetric tridiagonal matrices.     

Nordsieck methods with computationally verified algebraic stability

We describe the search for algebraically stable Nordsieck methods of order p = s and stage order q = p, where s is the number of stages. This search is based on the theoretical criteria for algebraic stability proposed recently by Hill, and Hewitt and Hill, for general linear methods for ordinary differential equations. These criteria, which are expressed in terms of the non-negativity of the eigenvalues of a Hermitian matrix on the unit circle, are then verified computationally for the derived Nordsieck methods of order p ? 2.     

A new efficient approach to the characterization of D‐stable matrices

The concept of D‐stability is relevant for stable square matrices of any order, especially when they appear in ordinary differential systems modeling physical problems. Indeed, D‐stability was treated from different points of view in the last 50 years, but the problem of characterization of a general D‐stable matrix was solved for low‐order matrices only (ie, up to order 4). Here, a new approach is proposed within the context of numerical linear algebra. Starting from a known necessary and sufficient condition, other simpler equivalent necessary and sufficient conditions for D‐stability are proved. Such conditions turn out to be computationally more appealing for symbolic software, as discussed in the reported examples. Therefore, a new symbolic method is proposed to characterize matrices of order greater than 4, and then it is used in some numerical examples, given in details.     

A high‐order finite difference method for 1D nonhomogeneous heat equations

In this article a sixth‐order approximation method (in both temporal and spatial variables) for solving nonhomogeneous heat equations is proposed. We first develop a sixth‐order finite difference approximation scheme for a two‐point boundary value problem, and then heat equation is approximated by a system of ODEs defined on spatial grid points. The ODE system is discretized to a Sylvester matrix equation via boundary value method. The obtained algebraic system is solved by a modified Bartels‐Stewart method. The proposed approach is unconditionally stable. Numerical results are provided to illustrate the accuracy and efficiency of our approximation method along with comparisons with those generated by the standard second‐order Crank‐Nicolson scheme as well as Sun‐Zhang's recent fourth‐order method. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Stability of T. Chan＇s Preconditioner from Numerical Range

A matrix is said to be stable if the real parts of all the eigenvalues are negative. In this paper, for any matrix An, we discuss the stability properties of T. Chan＇s preconditioner cU（An） from the viewpoint of the numerical range. An application in numerical ODEs is also given.