The Experts below are selected from a list of 303 Experts worldwide ranked by ideXlab platform
Qing-chang Zhong - One of the best experts on this subject based on the ideXlab platform.
-
J-SPECTRAL FACTORIZATION VIA SIMILARITY TRANSFORMATIONS
IFAC Proceedings Volumes, 2005Co-Authors: Qing-chang ZhongAbstract:Abstract This paper characterizes a class of regular para-Hermitian transfer matrices and then studies the J -spectral factorization of this class using similarity transformations. A transfer Matrix δ in this class admits a J -spectral factorization if and only if there exists a common Nonsingular Matrix to similarly transform the A -matrices of δ and δ -1 , resp., into 2 × 2 lower (upper, resp.) triangular block matrices with the (1, 1)-block including all the stable modes of δ (δ -1 resp.). For a transfer Matrix in a smaller subset, this Nonsingular Matrix is formulated in terms of the stabilizing solutions of two algebraic Riccati equations. The J -spectral factor is formulated in terms of the original realization of the transfer Matrix.
-
Technical communique: J-spectral factorization of regular para-Hermitian transfer matrices
Automatica, 2005Co-Authors: Qing-chang ZhongAbstract:This paper characterizes a class of regular para-Hermitian transfer matrices and then reveals the elementary characteristics of J-spectral factorization for this class. A transfer Matrix @L in this class admits a J-spectral factorization if and only if there exists a common Nonsingular Matrix to similarly transform the A-matrices of @L and @L^-^1, resp., into 2x2 lower (upper, resp.) triangular block matrices with the (1,1)-block including all the stable modes of @L (@L^-^1, resp.). For a transfer Matrix in a smaller subset, this Nonsingular Matrix is formulated in terms of the stabilizing solutions of two algebraic Riccati equations. The J-spectral factor is formulated in terms of the original realization of the transfer Matrix.
A S Morse - One of the best experts on this subject based on the ideXlab platform.
-
a fixed neighbor distributed algorithm for solving a linear algebraic equation
European Control Conference, 2013Co-Authors: Shaoshuai Mou, A S MorseAbstract:This paper presents a distributed algorithm for solving a linear algebraic equation of the form Ax = b where A is an n × n Nonsingular Matrix and b is an n-vector. The equation is solved by a network of n agents assuming that each agent knows exactly one distinct row of the partitioned Matrix [A b], the current estimates of the equation's solution generated by its neighbors, and nothing more. Each agent recursively updates its estimate of A-1b by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a simple, undirected graph G whose vertices correspond to agents and whose edges depict neighbor relations. It is shown that for any Nonsingular Matrix A and any connected graph G, the proposed algorithm causes all agents' estimates to converge exponentially fast to the desired solution A-1b.
-
ECC - A fixed-neighbor, distributed algorithm for solving a linear algebraic equation
2013 European Control Conference (ECC), 2013Co-Authors: Shaoshuai Mou, A S MorseAbstract:This paper presents a distributed algorithm for solving a linear algebraic equation of the form Ax = b where A is an n × n Nonsingular Matrix and b is an n-vector. The equation is solved by a network of n agents assuming that each agent knows exactly one distinct row of the partitioned Matrix [A b], the current estimates of the equation's solution generated by its neighbors, and nothing more. Each agent recursively updates its estimate of A-1b by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a simple, undirected graph G whose vertices correspond to agents and whose edges depict neighbor relations. It is shown that for any Nonsingular Matrix A and any connected graph G, the proposed algorithm causes all agents' estimates to converge exponentially fast to the desired solution A-1b.
Shaoshuai Mou - One of the best experts on this subject based on the ideXlab platform.
-
a fixed neighbor distributed algorithm for solving a linear algebraic equation
European Control Conference, 2013Co-Authors: Shaoshuai Mou, A S MorseAbstract:This paper presents a distributed algorithm for solving a linear algebraic equation of the form Ax = b where A is an n × n Nonsingular Matrix and b is an n-vector. The equation is solved by a network of n agents assuming that each agent knows exactly one distinct row of the partitioned Matrix [A b], the current estimates of the equation's solution generated by its neighbors, and nothing more. Each agent recursively updates its estimate of A-1b by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a simple, undirected graph G whose vertices correspond to agents and whose edges depict neighbor relations. It is shown that for any Nonsingular Matrix A and any connected graph G, the proposed algorithm causes all agents' estimates to converge exponentially fast to the desired solution A-1b.
-
ECC - A fixed-neighbor, distributed algorithm for solving a linear algebraic equation
2013 European Control Conference (ECC), 2013Co-Authors: Shaoshuai Mou, A S MorseAbstract:This paper presents a distributed algorithm for solving a linear algebraic equation of the form Ax = b where A is an n × n Nonsingular Matrix and b is an n-vector. The equation is solved by a network of n agents assuming that each agent knows exactly one distinct row of the partitioned Matrix [A b], the current estimates of the equation's solution generated by its neighbors, and nothing more. Each agent recursively updates its estimate of A-1b by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a simple, undirected graph G whose vertices correspond to agents and whose edges depict neighbor relations. It is shown that for any Nonsingular Matrix A and any connected graph G, the proposed algorithm causes all agents' estimates to converge exponentially fast to the desired solution A-1b.
M.j. Tsatsomeros - One of the best experts on this subject based on the ideXlab platform.
-
Extremal properties of ray-Nonsingular matrices
Discrete Mathematics, 2000Co-Authors: G.y. Lee, J.j. Mcdonald, B.l. Shader, M.j. TsatsomerosAbstract:A ray-Nonsingular Matrix is a square complex Matrix, A, such that each complex Matrix whose entries have the same arguments as the corresponding entries of A, is Nonsingular. Extremal properties of ray-Nonsingular matrices are studied in this paper. Combinatorial and probabilistic arguments are used to prove that if the order of a ray-Nonsingular Matrix is at least 6, then it must contain a zero entry, and that if each of its rows and columns have an equal number, k, of nonzeros, then k613. c 2000 Elsevier Science B.V. All rights reserved.
-
Extremal properties of ray-Nonsingular matrices
Discrete Mathematics, 2000Co-Authors: G.y. Lee, J.j. Mcdonald, B.l. Shader, M.j. TsatsomerosAbstract:AbstractA ray-Nonsingular Matrix is a square complex Matrix, A, such that each complex Matrix whose entries have the same arguments as the corresponding entries of A, is Nonsingular. Extremal properties of ray-Nonsingular matrices are studied in this paper. Combinatorial and probabilistic arguments are used to prove that if the order of a ray-Nonsingular Matrix is at least 6, then it must contain a zero entry, and that if each of its rows and columns have an equal number, k, of nonzeros, then k⩽13
He Jin - One of the best experts on this subject based on the ideXlab platform.
-
S~*-Matrix and Sign Nonsingular Matrix
Journal of Tongji University, 2001Co-Authors: He JinAbstract:The set of real matrices with the same sign pattern as A is called the qualitative class of A,denoted as Q (A).A square real Matrix A is called a sign Nonsingular Matrix (abbreviated SNS Matrix),if every Matrix in Q (A) is Nonsingular.Ais called an S * Matrix,if each Matrix obtained from A by deleting one of its columns is an SNS Matrix.In this paper,we study the relationships between SNS Matrix and S * Matrix,sign solvable linear systems and sign solvable digraphs.And solvable an important special case of a problem about nearly L matrices proposed by Jia Yu Shao and Suk Geun Hwang.
-
s Matrix and sign Nonsingular Matrix
Journal of Tongji University, 2001Co-Authors: He JinAbstract:The set of real matrices with the same sign pattern as A is called the qualitative class of A,denoted as Q (A).A square real Matrix A is called a sign Nonsingular Matrix (abbreviated SNS Matrix),if every Matrix in Q (A) is Nonsingular.Ais called an S * Matrix,if each Matrix obtained from A by deleting one of its columns is an SNS Matrix.In this paper,we study the relationships between SNS Matrix and S * Matrix,sign solvable linear systems and sign solvable digraphs.And solvable an important special case of a problem about nearly L matrices proposed by Jia Yu Shao and Suk Geun Hwang.
