Displaying similar documents to “An algorithm for model reduction in large electric power systems.”

Reduction of large circuit models via low rank approximate gramians

Jing-Rebecca Li, Jacob White (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

We describe a model reduction algorithm which is well-suited for the reduction of large linear interconnect models. It is an orthogonal projection method which takes as the projection space the sum of the approximate dominant controllable subspace and the approximate dominant observable subspace. These approximate dominant subspaces are obtained using the Cholesky Factor ADI (CF-ADI) algorithm. We describe an improvement upon the existing implementation of CF-ADI which can result in...

A parallel block Lanczos algorithm and its implementation for the evaluation of some eigenvalues of large sparse symmetric matrices on multicomputers

Mario Guarracino, Francesca Perla, Paolo Zanetti (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

In the present work we describe HPEC (High Performance Eigenvalues Computation), a parallel software package for the evaluation of some eigenvalues of a large sparse symmetric matrix. It implements an efficient and portable Block Lanczos algorithm for distributed memory multicomputers. HPEC is based on basic linear algebra operations for sparse and dense matrices, some of which have been derived by ScaLAPACK library modules. Numerical experiments have been carried out to evaluate HPEC...

Efficient numerical algorithms for balanced stochastic truncation

Peter Benner, Enrique Quintana-Ortí, Gregorio Quintana-Ortí (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

We propose an efficient numerical algorithm for relative error model reduction based on balanced stochastic truncation. The method uses full-rank factors of the Gramians to be balanced versus each other and exploits the fact that for large-scale systems these Gramians are often of low numerical rank. We use the easy-to-parallelize sign function method as the major computational tool in determining these full-rank factors and demonstrate the numerical performance of the suggested implementation...

A new efficient and flexible algorithm for the design of testable subsystems

Stéphane Ploix, Abed Alrahim Yassine, Jean-Marie Flaus (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

In complex industrial plants, there are usually many sensors and the modeling of plants leads to lots of mathematical relations. This paper presents a general method for finding all the possible testable subsystems, i.e., sets of relations that can lead to various types of detection tests. This method, which is based on structural analysis, provides the constraints that have to be used for the design of each detection test and manages situations where constraints contain non-deductible...

Extracting second-order structures from single-input state-space models: Application to model order reduction

Jérôme Guillet, Benjamin Mourllion, Abderazik Birouche, Michel Basset (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper focuses on the model order reduction problem of second-order form models. The aim is to provide a reduction procedure which guarantees the preservation of the physical structural conditions of second-order form models. To solve this problem, a new approach has been developed to transform a second-order form model from a state-space realization which ensures the preservation of the structural conditions. This new approach is designed for controllable single-input state-space...