Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You and Your Team.

Learn More →

Solving the coupled Sylvester-like matrix equations via a new finite iterative algorithm

Solving the coupled Sylvester-like matrix equations via a new finite iterative algorithm PurposeThe purpose of this paper is to obtain an iterative algorithm to find the solution of the coupled Sylvester-like matrix equations.Design/methodology/approachIn this work, the matrix form of the conjugate direction (CD) algorithm to find the solution X of the coupled Sylvester-like matrix equations: {A1XB1+M1f1(X)N1=F1,A2XB2+M2f2(X)N2=F2,with fi(X) = X, fi(X) = X¯, fi(X) = XT and fi(X) = XH for i = 1; 2 has been established.FindingsIt is proven that the algorithm converges to the solution within a finite number of iterations in the absence of round-off errors. Finally, four numerical examples were used to test the proficiency and convergence of the established algorithm.Originality/valueThe numerical examples have led the author to believe that the generalized CD (GCD) algorithm is efficient and it converges more rapidly in comparison with the CGNR and CGNE algorithms. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Engineering Computations Emerald Publishing

Solving the coupled Sylvester-like matrix equations via a new finite iterative algorithm

Engineering Computations , Volume 34 (5): 22 – Jul 3, 2017

Loading next page...
 
/lp/emerald-publishing/solving-the-coupled-sylvester-like-matrix-equations-via-a-new-finite-fcwDoG2VFi
Publisher
Emerald Publishing
Copyright
Copyright © Emerald Group Publishing Limited
ISSN
0264-4401
DOI
10.1108/EC-11-2015-0341
Publisher site
See Article on Publisher Site

Abstract

PurposeThe purpose of this paper is to obtain an iterative algorithm to find the solution of the coupled Sylvester-like matrix equations.Design/methodology/approachIn this work, the matrix form of the conjugate direction (CD) algorithm to find the solution X of the coupled Sylvester-like matrix equations: {A1XB1+M1f1(X)N1=F1,A2XB2+M2f2(X)N2=F2,with fi(X) = X, fi(X) = X¯, fi(X) = XT and fi(X) = XH for i = 1; 2 has been established.FindingsIt is proven that the algorithm converges to the solution within a finite number of iterations in the absence of round-off errors. Finally, four numerical examples were used to test the proficiency and convergence of the established algorithm.Originality/valueThe numerical examples have led the author to believe that the generalized CD (GCD) algorithm is efficient and it converges more rapidly in comparison with the CGNR and CGNE algorithms.

Journal

Engineering ComputationsEmerald Publishing

Published: Jul 3, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$499/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month