Author
Listed:
- Cartiel, Oriol
- Mesas, Juan-José
- Monjo, Lluís
- Sainz, Luis
Abstract
The limitations of traditional methods for identifying resonance frequencies have driven the development of Resonance Mode Analysis (RMA) as a more effective alternative. Despite its potential, RMA faces challenges in computational efficiency, particularly in multi-terminal transmission grids. To address this, Rapid RMA, a power iteration (PI)-based approach for determining the dominant eigenvalue of the nodal impedance matrix, was introduced. However, the PI-based approach can exhibit slow convergence or fail under certain conditions. To overcome these limitations, recent advancements have proposed two new methodologies: Faster RMA, a modified shifted-inverse PI-based method, and Lanczos-based RMA, a non-Hermitian Lanczos method. This paper evaluates the computational performance of RMA-based methods using various software tools (including normal computation, parallel computation and sparse techniques) across three distinct hardware-computing systems. The study highlights practical differences in computational speed and efficiency for RMA applications under diverse scenarios. By emphasising the critical role of optimising computational tools, the paper examines how hardware and software configurations influence RMA performance, particularly in transmission grids and microgrid clusters, using MATLAB/Simulink simulations. Finally, the paper proposes an efficient RMA-based methodology that is adaptable to a wide range of grid configurations and computational environments. This approach is applied to stability studies using the positive-mode-damping stability criterion, thereby offering a robust framework for advancing harmonic resonance analysis in power systems.
Suggested Citation
Cartiel, Oriol & Mesas, Juan-José & Monjo, Lluís & Sainz, Luis, 2026.
"Computational time efficiency analysis for resonance studies in transmission grids and microgrid clusters,"
Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 243(C), pages 486-498.
Handle:
RePEc:eee:matcom:v:243:y:2026:i:c:p:486-498
DOI: 10.1016/j.matcom.2025.12.009
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:243:y:2026:i:c:p:486-498. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.