Transient Sensitivity Analysis CASA Day 13th Nov 2007 Zoran Ilievski. Zoran Ilievski Transient Sensitivity Analysis
|
|
- Nathaniel Clark
- 5 years ago
- Views:
Transcription
1 CASA Day 13th Nov 2007
2 Talk Structure
3 Talk Structure Introduction
4 Talk Structure Introduction Recap Sensitivity
5 Talk Structure Introduction Recap Sensitivity Examples and Results
6 Talk Structure Introduction Recap Sensitivity Examples and Results Further Work
7 Talk Structure Introduction Recap Sensitivity Examples and Results Further Work
8 Introduction State Sensitivity L & W will gives R Which will change the states/voltages x(t)
9 Introduction Function Sensitivity More complex functions such as Gain are expressions based on these states and parameters. As parameters change, the Gain (or other functions) will also change.
10 Introduction - Circuit DAE Description d [q(x(t))] + j(x(t)) = s(t) dt x(t) R N is the state vector. j & q are current and charge densities s(t) contains all source values. Solve the DAE obtained from Kirchhoffs laws, to find behaviour.
11 Introduction - The influence of a parameter P d [q(x(t, p), p)] + j(x(t, p), p) = s(t, p) (1) dt p R P is the parameter vector. Optimisation is done by adjusting these parameters. How sensitive are the states x(t) R N to these adjustments? How does a circuits behaviour respond? What is the observed sensitivity of the circuit function?
12 Introduction - State sensitivity ˆx is the sensitivity of the states x to a parameters p, given by. ˆx(t, p) x(t, p)/ p R NxP How are these state sensitivities calculated? What is the operation cost of calculating the observation function sensitivities dependant upon these sate sensitivities?
13 Introduction - Circuit Observation Functions G f (x(p), p) = T 0 F(x(t, p), p)dt. (2) d dp G f (x(p), p) = T 0 F x F ˆx + dt. (3) p The Gain of an amplifier circuit can be called the observation function of that design You can see that the state sensitivity is central to the overall function sensitivity The cost of ˆx is the main burden.
14 Introduction How are these state and observation sensitivities calculated?
15 Introduction Recap Sensitivity Examples and Results Further Work
16 Recap - State sensitivity Backward-Euler (more generally: BDF) is applied: 1 t [q(xn+1 ) q(x n )] + j(x n+1 ) s(t n+1 ) = 0 (4) Newton-Raphson solution involves the coefficient matrix Y = 1 t C + G, in which C = q/ x and G = j/ x We now know q, j and s at each time point t
17 Recap - State sensitivity Differentiation w.r.t. parameter P gives: 0 = 1 n+1 t [ q p After slight re-arrangement: q n ] + 1 p t [Cˆxn+1 Cˆx n ] + Gˆx n+1 + j p s p n+1 ((1/ t)c + G) ˆx n+1 = 1 }{{} t [ q q ] + (1/ t)cˆx n j p p p + s p Y }{{} f n
18 Recap - State sensitivity - Cost ˆx n+1 (p) = Y 1 f, in which f = 1 n+1 t [ q p q n ] j n+1 p p + s n p t Cˆxn (p). The vector f requires O(PN 2 ) operations for the 1 t Cˆxn (p) term In addition O(PN) evaluations for each other term Solving the system requires an additional O(PN 2 ) operations.
19 Recap - Circuit Observation Functions We now have an analysis of ˆx But what part does ˆx play in the sensitivity analysis of any observation function. G f (x(p), p) = T 0 F(x(t, p), p)dt.
20 Recap - Circuit Observation Functions G f (x(p), p) = T 0 F(x(t, p), p)dt. d dp G f (x(p), p) = T 0 F F ˆx + x p dt. You can see that the state sensitivity is central to the overall function sensitivity. The cost of ˆx is the main burden.
21 Recap - Direct Forward Method It is no supprise that the emphasis in sensitivity analysis is the efficient calculation of ˆx or indeed the inner product. F F ˆx = x x.y 1 f = [Y T [ F x ]T ] T f This can be calculated in O(min(F, P)N 2 + FPN) operations. This is for the Direct Forward Method Circuits often contain many thousands of parameters, need a better method.
22 Recap - Backward Adjoint Method Small N Large Circuits, Large N Direct Foward Feasible Expensive Backward Adjoint Feasible Elimination of ˆx, and so reducing the complexity is done using a backward integration technique. An less expensive expression of the observation sensitivity in terms of λ(t)
23 Recap - Backward Adjoint Method - general λ expression [λ dq dp ] T 0 + T 0 [ ( dλ dt C λ G)ˆx dλ q dt p + λ ( j p s p )]dt = 0
24 Recap - Backward Adjoint Method - general λ expression [λ dq dp ] T 0 + T 0 [ ( dλ dt C λ G)ˆx dλ q dt p + λ ( j p s p )]dt = 0 This result holds for any λ
25 Recap - Backward Adjoint Method - general λ expression [λ dq dp ] T 0 + T 0 [ ( dλ dt C λ G)ˆx dλ q dt p + λ ( j p s p )]dt = 0 This result holds for any λ The motivation behind the selectin of λ is to eliminate ˆx in d dp G f (x(p), p) = T 0 F F ˆx + x p dt.
26 Recap - Backward Adjoint Method - general λ expression [λ dq dp ] T 0 + T 0 [ ( dλ dt C λ G)ˆx dλ q dt p + λ ( j p s p )]dt = 0 This result holds for any λ The motivation behind the selectin of λ is to eliminate ˆx in d dp G f (x(p), p) = T 0 F F ˆx + x p dt.
27 Recap - Backward Adjoint Method - general λ expression d dp G f (x(p), p) = T 0 F F ˆx + x p dt.
28 Recap - Backward Adjoint Method - general λ expression d dp G f (x(p), p) = T 0 F F ˆx + x p dt. d dp G f (x(p), p) = T 0 [ dλ dt C + λ G]ˆx + F p dt.
29 Recap - Backward Adjoint Method - general λ expression d dp G f (x(p), p) = T 0 F F ˆx + x p dt. d dp G f (x(p), p) = T 0 [ dλ dt C + λ G]ˆx + F p dt. C dλ dt G λ = ( F x ). The natural conclusion is that this linear adjoint DAE is the constraint on λ
30 Recap - Backward Adjoint Equation This linear adjoint DAE is the constraint on λ C dλ dt G λ = ( F x ).
31 Recap - Backward Adjoint Equation This linear adjoint DAE is the constraint on λ The sensitivity can be rewritten in terms of λ if it satisfies the adjoint DAE C dλ dt G λ = ( F x ).
32 Recap - Backward Adjoint Equation Alternative: Substituting the general λ equation the sensitivity can be expressed as follows, d dp G 2(x(p), p) = [λ (t) dq ( T dλ 0 dt dp ] T t=0 + q p λ ( j p s p ) + F p ) dt.
33 Recap - Backward Adjoint Equation - initial conditions [λ (t)( q q x.ˆx + p )] T t=0
34 Recap - Backward Adjoint Equation - initial conditions [λ (t)( q q x.ˆx + p )] T t=0 ˆx(t = T ) can be eliminated, if λ(t ) = 0
35 Recap - Backward Adjoint Equation - initial conditions [λ (t)( q q x.ˆx + p )] T t=0 ˆx(t = T ) can be eliminated, if λ(t ) = 0 With this choice the sensitivity expression simplifies to, d dp G 2(x(p), p) = λ (0)[ q x (0).ˆx DC + q p (0)] + T 0 dλ dt q p λ ( j p s p ) + F dt. (5) p
36 Recap - Backward Adjoint Equation - Summary Standard transient analysis of forward system, initial condition are set at t=0 d [q(x(t, p), p)] + j(x(t, p), p) = s(t, p) dt Solution of Backward Adjoint Equation Each time integration step requires O(FN 2 ) operations. Initial condition are set at t=t, λ(t )=0 C dλ dt G λ = ( F x ).
37 Recap - Backward Adjoint Equation - Summary BAE is always linear, even though original equation is nonlinear. C dλ dt G λ = ( F x ).
38 Recap - Backward Adjoint Equation - Summary substitution of λ values to obtain the observation sensitivity The integrand at each time point requires O(PN + FP) operations and O(FPN) evaluations d dp G 2(x(p), p) = λ (0)[ q x (0).ˆx DC + q p (0)] + T 0 dλ dt q p λ ( j p s p ) + F p dt.
39 Method Table Direct Foward Backward Adjoint Cost O(min(F, P), N 2 ) + O(FPN) O(FN + FP) + O(FPN) Usualy F << N
40 Talk Structure Introduction Recap Sensitivity Examples and Results Further Work
41 Backward Adjoint Equation - Reduction C dλ dt G λ = ( F x ). Each time integration step requires an LU decomposition of O(N α ) α=2 for a sparce system and α=3 for a full system This brings the total cost to O(N α + FN 2 ) F << P, in practice Quite a large cost for a large system, N. What if we could project this system on to a n << N dimensional subspace?
42 Proper Orthogonal Decomposition - Reduction C and G are large N x N, matrices As we have seen, costly system to solve Would like to reduce this cost
43 Proper Orthogonal Decomposition - Reduction V T V = I r Given a collection of functions x(t 1 ), x(t 1 ),...x(t M ) in X Find subspace X r X so to minimize the error, Σ M j=1 = x j V T ˆx j 2
44 Proper Orthogonal Decomposition - Reduction
45 Proper Orthogonal Decomposition - Reduction For any system, in the state analysis we obtain, X = [x(t 1 ), x(t 2 )...x(t nsnapshots ))] R nsnapshotsxn (6) Next an SVD is computed giving, X = V ΣU V n Σ n U nn << N (7) As long as the singular values decay rapidly the system can be reduced x r = V k x(t), x r R n
46 Proper Orthogonal Decomposition - Reduction Reduction methods differ in the way V is selected
47 Proper Orthogonal Decomposition - Reduction Reduction methods differ in the way V is selected POD produces data dependant bases, from existing snapshots
48 Proper Orthogonal Decomposition - Reduction Reduction methods differ in the way V is selected POD produces data dependant bases, from existing snapshots We already have snapshot data from the foward analysis.
49 Proper Orthogonal Decomposition - Reduction Reduction methods differ in the way V is selected POD produces data dependant bases, from existing snapshots We already have snapshot data from the foward analysis. We can form a POD basis for the forward analysis.
50 Proper Orthogonal Decomposition - Reduction Reduction methods differ in the way V is selected POD produces data dependant bases, from existing snapshots We already have snapshot data from the foward analysis. We can form a POD basis for the forward analysis. Can we reduce the backward adjoint method with the same basis?
51 Backward Adjoint Equation - Reduction Find a projection matrix, V to reduce the system to size n. n << N For highly non-linear circuits, POD is a good choice. V is constructed from the left eigen vectors corresponding to the most dominant singular values. As long as the decay in singular values is rapid the system can be reduced.
52 Backward Adjoint Equation - Reduction The projection matrix is applied as follows V C V dλ dt V G Vλ = V ( F x ). Ĉ dˆλ dt Ĝ ˆλ = ( F ˆ x ).
53 Backward Adjoint Equation - Reduction Ĉ dˆλ dt Ĝ ˆλ ˆ = ( F x ). λ can be obtained by projecting back on the the origional basis by V ˆλ This changes the cost contribution of N down to n. Where n << N, usually. A very attractive solution.
54 Results(1) - Direct Forward Sensitivity on Obf=Energy(I,R2) on R2, direct foward method, is e-008
55 Results(1) - Direct Forward Sensitivity Obf=Energy(I,R2) on R2, backward adjoint method, is e-008 Previous result was e-008 Promising result
56 Results(2) - Reduction Example length of R2 dg/dp dg/dp with POD x x x x x x10 10
57 Results(3) - Industrial Singular Value Analysis σ Use of internal PStar circuit simulation software Very good at supplying state snapshots, which can be recorded and used in Matlab. Value σ σ σ σ σ [V S U]=svd(states ); diag(s)
58 Results(3) - Industrial Example The rapid decay is singular values is promising, it shows a nice POD basis can be formed.
59 Talk Structure Introduction Recap Sensitivity Examples and Results Further Work
60 Conclusions and Further Work We have written the BAE in forward form, We use again the x(t-t) data in the state analysis, for the observation function. Form a POD bases for the state analysis. Attempt to apply the same pod bases to the backward step.
61 Conclusions and Further Work Further Work For a simple circuit, we have had some success. But were we just lucky. Can we apply the POD basis on all circuits? Collaborative work on the thory behind the application of POD is being carried out on this at Wuppertal. We are aiming to submit an abstract for SCEE 2008 and a paper in the proceedings with the subject on POD for BAE methods.
62 The End THE END
63 Problem Description The task is to reduce the Tline and then plug it back in to the system. The important requirement is to keep the nodes V 1 and V 2 safe. Figure: Circuit with the Transmission Line
64 Modified Nodal Analysis for the Tline V 4 and V 5 are the internal nodes and V 1 and V 2 are the external pins for transmission line C A V 1 V 2 V 4 V 5 q1 q C A R R R R R R 0 0 R B R R R 0 0 C A C V 1 V 2 V 4 V 5 q 1 q = C B I 1 I C A
65 AMOR The AMOR is an Arnoldi based algorithm which is used PRIMA techniques inside to reduced the dynamical system. The form which AMOR accepts is like this: { Bu = Eẋ + Kx, y = Cx.
66 AMOR bellow figure shows how we can define the AMOR input for this TLINE. In block form we have: ( E ) ( u ẋ ) ( D C + B K ) ( u x ) = ( y 0 )
67 AMOR What if the T-Line is terminated with a capacitor? Can this submodel be completely reduced?
Adjoint Transient Sensitivity Analysis in Circuit Simulation
Ajoint Transient Sensitivity Analysis in Circuit Simulation Z. Ilievski 1, H. Xu 1, A. Verhoeven 1, E.J.W. ter Maten 1,2, W.H.A. Schilers 1,2 an R.M.M. Mattheij 1 1 Technische Universiteit Einhoven; e-mail:
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 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 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 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 informationModel Order Reduction
Model Order Reduction Wil Schilders NXP Semiconductors & TU Eindhoven November 26, 2009 Utrecht University Mathematics Staff Colloquium Outline Introduction and motivation Preliminaries Model order reduction
More informationCHAPTER 10: Numerical Methods for DAEs
CHAPTER 10: Numerical Methods for DAEs Numerical approaches for the solution of DAEs divide roughly into two classes: 1. direct discretization 2. reformulation (index reduction) plus discretization Direct
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 information10.34: Numerical Methods Applied to Chemical Engineering. Lecture 19: Differential Algebraic Equations
10.34: Numerical Methods Applied to Chemical Engineering Lecture 19: Differential Algebraic Equations 1 Recap Differential algebraic equations Semi-explicit Fully implicit Simulation via backward difference
More informationQuiescent Steady State (DC) Analysis The Newton-Raphson Method
Quiescent Steady State (DC) Analysis The Newton-Raphson Method J. Roychowdhury, University of California at Berkeley Slide 1 Solving the System's DAEs DAEs: many types of solutions useful DC steady state:
More informationOptimal control of nonstructured nonlinear descriptor systems
Optimal control of nonstructured nonlinear descriptor systems TU Berlin DFG Research Center Institut für Mathematik MATHEON Workshop Elgersburg 19.02.07 joint work with Peter Kunkel Overview Applications
More informationOrganization. I MCMC discussion. I project talks. I Lecture.
Organization I MCMC discussion I project talks. I Lecture. Content I Uncertainty Propagation Overview I Forward-Backward with an Ensemble I Model Reduction (Intro) Uncertainty Propagation in Causal Systems
More informationComputing Phase Noise Eigenfunctions Directly from Steady-State Jacobian Matrices
Computing Phase Noise Eigenfunctions Directly from Steady-State Jacobian Matrices Alper Demir David Long Jaijeet Roychowdhury Bell Laboratories Murray Hill New Jersey USA Abstract The main effort in oscillator
More information1.2 Derivation. d p f = d p f(x(p)) = x fd p x (= f x x p ). (1) Second, g x x p + g p = 0. d p f = f x g 1. The expression f x gx
PDE-constrained optimization and the adjoint method Andrew M. Bradley November 16, 21 PDE-constrained optimization and the adjoint method for solving these and related problems appear in a wide range of
More informationElectrical Circuits I
Electrical Circuits I This lecture discusses the mathematical modeling of simple electrical linear circuits. When modeling a circuit, one ends up with a set of implicitly formulated algebraic and differential
More informationAlgorithms for Periodic Steady State Analysis on Electric Circuits
Nat.Lab. Unclassified Report 804/99 Date of issue: 2/99 Algorithms for Periodic Steady State Analysis on Electric Circuits Master s Thesis S.H.M.J. Houben Unclassified Report cfl Philips Electronics 1999
More informationEN Applied Optimal Control Lecture 8: Dynamic Programming October 10, 2018
EN530.603 Applied Optimal Control Lecture 8: Dynamic Programming October 0, 08 Lecturer: Marin Kobilarov Dynamic Programming (DP) is conerned with the computation of an optimal policy, i.e. an optimal
More informationTutorial on Principal Component Analysis
Tutorial on Principal Component Analysis Copyright c 1997, 2003 Javier R. Movellan. This is an open source document. Permission is granted to copy, distribute and/or modify this document under the terms
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 informationPreliminary Examination in Numerical Analysis
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August 7, 06, 0 am pm. Submit solutions to four (and no more) of the following six problems. Show all your work, and justify
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 informationOptimisation and optimal control 1: Tutorial solutions (calculus of variations) t 3
Optimisation and optimal control : Tutorial solutions calculus of variations) Question i) Here we get x d ) = d ) = 0 Hence ṫ = ct 3 where c is an arbitrary constant. Integrating, xt) = at 4 + b where
More informationProper Orthogonal Decomposition (POD) for Nonlinear Dynamical Systems. Stefan Volkwein
Proper Orthogonal Decomposition (POD) for Nonlinear Dynamical Systems Institute for Mathematics and Scientific Computing, Austria DISC Summerschool 5 Outline of the talk POD and singular value decomposition
More informationJacobi-Davidson methods and preconditioning with applications in pole-zero analysis
Nat.Lab. Unclassified Report 2002/817 Date of issue: 05/2002 Jacobi-Davidson methods and preconditioning with applications in pole-zero analysis Master s Thesis Joost Rommes Unclassified Report 2002/817
More informationProblem 1 Cost of an Infinite Horizon LQR
THE UNIVERSITY OF TEXAS AT SAN ANTONIO EE 5243 INTRODUCTION TO CYBER-PHYSICAL SYSTEMS H O M E W O R K # 5 Ahmad F. Taha October 12, 215 Homework Instructions: 1. Type your solutions in the LATEX homework
More informationObservability. It was the property in Lyapunov stability which allowed us to resolve that
Observability We have seen observability twice already It was the property which permitted us to retrieve the initial state from the initial data {u(0),y(0),u(1),y(1),...,u(n 1),y(n 1)} It was the property
More informationFundamentals of Matrices
Maschinelles Lernen II Fundamentals of Matrices Christoph Sawade/Niels Landwehr/Blaine Nelson Tobias Scheffer Matrix Examples Recap: Data Linear Model: f i x = w i T x Let X = x x n be the data matrix
More informationPOLE PLACEMENT. Sadegh Bolouki. Lecture slides for ECE 515. University of Illinois, Urbana-Champaign. Fall S. Bolouki (UIUC) 1 / 19
POLE PLACEMENT Sadegh Bolouki Lecture slides for ECE 515 University of Illinois, Urbana-Champaign Fall 2016 S. Bolouki (UIUC) 1 / 19 Outline 1 State Feedback 2 Observer 3 Observer Feedback 4 Reduced Order
More informationSteady State Kalman Filter
Steady State Kalman Filter Infinite Horizon LQ Control: ẋ = Ax + Bu R positive definite, Q = Q T 2Q 1 2. (A, B) stabilizable, (A, Q 1 2) detectable. Solve for the positive (semi-) definite P in the ARE:
More informationC M. Bergische Universität Wuppertal. Fachbereich Mathematik und Naturwissenschaften
M A C M Bergische Universität Wuppertal Fachbereich Mathematik und Naturwissenschaften Institute of Mathematical Modelling, Analysis and Computational Mathematics (IMACM) Preprint BUW-IMACM 15/10 B. Tasić,
More informationPARTIAL DIFFERENTIAL EQUATIONS
MATHEMATICAL METHODS PARTIAL DIFFERENTIAL EQUATIONS I YEAR B.Tech By Mr. Y. Prabhaker Reddy Asst. Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad. SYLLABUS OF MATHEMATICAL
More informationA Robustness Optimization of SRAM Dynamic Stability by Sensitivity-based Reachability Analysis
ASP-DAC 2014 A Robustness Optimization of SRAM Dynamic Stability by Sensitivity-based Reachability Analysis Yang Song, Sai Manoj P. D. and Hao Yu School of Electrical and Electronic Engineering, Nanyang
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 informationEL 625 Lecture 10. Pole Placement and Observer Design. ẋ = Ax (1)
EL 625 Lecture 0 EL 625 Lecture 0 Pole Placement and Observer Design Pole Placement Consider the system ẋ Ax () The solution to this system is x(t) e At x(0) (2) If the eigenvalues of A all lie in the
More informationProper Orthogonal Decomposition. POD for PDE Constrained Optimization. Stefan Volkwein
Proper Orthogonal Decomposition for PDE Constrained Optimization Institute of Mathematics and Statistics, University of Constance Joined work with F. Diwoky, M. Hinze, D. Hömberg, M. Kahlbacher, E. Kammann,
More informationEE 581 Power Systems. Admittance Matrix: Development, Direct and Iterative solutions
EE 581 Power Systems Admittance Matrix: Development, Direct and Iterative solutions Overview and HW # 8 Chapter 2.4 Chapter 6.4 Chapter 6.1-6.3 Homework: Special Problem 1 and 2 (see handout) Overview
More information7.3 State Space Averaging!
7.3 State Space Averaging! A formal method for deriving the small-signal ac equations of a switching converter! Equivalent to the modeling method of the previous sections! Uses the state-space matrix description
More informationReview: control, feedback, etc. Today s topic: state-space models of systems; linearization
Plan of the Lecture Review: control, feedback, etc Today s topic: state-space models of systems; linearization Goal: a general framework that encompasses all examples of interest Once we have mastered
More informationOptimal Control. Quadratic Functions. Single variable quadratic function: Multi-variable quadratic function:
Optimal Control Control design based on pole-placement has non unique solutions Best locations for eigenvalues are sometimes difficult to determine Linear Quadratic LQ) Optimal control minimizes a quadratic
More information5. Observer-based Controller Design
EE635 - Control System Theory 5. Observer-based Controller Design Jitkomut Songsiri state feedback pole-placement design regulation and tracking state observer feedback observer design LQR and LQG 5-1
More informationA Trajectory Piecewise-Linear Approach to Model Order Reduction and Fast Simulation of Nonlinear Circuits and Micromachined Devices
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 22, NO. 2, FEBRUARY 2003 155 A Trajectory Piecewise-Linear Approach to Model Order Reduction and Fast Simulation of Nonlinear
More informationPassivity Preserving Model Reduction and Selection of Spectral Zeros M A R Y A M S A A D V A N D I
Passivity Preserving Model Reduction and Selection of Spectral Zeros M A R Y A M S A A D V A N D I Master of Science Thesis Stockholm, Sweden 28 Passivity Preserving Model Reduction and Selection of Spectral
More informationNumerical Optimal Control Overview. Moritz Diehl
Numerical Optimal Control Overview Moritz Diehl Simplified Optimal Control Problem in ODE path constraints h(x, u) 0 initial value x0 states x(t) terminal constraint r(x(t )) 0 controls u(t) 0 t T minimize
More informationGeneralized Gradient Descent Algorithms
ECE 275AB Lecture 11 Fall 2008 V1.1 c K. Kreutz-Delgado, UC San Diego p. 1/1 Lecture 11 ECE 275A Generalized Gradient Descent Algorithms ECE 275AB Lecture 11 Fall 2008 V1.1 c K. Kreutz-Delgado, UC San
More informationCDS Solutions to the Midterm Exam
CDS 22 - Solutions to the Midterm Exam Instructor: Danielle C. Tarraf November 6, 27 Problem (a) Recall that the H norm of a transfer function is time-delay invariant. Hence: ( ) Ĝ(s) = s + a = sup /2
More informationMATH 3511 Lecture 1. Solving Linear Systems 1
MATH 3511 Lecture 1 Solving Linear Systems 1 Dmitriy Leykekhman Spring 2012 Goals Review of basic linear algebra Solution of simple linear systems Gaussian elimination D Leykekhman - MATH 3511 Introduction
More informationNumerical approximation for optimal control problems via MPC and HJB. Giulia Fabrini
Numerical approximation for optimal control problems via MPC and HJB Giulia Fabrini Konstanz Women In Mathematics 15 May, 2018 G. Fabrini (University of Konstanz) Numerical approximation for OCP 1 / 33
More informationMethods for Computing Periodic Steady-State Jacob White
Introduction to Simulation - Lecture 15 Methods for Computing Periodic Steady-State Jacob White Thanks to Deepak Ramaswamy, Michal Rewienski, and Karen Veroy Outline Periodic Steady-state problems Application
More informationPseudoinverse & Moore-Penrose Conditions
ECE 275AB Lecture 7 Fall 2008 V1.0 c K. Kreutz-Delgado, UC San Diego p. 1/1 Lecture 7 ECE 275A Pseudoinverse & Moore-Penrose Conditions ECE 275AB Lecture 7 Fall 2008 V1.0 c K. Kreutz-Delgado, UC San Diego
More informationSynopsis of Numerical Linear Algebra
Synopsis of Numerical Linear Algebra Eric de Sturler Department of Mathematics, Virginia Tech sturler@vt.edu http://www.math.vt.edu/people/sturler Iterative Methods for Linear Systems: Basics to Research
More informationRecent developments for MOR in the electronics industry
Recent developments for MOR in the electronics industry Wil Schilders Reduced Order Models in Computational Science and Engineering Aachen, January 30-31, 2014 Full proposal oc-2013-1-15312 for a new COST
More informationThe HJB-POD approach for infinite dimensional control problems
The HJB-POD approach for infinite dimensional control problems M. Falcone works in collaboration with A. Alla, D. Kalise and S. Volkwein Università di Roma La Sapienza OCERTO Workshop Cortona, June 22,
More informationStatic and Dynamic Optimization (42111)
Static and Dynamic Optimization (421) Niels Kjølstad Poulsen Build. 0b, room 01 Section for Dynamical Systems Dept. of Applied Mathematics and Computer Science The Technical University of Denmark Email:
More informationComparison of methods for parametric model order reduction of instationary problems
Max Planck Institute Magdeburg Preprints Ulrike Baur Peter Benner Bernard Haasdonk Christian Himpe Immanuel Maier Mario Ohlberger Comparison of methods for parametric model order reduction of instationary
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 informationMATHEMATICAL METHODS INTERPOLATION
MATHEMATICAL METHODS INTERPOLATION I YEAR BTech By Mr Y Prabhaker Reddy Asst Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad SYLLABUS OF MATHEMATICAL METHODS (as per JNTU
More informationAlgebraic Properties of Solutions of Linear Systems
Algebraic Properties of Solutions of Linear Systems In this chapter we will consider simultaneous first-order differential equations in several variables, that is, equations of the form f 1t,,,x n d f
More informationPower Systems Control Prof. Wonhee Kim. Modeling in the Frequency and Time Domains
Power Systems Control Prof. Wonhee Kim Modeling in the Frequency and Time Domains Laplace Transform Review - Laplace transform - Inverse Laplace transform 2 Laplace Transform Review 3 Laplace Transform
More informationTowards parametric model order reduction for nonlinear PDE systems in networks
Towards parametric model order reduction for nonlinear PDE systems in networks MoRePas II 2012 Michael Hinze Martin Kunkel Ulrich Matthes Morten Vierling Andreas Steinbrecher Tatjana Stykel Fachbereich
More informationTopic # Feedback Control Systems
Topic #17 16.31 Feedback Control Systems Deterministic LQR Optimal control and the Riccati equation Weight Selection Fall 2007 16.31 17 1 Linear Quadratic Regulator (LQR) Have seen the solutions to the
More informationOptimal Linear Feedback Control for Incompressible Fluid Flow
Optimal Linear Feedback Control for Incompressible Fluid Flow Miroslav K. Stoyanov Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the
More informationSYSTEMTEORI - KALMAN FILTER VS LQ CONTROL
SYSTEMTEORI - KALMAN FILTER VS LQ CONTROL 1. Optimal regulator with noisy measurement Consider the following system: ẋ = Ax + Bu + w, x(0) = x 0 where w(t) is white noise with Ew(t) = 0, and x 0 is a stochastic
More information9. Introduction and Chapter Objectives
Real Analog - Circuits 1 Chapter 9: Introduction to State Variable Models 9. Introduction and Chapter Objectives In our analysis approach of dynamic systems so far, we have defined variables which describe
More informationSimultaneous Step-size and Path Control for Efficient Transient Noise Analysis
Simultaneous Step-size and Path Control for Efficient Transient Noise Analysis Werner Römisch, Thorsten Sickenberger, and Renate Winkler Abstract Noise in electronic components is a random phenomenon that
More informationMath 4381 / 6378 Symmetry Analysis
Math 438 / 6378 Smmetr Analsis Elementar ODE Review First Order Equations Ordinar differential equations of the form = F(x, ( are called first order ordinar differential equations. There are a variet of
More informationDIFFERENTIAL EQUATIONS
DIFFERENTIAL EQUATIONS Chapter 1 Introduction and Basic Terminology Most of the phenomena studied in the sciences and engineering involve processes that change with time. For example, it is well known
More informationModeling and Experimentation: Compound Pendulum
Modeling and Experimentation: Compound Pendulum Prof. R.G. Longoria Department of Mechanical Engineering The University of Texas at Austin Fall 2014 Overview This lab focuses on developing a mathematical
More informationDefinite versus Indefinite Linear Algebra. Christian Mehl Institut für Mathematik TU Berlin Germany. 10th SIAM Conference on Applied Linear Algebra
Definite versus Indefinite Linear Algebra Christian Mehl Institut für Mathematik TU Berlin Germany 10th SIAM Conference on Applied Linear Algebra Monterey Bay Seaside, October 26-29, 2009 Indefinite Linear
More informationNonlinear Observers. Jaime A. Moreno. Eléctrica y Computación Instituto de Ingeniería Universidad Nacional Autónoma de México
Nonlinear Observers Jaime A. Moreno JMorenoP@ii.unam.mx Eléctrica y Computación Instituto de Ingeniería Universidad Nacional Autónoma de México XVI Congreso Latinoamericano de Control Automático October
More informationECE 275A Homework #3 Solutions
ECE 75A Homework #3 Solutions. Proof of (a). Obviously Ax = 0 y, Ax = 0 for all y. To show sufficiency, note that if y, Ax = 0 for all y, then it must certainly be true for the particular value of y =
More informationSlide05 Haykin Chapter 5: Radial-Basis Function Networks
Slide5 Haykin Chapter 5: Radial-Basis Function Networks CPSC 636-6 Instructor: Yoonsuck Choe Spring Learning in MLP Supervised learning in multilayer perceptrons: Recursive technique of stochastic approximation,
More informationNumerical Treatment of Unstructured. Differential-Algebraic Equations. with Arbitrary Index
Numerical Treatment of Unstructured Differential-Algebraic Equations with Arbitrary Index Peter Kunkel (Leipzig) SDS2003, Bari-Monopoli, 22. 25.06.2003 Outline Numerical Treatment of Unstructured Differential-Algebraic
More informationnonlinear simultaneous equations of type (1)
Module 5 : Solving Nonlinear Algebraic Equations Section 1 : Introduction 1 Introduction Consider set of nonlinear simultaneous equations of type -------(1) -------(2) where and represents a function vector.
More informationScientific Computing with Case Studies SIAM Press, Lecture Notes for Unit VII Sparse Matrix
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit VII Sparse Matrix Computations Part 1: Direct Methods Dianne P. O Leary c 2008
More informationLinear Algebra and Robot Modeling
Linear Algebra and Robot Modeling Nathan Ratliff Abstract Linear algebra is fundamental to robot modeling, control, and optimization. This document reviews some of the basic kinematic equations and uses
More informationHot-Starting NLP Solvers
Hot-Starting NLP Solvers Andreas Wächter Department of Industrial Engineering and Management Sciences Northwestern University waechter@iems.northwestern.edu 204 Mixed Integer Programming Workshop Ohio
More informationECEN 667 Power System Stability Lecture 17: Transient Stability Solutions, Load Models
ECEN 667 Power System Stability Lecture 17: Transient Stability Solutions, Load Models Prof. Tom Overbye Dept. of Electrical and Computer Engineering Texas A&M University, overbye@tamu.edu 1 Announcements
More informationNumerical Algorithms for ODEs/DAEs (Transient Analysis)
Numerical Algorithms for ODEs/DAEs (Transient Analysis) Slide 1 Solving Differential Equation Systems d q ( x(t)) + f (x(t)) + b(t) = 0 dt DAEs: many types of solutions useful DC steady state: state no
More informationElectrical Circuits I
Electrical Circuits I This lecture discusses the mathematical modeling of simple electrical linear circuits. When modeling a circuit, one ends up with a set of implicitly formulated algebraic and differential
More informationECEN 420 LINEAR CONTROL SYSTEMS. Lecture 6 Mathematical Representation of Physical Systems II 1/67
1/67 ECEN 420 LINEAR CONTROL SYSTEMS Lecture 6 Mathematical Representation of Physical Systems II State Variable Models for Dynamic Systems u 1 u 2 u ṙ. Internal Variables x 1, x 2 x n y 1 y 2. y m Figure
More informationExam. 135 minutes, 15 minutes reading time
Exam August 6, 208 Control Systems II (5-0590-00) Dr. Jacopo Tani Exam Exam Duration: 35 minutes, 5 minutes reading time Number of Problems: 35 Number of Points: 47 Permitted aids: 0 pages (5 sheets) A4.
More informationSimulation of RF integrated circuits. Dr. Emad Gad
Simulation of RF integrated circuits Dr. Emad Gad 2007 2 Contents 1 Formulation of Circuit Equations 3 1.1 Modified Nodal Analysis........................... 3 1.1.1 Resistor Stamps............................
More information9. Numerical linear algebra background
Convex Optimization Boyd & Vandenberghe 9. Numerical linear algebra background matrix structure and algorithm complexity solving linear equations with factored matrices LU, Cholesky, LDL T factorization
More informationA POD Projection Method for Large-Scale Algebraic Riccati Equations
A POD Projection Method for Large-Scale Algebraic Riccati Equations Boris Kramer Department of Mathematics Virginia Tech Blacksburg, VA 24061-0123 Email: bokr@vt.edu John R. Singler Department of Mathematics
More information9 Controller Discretization
9 Controller Discretization In most applications, a control system is implemented in a digital fashion on a computer. This implies that the measurements that are supplied to the control system must be
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 informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationEngineering Fundamentals and Problem Solving, 6e
Engineering Fundamentals and Problem Solving, 6e Chapter 17 Electrical Circuits Chapter Objectives Compute the equivalent resistance of resistors in series and in parallel Apply Ohm s law to a resistive
More information9. Numerical linear algebra background
Convex Optimization Boyd & Vandenberghe 9. Numerical linear algebra background matrix structure and algorithm complexity solving linear equations with factored matrices LU, Cholesky, LDL T factorization
More informationLinear Algebra (Review) Volker Tresp 2018
Linear Algebra (Review) Volker Tresp 2018 1 Vectors k, M, N are scalars A one-dimensional array c is a column vector. Thus in two dimensions, ( ) c1 c = c 2 c i is the i-th component of c c T = (c 1, c
More informationLecture 15: H Control Synthesis
c A. Shiriaev/L. Freidovich. March 12, 2010. Optimal Control for Linear Systems: Lecture 15 p. 1/14 Lecture 15: H Control Synthesis Example c A. Shiriaev/L. Freidovich. March 12, 2010. Optimal Control
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 informationControl Systems. Dynamic response in the time domain. L. Lanari
Control Systems Dynamic response in the time domain L. Lanari outline A diagonalizable - real eigenvalues (aperiodic natural modes) - complex conjugate eigenvalues (pseudoperiodic natural modes) - phase
More informationNonlinear differential equations - phase plane analysis
Nonlinear differential equations - phase plane analysis We consider the general first order differential equation for y(x Revision Q(x, y f(x, y dx P (x, y. ( Curves in the (x, y-plane which satisfy this
More informationFinal Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson
Final Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson Name: TA Name and section: NO CALCULATORS, SHOW ALL WORK, NO OTHER PAPERS ON DESK. There is very little actual work to be done on this exam if
More informationApplied Mathematics 205. Unit II: Numerical Linear Algebra. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit II: Numerical Linear Algebra Lecturer: Dr. David Knezevic Unit II: Numerical Linear Algebra Chapter II.3: QR Factorization, SVD 2 / 66 QR Factorization 3 / 66 QR Factorization
More informationOrdinary differential equations - Initial value problems
Education has produced a vast population able to read but unable to distinguish what is worth reading. G.M. TREVELYAN Chapter 6 Ordinary differential equations - Initial value problems In this chapter
More informationAPPLICATION TO TRANSIENT ANALYSIS OF ELECTRICAL CIRCUITS
EECE 552 Numerical Circuit Analysis Chapter Nine APPLICATION TO TRANSIENT ANALYSIS OF ELECTRICAL CIRCUITS I. Hajj Application to Electrical Circuits Method 1: Construct state equations = f(x, t) Method
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 informationChapter 8 VOLTAGE STABILITY
Chapter 8 VOTAGE STABIITY The small signal and transient angle stability was discussed in Chapter 6 and 7. Another stability issue which is important, other than angle stability, is voltage stability.
More information