Second-Order Balanced Truncation for Passive Order Reduction of RLCK Circuits
|
|
- Darrell Boyd
- 6 years ago
- Views:
Transcription
1 IEEE RANSACIONS ON CIRCUIS AND SYSEMS II, VOL XX, NO. XX, MONH X Second-Order Balanced runcation for Passive Order Reduction of RLCK Circuits Boyuan Yan, Student Member, IEEE, Sheldon X.-D. an, Senior Member, IEEE Bruce McGaughy, Member, IEEE Abstract In this paper, we propose a novel model order reduction approach, (Second-order Balanced truncation for Passive Order Reduction), which is the first second-order balanced truncation method proposed for passive reduction of RLCK circuits. By exploiting the special structure information in the circuit formulation, second-order Gramians are defined based on a symmetric first-order realization in descriptor from. As a result, can perform the traditional balancing with passivity-preserving congruency transformation at the cost of solving one generalized Lyapunov equation. Owing to the second-order formulation, also preserves the structure information inherent to RLCK circuits. We further propose, SOGA ( Second-Order Gramian Approximation version of SB- POR), to mitigate high computational cost of solving Lyapunov equation. Experimental results demonstrate that and SOGA are globally more accurate than the Krylov subspace based approaches. Index erms Model order reduction, Simulation, Krylov subspace, Projection, runcated balanced realization. I. INRODUCION Model order reduction (MOR) is an efficient technique to reduce the circuit complexity while producing a good approximation of the input-output behavior 7,, 4, 5. When an RLCK circuit is formulated in the second-order form, inductance (or partial inductance) will be represented in its inverse form, which is called susceptance. Susceptance coupling are shown to be more localized than inductance coupling and its matrix is diagonally dominant like capacitance matrix. Hence, susceptance matrix can be sparsified much easily without loss of stability, which, however, is difficult in general for the inductance matrix. he new susceptance element (called K element) can be stamped back into the circuit matrix using the SPICE-compatible equivalent circuits 3. Model order reduction techniques for second-order systems, which are more suitable for reducing RLCK circuits, have been developed in the past, 3. However, existing second-order MOR techniques are mainly based on Krylov-subspace methods, which in general have difficulties to generate reduced models with global accuracy. herefore, another approach, truncated balanced realization (BR), or balanced truncation (B), which was originally developed in the control community 6, has been studied intensively for interconnect reduction recently 8, 9,, Manuscript received October 7 and revised February 8. his paper was recommended by Associate Editor D.Z. Pan. Boyuan Yan and Sheldon X.-D. an are with Department of Electrical Engineering, University of California, Riverside, CA 95 USA ( {byan,stan}@ee.ucr.edu) Bruce McGaughy is with Cadence Design System, Cadence Design Systems Inc., San Jose, California 9534, USA. his work is funded in part by NSF CAREER Award under grant No. CCF , in part by UC MICRO awards #6-5 and #7-5 via Cadence Design System Inc. Copyright (c) 8 IEEE. Personal use of this material is permitted. However, permission to use this material for any other purposes must be obtained from the IEEE by sending an to pubs-permissions@ieee.org he idea of BR method is to first transform an original system into a new coordinate such that each state in this coordinate is equally controllable and observable before the consequent truncation of the weak states. o perform the passive reduction, positive-real BR (PR-BR) was applied in 8, which solves more expensive quadratic matrix equations. PR-BR has no constrains on the internal structure of the state-space equations. But it also does not preserve any structure information inherent to RLCK circuits such as symmetry, positive semi-definiteness and sparsity, during the reduction process. Another issue is that existing balanced truncation techniques for interconnect reduction are first-order based and cannot handle RLCK circuits formulated as secondorder systems. In the control literature 5, Meyer and Srinivasan introduced a second-order balanced truncation method where second-order Gramians are defined based on Moore s firstorder balanced truncation method. However, in order to preserve the stability of original system, congruency transformation instead of similarity transformation is performed. As a result, the transformed system is not really balanced, which sacrifices the accuracy. In this paper, we propose a new balanced truncation method, (Second-order Balanced truncation for Passive Order Reduction), for passive reduction of RLCK circuits. By exploiting the symmetric positive definiteness of the system matrices in the second-order circuit formulation, the new approach resolves the issue existing in 5 by defining secondorder Gramians based on a symmetric first-order realization. As a result, balancing and reduction can be achieved via only congruency transformation without any accuracy degradation. In contrast to the first-order balanced truncation approaches, can also preserve the structure information inherent to RLCK circuits and only needs to solve one linear matrix equation instead of two quadratic matrix equations. Furthermore, to mitigate the high computational cost of solving Lyapunov equation, a Second-Order Gramian Approximation version, SOGA, is proposed to generalize the existing first-order Gramian approximation technique PMBR 9 to second-order systems. II. FIRS-ORDER BALANCED RUNCAION Consider a linear time-invariant (LI) stable system in a standard state-space form ẋ(t) = Ax(t) + Bu(t) y(t) = Cx(t) where A R n n, B R n p, C R q n, and in which x(t) is the state vector, and u(t) and y(t) represent the input and output, respectively. he controllability and observability Gramians are computed from the Lyapunov equations AX + XA + BB = A Y + Y A + C C = () ()
2 IEEE RANSACIONS ON CIRCUIS AND SYSEMS II, VOL XX, NO. XX, MONH X Since the eigenvalues of the product XY are input-output invariant, a similarity transformation (A b = A, B b = B, C b = C) can be performed to diagonalize the product XY as XY = Σ = diag(σ, σ,...,σ n ) (3) he eigenvalues, which characterize the importance of state variables in terms of energy transfer, are arranged in a descending order. If we partition the matrices as W W XY V V = Σ Σ in which Σ contains r dominant eigenvalues, and the columns of W and V are corresponding left and right eigenvectors, respectively, a reduced model can be obtained as follows ẋ(t) y(t) = A r x(t) + B r u(t) = C r x(t) where A r = W AV, B r = W B, C r = CV. he error in the transfer function of the order r approximation is bounded by n i=r+ σ k. III. SECOND-ORDER BALANCED RUNCAION Consider a second-order LI stable system M q(t) + D q(t) + Kq(t) = Bu(t) y(t) = Pq(t) + Q q(t) where u(t) R p, y(t) R q, q(t) R n, B R n p, P, Q R q n, M, D, K R n n with M assumed to be nonsingular. he general idea of reducing the second-order system is to transform the second-order system first into the equivalent first-order system, from which the balancing matrices are obtained. o this end, the second-order Gramians in 5 were defined based on the first-order realization in a standard statespace form () with n-dimensional state x = q q, where A = I M K M D C = P Q M B he first-order realization has the same input-output behavior as the second-order system. Although a first-order MOR approach, like classic balanced truncation 6, can be applied to reduce (7), the reduced model is not a second-order system anymore in general. o perform the reduction directly on the second-order equations (6), one needs to define Gramians for second-order systems. Similar to the first order Gramian definition, the second order Gramian definition is based on the following optimization problem 5 min q() R n,u L, ( J = u (t)u(t)dt subject to (8) M q(t) + D q(t) + Kq(t) = Bu(t) q() = q which minimizes the necessary energy to reach the given q over all past inputs and initial q. If we compatibly partition the controllability Gramian of the first-order realization (7) as R S X = S (9) F then the optimum for the problem (8) is q R q and thus the controllability Gramian of the second-order system is X = R. ) (4) (5) (6) (7) Similarly, if we compatibly partition the observability Gramian of the first-order realization (7) as U V Y = V () N then the observability Gramian of the second-order system is Y = U. he eigenvalues of the Gramian product X Y are invariant under a similarity transformation X Y = diag(σ, σ,..., σ n ) () Similar to the first-order case, the matrices can be partitioned as W Σ W X Y V V = () Σ where Σ contains the first r largest eigenvalues and W, V are corresponding left and right eigenvectors, respectively. A reduced second-order model can be obtained as follows in which M r q(t) + D r q(t) + K r q(t) = B r u(t) y(t) = P r q(t) + Q r q(t) (3) M r = W MV, D r = W DV, K r = W KV B r = W B, P r = PV, Q r = QV (4) However, in order to preserve the symmetry and stability of the original system, an orthogonal projection is performed in 5 as follows M r = V MV, D r = V DV, K r = V KV B r = V B, P (5) r = PV, Q r = QV where the equations are left multiplied by V instead of W. Unfortunately, since W V for a non-symmetric system (7), the resulting Gramian product X Y will not be balanced and the accuracy is sacrificed. IV. HE ALGORIHM In this section, we introduce the new second-order balanced truncation method and its Gramian approximation version. A. Symmetric realization in descriptor form As mentioned before, RLCK circuits can be formulated in a second-order form (6) with special structure M = C, D = G, K = Γ, P =, Q = B C q(t) + G q(t) + Γq(t) = Bu(t) y(t) = B q(t) (6) where u(t), y(t) R p are input currents and output voltages; q(t) R n are nodal voltages; G, C, Γ R n n are matrices of conductance, capacitance and susceptance respectively and C = C >, G = G, Γ = Γ ; B R n p is the input matrix and its transpose B R p n is the output matrix. Note that C is assumed to be invertible 4, 5. he key idea in this paper is that instead of using the firstorder realization (7), we choose another first-order realization in descriptor form 4 with n-dimensional state x = q, q Eẋ(t) = Ax(t) + Bu(t) y(t) = B x(t) (7)
3 IEEE RANSACIONS ON CIRCUIS AND SYSEMS II, VOL XX, NO. XX, MONH X 3 where E = Γ C Γ, A = Γ G B (8) Note that, since C, G, Γ are all symmetric, it follows A = A, E = E, which means such a first-order realization is symmetric. Controllability and observability Gramians in descriptor form can be computed from a pair of generalized Lyapunov equations. However, in this symmetric case, both Gramians are equal and only one equation is to be solved EX A + AX E + BB = (9) If we compatibly partition the Gramians as R S X = Y = S F then the second-order Gramians are also equal () X = Y = R () Since Gramian is symmetric, R is orthogonally diagonalizable, i.e., there exists = such that R = Σ () As a result, the second-order Gramian product RR can be orthogonally diagonalized as RR = ( R)( R) = (Σ) (3) Note that the eigenspace of the Gramian product is exactly the eigenspace of each Gramian. If we partition the matrices in () as V V Σ R V V = Σ (4) where Σ contains the first r largest eigenvalues of Gramian R and V are corresponding eigenvectors, a reduced model can be obtained as follows C r q(t) + G r q(t) + Γ r q(t) = B r u(t) y = B r q(t) (5) where C r = V CV, G r = V GV, Γ r = V ΓV, B r = V B. his kind of transformation is known as congruency transformation, which preserves symmetry and definiteness of matrices such that C r = Cr, G r = G r, Γ r = Γ r, implying the reduced-order system has guaranteed stability, passivity, and reciprocity 3. he basic algorithm flow for is given in Fig.. ALGORIHM : Input: C, G, Γ, B Output: C r, G r, Γ r, B r Fig.. ) Form the symmetric first-order realization in descriptor form (7) ) Solve EX A + AX E + BB = for X 3) Partition» X as: R S X = S F 4) Compute SVD of the» second-order Gramian:» Σ V R = V V Σ V 5) Form the reduced model as C r = V CV, Gr = V GV, Γr = V ΓV, Br = V B he algorithm. B. Second-order Gramian approximation We also propose a second-order Gramian approximation technique to mitigate high computational cost. Practically, we find that Γ can easily become singular, which will make both A and E in (8) singular. o mitigate this problem, we propose a little different symmetric realization. If we define x = E l q, q, we have the following new realization: where C = L C Cẋ(t) = Gx(t) + Bu(t) y(t) = B x(t), G = E l L L E l G (6) B (7) Here E l is the incidence matrix for inductor matrix L in the modified nodal analysis (MNA) formulation and Γ = E l L E l. We remark that E l L will not have zero rows for a physical system as E l q is actually a vector of a branch vector potential 9. So G will not be singular, required by our new SOGA algorithm, for any physical system that has DC paths to ground for any node. Since C, G, L are all symmetric, such a first-order realization is also symmetric and the second-order Gramian measures the contribution of the node voltages q = v with respect to the transfer function. For first-order system in descriptor form (6), the Gramian X can be computed from the expression in frequency domain X = π + (jωc + G) BB (jωc + G) H dw (8) Let ω k be kth sampling point over the frequency range of interests. If we define z k = (jω k C + G )B (9) then ˆX can be approximately computed as ˆX = zk zk H = ZZ H (3) π where Z is a matrix whose columns are z k. If we partition Z H = Z H Z H and compatibly partition the approximated Gramian as ˆR Ŝ Z Z ˆX = Ŝ = H Z Z H ˆF Z Z H Z Z H (3) then the approximated second-order Gramian is ˆF, which can be diagonalized as ˆF = Z Z H = (Û ˆΣˆV )(Û ˆΣˆV ) = Û ˆΣ Û = ˆΣ Û Û Û ˆΣ Û (3) herefore, Û will be used to perform the reduction as in the method. he SOGA algorithm is presented in Fig.. V. EXPERIMENAL RESULS In this section, we show examples that illustrate the effectiveness of proposed method and compare it with existing relevant MOR approaches.
4 IEEE RANSACIONS ON CIRCUIS AND SYSEMS II, VOL XX, NO. XX, MONH X 4 ALGORIHM : SOGA Input: C, G, Γ, B Output: C r, G r, Γ r, B r ) Start from the symmetric first-order realization (6) ) Do until satisfied: 3) Select a frequency points s k 4) Compute z k = (s k C + G) B 5) Form Z k = z, z,..., z k and partition Z k =» Zk Z k 6) Compute the SVD of the matrix Z k. If the error is satisfactory, go to Step 7. Otherwise, go to Step. 7) Form the projection matrix Û from the singular vectors of Z k, dropping ones corresponding to small singular values below a desired tolerance, and form the reduced model as C r = Û CÛ, Gr = Û GÛ, Γr = Û ΓÛ, Br = Û B B. Comparison with In the second example, we want to compare our method with moment-matching based second-order MOR approach 3. he example is an RLCK circuit, which has nodal voltages. he reduced second-order model has a dimension of. As shown in Fig. 4(a), is globally 8 6 Fig.. he SOGA algorithm. 4 A. Comparison with first-order BR Given a circuit in the form (6), we first compare with the first-order BR method. Note that the order q in the reduced models reduced by on (6) will correspond to the order of q in the reduced models by the first-order BR method performed on equivalent first-order realization (7). We choose a small circuit for the purpose of illustration so that both impedances and real parts can be compared at all possible reduced orders. he RLCK circuit has 4 nodal voltages and thus has a dimension of 4 in a second-order formulation. he equivalent first-order realization has a dimension of 8. As shown in Fig. 3(a),(b),(c), outperforms standard Absolute Error (a) (c) BR 5 BR 5 Singular Values (b) (d) Singular Values BR Fig. 3. Comparison with the first-order BR method (performed on linearied first-order system). BR at each reduced order (q=,,3). his can be explained from the energy distribution of singular values as shown in Fig. 3(d), where the second-order singular values decay much faster than the first-order ones. he passivity of reduced models can be tested from the real parts. As expected, can guarantee the passivity of reduced models while standard BR cannot. As shown in Fig. 3(a),(b),(c), only in Fig. 3(c), the real part of BR reduced model is positive at all frequencies and thus the reduced model is passive. Note that standard BR applied to the equivalent first-order realization(7) also results in a first-order reduced model and thus is not a second-order MOR approach available. We just use it as a criterion to show the accuracy of our new approach. BR 6 Fig. 4. Comparison with Krylov-based second-order MOR method 3. accurate at all frequencies while has very good local behavior around DC (the expansion point of is. Hz) but behaves so bad at other frequencies. he error is shown in Fig. 4(b), where the maximum absolute error for is about but for is almost. C. Comparison with existing second-order BR In this part, we want to compare the new method,, with existing technique 5 in the control literature, which we name BR. he example is an RLCK circuit with nodal voltages and the reduced dimension is. In Fig. 5(a), we can see that outperforms BR obviously. As shown in Fig. 5(b), the maximum absolute error for is smaller than while it is almost for BR. he reason is that the system in BR is not really balanced and thus the accuracy is sacrificed. D. Comparison of SOGA with he original model is an RLCK circuit with nodes in a second-order formulation. he reduced model has an order of (q = ). As shown in Fig. 6, SOGA produces a better approximation than over a wide frequency band (the expansion point of is Hz). he computational cost of SOGA is almost the same as that of given the same reduction order. he reduction CPU times of several meshstructured RLC examples are shown in able I, where the n is the number of nodes and the reduced order is.
5 IEEE RANSACIONS ON CIRCUIS AND SYSEMS II, VOL XX, NO. XX, MONH X BR 4 3 SOGA BR SOGA Absolute Error Relative Error Fig. 5. Comparison with the existing second-order BR method 5. Fig. 6. Accuracy comparison between SOGA and. ABLE I REDUCION CPU IME COMPARISON OF SOGA AND (SECONDS). n=64 n= n=68 n=438 SOGA VI. CONCLUSION In this paper, we have proposed a novel method, and its faster Gramian computation version, SOGA, for the model order reduction of RLCK circuits. utilizes a symmetric first-order realization in descriptor form so that the second-order system can be really balanced via congruency transformation without any accuracy loss, which in contrast with the existing second-order balanced truncation 5. Experimental results show that is more accurate than existing second-order balanced truncation method 5. SOGA is also globally more accurate than the second-order Krylov subspace based method 3 with similar computational cost. REFERENCES A. Devgan, H. Ji, and W. Dai, How to efficiently capture on-chip inductance effects: introducing a new circuit element K, in Proc. Int. Conf. on Computer Aided Design (ICCAD),, pp Z. He, M. Celik, and L. Pillegi, SPIE: Sparse partial inductance extraction, in Proc. Design Automation Conf. (DAC), 997, pp H. Ji, A. Devgan, and W. Dai, Ksim: A stable and efficient RKC simulator for capturing on-chip inductance effect, in Proc. Asia South Pacific Design Automation Conf. (ASPDAC),, pp A. J. Laub and W. F. Arnold, Controllability and observability criteria for multivariable linear second-order models, IEEE rans. Automat. Contr., vol. 9, pp , D. G. Meyer and S. Srinivasan, Balancing and model reduction for second-order form linear systems, IEEE rans. Automat. Contr., vol. AC-4, pp , B. Moore, Principle component analysis in linear systems: Controllability, and observability, and model reduction, IEEE rans. Automat. Contr., vol. 6, no., pp. 7 3, A. Odabasioglu, M. Celik, and L. Pileggi, PRIMA: Passive reduced-order interconnect macromodeling algorithm, IEEE rans. on Computer-Aided Design of Integrated Circuits and Systems, pp , J. R. Phillips, L. Daniel, and L. M. Silveira, Guaranteed passive balanced transformation for model order reduction, IEEE rans. on Computer-Aided Design of Integrated Circuits and Systems, vol., no. 8, pp. 7 4, 3. 9 J. R. Phillips and L. M. Silveira, Poor man s BR: a simple model reduction scheme, IEEE rans. on Computer-Aided Design of Integrated Circuits and Systems, vol. 4, no., pp , 5. Z. Qi, H. Yu, P. Liu, S. X.-D. an, and L. He, Wideband passive multiport model order reduction and realization of RLCM circuits, IEEE rans. on Computer-Aided Design of Integrated Circuits and Systems, pp , Aug. 6. B. N. Sheehan, ENOR: model order reduction of RLC circuits using nodal equations for efficient factorization, in Proc. Design Automation Conf. (DAC), 999, pp. 7. L. M. Silveira and J. R. Phillips, Exploiting input information in a model reduction algorithm for massively coupled parasitic networks, in Proc. Design Automation Conf. (DAC), 4, pp Y. Su, J. Wang, X. Zeng, Z. Bai, C. Chiang, and D. Zhou, : second-order Arnoldi method for passive order reduction of RCS circuits, in Proc. Int. Conf. on Computer Aided Design (ICCAD), 4, pp S. X.-D. an, A general hierarchical circuit modeling and simulation algorithm, IEEE rans. on Computer-Aided Design of Integrated Circuits and Systems, pp , April 5. 5 S. X.-D. an and L. He, Advanced Model Order Reduction echniques in VLSI Design. Cambridge University Press, 7. 6 N. Wang and V. Balakrishnan, Fast balanced stochastic truncation via a quadratic extension of the alternating direction implicit iteration, in Proc. Int. Conf. on Computer Aided Design (ICCAD), 5, pp N. Wang, V. Balakrishnan, and C.-K. Koh, Passivity-preserving model reduction via a computationally efficient projection-and-balance scheme, in Proc. Design Automation Conf. (DAC), 4, pp B. Yan, S. X.-D. an, P. Liu, and B. McGaughy, Passive interconnect macromodeling via balanced truncation of linear systems in descriptor form, in Proc. Asia South Pacific Design Automation Conf. (ASPDAC), 7, pp H. Yu, Y. Shi, L. He, and D. Smart, A fast block structure preserving model order reduction in inverse inductance circuits, in Proc. Int. Conf. on Computer Aided Design (ICCAD), Nov. 6, pp. 7.
Passive Interconnect Macromodeling Via Balanced Truncation of Linear Systems in Descriptor Form
Passive Interconnect Macromodeling Via Balanced Truncation of Linear Systems in Descriptor Form Boyuan Yan, Sheldon X.-D. Tan,PuLiu and Bruce McGaughy Department of Electrical Engineering, University of
More informationEE5900 Spring Lecture 5 IC interconnect model order reduction Zhuo Feng
EE59 Spring Parallel VLSI CAD Algorithms Lecture 5 IC interconnect model order reduction Zhuo Feng 5. Z. Feng MU EE59 In theory we can apply moment matching for any order of approximation But in practice
More informationModel order reduction of electrical circuits with nonlinear elements
Model order reduction of electrical circuits with nonlinear elements Andreas Steinbrecher and Tatjana Stykel 1 Introduction The efficient and robust numerical simulation of electrical circuits plays a
More informationPractical Considerations For Passive Reduction of RLC Circuits
Practical Considerations For Passive Reduction of RLC Circuits Altan Odabasioglu and Mustafa Celik {altan, celik}@montereydesign.com Monterey Design Systems, Inc. Sunnyvale, CA 94089 Lawrence T. Pileggi
More informationIdentification of Electrical Circuits for Realization of Sparsity Preserving Reduced Order Models
Identification of Electrical Circuits for Realization of Sparsity Preserving Reduced Order Models Christof Kaufmann 25th March 2010 Abstract Nowadays very-large scale integrated circuits contain a large
More informationKrylov Techniques for Model Reduction of Second-Order Systems
Krylov Techniques for Model Reduction of Second-Order Systems A Vandendorpe and P Van Dooren February 4, 2004 Abstract The purpose of this paper is to present a Krylov technique for model reduction of
More informationWavelet-Based Passivity Preserving Model Order Reduction for Wideband Interconnect Characterization
Wavelet-Based Passivity Preserving Model Order Reduction for Wideband Interconnect Characterization Mehboob Alam, Arthur Nieuwoudt, and Yehia Massoud Rice Automated Nanoscale Design Group Rice University,
More informationVector Potential Equivalent Circuit Based on PEEC Inversion
43.2 Vector Potential Equivalent Circuit Based on PEEC Inversion Hao Yu EE Department, UCLA Los Angeles, CA 90095 Lei He EE Department, UCLA Los Angeles, CA 90095 ABSTRACT The geometry-integration based
More informationPoor Man s TBR: A Simple Model Reduction Scheme
Poor Man s TBR: A Simple Model Reduction Scheme Joel Phillips Cadence Berkeley Laboratories Cadence Design Systems San Jose, CA 95134, U.S.A. jrp@cadence.com L. Miguel Silveira INESC ID/IST, Cadence Laboratories
More informationWideband Modeling of RF/Analog Circuits via Hierarchical Multi-Point Model Order Reduction
2E-1 Wideband Modeling of RF/Analog Circuits via Hierarchical Multi-Point Model Order Reduction Zhenyu Qi, Sheldon X.-D. Tan Department of Electrical Engineering, University of California, Riverside, CA
More informationAS VERY large scale integration (VLSI) technology advances
1496 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 25, NO. 8, AUGUST 2006 Wideband Passive Multiport Model Order Reduction and Realization of RLCM Circuits Zhenyu
More informationMODEL-order reduction is emerging as an effective
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR PAPERS, VOL. 52, NO. 5, MAY 2005 975 Model-Order Reduction by Dominant Subspace Projection: Error Bound, Subspace Computation, and Circuit Applications
More informationFast Simulation of VLSI Interconnects
Fast Simulation of VLSI Interconnects Jitesh Jain, Cheng-Kok Koh, and Venkataramanan Balakrishnan School of Electrical and Computer Engineering Purdue University, West Lafayette, IN 4797-1285 {jjain,chengkok,ragu}@ecn.purdue.edu
More informationComparison of Model Reduction Methods with Applications to Circuit Simulation
Comparison of Model Reduction Methods with Applications to Circuit Simulation Roxana Ionutiu, Sanda Lefteriu, and Athanasios C. Antoulas Department of Electrical and Computer Engineering, Rice University,
More informationModel Reduction for Unstable Systems
Model Reduction for Unstable Systems Klajdi Sinani Virginia Tech klajdi@vt.edu Advisor: Serkan Gugercin October 22, 2015 (VT) SIAM October 22, 2015 1 / 26 Overview 1 Introduction 2 Interpolatory Model
More informationAn Optimum Fitting Algorithm for Generation of Reduced-Order Models
An Optimum Fitting Algorithm for Generation of Reduced-Order Models M.M. Gourary 1, S.G. Rusakov 1, S.L. Ulyanov 1, M.M. Zharov 1, B.J. Mulvaney 2 1 IPPM, Russian Academy of Sciences, Moscow 1523, e-mail:
More informationModel reduction of nonlinear circuit equations
Model reduction of nonlinear circuit equations Tatjana Stykel Technische Universität Berlin Joint work with T. Reis and A. Steinbrecher BIRS Workshop, Banff, Canada, October 25-29, 2010 T. Stykel. Model
More informationWHILE designing VLSI chips, engineers need to take
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS TurboMOR-RC: an Efficient Model Order Reduction Technique for RC Networks with Many Ports Denis Oyaro, Student Member, IEEE, and Piero
More informationBlock oriented model order reduction of interconnected systems
INTERNATIONAL JOURNAL OF NUMERICAL MODELLING: ELECTRONIC NETWORKS, DEVICES AND FIELDS [Version: 2002/09/18 v1.01] Block oriented model order reduction of interconnected systems Jorge Fernández Villena
More informationArchitecture-level Thermal Behavioral Models For Quad-Core Microprocessors
Architecture-level Thermal Behavioral Models For Quad-Core Microprocessors Duo Li Dept. of Electrical Engineering University of California Riverside, CA 951 dli@ee.ucr.edu Sheldon X.-D. Tan Dept. of Electrical
More informationPassivity Preserving Model Reduction for Large-Scale Systems. Peter Benner.
Passivity Preserving Model Reduction for Large-Scale Systems Peter Benner Mathematik in Industrie und Technik Fakultät für Mathematik Sonderforschungsbereich 393 S N benner@mathematik.tu-chemnitz.de SIMULATION
More informationModel Order Reduction of Fully Parameterized Systems by Recursive Least Square Optimization
Model Order Reduction of Fully Parameterized Systems by Recursive Least Square Optimization Zheng Zhang, Ibrahim (Abe) M. Elfadel, and Luca Daniel Research Lab of Electronics, Massachusetts Institute of
More informationProperties of Matrices and Operations on Matrices
Properties of Matrices and Operations on Matrices A common data structure for statistical analysis is a rectangular array or matris. Rows represent individual observational units, or just observations,
More informationME 234, Lyapunov and Riccati Problems. 1. This problem is to recall some facts and formulae you already know. e Aτ BB e A τ dτ
ME 234, Lyapunov and Riccati Problems. This problem is to recall some facts and formulae you already know. (a) Let A and B be matrices of appropriate dimension. Show that (A, B) is controllable if and
More informationParallel VLSI CAD Algorithms. Lecture 1 Introduction Zhuo Feng
Parallel VLSI CAD Algorithms Lecture 1 Introduction Zhuo Feng 1.1 Prof. Zhuo Feng Office: EERC 513 Phone: 487-3116 Email: zhuofeng@mtu.edu Class Website http://www.ece.mtu.edu/~zhuofeng/ee5900spring2012.html
More informationStructure-Preserving Model Order Reduction of RCL Circuit Equations
Structure-Preserving Model Order Reduction of RCL Circuit Equations Roland W. Freund Department of Mathematics, University of California at Davis, One Shields Avenue, Davis, CA 95616, U.S.A. freund@math.ucdavis.edu
More informationComputing Transfer Function Dominant Poles of Large Second-Order Systems
Computing Transfer Function Dominant Poles of Large Second-Order Systems Joost Rommes Mathematical Institute Utrecht University rommes@math.uu.nl http://www.math.uu.nl/people/rommes joint work with Nelson
More informationEfficient Reluctance Extraction for Large-Scale Power Grid with High- Frequency Consideration
Efficient Reluctance Extraction for Large-Scale Power Grid with High- Frequency Consideration Shan Zeng, Wenjian Yu, Jin Shi, Xianlong Hong Dept. Computer Science & Technology, Tsinghua University, Beijing
More informationMODEL REDUCTION BY A CROSS-GRAMIAN APPROACH FOR DATA-SPARSE SYSTEMS
MODEL REDUCTION BY A CROSS-GRAMIAN APPROACH FOR DATA-SPARSE SYSTEMS Ulrike Baur joint work with Peter Benner Mathematics in Industry and Technology Faculty of Mathematics Chemnitz University of Technology
More informationH 2 optimal model reduction - Wilson s conditions for the cross-gramian
H 2 optimal model reduction - Wilson s conditions for the cross-gramian Ha Binh Minh a, Carles Batlle b a School of Applied Mathematics and Informatics, Hanoi University of Science and Technology, Dai
More informationModel reduction for linear systems by balancing
Model reduction for linear systems by balancing Bart Besselink Jan C. Willems Center for Systems and Control Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen, Groningen,
More informationModel Order-Reduction of RC(L) Interconnect including Variational Analysis
_ Model Order-Reduction of RC(L) Interconnect including Variational Analysis Ying Liu, Lawrence T. Pileggi and Andrzej J. Strojwas Department of Electrical and Computer Engineering Carnegie Mellon University
More informationStochastic Capacitance Extraction Considering Process Variation with Spatial Correlation
Stochastic Capacitance Extraction Considering Process Variation with Spatial Correlation Tuck Chan EE Department UCLA, CA 90095 tuckie@ucla.edu Fang Gong EE Department UCLA, CA 90095 gongfang@ucla.edu
More informationChapter 6 Balanced Realization 6. Introduction One popular approach for obtaining a minimal realization is known as Balanced Realization. In this appr
Lectures on ynamic Systems and Control Mohammed ahleh Munther A. ahleh George Verghese epartment of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter 6 Balanced
More informationA Hierarchical Analysis Methodology for Chip-Level Power Delivery with Realizable Model Reduction
A Hierarchical Analysis Methodology for Chip-Level Power Delivery with Realizable Model Reduction Yu-Min Lee Electrical and Computer Engineering University of Wisconsin at Madison Charlie Chung-Ping Chen
More information3 Gramians and Balanced Realizations
3 Gramians and Balanced Realizations In this lecture, we use an optimization approach to find suitable realizations for truncation and singular perturbation of G. It turns out that the recommended realizations
More informationKrylov-Subspace Based Model Reduction of Nonlinear Circuit Models Using Bilinear and Quadratic-Linear Approximations
Krylov-Subspace Based Model Reduction of Nonlinear Circuit Models Using Bilinear and Quadratic-Linear Approximations Peter Benner and Tobias Breiten Abstract We discuss Krylov-subspace based model reduction
More informationCME 345: MODEL REDUCTION
CME 345: MODEL REDUCTION Balanced Truncation Charbel Farhat & David Amsallem Stanford University cfarhat@stanford.edu These slides are based on the recommended textbook: A.C. Antoulas, Approximation of
More informationFast Analysis of Structured Power Grid by Triangularization Based Structure Preserving Model Order Reduction
1 Fast Analysis of Structured Power Grid by Triangularization Based Structure Preserving Model Order Reduction Hao Yu, Yiyu Shi, and Lei He Electrical Engineering Department University of California, Los
More informationBALANCING-RELATED MODEL REDUCTION FOR DATA-SPARSE SYSTEMS
BALANCING-RELATED Peter Benner Professur Mathematik in Industrie und Technik Fakultät für Mathematik Technische Universität Chemnitz Computational Methods with Applications Harrachov, 19 25 August 2007
More informationAutomatic Generation of Geometrically Parameterized Reduced Order Models for Integrated Spiral RF-Inductors
Automatic Generation of Geometrically Parameterized Reduced Order Models for Integrated Spiral RF-Inductors Luca Daniel Massachusetts Institute of Technology Dept. of Elect. Engin. and Comp. Science Research
More informationModel-Order Reduction of High-Speed Interconnects: Challenges and Opportunities
Model-Order Reduction of High-Speed Interconnects: Challenges and Opportunities Michel Nakhla Carleton University Canada Model Reduction for Complex Dynamical Systems Berlin 2010 EMI Delay Crosstalk Reflection
More informationA Novel Approach for Generating Dynamic Compact Models of Thermal Networks Having Large Numbers of Power Sources
A Novel Approach for Generating Dynamic Compact Models of Thermal Networks Having Large Numbers of Power Sources Lorenzo Codecasa, Dario D Amore, Paolo Maffezzoni and Nadia Spennagallo Dipartimento di
More informationReluctance/Inductance Matrix under
Generating Stable and Sparse Reluctance/Inductance Matrix under Insufficient Conditions Y. Tanji, Kagawa University, Japan T. Watanabe, The University it of Shizuoka, Japan H. Asai, Shizuoka University,
More informationModel reduction of interconnected systems
Model reduction of interconnected systems A Vandendorpe and P Van Dooren 1 Introduction Large scale linear systems are often composed of subsystems that interconnect to each other Instead of reducing the
More informationA Solenoidal Basis Method For Efficient Inductance Extraction Λ
A Solenoidal Basis Method For Efficient Inductance Extraction Λ Hemant Mahawar Department of Computer Science Texas A&M University College Station, TX 77843 mahawarh@cs.tamu.edu Vivek Sarin Department
More informationSUCCESSIVE POLE SHIFTING USING SAMPLED-DATA LQ REGULATORS. Sigeru Omatu
SUCCESSIVE POLE SHIFING USING SAMPLED-DAA LQ REGULAORS oru Fujinaka Sigeru Omatu Graduate School of Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Sakai, 599-8531 Japan Abstract: Design of sampled-data
More informationAdvanced Computational Methods for VLSI Systems. Lecture 4 RF Circuit Simulation Methods. Zhuo Feng
Advanced Computational Methods for VLSI Systems Lecture 4 RF Circuit Simulation Methods Zhuo Feng 6. Z. Feng MTU EE59 Neither ac analysis nor pole / zero analysis allow nonlinearities Harmonic balance
More informationSystem Level Modeling of Microsystems using Order Reduction Methods
System Level Modeling of Microsystems using Order Reduction Methods Sven Reitz, Jens Bastian, Joachim Haase, Peter Schneider, Peter Schwarz Fraunhofer Institute for Integrated Circuits, Branch Lab Design
More informationAn iterative SVD-Krylov based method for model reduction of large-scale dynamical systems
An iterative SVD-Krylov based method for model reduction of large-scale dynamical systems Serkan Gugercin Department of Mathematics, Virginia Tech., Blacksburg, VA, USA, 24061-0123 gugercin@math.vt.edu
More informationModel Reduction for Linear Dynamical Systems
Summer School on Numerical Linear Algebra for Dynamical and High-Dimensional Problems Trogir, October 10 15, 2011 Model Reduction for Linear Dynamical Systems Peter Benner Max Planck Institute for Dynamics
More informationModel Order Reduction of Continuous LTI Large Descriptor System Using LRCF-ADI and Square Root Balanced Truncation
, July 1-3, 15, London, U.K. Model Order Reduction of Continuous LI Large Descriptor System Using LRCF-ADI and Square Root Balanced runcation Mehrab Hossain Likhon, Shamsil Arifeen, and Mohammad Sahadet
More informationINDUCTWISE: Inductance-Wise Interconnect Simulator and Extractor
884 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 22, NO. 7, JULY 2003 INDUCTWISE: Inductance-Wise Interconnect Simulator and Extractor Tsung-Hao Chen, Clement Luk,
More informationH 2 -optimal model reduction of MIMO systems
H 2 -optimal model reduction of MIMO systems P. Van Dooren K. A. Gallivan P.-A. Absil Abstract We consider the problem of approximating a p m rational transfer function Hs of high degree by another p m
More informationChapter 6 Balanced Realization 6. Introduction One popular approach for obtaining a minimal realization is known as Balanced Realization. In this appr
Lectures on ynamic Systems and Control Mohammed ahleh Munther A. ahleh George Verghese epartment of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter 6 Balanced
More informationPassive reduced-order modeling via Krylov-subspace methods
Passive reduced-order modeling via Krylov-subspace methods Roland W. Freund Bell Laboratories Room 2C 525 700 Mountain Avenue Murray Hill, New Jersey 07974 0636, U.S.A. freund@research.bell-labs.com Keywords:
More informationClustering-Based Model Order Reduction for Multi-Agent Systems with General Linear Time-Invariant Agents
Max Planck Institute Magdeburg Preprints Petar Mlinarić Sara Grundel Peter Benner Clustering-Based Model Order Reduction for Multi-Agent Systems with General Linear Time-Invariant Agents MAX PLANCK INSTITUT
More informationSparse Implicit Projection (SIP) for Reduction of General Many-Terminal Networks
Sparse mplicit Projection (SP) for Reduction of General Many-Terminal Networks Zuochang Ye, Dmitry Vasilyev, Zhenhai Zhu, Joel R. Phillips Cadence Research Laboratories Massachusetts nstitute of Technology
More informationKSim: A Stable and Efficient RKC Simulator for Capturing On-Chip Inductance Effect
KSim: A Stable and Efficient KC Simulator for Capturing OnChip Inductance Effect Hao Ji Anirudh Devgan Wayne Dai UC Santa Cruz CE Dept IBM Microelectronics UC Santa Cruz CE Dept Santa Cruz, CA 90 Austin,
More informationStability and Passivity of the Super Node Algorithm for EM Modeling of IC s
Stability and Passivity of the Super Node Algorithm for EM Modeling of IC s M.V. Ugryumova and W.H.A. Schilders Abstract The super node algorithm performs model order reduction based on physical principles.
More informationSome of the different forms of a signal, obtained by transformations, are shown in the figure. jwt e z. jwt z e
Transform methods Some of the different forms of a signal, obtained by transformations, are shown in the figure. X(s) X(t) L - L F - F jw s s jw X(jw) X*(t) F - F X*(jw) jwt e z jwt z e X(nT) Z - Z X(z)
More informationFREQUENCY-WEIGHTED MODEL REDUCTION METHOD WITH ERROR BOUNDS FOR 2-D SEPARABLE DENOMINATOR DISCRETE SYSTEMS
INERNAIONAL JOURNAL OF INFORMAION AND SYSEMS SCIENCES Volume 1, Number 2, Pages 105 119 c 2005 Institute for Scientific Computing and Information FREQUENCY-WEIGHED MODEL REDUCION MEHOD WIH ERROR BOUNDS
More informationIEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 17, NO. 10, OCTOBER
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL 17, NO 10, OCTOBER 2009 1495 Architecture-Level Thermal Characterization for Multicore Microprocessors Duo Li, Student Member, IEEE,
More informationAn Algorithmic Framework of Large-Scale Circuit Simulation Using Exponential Integrators
An Algorithmic Framework of Large-Scale Circuit Simulation Using Exponential Integrators Hao Zhuang 1, Wenjian Yu 2, Ilgweon Kang 1, Xinan Wang 1, and Chung-Kuan Cheng 1 1. University of California, San
More informationarxiv: v3 [math.na] 6 Jul 2018
A Connection Between Time Domain Model Order Reduction and Moment Matching for LTI Systems arxiv:181.785v3 [math.na] 6 Jul 218 Manuela Hund a and Jens Saak a a Max Planck Institute for Dynamics of Complex
More informationBalanced Truncation 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 2004: MODEL REDUCTION Balanced Truncation This lecture introduces balanced truncation for LTI
More informationModel Order Reduction using SPICE Simulation Traces. Technical Report
Model Order Reduction using SPICE Simulation Traces Paul Winkler, Henda Aridhi, and Sofiène Tahar Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada pauwink@web.de,
More informationAutomatic Generation of Geometrically Parameterized Reduced Order Models for Integrated Spiral RF-Inductors
Automatic Generation of Geometrically Parameterized Reduced Order Models for Integrated Spiral RF-Inductors L. Daniel and J. White Department of Electrical Engineering and Computer Science Research Lab
More informationA New Subspace Identification Method for Open and Closed Loop Data
A New Subspace Identification Method for Open and Closed Loop Data Magnus Jansson July 2005 IR S3 SB 0524 IFAC World Congress 2005 ROYAL INSTITUTE OF TECHNOLOGY Department of Signals, Sensors & Systems
More informationWindow-Based Susceptance Models for Large-Scale RLC Circuit Analyses
Window-Based Susceptance Models for arge-scale R ircuit Analyses Hui Zheng, Byron Krauter 2, Michael Beattie, awrence Pileggi ABSTRAT Due to the increasing operating frequencies and the manner in which
More informationModel reduction of large-scale dynamical systems
Model reduction of large-scale dynamical systems Lecture III: Krylov approximation and rational interpolation Thanos Antoulas Rice University and Jacobs University email: aca@rice.edu URL: www.ece.rice.edu/
More information1556 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 18, NO. 11, NOVEMBER 2010
1556 IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL 18, NO 11, NOVEMBER 2010 Variational Capacitance Extraction and Modeling Based on Orthogonal Polynomial Method Ruijing Shen, Student
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationPassivity Assessment and Model Order Reduction for Linear Time-Invariant Descriptor Systems in VLSI Circuit Simulation.
Abstract of thesis entitled Passivity Assessment and Model Order Reduction for Linear Time-Invariant Descriptor Systems in VLSI Circuit Simulation Submitted by Zheng ZHANG for the degree of Master of Philosophy
More informationModel Order Reduction for Systems with Non-Rational Transfer Function Arising in Computational Electromagnetics
Model Order Reduction for Systems with Non-Rational Transfer Function Arising in Computational Electromagnetics Lihong Feng and Peter Benner Abstract We consider model order reduction of a system described
More informationModel order reduction of large-scale dynamical systems with Jacobi-Davidson style eigensolvers
MAX PLANCK INSTITUTE International Conference on Communications, Computing and Control Applications March 3-5, 2011, Hammamet, Tunisia. Model order reduction of large-scale dynamical systems with Jacobi-Davidson
More informationLecture 10. Lecturer: Aleksander Mądry Scribes: Mani Bastani Parizi and Christos Kalaitzis
CS-621 Theory Gems October 18, 2012 Lecture 10 Lecturer: Aleksander Mądry Scribes: Mani Bastani Parizi and Christos Kalaitzis 1 Introduction In this lecture, we will see how one can use random walks to
More informationFEL3210 Multivariable Feedback Control
FEL3210 Multivariable Feedback Control Lecture 8: Youla parametrization, LMIs, Model Reduction and Summary [Ch. 11-12] Elling W. Jacobsen, Automatic Control Lab, KTH Lecture 8: Youla, LMIs, Model Reduction
More informationSystem Identification by Nuclear Norm Minimization
Dept. of Information Engineering University of Pisa (Italy) System Identification by Nuclear Norm Minimization eng. Sergio Grammatico grammatico.sergio@gmail.com Class of Identification of Uncertain Systems
More informationImplementation of a Transmission Line Model with the PEEC Method for Lightning Surge Analysis
Implementation of a Transmission Line Model with the PEEC Method for Lightning Surge Analysis PEERAWUT YUTTHAGOWITH Department of Electrical Engineering, Faculty of Engineering King Mongkut s Institute
More informationKrylov Subspace Methods for Nonlinear Model Reduction
MAX PLANCK INSTITUT Conference in honour of Nancy Nichols 70th birthday Reading, 2 3 July 2012 Krylov Subspace Methods for Nonlinear Model Reduction Peter Benner and Tobias Breiten Max Planck Institute
More informationMATH 221, Spring Homework 10 Solutions
MATH 22, Spring 28 - Homework Solutions Due Tuesday, May Section 52 Page 279, Problem 2: 4 λ A λi = and the characteristic polynomial is det(a λi) = ( 4 λ)( λ) ( )(6) = λ 6 λ 2 +λ+2 The solutions to the
More informationScattering Parameters
Berkeley Scattering Parameters Prof. Ali M. Niknejad U.C. Berkeley Copyright c 2016 by Ali M. Niknejad September 7, 2017 1 / 57 Scattering Parameters 2 / 57 Scattering Matrix Voltages and currents are
More informationComputing tomographic resolution matrices using Arnoldi s iterative inversion algorithm
Stanford Exploration Project, Report 82, May 11, 2001, pages 1 176 Computing tomographic resolution matrices using Arnoldi s iterative inversion algorithm James G. Berryman 1 ABSTRACT Resolution matrices
More informationModel-Order Reduction Using Variational Balanced Truncation with Spectral Shaping
Model-Order Reduction Using Variational Balanced runcation with Spectral Shaping Payam Heydari Department of Electrical Engineering and Computer Science University of California Irvine, CA 92697-2625 Massoud
More informationFourier Model Reduction for Large-Scale Applications in Computational Fluid Dynamics
Fourier Model Reduction for Large-Scale Applications in Computational Fluid Dynamics K. Willcox and A. Megretski A new method, Fourier model reduction (FMR), for obtaining stable, accurate, low-order models
More informationAn iterative SVD-Krylov based method for model reduction of large-scale dynamical systems
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 1964 1986 www.elsevier.com/locate/laa An iterative SVD-Krylov based method for model reduction of large-scale dynamical
More information6.241 Dynamic Systems and Control
6.241 Dynamic Systems and Control Lecture 24: H2 Synthesis Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology May 4, 2011 E. Frazzoli (MIT) Lecture 24: H 2 Synthesis May
More informationModel reduction of coupled systems
Model reduction of coupled systems Tatjana Stykel Technische Universität Berlin ( joint work with Timo Reis, TU Kaiserslautern ) Model order reduction, coupled problems and optimization Lorentz Center,
More informationPAPER A Fast Delay Computation for the Hybrid Structured Clock Network
1964 PAPER A Fast Delay Computation for the Hybrid Structured Clock Network Yi ZOU a), Student Member, Yici CAI b), Qiang ZHOU c), Xianlong HONG d), and Sheldon X.-D. TAN e), Nonmembers SUMMARY This paper
More informationTwo-Sided Arnoldi in Order Reduction of Large Scale MIMO Systems
Two-Sided Arnoldi in Order Reduction of Large Scale MIMO Systems B. Salimbahrami and B. Lohmann Institute of Automation, University of Bremen Otto-Hahn-Allee, NW1 28359 Bremen, Germany e-mail: salimbahrami@iat.uni-bremen.de
More informationAn efficient DC-gain matched balanced truncation realization for VLSI interconnect circuit order reduction
Microelectronic Engineering 60 (00) 15 www.elsevier.com/ locate/ mee An efficient DC-gain matched balanced truncation realization for VLSI interconnect circuit order reduction Xuan Zeng *, Dian Zhou, Wei
More informationw T 1 w T 2. w T n 0 if i j 1 if i = j
Lyapunov Operator Let A F n n be given, and define a linear operator L A : C n n C n n as L A (X) := A X + XA Suppose A is diagonalizable (what follows can be generalized even if this is not possible -
More informationEXERCISES ON DETERMINANTS, EIGENVALUES AND EIGENVECTORS. 1. Determinants
EXERCISES ON DETERMINANTS, EIGENVALUES AND EIGENVECTORS. Determinants Ex... Let A = 0 4 4 2 0 and B = 0 3 0. (a) Compute 0 0 0 0 A. (b) Compute det(2a 2 B), det(4a + B), det(2(a 3 B 2 )). 0 t Ex..2. For
More informationScattering Matrices for Nonuniform Multiconductor Transmission Lines
Interaction Notes Note 596 29 March 2005 Scattering Matrices for Nonuniform Multiconductor ransmission Lines Carl E. Baum Air Force Research Laboratory Directed Energy Directorate Abstract A section of
More informationPeter C. Müller. Introduction. - and the x 2 - subsystems are called the slow and the fast subsystem, correspondingly, cf. (Dai, 1989).
Peter C. Müller mueller@srm.uni-wuppertal.de Safety Control Engineering University of Wuppertal D-497 Wupperta. Germany Modified Lyapunov Equations for LI Descriptor Systems or linear time-invariant (LI)
More informationCANONICAL LOSSLESS STATE-SPACE SYSTEMS: STAIRCASE FORMS AND THE SCHUR ALGORITHM
CANONICAL LOSSLESS STATE-SPACE SYSTEMS: STAIRCASE FORMS AND THE SCHUR ALGORITHM Ralf L.M. Peeters Bernard Hanzon Martine Olivi Dept. Mathematics, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht,
More informationVector Potential Equivalent Circuit Based on PEEC Inversion
1 Vector Potential Equivalent Circuit Based on PEEC Inversion Hao Yu, Student Member, IEEE, Lei He, Member, IEEE Abstract The geometry-integration based vector potential equivalent circuit (VPEC) was introduced
More informationA Structure-Preserving Method for Large Scale Eigenproblems. of Skew-Hamiltonian/Hamiltonian (SHH) Pencils
A Structure-Preserving Method for Large Scale Eigenproblems of Skew-Hamiltonian/Hamiltonian (SHH) Pencils Yangfeng Su Department of Mathematics, Fudan University Zhaojun Bai Department of Computer Science,
More informationFrequency-Domain Balanced Stochastic Truncation for Continuous and Discrete Time Systems
80 International Journal of Control, Hamid Automation, Reza Shaker and Systems, vol. 6, no. 2, pp. 80-85, April 2008 Frequency-Domain Balanced Stochastic runcation for Continuous and Discrete ime Systems
More information