检索结果-内蒙古大学图书馆

CONVERGENCE RESULTS OF THE biconjugate residual algorithm FOR SOLVING GENERALIZED SYLVESTER MATRIX EQUATION

ASIAN JOURNAL OF CONTROL 2017年第3期19卷 961-968页

作者： Hajarian, Masoud Shahid Beheshti Univ Fac Math Sci Dept Math Gen Campus Tehran 19839 Iran

In this article, we investigate a variant of the biconjugate residual (BCR) algorithm to solve the generalized Sylvester matrix equation Sigma(k)(i=1) A(i)XB(i) + Sigma(l)(j=1) CjYDj = E , which includes the well-known Lyapunov, Stein and Sylvester matrix equations. We show that the BCR algorithm with any (special) initial matrix pair can smoothly compute the (least Frobenius norm) solution pair of the generalized Sylvester matrix equation within a finite number of iterations in the absence of round-off errors. Finally the accuracy and effectiveness of the BCR algorithm in comparison to some existing algorithms are demonstrated by two numerical examples.

关键词： biconjugate residual algorithm finite number of iterations generalized Sylvester matrix equation

来源：评论

学校读者我要写书评

暂无评论

Finding solutions for periodic discrete-time generalized coupled Sylvester matrix equations via the generalized BCR method

引用

TRANSACTIONS OF THE INSTITUTE OF MEASUREMENT AND CONTROL 2018年第2期40卷 647-656页

作者： Hajarian, Masoud Shahid Beheshti Univ Dept Math Tehran Iran

The periodic discrete-time matrix equations have wide applications in stability theory, control theory and perturbation analysis. In this work, the biconjugate residual algorithm is generalized to construct a matrix iterative method to solve the periodic discrete-time generalized coupled Sylvester matrix equations The constructed method is shown to be convergent in a finite number of iterations in the absence of round-off errors. By comparing with other similar methods in practical computation, we give numerical results to demonstrate the accuracy and the numerical superiority of the constructed method.

关键词： Periodic discrete-time generalized coupled Sylvester matrix equations biconjugate residual algorithm finite number of iterations

来源：评论

学校读者我要写书评

暂无评论

Lanczos version of BCR algorithm for solving the generalised second-order Sylvester matrix equation EVF plus GVH plus BVC = DWE plus M

引用

IET CONTROL THEORY AND APPLICATIONS 2017年第2期11卷 273-281页

作者： Hajarian, Masoud Shahid Beheshti Univ Fac Math Sci Dept Math Gen Campus Tehran 19839 Iran

It is well known that the biconjugate residual (BCR) algorithm and its variants are powerful procedures to find the solution of large sparse non-symmetric systems equation. In this study, the authors develop the Lanczos version of BCR algorithm for computing the solution pair of the generalised second-order Sylvester matrix equation EVF + GVH + BVC = DWE + M which includes the second-order Sylvester, Lyapunov and Stein matrix equations as special cases. The convergence results show that the algorithm with any initial matrices converges to the solutions within a finite number of iterations in the absence of round-off errors. Finally, two numerical examples are provided to support the theoretical findings and to testify the effectiveness and usefulness of the algorithm.

关键词： matrix algebra iterative methods pole assignment observers generalised second-order Sylvester matrix equation biconjugate residual algorithm Stein matrix equations Lanczos version BCR algorithm pole assignment eigenstructure assignment robust fault detection Luenberger-type observer design second-order linear system

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：