J OU R NAL O F XI D IAN U N IV E R S I T Y
|
|
- Alexander Bruce
- 5 years ago
- Views:
Transcription
1 ( ) J OU R NAL O F XI D IAN U N IV E R S I T Y J un Vol. 35 No. 3 / B i C GS t a b,,, (, ) : /.,, ; BiCGStab,,., HSPICE ; HSPICE 95 %, 75 %.,,, /. : / ; ;BiCGStab : TP :A : (2008) Fast method for the large2scale power and ground net work analysis based on the compressed BiCGStab algorithm S U H ao2han g, Z H A N G Yi2men, Z H A N G Yu2mi ng, M A N J i n2cai ( Ministry of Education Key Lab. of Wide Band2Gap Semiconductor Materials and Devices, School of Microelectronic, Xidian Univ., Xi an , China) Abstract : An effective method is proposed to perform static and transient simulations for the large2scale power and ground network circuit s with a good result obtained. This method compresses the large coefficient matrix by only storing the non2zero element s with the column coordinate index which avoids the row coordinate index and eases the burden of memory usage. Then it uses the BiCGStab algorithm to analyze the large network which avoids the inverse matrix computing. Extensive experimental result s on the large2scale power and ground network show that the presented method is over two orders of magnitude faster than HSPICE in transient simulations. Furthermore, our method reduces over 95 % memory usage than HSPICE and 75 % memory usage than Incomplete Cholesky Conjugate Gradient while the accuracy is not compromised. The presented method has more powerf ul capability to deal with the increasing size of power grids in modern microprocessors than general2purpose circuit simulators with significant memory and run2time advantages. Key Words : power and ground networks ;circuit simulations ;BiCGStab algorithm, /,,,, / VL SI. / CPU 3, /. : [ 1 ] [2 ] [3 ] [4 6 ]. (ICCG) Krylov2subspace, /. /, ICCG : : (2007F20) : (19792),,,E2mail : com.
2 3 : / BiCGStab 509,., /, n ( ),,., BiCGStab (BiConjugate Gradient Stabilized),,,, /. 1 / MNA,, /.. /,,. /, /. /, IR, hot point,,. / : ( ), ( / ) ; /,, ; ;., / RL C, 1. MNA (Modified Nodal Analysis), : gg = 1 / gg x + gc x = gb, (1) G A l - A T l 0, gc = C 0 0 L, x = v( t) i l ( t) G, C L ; Al ; v( t), i l ( t) ; b( t)., RL, / RL, RL, 2. RL C, RL,, gb = b( t) 0, 2 RL, 2 (a) ( ). (b), RL = 2L/ h, I ( t + h) = I ( t) + V ( t + h) / RL, h., (c) (d). RL C RC, RL,,., (1) : G x( t) + C x ( t) = b( t), (2)
3 ( ) G, C, x( t), b( t). : ( G + C/ h) x( t) = b( t) + ( C/ h) x( t - h). (3) (3). G + C/ h.,,, (3) /,., /. 2 BiCGStab BiCGStab (3). BiCGStab : BiCGStab. 211 / G + C/ h, 7,,. /,,.,,. G + C/ h,,., 7, 1,, ;,, G + C/ h,,.,,. 212 BiCGStab /,, /,. : [1 ],,, ;,,,. ICCG [4-6 ] PGMRES(Precondition Generalized Minimum RESidual) [4 ] Jacobi [2 ] Gauss2Seidel [2 ]. ICCG CG,, /,, :..,,, ;,,.,,ICCG /., ( GMRES),,,., GMRES P GMRES, P GMRES,. [4 ],,P GMRES ICCG. J acobi Gauss2Seidel,. /. BiCGStab /. BiCGStab, /. BiCGStab CGS(Conjugate Gradient Squared) BCG(Bi2Conjugate Gradient) GMRES,,,
4 3 : / BiCGStab 511,,, ICCG [7 ],,.,,BiCGStab., ( ),. n v n, t n BiCGStab : (1) x 0,, n = 0 ; (2) r 0 = b - Ax 0, 0 = 0 = 0 = 0, v 0 = p 0 = 0 ; (3) r 0, r 0,., (4) ; (4) n = r T 0 r n- 1, = n n, p n- 1 n = r n- 1 + n ( p n- 1 n- 1 = As n, n = tt n s n t T, x n = x n- 1 + n p n n t n (5) r n,., (6) ; (6) n = n + 1, (4). ICCG : (1) x 0,, k = 0 ; (2) r 0 = b - Ax 0, p 0 = (LL T ) - 1 r 0 ; (3) r 0, r 0,., (4) ; + n s n, r n = s n - n t n ; (4) k = ( r k, (LL T ) - 1 r k ), x ( p k, Ap k ) k+1 = x k + k p k, r k+1 = r k - k A p k ; (5) r k+1, r k+1,., (6) ; (6) k = ( r k+1, (LL T ) - 1 r k+1 ) ( r k, (LL T ) - 1, p k+1 = (LL T ) - 1 r k+1 + k p k ; r k ) (7) k = k + 1, (4). - n- 1 v n- 1 ), v n = Ap n, n = n r T, s n = r n- 1-0 v n BiCGStab, /, BiCGStab. 3 C + +, Pentium,CPU 2166 GHZ, 1 GB., 118 V., HSPICE. 6 ns, 120, ,, ICCG [4 ] HSPICE, 3 (a)
5 ( ) HSPICE 95 %, ICCG 75 % , HSPICE 8211 MB, ICCG 1316 MB, BiCGStab CG 316 MB 314 MB ; , HSPICE, ICCG MB, BiCGStab CG 2515 MB 2314 MB. BiCGStab CG,, 3 (b), BiCGStab CG.,, 1. HSPICE, BiCGStab, HSPICE. [5 ],, BiCGStab ICCG,, ICCG. /. [ 5,6 ],, /. 540, HSPICE,, HSPICE, 6 mv, 4 mv. 1 HSPICE 2CG 2BICGStab # # # # # # s 4 BiCGStab /., BiCGStab,,, HSPICE, HSPICE 95 %, ICCG 75 %. BiCGStab 10 min. /. : [ 1 ] Zhao M, Panda R V, Sapatnekar S S. Hierarchical Analysis of Power Distribution Networks [ J ]. IEEE Trans on Computer2Aided Design of Integrated Circuit s and Systems, 2002, 21 (2) : [ 2 ] Kozhaya J N, Nassif S R, Najm F N. A Multigrid2Like Technique for Power Grid Analysis[J ]. IEEE Trans on Computer2 Aided Design of Integrated Circuits and Systems, 2002, 21 (10) : [ 3 ] Qian H, Nassif S R, Sapatnekar S S. Hierarchical Random2walk Algorithm, ms for Power Grid Analysis[J ]. IEEE Trans on Computer2Aided Design of Integrated Circuits and Systems, 2005, 24 (8) : [ 4 ] Chen Tsung2Hao, Chen Charlie Chung2Ping. Efficient Large2scale Power Grid Analysis Based on Preconditioned Krylov2 Subspace Iterative Methods[ C]/ / Proceeding of Design Automation Conference. Las Vegas : ACM, 2001 : [5 ],,. / [J ]., 2005, 17 (4) : Cai Yici, Pan Zhu, L uo Zuying. Fast Analysis of Power/ Ground Net Works Via Circuit Reduction[J ]. Chinese Journal of Semi Conductors, 2005, 17 (4) : [ 6 ] Cai Yici. Fast Analysis of Power/ Ground Networks via Circuit Reduction[J ]. Chinese Journal of Semiconductors, 2005, 26 (7) : [ 7 ] Top sakal E, Kindt R, Sertel K, et al. Evaluation of the BICGSTAB ( l) Algorithm for the Finite2element/ boundary2 integral Method[J ]. IEEE Antennas and Propagation Magazine, 2001, 43 (6) : ( : )
Efficient Incremental Analysis of On-Chip Power Grid via Sparse Approximation
Efficient Incremental Analysis of On-Chip Power Grid via Sparse Approximation Pei Sun and Xin Li ECE Department, Carnegie Mellon University 5000 Forbes Avenue, Pittsburgh, PA 1513 {peis, xinli}@ece.cmu.edu
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 18 Outline
More information9.1 Preconditioned Krylov Subspace Methods
Chapter 9 PRECONDITIONING 9.1 Preconditioned Krylov Subspace Methods 9.2 Preconditioned Conjugate Gradient 9.3 Preconditioned Generalized Minimal Residual 9.4 Relaxation Method Preconditioners 9.5 Incomplete
More informationContents. Preface... xi. Introduction...
Contents Preface... xi Introduction... xv Chapter 1. Computer Architectures... 1 1.1. Different types of parallelism... 1 1.1.1. Overlap, concurrency and parallelism... 1 1.1.2. Temporal and spatial parallelism
More informationIterative Methods and Multigrid
Iterative Methods and Multigrid Part 3: Preconditioning 2 Eric de Sturler Preconditioning The general idea behind preconditioning is that convergence of some method for the linear system Ax = b can be
More informationComparison of Fixed Point Methods and Krylov Subspace Methods Solving Convection-Diffusion Equations
American Journal of Computational Mathematics, 5, 5, 3-6 Published Online June 5 in SciRes. http://www.scirp.org/journal/ajcm http://dx.doi.org/.436/ajcm.5.5 Comparison of Fixed Point Methods and Krylov
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 informationTHE FACTORIZED SPARSE APPROXIMATE INVERSE PRECONDITIONED CONJUGATE GRADIENT ALGO- RITHM FOR FINITE ELEMENT ANALYSIS OF SCAT- TERING PROBLEMS
Progress In Electromagnetics Research, PIER 98, 15 31, 2009 THE FACTORIZED SPARSE APPROXIMATE INVERSE PRECONDITIONED CONJUGATE GRADIENT ALGO- RITHM FOR FINITE ELEMENT ANALYSIS OF SCAT- TERING PROBLEMS
More informationKrylov Space Solvers
Seminar for Applied Mathematics ETH Zurich International Symposium on Frontiers of Computational Science Nagoya, 12/13 Dec. 2005 Sparse Matrices Large sparse linear systems of equations or large sparse
More informationIEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 34, NO. 3, MARCH
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 34, NO. 3, MARCH 2015 409 Efficient Transient Analysis of Power Delivery Network With Clock/Power Gating by Sparse Approximation
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 informationSOLVING SPARSE LINEAR SYSTEMS OF EQUATIONS. Chao Yang Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA, USA
1 SOLVING SPARSE LINEAR SYSTEMS OF EQUATIONS Chao Yang Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA, USA 2 OUTLINE Sparse matrix storage format Basic factorization
More informationSparse Matrices and Iterative Methods
Sparse Matrices and Iterative Methods K. 1 1 Department of Mathematics 2018 Iterative Methods Consider the problem of solving Ax = b, where A is n n. Why would we use an iterative method? Avoid direct
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)
AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences) Lecture 19: Computing the SVD; Sparse Linear Systems Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical
More informationIterative methods for Linear System
Iterative methods for Linear System JASS 2009 Student: Rishi Patil Advisor: Prof. Thomas Huckle Outline Basics: Matrices and their properties Eigenvalues, Condition Number Iterative Methods Direct and
More informationA Robust Preconditioned Iterative Method for the Navier-Stokes Equations with High Reynolds Numbers
Applied and Computational Mathematics 2017; 6(4): 202-207 http://www.sciencepublishinggroup.com/j/acm doi: 10.11648/j.acm.20170604.18 ISSN: 2328-5605 (Print); ISSN: 2328-5613 (Online) A Robust Preconditioned
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 informationIntroduction to Scientific Computing
(Lecture 5: Linear system of equations / Matrix Splitting) Bojana Rosić, Thilo Moshagen Institute of Scientific Computing Motivation Let us resolve the problem scheme by using Kirchhoff s laws: the algebraic
More informationIterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems Luca Bergamaschi e-mail: berga@dmsa.unipd.it - http://www.dmsa.unipd.it/ berga Department of Mathematical Methods and Models for Scientific Applications University
More information1420 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 24, NO. 9, SEPTEMBER 2005
14 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 4, NO. 9, SEPTEMBER 5 Sparse Transformations and Preconditioners for 3-D Capacitance Extraction Shu Yan, Student Member,
More informationChapter 7 Iterative Techniques in Matrix Algebra
Chapter 7 Iterative Techniques in Matrix Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128B Numerical Analysis Vector Norms Definition
More informationIterative methods for Linear System of Equations. Joint Advanced Student School (JASS-2009)
Iterative methods for Linear System of Equations Joint Advanced Student School (JASS-2009) Course #2: Numerical Simulation - from Models to Software Introduction In numerical simulation, Partial Differential
More informationLecture 18 Classical Iterative Methods
Lecture 18 Classical Iterative Methods MIT 18.335J / 6.337J Introduction to Numerical Methods Per-Olof Persson November 14, 2006 1 Iterative Methods for Linear Systems Direct methods for solving Ax = b,
More informationScalable Non-blocking Preconditioned Conjugate Gradient Methods
Scalable Non-blocking Preconditioned Conjugate Gradient Methods Paul Eller and William Gropp University of Illinois at Urbana-Champaign Department of Computer Science Supercomputing 16 Paul Eller and William
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 21: Sensitivity of Eigenvalues and Eigenvectors; Conjugate Gradient Method Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical Analysis
More informationCME342 Parallel Methods in Numerical Analysis. Matrix Computation: Iterative Methods II. Sparse Matrix-vector Multiplication.
CME342 Parallel Methods in Numerical Analysis Matrix Computation: Iterative Methods II Outline: CG & its parallelization. Sparse Matrix-vector Multiplication. 1 Basic iterative methods: Ax = b r = b Ax
More informationFast 3-D Thermal Simulation for Integrated Circuits With Domain Decomposition Method
2014 IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 32, NO. 12, DECEMBER 2013 Fast 3-D Thermal Simulation for Integrated Circuits With Domain Decomposition Method Wenjian
More informationPreface to the Second Edition. Preface to the First Edition
n page v Preface to the Second Edition Preface to the First Edition xiii xvii 1 Background in Linear Algebra 1 1.1 Matrices................................. 1 1.2 Square Matrices and Eigenvalues....................
More informationLab 1: Iterative Methods for Solving Linear Systems
Lab 1: Iterative Methods for Solving Linear Systems January 22, 2017 Introduction Many real world applications require the solution to very large and sparse linear systems where direct methods such as
More informationA SPARSE APPROXIMATE INVERSE PRECONDITIONER FOR NONSYMMETRIC LINEAR SYSTEMS
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING, SERIES B Volume 5, Number 1-2, Pages 21 30 c 2014 Institute for Scientific Computing and Information A SPARSE APPROXIMATE INVERSE PRECONDITIONER
More informationOUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative methods ffl Krylov subspace methods ffl Preconditioning techniques: Iterative methods ILU
Preconditioning Techniques for Solving Large Sparse Linear Systems Arnold Reusken Institut für Geometrie und Praktische Mathematik RWTH-Aachen OUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative
More information6.4 Krylov Subspaces and Conjugate Gradients
6.4 Krylov Subspaces and Conjugate Gradients Our original equation is Ax = b. The preconditioned equation is P Ax = P b. When we write P, we never intend that an inverse will be explicitly computed. P
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 9 Minimizing Residual CG
More informationStatic Timing Analysis Considering Power Supply Variations
Static Timing Analysis Considering Power Supply Variations Sanay Pant, David Blaauw University of Michigan, Ann Arbor, MI Abstract Power supply integrity verification has become a key concern in high performance
More informationITERATIVE METHODS BASED ON KRYLOV SUBSPACES
ITERATIVE METHODS BASED ON KRYLOV SUBSPACES LONG CHEN We shall present iterative methods for solving linear algebraic equation Au = b based on Krylov subspaces We derive conjugate gradient (CG) method
More informationIterative Methods for Linear Systems of Equations
Iterative Methods for Linear Systems of Equations Projection methods (3) ITMAN PhD-course DTU 20-10-08 till 24-10-08 Martin van Gijzen 1 Delft University of Technology Overview day 4 Bi-Lanczos method
More informationEarly-stage Power Grid Analysis for Uncertain Working Modes
Early-stage Power Grid Analysis for Uncertain Working Modes Haifeng Qian Department of ECE University of Minnesota Minneapolis, MN 55414 qianhf@ece.umn.edu Sani R. Nassif IBM Austin Research Labs 11400
More informationLecture 17: Iterative Methods and Sparse Linear Algebra
Lecture 17: Iterative Methods and Sparse Linear Algebra David Bindel 25 Mar 2014 Logistics HW 3 extended to Wednesday after break HW 4 should come out Monday after break Still need project description
More informationIterative Methods for Solving A x = b
Iterative Methods for Solving A x = b A good (free) online source for iterative methods for solving A x = b is given in the description of a set of iterative solvers called templates found at netlib: http
More informationConjugate gradient method. Descent method. Conjugate search direction. Conjugate Gradient Algorithm (294)
Conjugate gradient method Descent method Hestenes, Stiefel 1952 For A N N SPD In exact arithmetic, solves in N steps In real arithmetic No guaranteed stopping Often converges in many fewer than N steps
More informationConjugate Gradient Method
Conjugate Gradient Method direct and indirect methods positive definite linear systems Krylov sequence spectral analysis of Krylov sequence preconditioning Prof. S. Boyd, EE364b, Stanford University Three
More informationIncomplete Cholesky preconditioners that exploit the low-rank property
anapov@ulb.ac.be ; http://homepages.ulb.ac.be/ anapov/ 1 / 35 Incomplete Cholesky preconditioners that exploit the low-rank property (theory and practice) Artem Napov Service de Métrologie Nucléaire, Université
More informationThe amount of work to construct each new guess from the previous one should be a small multiple of the number of nonzeros in A.
AMSC/CMSC 661 Scientific Computing II Spring 2005 Solution of Sparse Linear Systems Part 2: Iterative methods Dianne P. O Leary c 2005 Solving Sparse Linear Systems: Iterative methods The plan: Iterative
More informationSummary of Iterative Methods for Non-symmetric Linear Equations That Are Related to the Conjugate Gradient (CG) Method
Summary of Iterative Methods for Non-symmetric Linear Equations That Are Related to the Conjugate Gradient (CG) Method Leslie Foster 11-5-2012 We will discuss the FOM (full orthogonalization method), CG,
More informationChapter 7. Iterative methods for large sparse linear systems. 7.1 Sparse matrix algebra. Large sparse matrices
Chapter 7 Iterative methods for large sparse linear systems In this chapter we revisit the problem of solving linear systems of equations, but now in the context of large sparse systems. The price to pay
More informationTopics. The CG Algorithm Algorithmic Options CG s Two Main Convergence Theorems
Topics The CG Algorithm Algorithmic Options CG s Two Main Convergence Theorems What about non-spd systems? Methods requiring small history Methods requiring large history Summary of solvers 1 / 52 Conjugate
More informationAn H-LU Based Direct Finite Element Solver Accelerated by Nested Dissection for Large-scale Modeling of ICs and Packages
PIERS ONLINE, VOL. 6, NO. 7, 2010 679 An H-LU Based Direct Finite Element Solver Accelerated by Nested Dissection for Large-scale Modeling of ICs and Packages Haixin Liu and Dan Jiao School of Electrical
More informationAccurate Power Grid Analysis with Behavioral Transistor Network Modeling
Accurate Power Grid Analysis with Behavioral Transistor Network Modeling Anand Ramalingam Giri V. Devarayanadurg anandram@cerc.utexas.edu giri.venkata@intel.com David Z. Pan dpan@cerc.utexas.edu Department
More informationAlgorithm for Sparse Approximate Inverse Preconditioners in the Conjugate Gradient Method
Algorithm for Sparse Approximate Inverse Preconditioners in the Conjugate Gradient Method Ilya B. Labutin A.A. Trofimuk Institute of Petroleum Geology and Geophysics SB RAS, 3, acad. Koptyug Ave., Novosibirsk
More informationIDR(s) A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations
IDR(s) A family of simple and fast algorithms for solving large nonsymmetric systems of linear equations Harrachov 2007 Peter Sonneveld en Martin van Gijzen August 24, 2007 1 Delft University of Technology
More informationITERATIVE METHODS FOR SPARSE LINEAR SYSTEMS
ITERATIVE METHODS FOR SPARSE LINEAR SYSTEMS YOUSEF SAAD University of Minnesota PWS PUBLISHING COMPANY I(T)P An International Thomson Publishing Company BOSTON ALBANY BONN CINCINNATI DETROIT LONDON MADRID
More informationResearch on the MPCG Algorithm applied in the three dimensional electric field calculation of SF 6 Circuit Breaker in three-phase-in-onetank
Research on the MPCG Algorithm applied in the three dimensional electric field calculation of SF 6 Circuit Breaker in three-phase-in-onetank GIS MA Ai-qing, JIANG Xiu-chen, ZENG Yi Department of Electrical
More informationOn the choice of abstract projection vectors for second level preconditioners
On the choice of abstract projection vectors for second level preconditioners C. Vuik 1, J.M. Tang 1, and R. Nabben 2 1 Delft University of Technology 2 Technische Universität Berlin Institut für Mathematik
More informationSolution to Laplace Equation using Preconditioned Conjugate Gradient Method with Compressed Row Storage using MPI
Solution to Laplace Equation using Preconditioned Conjugate Gradient Method with Compressed Row Storage using MPI Sagar Bhatt Person Number: 50170651 Department of Mechanical and Aerospace Engineering,
More informationThe flexible incomplete LU preconditioner for large nonsymmetric linear systems. Takatoshi Nakamura Takashi Nodera
Research Report KSTS/RR-15/006 The flexible incomplete LU preconditioner for large nonsymmetric linear systems by Takatoshi Nakamura Takashi Nodera Takatoshi Nakamura School of Fundamental Science and
More informationAn Efficient Graph Sparsification Approach to Scalable Harmonic Balance (HB) Analysis of Strongly Nonlinear RF Circuits
Design Automation Group An Efficient Graph Sparsification Approach to Scalable Harmonic Balance (HB) Analysis of Strongly Nonlinear RF Circuits Authors : Lengfei Han (Speaker) Xueqian Zhao Dr. Zhuo Feng
More informationSplitting Iteration Methods for Positive Definite Linear Systems
Splitting Iteration Methods for Positive Definite Linear Systems Zhong-Zhi Bai a State Key Lab. of Sci./Engrg. Computing Inst. of Comput. Math. & Sci./Engrg. Computing Academy of Mathematics and System
More informationPAPER Fast Algorithm for Solving Matrix Equation in MoM Analysis of Large-Scale Array Antennas
2482 PAPER Fast Algorithm for Solving Matrix Equation in MoM Analysis of Large-Scale Array Antennas Qiang CHEN, Regular Member, Qiaowei YUAN, Nonmember, and Kunio SAWAYA, Regular Member SUMMARY A new iterative
More informationConjugate Gradient algorithm. Storage: fixed, independent of number of steps.
Conjugate Gradient algorithm Need: A symmetric positive definite; Cost: 1 matrix-vector product per step; Storage: fixed, independent of number of steps. The CG method minimizes the A norm of the error,
More informationMaximum-weighted matching strategies and the application to symmetric indefinite systems
Maximum-weighted matching strategies and the application to symmetric indefinite systems by Stefan Röllin, and Olaf Schenk 2 Technical Report CS-24-7 Department of Computer Science, University of Basel
More informationA Novel Approach for Solving the Power Flow Equations
Vol.1, Issue.2, pp-364-370 ISSN: 2249-6645 A Novel Approach for Solving the Power Flow Equations Anwesh Chowdary 1, Dr. G. MadhusudhanaRao 2 1 Dept.of.EEE, KL University-Guntur, Andhra Pradesh, INDIA 2
More informationFinite-choice algorithm optimization in Conjugate Gradients
Finite-choice algorithm optimization in Conjugate Gradients Jack Dongarra and Victor Eijkhout January 2003 Abstract We present computational aspects of mathematically equivalent implementations of the
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 informationMultilevel low-rank approximation preconditioners Yousef Saad Department of Computer Science and Engineering University of Minnesota
Multilevel low-rank approximation preconditioners Yousef Saad Department of Computer Science and Engineering University of Minnesota SIAM CSE Boston - March 1, 2013 First: Joint work with Ruipeng Li Work
More informationRecycling Krylov Subspaces for Solving Linear Systems with Successively Changing Right-Hand Sides Arising in Model Reduction
Recycling Krylov Subspaces for Solving Linear Systems with Successively Changing Right-Hand Sides Arising in Model Reduction Peter Benner and Lihong Feng Abstract We discuss the numerical solution of successive
More informationPreconditioned CG-Solvers and Finite Element Grids
Preconditioned CG-Solvers and Finite Element Grids R. Bauer and S. Selberherr Institute for Microelectronics, Technical University of Vienna Gusshausstrasse 27-29, A-1040 Vienna, Austria Phone +43/1/58801-3854,
More informationEECS 275 Matrix Computation
EECS 275 Matrix Computation Ming-Hsuan Yang Electrical Engineering and Computer Science University of California at Merced Merced, CA 95344 http://faculty.ucmerced.edu/mhyang Lecture 20 1 / 20 Overview
More informationCourse Notes: Week 1
Course Notes: Week 1 Math 270C: Applied Numerical Linear Algebra 1 Lecture 1: Introduction (3/28/11) We will focus on iterative methods for solving linear systems of equations (and some discussion of eigenvalues
More informationNumerical behavior of inexact linear solvers
Numerical behavior of inexact linear solvers Miro Rozložník joint results with Zhong-zhi Bai and Pavel Jiránek Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic The fourth
More informationNetwork Analysis at IIT Bombay
H. Narayanan Department of Electrical Engineering Indian Institute of Technology, Bombay October, 2007 Plan Speed-up of Network Analysis by exploiting Topological Methods. Adaptation of standard linear
More informationIntroduction of a Stabilized Bi-Conjugate Gradient iterative solver for Helmholtz s Equation on the CMA GRAPES Global and Regional models.
Introduction of a Stabilized Bi-Conjugate Gradient iterative solver for Helmholtz s Equation on the CMA GRAPES Global and Regional models. Peng Hong Bo (IBM), Zaphiris Christidis (Lenovo) and Zhiyan Jin
More informationPreconditioning Techniques Analysis for CG Method
Preconditioning Techniques Analysis for CG Method Huaguang Song Department of Computer Science University of California, Davis hso@ucdavis.edu Abstract Matrix computation issue for solve linear system
More informationSOLUTION of linear systems of equations of the form:
Proceedings of the Federated Conference on Computer Science and Information Systems pp. Mixed precision iterative refinement techniques for the WZ factorization Beata Bylina Jarosław Bylina Institute of
More informationA robust multilevel approximate inverse preconditioner for symmetric positive definite matrices
DICEA DEPARTMENT OF CIVIL, ENVIRONMENTAL AND ARCHITECTURAL ENGINEERING PhD SCHOOL CIVIL AND ENVIRONMENTAL ENGINEERING SCIENCES XXX CYCLE A robust multilevel approximate inverse preconditioner for symmetric
More informationPDE Solvers for Fluid Flow
PDE Solvers for Fluid Flow issues and algorithms for the Streaming Supercomputer Eran Guendelman February 5, 2002 Topics Equations for incompressible fluid flow 3 model PDEs: Hyperbolic, Elliptic, Parabolic
More informationLinear Solvers. Andrew Hazel
Linear Solvers Andrew Hazel Introduction Thus far we have talked about the formulation and discretisation of physical problems...... and stopped when we got to a discrete linear system of equations. Introduction
More informationSolving Sparse Linear Systems: Iterative methods
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccs Lecture Notes for Unit VII Sparse Matrix Computations Part 2: Iterative Methods Dianne P. O Leary c 2008,2010
More informationSolving Sparse Linear Systems: Iterative methods
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 2: Iterative Methods Dianne P. O Leary
More informationA Clustering Technique for Fast Electrothermal Analysis of On-Chip Power Distribution Networks
A Clustering Technique for Fast Electrothermal Analysis of On-Chip Power Distribution Networks A. Magnani 1, M. de Magistris 1, A. Maffucci 2, A. Todri Sanial 3 maffucci@unicas.it (1) Dept. of Electrical
More informationResidual iterative schemes for largescale linear systems
Universidad Central de Venezuela Facultad de Ciencias Escuela de Computación Lecturas en Ciencias de la Computación ISSN 1316-6239 Residual iterative schemes for largescale linear systems William La Cruz
More information4.8 Arnoldi Iteration, Krylov Subspaces and GMRES
48 Arnoldi Iteration, Krylov Subspaces and GMRES We start with the problem of using a similarity transformation to convert an n n matrix A to upper Hessenberg form H, ie, A = QHQ, (30) with an appropriate
More informationSystem Reduction for Nanoscale IC Design (SyreNe)
System Reduction for Nanoscale IC Design (SyreNe) Peter Benner February 26, 2009 1 Introduction Since 1993, the German Federal Ministry of Education and Research (BMBF Bundesministerium füa Bildung und
More informationIEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 31, NO. 1, JANUARY
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 31, NO. 1, JANUARY 2012 109 A Realistic Early-Stage Power Grid Verification Algorithm Based on Hierarchical Constraints
More informationAN INDEPENDENT LOOPS SEARCH ALGORITHM FOR SOLVING INDUCTIVE PEEC LARGE PROBLEMS
Progress In Electromagnetics Research M, Vol. 23, 53 63, 2012 AN INDEPENDENT LOOPS SEARCH ALGORITHM FOR SOLVING INDUCTIVE PEEC LARGE PROBLEMS T.-S. Nguyen *, J.-M. Guichon, O. Chadebec, G. Meunier, and
More information2.29 Numerical Fluid Mechanics Spring 2015 Lecture 9
Spring 2015 Lecture 9 REVIEW Lecture 8: Direct Methods for solving (linear) algebraic equations Gauss Elimination LU decomposition/factorization Error Analysis for Linear Systems and Condition Numbers
More informationAn Efficient Low Memory Implicit DG Algorithm for Time Dependent Problems
An Efficient Low Memory Implicit DG Algorithm for Time Dependent Problems P.-O. Persson and J. Peraire Massachusetts Institute of Technology 2006 AIAA Aerospace Sciences Meeting, Reno, Nevada January 9,
More informationUsing FLOTHERM and the Command Center to Exploit the Principle of Superposition
Using FLOTHERM and the Command Center to Exploit the Principle of Superposition Paul Gauché Flomerics Inc. 257 Turnpike Road, Suite 100 Southborough, MA 01772 Phone: (508) 357-2012 Fax: (508) 357-2013
More informationTHE solution of the absolute value equation (AVE) of
The nonlinear HSS-like iterative method for absolute value equations Mu-Zheng Zhu Member, IAENG, and Ya-E Qi arxiv:1403.7013v4 [math.na] 2 Jan 2018 Abstract Salkuyeh proposed the Picard-HSS iteration method
More informationConvergence property of IDR variant methods in the integral equation analysis of electromagnetic scattering problems
LETTER IEICE Electronics Express, Vol.11, No.9, 1 8 Convergence property of IDR variant methods in the integral equation analysis of electromagnetic scattering problems Hidetoshi Chiba a), Toru Fukasawa,
More informationEfficient Deflation for Communication-Avoiding Krylov Subspace Methods
Efficient Deflation for Communication-Avoiding Krylov Subspace Methods Erin Carson Nicholas Knight, James Demmel Univ. of California, Berkeley Monday, June 24, NASCA 2013, Calais, France Overview We derive
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 16-02 The Induced Dimension Reduction method applied to convection-diffusion-reaction problems R. Astudillo and M. B. van Gijzen ISSN 1389-6520 Reports of the Delft
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 24: Preconditioning and Multigrid Solver Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 5 Preconditioning Motivation:
More informationLecture 17 Methods for System of Linear Equations: Part 2. Songting Luo. Department of Mathematics Iowa State University
Lecture 17 Methods for System of Linear Equations: Part 2 Songting Luo Department of Mathematics Iowa State University MATH 481 Numerical Methods for Differential Equations Songting Luo ( Department of
More informationLeveraging Task-Parallelism in Energy-Efficient ILU Preconditioners
Leveraging Task-Parallelism in Energy-Efficient ILU Preconditioners José I. Aliaga Leveraging task-parallelism in energy-efficient ILU preconditioners Universidad Jaime I (Castellón, Spain) José I. Aliaga
More informationThe solution of the discretized incompressible Navier-Stokes equations with iterative methods
The solution of the discretized incompressible Navier-Stokes equations with iterative methods Report 93-54 C. Vuik Technische Universiteit Delft Delft University of Technology Faculteit der Technische
More informationRobust Preconditioned Conjugate Gradient for the GPU and Parallel Implementations
Robust Preconditioned Conjugate Gradient for the GPU and Parallel Implementations Rohit Gupta, Martin van Gijzen, Kees Vuik GPU Technology Conference 2012, San Jose CA. GPU Technology Conference 2012,
More informationHurwitz Stable Reduced Order Modeling and D2M Delay Calculation Metric Motivation Review: Moments. Content. Moments: Review. Motivation.
Hurwitz Stable Reduced Order Modeling and D2M Delay Calculation Metric Motivation Review: Moments Content Zhong Wang Electrical and Computer Engineering University of Toronto Feb 13, 2002 Hurwitz Stable
More informationEarly-stage Power Grid Analysis for Uncertain Working Modes
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL., NO., 1 Early-stage Power Grid Analysis for Uncertain Working Modes Haifeng Qian, Sani R. Nassif, Senior Member, IEEE,
More informationAccelerating the spike family of algorithms by solving linear systems with multiple right-hand sides
Accelerating the spike family of algorithms by solving linear systems with multiple right-hand sides Dept. of Computer Engineering & Informatics University of Patras Graduate Program in Computer Science
More informationAN EFFICIENT APPROACH FOR MULTIFRONTAL AL- GORITHM TO SOLVE NON-POSITIVE-DEFINITE FI- NITE ELEMENT EQUATIONS IN ELECTROMAGNETIC PROBLEMS
Progress In Electromagnetics Research, PIER 95, 2 33, 29 AN EFFICIENT APPROACH FOR MULTIFRONTAL AL- GORITHM TO SOLVE NON-POSITIVE-DEFINITE FI- NITE ELEMENT EQUATIONS IN ELECTROMAGNETIC PROBLEMS J. Tian,
More information