Componentwise Asymptotic Stability of Continuous-Time Interval Systems

A special type of asymptotic (exponential) stability, namely componentwise asymptotic (exponential) stability for the continuous-time interval system is investigated. A set-valued map that represents the constraint of the state of the system is defined. And, by applying the viability theory of differential equation, sufficient and necessary conditions for the componentwise asymptotical (exponential) stability of this kind of systems are given.

Componentwise Complementary Cycles in Multipartite Tournaments

The problem of complementary cycles in tournaments and bipartite tournaments was completely solved. However, the problem of complementary cycles in semicomplete n-partite digraphs with n 〉 3 is still open. Based on the definition of componentwise complementary cycles, we get the following result. Let D be a 2-strong n-partite （n 〉 6） tournament that is not a tournament. Let C be a 3-cycle of D and D ／ V（C） be nonstrong. For the unique acyclic sequence D1, D2,..., Da of D ／ V（C）, where a 〉 2, let Dc = {Di｜Di contains cycles, i = 1,2,...,a}, Dc = {D1,D2,...,Da} ／ De. If Dc≠ 0, then D contains a pair of componentwise complementary cycles.

Structured condition numbers and statistical condition estimation for the LDU factorization

In this article, we consider the structured condition numbers for LDU, factorization by using the modified matrix-vector approach and the differential calculus, which can be represented by sets of parameters. By setting the specific norms and weight parameters, we present the expressions of the structured normwise, mixed, componentwise condition numbers and the corresponding results for unstructured ones. In addition, we investigate the statistical estimation of condition numbers of LDU factorization using the probabilistic spectral norm estimator and the small-sample statistical condition estimation method, and devise three algorithms. Finally, we compare the structured condition numbers with the corresponding unstructured ones in numerical experiments.

ACCURATE COMPUTATION FOR IRREDUCIBLE NONSINGULAR M-MATRIX

Computing the eigenvalue of smallest modulus and its corresponding eigneveclor of an irreducible nonsingular M-matrix A is considered, It is shown that if the entries of A are known with high relative accuracy, its eigenvalue of smallest modulus and each component of the corresponding eigenvector will be determined to much higher accuracy than the standard perturbation theory suggests. An algorithm is presented to compute them with a small componentwise backward error, which is consistent with the perturbation results.

Re ned rigorous perturbation bounds for the SR decomposition

In this article,some new rigorous perturbation bounds for the SR decomposition un-der normwise or componentwise perturbations for a given matrix are derived.Also,the explicit expressions for the mixed and componentwise condition numbers are presented by utilizing the block matrix-vector equation approach.Hypothetical and trial results demonstrate that these new bounds are constantly more tightly than the comparing ones in the literature.

On Iterative Algorithm and Perturbation Analysis for the Nonlinear Matrix Equation

In this study,an iterative algorithm is proposed to solve the nonlinear matrix equation X+A∗eXA=In.Explicit expressions for mixed and componentwise condition numbers with their upper bounds are derived to measure the sensitivity of the considered nonlinear matrix equation.Comparative analysis for the derived condition numbers and the proposed algorithm are presented.The proposed iterative algorithm reduces the number of iterations significantly when incorporated with exact line searches.Componentwise condition number seems more reliable to detect the sensitivity of the considered equation than mixed condition number as validated by numerical examples.