Abstract
We investigate the numerical solution of algebraic Bernoulli equations 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 stabilization of linear systems, coprime factorization of rational matrix-valued functions, as well as model reduction. The algorithm proposed here is easily parallelizable and thus provides an efficient tool to solve large-scale problems. We report the parallel performance and scalability of our parallel implementations on an IBM Regatta system. Efficiencies around 80% and higher are obtained for using a reduced number of nodes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
