Results 1  10
of
17
Asymptotic waveform evaluation via a Lanczos method
 Appl. Math. Lett
, 1994
"... AbstractIn this paper we show that the twosided Lanczos procedure combined with implicit restarts, offers significant advantages over Pad6 approximations used typically for model reduction in circuit simulation. ..."
Abstract

Cited by 58 (4 self)
 Add to MetaCart
AbstractIn this paper we show that the twosided Lanczos procedure combined with implicit restarts, offers significant advantages over Pad6 approximations used typically for model reduction in circuit simulation.
Model reduction of state space systems via an Implicitly Restarted Lanczos method
 Numer. Algorithms
, 1996
"... The nonsymmetric Lanczos method has recently received significant attention as a model reduction technique for largescale systems. Unfortunately, the Lanczos method may produce an unstable partial realization for a given, stable system. To remedy this situation, inexpensive implicit restarts are de ..."
Abstract

Cited by 56 (8 self)
 Add to MetaCart
The nonsymmetric Lanczos method has recently received significant attention as a model reduction technique for largescale systems. Unfortunately, the Lanczos method may produce an unstable partial realization for a given, stable system. To remedy this situation, inexpensive implicit restarts are developed which can be employed to stabilize the Lanczos generated model.
Reducedorder modeling techniques based on Krylov subspaces and their use in circuit simulation
, 1998
"... ..."
Algorithms for Model Reduction of Large Dynamical Systems
, 1999
"... Three algorithms for the model reduction of largescale, continuoustime, timeinvariant, linear, dynamical systems with a sparse or structured transition matrix and a small number of inputs and outputs are described. They rely on low rank approximations to the controllability and observability Gram ..."
Abstract

Cited by 43 (1 self)
 Add to MetaCart
Three algorithms for the model reduction of largescale, continuoustime, timeinvariant, linear, dynamical systems with a sparse or structured transition matrix and a small number of inputs and outputs are described. They rely on low rank approximations to the controllability and observability Gramians, which can eciently be computed by ADI based iterative low rank methods. The rst two model reduction methods are closely related to the wellknown square root method and Schur method, which are balanced truncation techniques. The third method is a heuristic, balancingfree technique. The performance of the model reduction algorithms is studied in numerical experiments.
On some modifications of the Lanczos algorithm and the relation with Padé approximations
, 1995
"... In this paper we try to show the relations between the Lanczos algorithm and Pad'e approximations as used e.g. in identification and model reduction of dynamical systems. 1 1 Introduction For simplicity we assume here that all systems are SISO, although some results do extend to the MIMO case ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In this paper we try to show the relations between the Lanczos algorithm and Pad'e approximations as used e.g. in identification and model reduction of dynamical systems. 1 1 Introduction For simplicity we assume here that all systems are SISO, although some results do extend to the MIMO case. Let a nth order dynamical system be described by x = Ax + bu (1.1) y = cx + du (1.2) where A is a square, b is a column vector, c is a row vector, and d is a scalar. It is wellknown that the transfer function of this system : h(s) = c(sI \Gamma A) \Gamma1 b + d has a Taylor expansion around s = 1 that looks like : h(s) = d + cbs \Gamma1 + cAbs \Gamma2 + cA 2 bs \Gamma3 + cA 3 bs \Gamma4 + : : : The coefficients m \Gammai of the powers of s \Gammai satisfy thus m 0 = d ; m \Gammai = cA i\Gamma1 b ; i 1: For i 1 these are also called moments or Markov parameters of the system fA; b; cg. It follows already from the work of Hankel that the first 2n moments 1 To appea...
Model Reduction of LargeScale Systems Rational Krylov Versus Balancing Techniques
"... . In this paper, we describe some recent developments in the use of projection methods to produce a reducedorder model for a linear timeinvariant dynamical system which approximates its frequency response. We give an overview of the family of Rational Krylov methods and compare them with "near ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
. In this paper, we describe some recent developments in the use of projection methods to produce a reducedorder model for a linear timeinvariant dynamical system which approximates its frequency response. We give an overview of the family of Rational Krylov methods and compare them with "nearoptimal" approximation methods based on balancing transformations. 1.
The Lanczos algorithm and Padé approximations
 Short Course, Benelux Meeting on Systems and Control
, 1995
"... Introduction In these two lectures we try to show the relations between the Lanczos algorithm and Pad'e approximations as used e.g. in identification and model reduction of dynamical systems. These notes are based on material in the papers [10, 17, 11, 12] for which a lot of credit ought to be ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Introduction In these two lectures we try to show the relations between the Lanczos algorithm and Pad'e approximations as used e.g. in identification and model reduction of dynamical systems. These notes are based on material in the papers [10, 17, 11, 12] for which a lot of credit ought to be given to the respective coauthors. For simplicity we assume here that all systems are SISO, although some results do extend to the MIMO case. Let a nth order dynamical system be described by x = Ax + bu (1) y = cx + du (2) where A is a square, b is a column vector, c is a row vector, and d is a scalar. It is wellknown that the transfer function of this system : h(s) = c(sI \Gamma A) \Gamma1 b +<F29
Reduction of Linear TimeInvariant Systems Using RouthApproximation and PSO
"... Abstract—Order reduction of lineartime invariant systems employing two methods; one using the advantages of Routh approximation and other by an evolutionary technique is presented in this paper. In Routh approximation method the denominator of the reduced order model is obtained using Routh approxi ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract—Order reduction of lineartime invariant systems employing two methods; one using the advantages of Routh approximation and other by an evolutionary technique is presented in this paper. In Routh approximation method the denominator of the reduced order model is obtained using Routh approximation while the numerator of the reduced order model is determined using the indirect approach of retaining the time moments and/or Markov parameters of original system. By this method the reduced order model guarantees stability if the original high order model is stable. In the second method Particle Swarm Optimization (PSO) is employed to reduce the higher order model. PSO method is based on the minimization of the Integral Squared Error (ISE) between the transient responses of original higher order model and the reduced order model pertaining to a unit step input. Both the methods are illustrated through numerical examples.
Ardil, “Model Reduction of Linear Systems by Conventional and Evolutionary Techniques
 International Journal of Computational and Mathematical Sciences
, 2009
"... continuous systems into Reduced Order Model (ROM), using a conventional and an evolutionary technique is presented in this paper. In the conventional technique, the mixed advantages of Mihailov stability criterion and continued fraction expansions (CFE) technique is employed where the reduced denomi ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
continuous systems into Reduced Order Model (ROM), using a conventional and an evolutionary technique is presented in this paper. In the conventional technique, the mixed advantages of Mihailov stability criterion and continued fraction expansions (CFE) technique is employed where the reduced denominator polynomial is derived using Mihailov stability criterion and the numerator is obtained by matching the quotients of the Cauer second form of Continued fraction expansions. In the evolutionary technique method Particle Swarm Optimization (PSO) is employed to reduce the higher order model. PSO method is based on the minimization of the Integral Squared Error (ISE) between the transient responses of original higher order model and the reduced order model pertaining to a unit step input. Both the methods are illustrated through numerical example.
Evolutionary Techniques for Model Order Reduction of Large Scale Linear Systems
"... Abstract—Recently, genetic algorithms (GA) and particle swarm optimization (PSO) technique have attracted considerable attention among various modern heuristic optimization techniques. The GA has been popular in academia and the industry mainly because of its intuitiveness, ease of implementation, a ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract—Recently, genetic algorithms (GA) and particle swarm optimization (PSO) technique have attracted considerable attention among various modern heuristic optimization techniques. The GA has been popular in academia and the industry mainly because of its intuitiveness, ease of implementation, and the ability to effectively solve highly nonlinear, mixed integer optimization problems that are typical of complex engineering systems. PSO technique is a relatively recent heuristic search method whose mechanics are inspired by the swarming or collaborative behavior of biological populations. In this paper both PSO and GA optimization are employed for finding stable reduced order models of singleinput singleoutput largescale linear systems. Both the techniques guarantee stability of reduced order model if the original high order model is stable. PSO method is based on the minimization of the Integral Squared Error (ISE) between the transient responses of original higher order model and the reduced order model pertaining to a unit step input. Both the methods are illustrated through numerical example from literature and the results are compared with recently published conventional model reduction technique.