Numerical Methods for Random Matrices
|
|
- Ezra Barrett
- 6 years ago
- Views:
Transcription
1 Numerical Methods for Random Matrices MIT IAP Lecture Series Per-Olof Persson January 23, Random Matrix Eigenvalue Distribution β=1 β=2 β=4 Probability f β (s) Normalized Consecutive spacings s 1
2 Topics Histogramming random matrix eigenvalues Tridiagonal model Histogramming with Sturm sequences Largest eigenvalue distributions Simulation and approximations Numerical solution of Painlevé II Distributions for general β Eigenvalue spacing distributions Numerical solution of Painlevé V Eigenvalues of the Prolate matrix Spacing of Riemann Zeta zeros 2
3 The Gaussian Unitary Ensemble The Gaussian Unitary Ensemble: Set of n n random Hermitian matrices, with independent zero-mean Gaussian elements Diagonal elements x jj, upper triangular elements x jk = u jk + iv jk : Var(x jj ) = 1, 1 j n Var(u jk ) = Var(v jk ) = 1, 1 j < k n 2 In MATLAB: A=randn(n)+i*randn(n); A=(A+A )/2; 3
4 The Semi Circle Law The probability distribution of the eigenvalues of matrices in the GUE is a semi-circle as n Create histogram for finite n by generating random matrices and solving for all eigenvalues Requires O(n 2 ) memory = n < 1 4 for most computers Requires O(n 3 ) work per sample = Days to get a nice histogram Probability Eigenvalue x 1 4 4
5 Faster Method Similar Tridiagonal Matrix Real, symmetric, tridiagonal matrix with same eigenvalues as the GUE for β = 2 [Dumitriu, Edelman]: N(, 2) χ (n 1)β H β 1 χ (n 1)β N(, 2) χ (n 2)β χ 2β N(, 2) χ β χ β N(, 2) All eigenvalues in O(n) memory and O(n 2 ) time (e.g. the QR algorithm) Can easily handle n 1 6 on a single computer 5
6 Method of Bisection The Method of Bisection finds eigenvalues in an interval [λ min,λ max ) by considering roots of p(x) = det(a xi) The # of negative eigenvalues of A = The # of sign changes in the Sturm sequence 1, det(a (1) ), det(a (2) ),..., det(a (n) ) Shift A to get number of eigenvalues in (,λ max ) and twice for [λ min,λ max ) Three-term recurrence for the determinants: det(a (k) ) = a k det(a (k 1) ) b 2 k 1det(A (k 2) ) With shift xi and p (k) (x) = det(a (k) xi): p (k) (x) = (a k x)p (k 1) (x) b 2 k 1p (k 2) (x) 6
7 Histogramming by Bisection Idea [Edelman]: A histogram contains less information than all eigenvalues Use the method of bisection: Choose m histogram boxes σ i, compute Sturm sequences to count # eigenvalues < σ i Complexity: Work O(mn) instead of O(n 2 ) Memory O(1) instead of O(n) (if matrix generated on-the-fly) Can compute histograms for n 1 11 on a single computer 7
8 Topics Histogramming random matrix eigenvalues Tridiagonal model Histogramming with Sturm sequences Largest eigenvalue distributions Simulation and approximations Numerical solution of Painlevé II Distributions for general β Eigenvalue spacing distributions Numerical solution of Painlevé V Eigenvalues of the Prolate matrix Spacing of Riemann Zeta zeros 8
9 Largest Eigenvalue Distributions Consider again the GUE, but the distribution of the largest eigenvalue Rescale around the largest eigenvalue: ( λ max = n 1 6 λmax 2 n ) Use tridiagonal matrix for O(n) storage and O(n) computational work for largest eigenvalue (using Arnoldi iterations or method of bisection) 9
10 Faster Method Sparse Eigenvector The eigenvector corresponding to the largest eigenvalue is very close to zero in most components Therefore, when computing the largest eigenvalue the matrix is well approximated by the upper-left n cutoff by n cutoff matrix, where n cutoff 1n 1 3 = very large n can be used (> 1 12 ) Also, χ 2 n n + Gaussian for large n 1
11 Largest Eigenvalue Distributions β=1 β=2 β= Probability.4.3 Probability.4.3 Probability Normalized and Scaled Largest Eigenvalue Normalized and Scaled Largest Eigenvalue Normalized and Scaled Largest Eigenvalue Probability distribution of scaled largest eigenvalue (1 5 repetitions, n = 1 9 ) 11
12 Differential Equation for Distributions Probability distribution f 2 (s) is given by [Tracy, Widom]: where F 2 (s) = exp f 2 (s) = d ds F 2(s) ( s ) (x s)q(x) 2 dx and q(s) satisfies the Painlevé II differential equation: with the boundary condition q = sq + 2q 3 q(s) Ai(s), as s 12
13 Distributions for β = 1 and β = 4 The distributions for β = 1 and β = 4 can be computed from F 2 (s) as F 4 ( s F 1 (s) 2 = F 2 (s)e ) 2 = F 2 (s)( e 1 2 s q(x) dx s q(x) dx + e s ) 2 q(x) dx 13
14 Numerical Solution as Initial Value Problem Write as 1 st order system: d ds q = q q sq + 2q 3 Solve as initial-value problem starting at s = s = large positive number Initial values (boundary conditions): Explicit ODE solver (RK4) q(s ) = Ai(s ) q (s ) = Ai (s ) 14
15 Post-processing to Obtain f β (s) F 2 (s) = exp ( s (x s)q(x)2 dx ) could be computed using high-order quadrature Convenient trick: Set I(s) = (x s s)q(x)2 dx and differentiate: I (s) = s I (s) = q(s) 2 q(x) 2 dx Add these equations and the variables I(s),I (s) to ODE system, and let the solver do the integration Also, add variable J(s) = q(x)dx and equation J (s) = q(s) for s computation of F 1 (s) and F 4 (s) f β (s) = d ds F β(s) using numerical differentiation 15
16 Tracy-Widom Distributions using Painlevé II.7.6 β=1 β=2 β=4.5.4 f β (s) s The probability distributions f 1 (s), f 2 (s), and f 4 (s), using Painlevé II 16
17 Numerical Solution as Boundary Value Problem Initial value problem sensitive to errors in q(s ) and q (s ) More robust and higher accuracy by solving as a BVP Instead of condition on q (s ), use left end asymptotic [Dieng]: ( t q( t/2) t t ) 6 2t 9 8t 12 Discretize Painlevé II q = sq + 2q 3 using centered finite differences Solve discrete system R(Q) = by Newton s method (the Jacobian R/ Q is tridiagonal) Straight line initial guess for Newton iterations gives convergence to full accuracy in < 1 iterations 17
18 Distributions for general β Open question: Is there a differential equation for any β? Tridiagonal model allows us to experiment numerically: β=1 2 Probability β= Normalized and Scaled Largest Eigenvalue Distributions of scaled largest eigenvalue, β = 1, 1, 4, 2, 1,.2 18
19 β-dependence of Mean and Variance For large β, mean and variance are close to linear functions of 1/β: Average and Variance in Largest Eigenvalue Distribution Variance Average /β Average and variance of probability distribution as a function of 1/β 19
20 Convection-Diffusion Approximation Average and variance linear in t = 1/β suggest constant-coefficient convection-diffusion approximation: df dt = C 2 d 2 f 2 ds C df 2 1 ds f(,s) = δ(s AiZ 1 ) where C 1,C 2 are the slopes of the average and the variance. Solution: f(t,s) = ( 1 2πC2 t exp (x AiZ ) 1 C 1 t) 2 2C 2 t 2
21 Convection-Diffusion Approximation β=1 β=2 β=4.6 Exact C D Approximation f (s) β.4 f (s) β.4 f (s) β s s s Approximate distributions for β = 1, 2, 4 using the convection-diffusion model. 21
22 Topics Histogramming random matrix eigenvalues Tridiagonal model Histogramming with Sturm sequences Largest eigenvalue distributions Simulation and approximations Numerical solution of Painlevé II Distributions for general β Eigenvalue spacing distributions Numerical solution of Painlevé V Eigenvalues of the Prolate matrix Spacing of Riemann Zeta zeros 22
23 Eigenvalue Spacing Distribution Consider again the GUE, but the spacing of consecutive eigenvalues Normalized spacing of eigenvalues λ 1 λ 2... λ n : δ k = λ k+1 λ k 8n λ 2 k 4π, k n/2 Need to compute all eigenvalues use tridiagonal model for O(n) storage but O(n 2 ) work 23
24 Eigenvalue Spacing Distribution 1 Random Matrix Eigenvalue Distribution Probability Normalized Consecutive spacings Probability distribution of consecutive spacings of random matrix eigenvalues (1 repetitions, n = 1) 24
25 Differential Equation for Distributions Probability distribution p(s) is given by where p(s) = d2 ds 2E(s) E(s) = exp ( πs ) σ(t) dt t and σ(t) satisfies the Painlevé V differential equation: (tσ ) 2 + 4(tσ σ) ( tσ σ + (σ ) 2) = with the boundary condition σ(t) t π ( t π ) 2, as t + 25
26 Numerical Solution as Initial Value Problem Write as 1 st order system: d σ σ = dt σ t 2 (σ tσ ) (tσ σ + (σ ) 2 ) Solve as initial-value problem starting at t = t = small positive number Initial values (boundary conditions): Explicit ODE solver (RK4) σ(t ) = t π ( t π ) 2 σ (t ) = 1 π 2t π 26
27 ( πs E(s) = exp quadrature Post-processing to Obtain p(s) ) σ(t) dt t could be computed using high-order Convenient trick: Add variable I(t) and equation d dt I = σ t system, and let the solver do the integration to ODE p(s) = d2 ds 2 E(s) using numerical differentiation 27
28 Spacing Distributions using Painlevé V 1 σ(t) E(s), p(s) t s Painlevé V (left), E(s) and p(s) (right) 28
29 The Prolate Matrix E(2t) = i (1 λ i) where λ i are eigenvalues of the operator f(y) 1 1 Q(x,y)f(y)dy, Q(x,y) = sin ((x y)πt) (x y)π Infinite symmetric Prolate matrix: A = a a 1... a 1 a.... with a = 2w, a k = (sin 2πwk)/πk for k = 1, 2,..., and < w < 1 2. Set w = t/n. The upper-left n n submatrix A n is then a discretization of Q(x,y)
30 Improving Accuracy by Richardson Extrapolation Difference between Prolate solution E(s) and Painlevé V solution E (s): max E(s) E (s) s 5 after, 1, 2, and 3 Richardson extrapolations: N Error Error 1 Error 2 Error
31 Riemann Zeta Zeros Consider the zeros of the Riemann Zeta function along the critical line ζ ( ) iγ n where γ n = n th zero on the line =, < γ 1 < γ 2 <... Numerical values available for γ N+n, N =, 1 6, 1 12, 1 18, n = 1, 2,...,1 5 [Odlyzko] Normalize the zeros: γ n = γ n avg spacing near γ n = γ n [ ] log γn /2π Histogram consecutive spacings γ n+1 γ n and compare with eigenvalue spacing for the GUE 2π 31
32 Riemann Zeta Zeros and Eigenvalue Spacings 1 Riemann Zeta Zero Distribution Probability Normalized Consecutive spacings Probability distribution of consecutive spacings of Riemann Zeta zeros (3, zeros, n 1 12, 1 21, 1 22 ) 32
Random Matrices Numerical Methods for Random Matrices. Per-Olof Persson
18.325 Random Matrices Numerical Methods for Random Matrices Per-Olof Persson (persson@mit.edu) December 19, 22 1 Largest Eigenvalue Distributions In this section, the distributions of the largest eigenvalue
More informationarxiv:math-ph/ v1 27 Jan 2005
arxiv:math-ph/5168v1 27 Jan 25 Numerical Methods for Eigenvalue Distributions of Random Matrices Alan Edelman and Per-Olof Persson September 7, 218 Abstract We present efficient numerical techniques for
More informationAdvances in Random Matrix Theory: Let there be tools
Advances in Random Matrix Theory: Let there be tools Alan Edelman Brian Sutton, Plamen Koev, Ioana Dumitriu, Raj Rao and others MIT: Dept of Mathematics, Computer Science AI Laboratories World Congress,
More informationUniversality of distribution functions in random matrix theory Arno Kuijlaars Katholieke Universiteit Leuven, Belgium
Universality of distribution functions in random matrix theory Arno Kuijlaars Katholieke Universiteit Leuven, Belgium SEA 06@MIT, Workshop on Stochastic Eigen-Analysis and its Applications, MIT, Cambridge,
More informationNumerical Evaluation of Standard Distributions in Random Matrix Theory
Numerical Evaluation of Standard Distributions in Random Matrix Theory A Review of Folkmar Bornemann s MATLAB Package and Paper Matt Redmond Department of Mathematics Massachusetts Institute of Technology
More informationExponential tail inequalities for eigenvalues of random matrices
Exponential tail inequalities for eigenvalues of random matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify
More informationAlan Edelman. Why are random matrix eigenvalues cool? MAA Mathfest 2002 Thursday, August 1. MIT: Dept of Mathematics, Lab for Computer Science
Why are random matrix eigenvalues cool? Alan Edelman MIT: Dept of Mathematics, Lab for Computer Science MAA Mathfest 2002 Thursday, August 6/2/2004 Message Ingredient: Take Any important mathematics Then
More informationMath 405: Numerical Methods for Differential Equations 2016 W1 Topics 10: Matrix Eigenvalues and the Symmetric QR Algorithm
Math 405: Numerical Methods for Differential Equations 2016 W1 Topics 10: Matrix Eigenvalues and the Symmetric QR Algorithm References: Trefethen & Bau textbook Eigenvalue problem: given a matrix A, find
More informationMath 504 (Fall 2011) 1. (*) Consider the matrices
Math 504 (Fall 2011) Instructor: Emre Mengi Study Guide for Weeks 11-14 This homework concerns the following topics. Basic definitions and facts about eigenvalues and eigenvectors (Trefethen&Bau, Lecture
More informationPainlevé Representations for Distribution Functions for Next-Largest, Next-Next-Largest, etc., Eigenvalues of GOE, GUE and GSE
Painlevé Representations for Distribution Functions for Next-Largest, Next-Next-Largest, etc., Eigenvalues of GOE, GUE and GSE Craig A. Tracy UC Davis RHPIA 2005 SISSA, Trieste 1 Figure 1: Paul Painlevé,
More informationarxiv:hep-th/ v1 14 Oct 1992
ITD 92/93 11 Level-Spacing Distributions and the Airy Kernel Craig A. Tracy Department of Mathematics and Institute of Theoretical Dynamics, University of California, Davis, CA 95616, USA arxiv:hep-th/9210074v1
More informationx x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
More informationProgress in the method of Ghosts and Shadows for Beta Ensembles
Progress in the method of Ghosts and Shadows for Beta Ensembles Alan Edelman (MIT) Alex Dubbs (MIT) and Plamen Koev (SJS) Oct 8, 2012 1/47 Wishart Matrices (arbitrary covariance) G=mxn matrix of Gaussians
More informationComputing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices
Computing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 8, 2009 Today
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 informationRANDOM MATRIX THEORY AND TOEPLITZ DETERMINANTS
RANDOM MATRIX THEORY AND TOEPLITZ DETERMINANTS David García-García May 13, 2016 Faculdade de Ciências da Universidade de Lisboa OVERVIEW Random Matrix Theory Introduction Matrix ensembles A sample computation:
More informationMaximal height of non-intersecting Brownian motions
Maximal height of non-intersecting Brownian motions G. Schehr Laboratoire de Physique Théorique et Modèles Statistiques CNRS-Université Paris Sud-XI, Orsay Collaborators: A. Comtet (LPTMS, Orsay) P. J.
More informationMarkov operators, classical orthogonal polynomial ensembles, and random matrices
Markov operators, classical orthogonal polynomial ensembles, and random matrices M. Ledoux, Institut de Mathématiques de Toulouse, France 5ecm Amsterdam, July 2008 recent study of random matrix and random
More informationLow-temperature random matrix theory at the soft edge. Abstract
Low-temperature random matrix theory at the soft edge Alan Edelman Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 239, USA Per-Olof Persson Department of Mathematics, University
More informationBulk scaling limits, open questions
Bulk scaling limits, open questions Based on: Continuum limits of random matrices and the Brownian carousel B. Valkó, B. Virág. Inventiones (2009). Eigenvalue statistics for CMV matrices: from Poisson
More informationNumerical Methods - Numerical Linear Algebra
Numerical Methods - Numerical Linear Algebra Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Numerical Linear Algebra I 2013 1 / 62 Outline 1 Motivation 2 Solving Linear
More informationNUMERICAL COMPUTATION IN SCIENCE AND ENGINEERING
NUMERICAL COMPUTATION IN SCIENCE AND ENGINEERING C. Pozrikidis University of California, San Diego New York Oxford OXFORD UNIVERSITY PRESS 1998 CONTENTS Preface ix Pseudocode Language Commands xi 1 Numerical
More informationAiry and Pearcey Processes
Airy and Pearcey Processes Craig A. Tracy UC Davis Probability, Geometry and Integrable Systems MSRI December 2005 1 Probability Space: (Ω, Pr, F): Random Matrix Models Gaussian Orthogonal Ensemble (GOE,
More informationJACOBI S ITERATION METHOD
ITERATION METHODS These are methods which compute a sequence of progressively accurate iterates to approximate the solution of Ax = b. We need such methods for solving many large linear systems. Sometimes
More informationDeterminantal point processes and random matrix theory in a nutshell
Determinantal point processes and random matrix theory in a nutshell part II Manuela Girotti based on M. Girotti s PhD thesis, A. Kuijlaars notes from Les Houches Winter School 202 and B. Eynard s notes
More informationRandom Matrices and Multivariate Statistical Analysis
Random Matrices and Multivariate Statistical Analysis Iain Johnstone, Statistics, Stanford imj@stanford.edu SEA 06@MIT p.1 Agenda Classical multivariate techniques Principal Component Analysis Canonical
More informationIntroduction to Numerical Analysis
J. Stoer R. Bulirsch Introduction to Numerical Analysis Second Edition Translated by R. Bartels, W. Gautschi, and C. Witzgall With 35 Illustrations Springer Contents Preface to the Second Edition Preface
More informationMath Ordinary Differential Equations
Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x
More informationLecture 10: Finite Differences for ODEs & Nonlinear Equations
Lecture 10: Finite Differences for ODEs & Nonlinear Equations J.K. Ryan@tudelft.nl WI3097TU Delft Institute of Applied Mathematics Delft University of Technology 21 November 2012 () Finite Differences
More informationOrthogonal Polynomial Ensembles
Chater 11 Orthogonal Polynomial Ensembles 11.1 Orthogonal Polynomials of Scalar rgument Let wx) be a weight function on a real interval, or the unit circle, or generally on some curve in the comlex lane.
More informationLast Time. Social Network Graphs Betweenness. Graph Laplacian. Girvan-Newman Algorithm. Spectral Bisection
Eigenvalue Problems Last Time Social Network Graphs Betweenness Girvan-Newman Algorithm Graph Laplacian Spectral Bisection λ 2, w 2 Today Small deviation into eigenvalue problems Formulation Standard eigenvalue
More informationLecture4 INF-MAT : 5. Fast Direct Solution of Large Linear Systems
Lecture4 INF-MAT 4350 2010: 5. Fast Direct Solution of Large Linear Systems Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo September 16, 2010 Test Matrix
More informationConsider the following example of a linear system:
LINEAR SYSTEMS Consider the following example of a linear system: Its unique solution is x + 2x 2 + 3x 3 = 5 x + x 3 = 3 3x + x 2 + 3x 3 = 3 x =, x 2 = 0, x 3 = 2 In general we want to solve n equations
More informationDetailed analysis of prolate quadratures and interpolation formulas
As demonstrated by Slepian et. al. in a sequence of classical papers see [33], [34], [7], [35], [36]), prolate spheroidal wave functions PSWFs) provide a natural and efficient tool for computing with bandlimited
More informationTriangular matrices and biorthogonal ensembles
/26 Triangular matrices and biorthogonal ensembles Dimitris Cheliotis Department of Mathematics University of Athens UK Easter Probability Meeting April 8, 206 2/26 Special densities on R n Example. n
More information1 Tridiagonal matrices
Lecture Notes: β-ensembles Bálint Virág Notes with Diane Holcomb 1 Tridiagonal matrices Definition 1. Suppose you have a symmetric matrix A, we can define its spectral measure (at the first coordinate
More informationLecture 13 Eigenvalue Problems
Lecture 13 Eigenvalue Probles MIT 18.335J / 6.337J Introduction to Nuerical Methods Per-Olof Persson October 24, 2006 1 The Eigenvalue Decoposition Eigenvalue proble for atrix A: Ax = λx with eigenvalues
More informationCourse 216: Ordinary Differential Equations
Course 16: Ordinary Differential Equations Notes by Chris Blair These notes cover the ODEs course given in 7-8 by Dr. John Stalker. Contents I Solving Linear ODEs 1 Reduction of Order Computing Matrix
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 informationThe family of Runge Kutta methods with two intermediate evaluations is defined by
AM 205: lecture 13 Last time: Numerical solution of ordinary differential equations Today: Additional ODE methods, boundary value problems Thursday s lecture will be given by Thomas Fai Assignment 3 will
More informationContents. Preface to the Third Edition (2007) Preface to the Second Edition (1992) Preface to the First Edition (1985) License and Legal Information
Contents Preface to the Third Edition (2007) Preface to the Second Edition (1992) Preface to the First Edition (1985) License and Legal Information xi xiv xvii xix 1 Preliminaries 1 1.0 Introduction.............................
More informationDouble contour integral formulas for the sum of GUE and one matrix model
Double contour integral formulas for the sum of GUE and one matrix model Based on arxiv:1608.05870 with Tom Claeys, Arno Kuijlaars, and Karl Liechty Dong Wang National University of Singapore Workshop
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 informationApplied Mathematics 205. Unit V: Eigenvalue Problems. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit V: Eigenvalue Problems Lecturer: Dr. David Knezevic Unit V: Eigenvalue Problems Chapter V.4: Krylov Subspace Methods 2 / 51 Krylov Subspace Methods In this chapter we give
More informationComputation of eigenvalues and singular values Recall that your solutions to these questions will not be collected or evaluated.
Math 504, Homework 5 Computation of eigenvalues and singular values Recall that your solutions to these questions will not be collected or evaluated 1 Find the eigenvalues and the associated eigenspaces
More informationMath 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008
Math 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008 Exam 2 will be held on Tuesday, April 8, 7-8pm in 117 MacMillan What will be covered The exam will cover material from the lectures
More informationLECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel
LECTURE NOTES on ELEMENTARY NUMERICAL METHODS Eusebius Doedel TABLE OF CONTENTS Vector and Matrix Norms 1 Banach Lemma 20 The Numerical Solution of Linear Systems 25 Gauss Elimination 25 Operation Count
More informationThe restarted QR-algorithm for eigenvalue computation of structured matrices
Journal of Computational and Applied Mathematics 149 (2002) 415 422 www.elsevier.com/locate/cam The restarted QR-algorithm for eigenvalue computation of structured matrices Daniela Calvetti a; 1, Sun-Mi
More informationIterative Methods. Splitting Methods
Iterative Methods Splitting Methods 1 Direct Methods Solving Ax = b using direct methods. Gaussian elimination (using LU decomposition) Variants of LU, including Crout and Doolittle Other decomposition
More informationConcentration Inequalities for Random Matrices
Concentration Inequalities for Random Matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify the asymptotic
More informationNear extreme eigenvalues and the first gap of Hermitian random matrices
Near extreme eigenvalues and the first gap of Hermitian random matrices Grégory Schehr LPTMS, CNRS-Université Paris-Sud XI Sydney Random Matrix Theory Workshop 13-16 January 2014 Anthony Perret, G. S.,
More informationMath 577 Assignment 7
Math 577 Assignment 7 Thanks for Yu Cao 1. Solution. The linear system being solved is Ax = 0, where A is a (n 1 (n 1 matrix such that 2 1 1 2 1 A =......... 1 2 1 1 2 and x = (U 1, U 2,, U n 1. By the
More informationFEM and sparse linear system solving
FEM & sparse linear system solving, Lecture 9, Nov 19, 2017 1/36 Lecture 9, Nov 17, 2017: Krylov space methods http://people.inf.ethz.ch/arbenz/fem17 Peter Arbenz Computer Science Department, ETH Zürich
More informationNotes for CS542G (Iterative Solvers for Linear Systems)
Notes for CS542G (Iterative Solvers for Linear Systems) Robert Bridson November 20, 2007 1 The Basics We re now looking at efficient ways to solve the linear system of equations Ax = b where in this course,
More informationLinear algebra & Numerical Analysis
Linear algebra & Numerical Analysis Eigenvalues and Eigenvectors Marta Jarošová http://homel.vsb.cz/~dom033/ Outline Methods computing all eigenvalues Characteristic polynomial Jacobi method for symmetric
More informationClass notes: Approximation
Class notes: Approximation Introduction Vector spaces, linear independence, subspace The goal of Numerical Analysis is to compute approximations We want to approximate eg numbers in R or C vectors in R
More informationLecture IX. Definition 1 A non-singular Sturm 1 -Liouville 2 problem consists of a second order linear differential equation of the form.
Lecture IX Abstract When solving PDEs it is often necessary to represent the solution in terms of a series of orthogonal functions. One way to obtain an orthogonal family of functions is by solving a particular
More informationComputing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices
Computing Eigenvalues and/or Eigenvectors;Part 1, Generalities and symmetric matrices Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 9, 2008 Today
More informationIntroduction to Mathematical Programming
Introduction to Mathematical Programming Ming Zhong Lecture 6 September 12, 2018 Ming Zhong (JHU) AMS Fall 2018 1 / 20 Table of Contents 1 Ming Zhong (JHU) AMS Fall 2018 2 / 20 Solving Linear Systems A
More informationON THE CONVERGENCE OF THE NEAREST NEIGHBOUR EIGENVALUE SPACING DISTRIBUTION FOR ORTHOGONAL AND SYMPLECTIC ENSEMBLES
O THE COVERGECE OF THE EAREST EIGHBOUR EIGEVALUE SPACIG DISTRIBUTIO FOR ORTHOGOAL AD SYMPLECTIC ESEMBLES Dissertation zur Erlangung des Doktorgrades der aturwissenschaften an der Fakultät für Mathematik
More informationUniversality of local spectral statistics of random matrices
Universality of local spectral statistics of random matrices László Erdős Ludwig-Maximilians-Universität, Munich, Germany CRM, Montreal, Mar 19, 2012 Joint with P. Bourgade, B. Schlein, H.T. Yau, and J.
More informationCache Oblivious Stencil Computations
Cache Oblivious Stencil Computations S. HUNOLD J. L. TRÄFF F. VERSACI Lectures on High Performance Computing 13 April 2015 F. Versaci (TU Wien) Cache Oblivious Stencil Computations 13 April 2015 1 / 19
More informationA Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem
A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem Bor Plestenjak Department of Mathematics University of Ljubljana Slovenia Ellen Van Camp and Marc Van
More informationSTABILITY FOR PARABOLIC SOLVERS
Review STABILITY FOR PARABOLIC SOLVERS School of Mathematics Semester 1 2008 OUTLINE Review 1 REVIEW 2 STABILITY: EXPLICIT METHOD Explicit Method as a Matrix Equation Growing Errors Stability Constraint
More informationAPPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS
LECTURE 10 APPLICATIONS OF FD APPROXIMATIONS FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS Ordinary Differential Equations Initial Value Problems For Initial Value problems (IVP s), conditions are specified
More informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
More informationNUMERICAL CALCULATION OF RANDOM MATRIX DISTRIBUTIONS AND ORTHOGONAL POLYNOMIALS. Sheehan Olver NA Group, Oxford
NUMERICAL CALCULATION OF RANDOM MATRIX DISTRIBUTIONS AND ORTHOGONAL POLYNOMIALS Sheehan Olver NA Group, Oxford We are interested in numerically computing eigenvalue statistics of the GUE ensembles, i.e.,
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 19: More on Arnoldi Iteration; Lanczos Iteration Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical Analysis I 1 / 17 Outline 1
More informationStability of Krylov Subspace Spectral Methods
Stability of Krylov Subspace Spectral Methods James V. Lambers Department of Energy Resources Engineering Stanford University includes joint work with Patrick Guidotti and Knut Sølna, UC Irvine Margot
More informationLinear Algebra Review
Chapter 1 Linear Algebra Review It is assumed that you have had a course in linear algebra, and are familiar with matrix multiplication, eigenvectors, etc. I will review some of these terms here, but quite
More informationButcher tableau Can summarize an s + 1 stage Runge Kutta method using a triangular grid of coefficients
AM 205: lecture 13 Last time: ODE convergence and stability, Runge Kutta methods Today: the Butcher tableau, multi-step methods, boundary value problems Butcher tableau Can summarize an s + 1 stage Runge
More informationA determinantal formula for the GOE Tracy-Widom distribution
A determinantal formula for the GOE Tracy-Widom distribution Patrik L. Ferrari and Herbert Spohn Technische Universität München Zentrum Mathematik and Physik Department e-mails: ferrari@ma.tum.de, spohn@ma.tum.de
More informationLecture 1: Systems of linear equations and their solutions
Lecture 1: Systems of linear equations and their solutions Course overview Topics to be covered this semester: Systems of linear equations and Gaussian elimination: Solving linear equations and applications
More informationThe Density Matrix for the Ground State of 1-d Impenetrable Bosons in a Harmonic Trap
The Density Matrix for the Ground State of 1-d Impenetrable Bosons in a Harmonic Trap Institute of Fundamental Sciences Massey University New Zealand 29 August 2017 A. A. Kapaev Memorial Workshop Michigan
More informationEigenvalue Problems. Eigenvalue problems occur in many areas of science and engineering, such as structural analysis
Eigenvalue Problems Eigenvalue problems occur in many areas of science and engineering, such as structural analysis Eigenvalues also important in analyzing numerical methods Theory and algorithms apply
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 4 Eigenvalue Problems Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction
More informationAIMS Exercise Set # 1
AIMS Exercise Set #. Determine the form of the single precision floating point arithmetic used in the computers at AIMS. What is the largest number that can be accurately represented? What is the smallest
More informationEigenvalue PDFs. Peter Forrester, M&S, University of Melbourne
Outline Eigenvalue PDFs Peter Forrester, M&S, University of Melbourne Hermitian matrices with real, complex or real quaternion elements Circular ensembles and classical groups Products of random matrices
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationFluctuations from the Semicircle Law Lecture 1
Fluctuations from the Semicircle Law Lecture 1 Ioana Dumitriu University of Washington Women and Math, IAS 2014 May 20, 2014 Ioana Dumitriu (UW) Fluctuations from the Semicircle Law Lecture 1 May 20, 2014
More informationESTIMATES OF THE TRACE OF THE INVERSE OF A SYMMETRIC MATRIX USING THE MODIFIED CHEBYSHEV ALGORITHM
ESTIMATES OF THE TRACE OF THE INVERSE OF A SYMMETRIC MATRIX USING THE MODIFIED CHEBYSHEV ALGORITHM GÉRARD MEURANT In memory of Gene H. Golub Abstract. In this paper we study how to compute an estimate
More informationAlgebraic aspects of some Riordan arrays related to binary words avoiding a pattern
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern D. Merlini and R. Sprugnoli Dipartimento di Sistemi e Informatica viale Morgagni 65, 5034, Firenze, Italia merlini@dsi.unifi.it,
More informationMAT Linear Algebra Collection of sample exams
MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system
More informationUniversality in Numerical Computations with Random Data. Case Studies.
Universality in Numerical Computations with Random Data. Case Studies. Percy Deift and Thomas Trogdon Courant Institute of Mathematical Sciences Govind Menon Brown University Sheehan Olver The University
More information1 Linear Regression and Correlation
Math 10B with Professor Stankova Worksheet, Discussion #27; Tuesday, 5/1/2018 GSI name: Roy Zhao 1 Linear Regression and Correlation 1.1 Concepts 1. Often when given data points, we want to find the line
More informationProject: Vibration of Diatomic Molecules
Project: Vibration of Diatomic Molecules Objective: Find the vibration energies and the corresponding vibrational wavefunctions of diatomic molecules H 2 and I 2 using the Morse potential. equired Numerical
More informationNumerical Methods I Eigenvalue Problems
Numerical Methods I Eigenvalue Problems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 2nd, 2014 A. Donev (Courant Institute) Lecture
More informationthat determines x up to a complex scalar of modulus 1, in the real case ±1. Another condition to normalize x is by requesting that
Chapter 3 Newton methods 3. Linear and nonlinear eigenvalue problems When solving linear eigenvalue problems we want to find values λ C such that λi A is singular. Here A F n n is a given real or complex
More informationStochastic Differential Equations.
Chapter 3 Stochastic Differential Equations. 3.1 Existence and Uniqueness. One of the ways of constructing a Diffusion process is to solve the stochastic differential equation dx(t) = σ(t, x(t)) dβ(t)
More informationNumerical Methods for Engineers and Scientists
Numerical Methods for Engineers and Scientists Second Edition Revised and Expanded Joe D. Hoffman Department of Mechanical Engineering Purdue University West Lafayette, Indiana m MARCEL D E К К E R MARCEL
More informationQuadrature for the Finite Free Convolution
Spectral Graph Theory Lecture 23 Quadrature for the Finite Free Convolution Daniel A. Spielman November 30, 205 Disclaimer These notes are not necessarily an accurate representation of what happened in
More informationNumerical Programming I (for CSE)
Technische Universität München WT 1/13 Fakultät für Mathematik Prof. Dr. M. Mehl B. Gatzhammer January 1, 13 Numerical Programming I (for CSE) Tutorial 1: Iterative Methods 1) Relaxation Methods a) Let
More informationSolving linear equations with Gaussian Elimination (I)
Term Projects Solving linear equations with Gaussian Elimination The QR Algorithm for Symmetric Eigenvalue Problem The QR Algorithm for The SVD Quasi-Newton Methods Solving linear equations with Gaussian
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationMath 411 Preliminaries
Math 411 Preliminaries Provide a list of preliminary vocabulary and concepts Preliminary Basic Netwon s method, Taylor series expansion (for single and multiple variables), Eigenvalue, Eigenvector, Vector
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J Olver 8 Numerical Computation of Eigenvalues In this part, we discuss some practical methods for computing eigenvalues and eigenvectors of matrices Needless to
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 9
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 9 Initial Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction
More informationDifferential Equations for Dyson Processes
Differential Equations for Dyson Processes Joint work with Harold Widom I. Overview We call Dyson process any invariant process on ensembles of matrices in which the entries undergo diffusion. Dyson Brownian
More informationNumerical Methods in Matrix Computations
Ake Bjorck Numerical Methods in Matrix Computations Springer Contents 1 Direct Methods for Linear Systems 1 1.1 Elements of Matrix Theory 1 1.1.1 Matrix Algebra 2 1.1.2 Vector Spaces 6 1.1.3 Submatrices
More information11.3 Eigenvalues and Eigenvectors of a Tridiagonal Matrix
11.3 Eigenvalues and Eigenvectors of a ridiagonal Matrix Evaluation of the Characteristic Polynomial Once our original, real, symmetric matrix has been reduced to tridiagonal form, one possible way to
More information