LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A Parallelizable Algorithm for Stabilizing Large Sparse Linear Systems With Uncertain Interconnections

Photo by cosmicwriter from unsplash

This paper proposes a new method for permuting sparse matrices into an upper block triangular from. The algorithm is highly parallelizable, which makes it suitable for large-scale systems with uncertain… Click to show full abstract

This paper proposes a new method for permuting sparse matrices into an upper block triangular from. The algorithm is highly parallelizable, which makes it suitable for large-scale systems with uncertain interconnection patterns. In such cases, the proposed decomposition can be used to develop flexible decentralized control strategies that produce a different gain matrix whenever the configuration changes. Applications to interconnected microgrids and supply and demand networks are provided to illustrate the versatility of the proposed approach.

Keywords: systems uncertain; stabilizing large; parallelizable algorithm; sparse linear; large sparse; algorithm stabilizing

Journal Title: IEEE Access
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.