http://iet.metastore.ingenta.com
1887

Reduce–factor–solve for fast Thevenin impedance computation and network reduction

Reduce–factor–solve for fast Thevenin impedance computation and network reduction

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Generation, Transmission & Distribution — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The complexity and volatility of power system operation increase when larger parts of the power production is based on distributed and non-controllable renewable energy sources. Ensuring stable and secure operation becomes more difficult in these modern power systems. For security assessment, the results of traditional offline simulations may become obsolete prior to the completion of the assessment. In contrast, real-time stability and security assessment aims at online computation, and it is therefore dependent on very fast computation of properties of the grid operating state. The study develops the reduce–factor–solve approach to real-time computation of two key components in real-time assessment methods, network reduction, and calculation of Thevenin impedances. The aim is to allow online stability assessment for very complex networks. The theoretical foundation behind the reduce–factor–solve approach is described together with the ability to handle both algorithms in a common framework. By exploiting parallelisation of the reduce and solve steps in combination with fast matrix factorisation, Thevenin impedances and reduced networks are computed much faster than previous approaches. The reduce–factor–solve algorithm is evaluated on power grids of varying complexity to show that Thevenin impedance computation and network reduction for complex power systems can be performed on a milliseconds time scale.

http://iet.metastore.ingenta.com/content/journals/10.1049/iet-gtd.2018.5330
Loading

Related content

content/journals/10.1049/iet-gtd.2018.5330
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address