Publication

Approaches for analog VLSI simulation of the transient stability of large power networks

Christian Enz, Alain Germond, Sidi-Rachid Cherkaoui, Eric Vittoz
1999
Journal Articles

Abstract

This paper suggests several approaches for determining the transient stability of a power network by using an analog VLSI chip for simulating the system behavior. The main advantages of using this method are the much shorter computation time and lower complexity compared to the currently used methods, which are based on numerical calculations or discrete analog emulators

Official source

https://infoscience.epfl.ch/entities/publication/2ac94c10-2c2e-43f9-a738-abf0bef93e74

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.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Christian Enz, Alain Germond, Sidi-Rachid Cherkaoui, Eric Vittoz
1999
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/2ac94c10-2c2e-43f9-a738-abf0bef93e74

About this result

Related concepts (32)

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.

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.

Computational complexity theory

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.

Related publications (32)

Approaches for analog VLSI simulation of the transient stability of large power networks

Chat with Graph Search

Transport of blowing snow particles through turbulent motions

Symplectic cohomology of quasihomogeneous cAn singularities

3D Numerical modeling of compressible and cohesive granular flow impact on narrow obstacles