Publication

A Transient Stability Assessment Method using Post-Fault Trajectories

Maher Kayal, Sidi-Rachid Cherkaoui, Theodoros Kyriakidis, Guillaume Olivier Lanz
2013
Conference Papers

Abstract

Transient Stability Assessment (TSA) is the process in which the stability of a system is characterized qualitatively or quantitatively. The TSA algorithm presented in this paper is derived from the well-established Single Machine Equivalent (SIME) method and can thus be categorized as a hybrid direct-temporal method. The novelty of the proposed algorithm is that it derives a Transient Stability Index (TSI) with a single Time-Domain (TD) simulation for both stable and unstable cases. The resulting TSI is uniform in units and linear around the instability point. Results are reported for two sample power systems of 9 and 36 buses. The proposed algorithm has also been successfully employed to speed-up a Critical Clearing Time (CCT) determination algorithm.

Official source

https://infoscience.epfl.ch/entities/publication/f28fe2f8-77d0-4c86-b794-dc34c4c176b4

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Maher Kayal, Sidi-Rachid Cherkaoui, Theodoros Kyriakidis, Guillaume Olivier Lanz
2013
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/f28fe2f8-77d0-4c86-b794-dc34c4c176b4

About this result

Related concepts (14)

Euler method

In mathematics and computational science, the Euler method (also called the forward Euler method) is a first-order numerical procedure for solving ordinary differential equations (ODEs) with a given initial value. It is the most basic explicit method for numerical integration of ordinary differential equations and is the simplest Runge–Kutta method. The Euler method is named after Leonhard Euler, who first proposed it in his book Institutionum calculi integralis (published 1768–1870).

Iterative method

In computational mathematics, an iterative method is a mathematical procedure that uses an initial value to generate a sequence of improving approximate solutions for a class of problems, in which the n-th approximation is derived from the previous ones. A specific implementation with termination criteria for a given iterative method like gradient descent, hill climbing, Newton's method, or quasi-Newton methods like BFGS, is an algorithm of the iterative method.

Heun's method

In mathematics and computational science, Heun's method may refer to the improved or modified Euler's method (that is, the explicit trapezoidal rule), or a similar two-stage Runge–Kutta method. It is named after Karl Heun and is a numerical procedure for solving ordinary differential equations (ODEs) with a given initial value. Both variants can be seen as extensions of the Euler method into two-stage second-order Runge–Kutta methods.

Related publications (27)

SIMPLE HIERARCHICAL PLANNING WITH DIFFUSION

Chang Chen, Caglar Gulcehre

Diffusion-based generative methods have proven effective in modeling trajectories with offline datasets. However, they often face computational challenges and can falter in generalization, especially in capturing temporal abstractions for long- horizon tas ...

2024

Micropreparative Gel Electrophoresis for Purification of Nanoscale Bioconjugates

Vitalijs Zubkovs, Ardemis Anoush Boghossian, Sayyed Hashem Sajjadi, Shang-Jung Wu, Yahya Rabbani

Conventional techniques for purifying macromolecular conjugates often require complex and costly installments that are inaccessible to most laboratories. In this work, we develop a one-step micropreparative method based on a trilayered polyacrylamide gel e ...

2024

Efficient Continual Finite-Sum Minimization

Volkan Cevher, Leello Tadesse Dadi, Efstratios Panteleimon Skoulakis

Given a sequence of functions

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024

Related publications (27)

f_1,\ldots,f_n

with

f_i:\mathcal{D}\mapsto \mathbb{R}

, finite-sum minimization seeks a point

{x}^\star \in \mathcal{D}

minimizing

\sum_{j=1}^nf_j(x)/n

. In this work, we propose a key twist into the finite-sum minimizat ...

2024