Parallel solution of large-scale algebraic Bernoulli equations with the matrix sign function method
by Sergio Barrachina, Peter Benner, Enrique S. Quintana-Orti
International Journal of Computational Science and Engineering (IJCSE), Vol. 4, No. 2, 2009

Abstract: We investigate the numerical solution of algebraic Bernoulli equations (ABE) via the Newton iteration for the matrix sign function. Bernoulli equations are nonlinear matrix equations arising in control and systems theory in the context of stabilisation of linear systems, coprime factorisation of rational matrix-valued functions, as well as model reduction. The algorithm proposed here is easily parallelisable and thus provides an efficient tool to solve large-scale problems. We report the parallel performance and scalability of our parallel implementations on a cluster of Intel Xeon processors.

Online publication date: Sun, 12-Jul-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com