Circuit Simulation via Matrix Exponential Operators CK Cheng UC San Diego 1.

Slides:



Advertisements
Similar presentations
BQP/qpoly EXP/poly Scott Aaronson UC Berkeley. BQP/qpoly Class of languages recognized by a bounded-error polytime quantum algorithm, with a polysize.
Advertisements

CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 4 Model Order Reduction (2) Spring 2010 Prof. Chung-Kuan Cheng 1.
8.2 Kernel And Range.
CSE 245: Computer Aided Circuit Simulation and Verification Matrix Computations: Iterative Methods (II) Chung-Kuan Cheng.
CS 140 Lecture 16 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.
1 CS 140L Lecture 8 System Design Professor CK Cheng CSE Dept. UC San Diego.
MIMO Communication Systems
Quantum Computing MAS 725 Hartmut Klauck NTU
CS 140 Lecture 10 Sequential Networks: Implementation Professor CK Cheng CSE Dept. UC San Diego 1.
Modern iterative methods For basic iterative methods, converge linearly Modern iterative methods, converge faster –Krylov subspace method Steepest descent.
Symmetric Matrices and Quadratic Forms
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Note 3 Model Order Reduction (1) Spring 2008 Prof. Chung-Kuan Cheng.
Modern Sampling Methods Summary of Subspace Priors Spring, 2009.
CSE245: Computer-Aided Circuit Simulation and Verification Lecture Notes 3 Model Order Reduction (1) Spring 2008 Prof. Chung-Kuan Cheng.
1 BSMOR: Block Structure-preserving Model Order Reduction http//:eda.ee.ucla.edu Hao Yu, Lei He Electrical Engineering Dept., UCLA Sheldon S.D. Tan Electrical.
UCSD CSE 245 Notes – SPRING 2006 CSE245: Computer-Aided Circuit Simulation and Verification Lecture Notes 3 Model Order Reduction (1) Spring 2006 Prof.
1 CSE20 Lecture 6 4/19/11 CK Cheng UC San Diego. Residual Numbers (NT-1 and Shaum’s Chapter 11) Introduction Definition Operations Range of numbers Conversion.
UCSD CSE 245 Notes – SPRING 2006 CSE245: Computer-Aided Circuit Simulation and Verification Lecture Notes 4 Model Order Reduction (2) Spring 2006 Prof.
SAMSON: A Generalized Second-order Arnoldi Method for Reducing Multiple Source Linear Network with Susceptance Yiyu Shi, Hao Yu and Lei He EE Department,
Lecture 12 Least Square Approximation Shang-Hua Teng.
CSE 245: Computer Aided Circuit Simulation and Verification
CS 140L Lecture 7 Transformation between Mealy and Moore Machines Professor CK Cheng CSE Dept. UC San Diego.
Subspaces, Basis, Dimension, Rank
CSE20 Lecture 3 Number Systems: Negative Numbers 1.Sign and Magnitude Representation 2.1’s Complement Representation 3.2’s Complement Representation 1.
資訊科學數學11 : Linear Equation and Matrices
Circuit Simulation via Matrix Exponential Method Speaker: Shih-Hung Weng Adviser: Chung-Kuan Cheng Date: 05/31/
Chapter 5 Orthogonality.
Linear Algebra (Aljabar Linier) Week 10 Universitas Multimedia Nusantara Serpong, Tangerang Dr. Ananda Kusuma
Orthogonality and Least Squares
Efficient Integration of Large Stiff Systems of ODEs Using Exponential Integrators M. Tokman, M. Tokman, University of California, Merced 2 hrs 1.5 hrs.
Decentralized Model Order Reduction of Linear Networks with Massive Ports Boyuan Yan, Lingfei Zhou, Sheldon X.-D. Tan, Jie Chen University of California,
1 Distributed Detection of Network-Wide Traffic Anomalies Ling Huang* XuanLong Nguyen* Minos Garofalakis § Joe Hellerstein* Michael Jordan* Anthony Joseph*
1 Marijn Bartel Schreuders Supervisor: Dr. Ir. M.B. Van Gijzen Date:Monday, 24 February 2014.
CSE 245: Computer Aided Circuit Simulation and Verification Matrix Computations: Iterative Methods I Chung-Kuan Cheng.
4.8 Rank Rank enables one to relate matrices to vectors, and vice versa. Definition Let A be an m  n matrix. The rows of A may be viewed as row vectors.
Math – What is a Function? 1. 2 input output function.
2 2.9 © 2016 Pearson Education, Inc. Matrix Algebra DIMENSION AND RANK.
Class 24: Question 1 Which of the following set of vectors is not an orthogonal set?
Numerical methods 1 An Introduction to Numerical Methods For Weather Prediction by Mariano Hortal office 122.
Chapter 2 Interconnect Analysis Prof. Lei He Electrical Engineering Department University of California, Los Angeles URL: eda.ee.ucla.edu
4.8 Rank Rank enables one to relate matrices to vectors, and vice versa. Definition Let A be an m  n matrix. The rows of A may be viewed as row vectors.
1 MAC 2103 Module 11 lnner Product Spaces II. 2 Rev.F09 Learning Objectives Upon completing this module, you should be able to: 1. Construct an orthonormal.
Circuit Simulation using Matrix Exponential Method Shih-Hung Weng, Quan Chen and Chung-Kuan Cheng CSE Department, UC San Diego, CA Contact:
SPICE Diego : Circuit Simulation for Post Layout Analysis Chung-Kuan Cheng Department of Computer Science and Engineering University of California, San.
EE 481 Design Project 10 KVA Inverter Intro Stage DC-DC Boost Converter Greg Hopper Todd Reilly.
Pieter Heres, Aday Error control in Krylov subspace methods for Model Order Reduction Pieter Heres June 21, 2005 Eindhoven.
Finding Rightmost Eigenvalues of Large, Sparse, Nonsymmetric Parameterized Eigenvalue Problems Minghao Wu AMSC Program Advisor: Dr. Howard.
An inner product on a vector space V is a function that, to each pair of vectors u and v in V, associates a real number and satisfies the following.
Let W be a subspace of R n, y any vector in R n, and the orthogonal projection of y onto W. …
6 6.5 © 2016 Pearson Education, Ltd. Orthogonality and Least Squares LEAST-SQUARES PROBLEMS.
Beyond Vectors Hung-yi Lee. Introduction Many things can be considered as “vectors”. E.g. a function can be regarded as a vector We can apply the concept.
Name:- Dhanraj Vaghela Branch:- Mechanical Sem:- 02 Enrollment From the desk of Dhanraj from SRICT.
Tutorial 6. Eigenvalues & Eigenvectors Reminder: Eigenvectors A vector x invariant up to a scaling by λ to a multiplication by matrix A is called.
Linear Transformation, Null Spaces and Ranges
CSE 245: Computer Aided Circuit Simulation and Verification
Linear Transformations
EE 201C Homework 2 (due Feb 3 ) Wei Wu
CSE245: Computer-Aided Circuit Simulation and Verification
CSE 245: Computer Aided Circuit Simulation and Verification
Conjugate Gradient Method
Sensitivity Analysis by Adjoint Network
EE 201C Homework 2 (due Feb 3 ) Wei Wu
Model Order Reduction Slides adopted from Luca Daniel
Evaluating Logarithms
Linear Algebra Lecture 21.
Exponential and Logarithmic Forms
Maths for Signals and Systems Linear Algebra in Engineering Lecture 18, Friday 18th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Linear Algebra Lecture 41.
CS 140L Lecture 7 Transformation between Mealy and Moore Machines
RKPACK A numerical package for solving large eigenproblems
Presentation transcript:

Circuit Simulation via Matrix Exponential Operators CK Cheng UC San Diego 1

Outline General Matrix Exponential Krylov Space and Arnoldi Orthogonalization Matrix Exponential Method – Krylov Subspace Approximation – Invert Krylov Subspace Approximation – Rational Krylov Subspace Approximation 2

General Matrix Exponential 3

Krylov Space and Arnoldi Orthonormalization Input A and v 1 =x 0 /|x 0 | Output AV=VH+h m+1 v m+1 e m T For i=1, …, m T i+1 =Av i For j=1, …, I – h ji = – T i+1 =T i+1 -h ji v j End For h i+1,i =|T i+1 | v i+1 =1/h i+1 T i+1 End For 4

Standard Krylov Space Generate: AV=VH+h m+1 v m+1 e m T Thus, we have e Ah v 1 ≈ Ve Hh e 1 Residual r=Cdx/dt-Gx=-h m+1 Cv m+1 e m T e Hh e 1 Derivation: Cdx/dt-Gx=CVHe Hh e 1 -GVe Hh e 1 =(CVH-GV)e Hh e 1 = C(VH-C -1 GV)e Hh e 1 =C(VH-VH-h m+1 v m+1 e m T )e Hh e 1 =-h m+1 Cv m+1 e m T e Hh e 1 5

Standard Mexp Error trend 6 sweep m and h

Invert Krylov Space Generate: A -1 V=VH+h m+1 v m+1 e m T Let H=H -1, we have e Ah v 1 ≈ Ve Hh e 1 Residual r=Cdx/dt-Gx=h m+1 Gv m+1 e m T He Hh e 1 Derivation: Cdx/dt-Gx=CVHe Hh e 1 -GVe Hh e 1 =(CVH-GV)e Hh e 1 = G(G -1 CVH-V)e Hh e 1 =G(A -1 VH-V)e Hh e 1 =h m+1 Gv m+1 e m T He Hh e 1 7

large step size with less dimension Invert Matrix Exponential 8 sweep m and h

Rational Krylov Space Generate: (1-rA) -1 V=VH+h m+1 v m+1 e m T Let H=1/r (I-H -1 ) we have e Ah v 1 ≈ Ve Hh e 1 Residual r=Cdx/dt-Gx=-h m+1 (C/r-G)v m+1 e m T H -1 e Hh e 1 Derivation: Cdx/dt-Gx=CVHe Hh e 1 -GVe Hh e 1 =(CVH-GV)e Hh e 1 = (1/r CV(I-H -1 )-GV)e Hh e 1 =(1/rCV(H-1)-GVH)H -1 e Hh e 1 =((1/rC-G)VH-1/rCV)H -1 e Hh e 1 =-h m+1 (C/r-G)v m+1 e m T H -1 e Hh e 1 9

large step size with less dimension Rational Matrix Exponential 10 fix , sweep m and h

Different  11 needs large m

Different  12

Spectral Transformation –  = 10f Small RC mesh, 100 by 100 Different h for Krylov subspace Different  for rational Krylov subspace 13

Spectral Transformation–  = 1p Small RC mesh, 100 by 100 Different h for Krylov subspace Different  for rational Krylov subspace 14

Spectral Transformation–  = 100p Small RC mesh, 100 by 100 Different h for Krylov subspace Different  for rational Krylov subspace 15

Sweep  for Large Range 16

Sweep  for Large Range 17

Difference Between Inverted and Rational 18

Fixed  = 1p, sweep time step h 19

Fixed  = 1n, sweep time step h 20

Fixed  = 1u, sweep time step h 21

Fixed  = 1m, sweep time step h 22

Fixed  = 1, sweep time step h 23

Fixed  = 1k, sweep time step h 24

Fixed  = 1M, sweep time step h 25

Krylov Space Residual Generate: AV=VH+h m+1 v m+1 e m T Thus, we have e Ah v 1 ≈ Ve Hh e 1 Residual r=Cdx/dt-Gx=-h m+1 Cv m+1 e m T e Hh e 1 Derivation: 1. Set Y=[e 1 He 1 H 2 e 1 … H m-1 e 1 ] 2. We have YC=HY where C= z m +c m-1 z m-1 +…+c 1 z+c 0 =0 has roots 1, 2,… m 26 0-c 0 10-c 1 10-c 2 ……… 10-c m-2 1-c m-1

Krylov Space Residual m m m. m m-1

Invert Krylov Space Residual 28