A numerical solution of the constrained weighted energy problem and its relation to rational Lanczos iterations
|
|
- Leon Payne
- 5 years ago
- Views:
Transcription
1 A numerical solution of the constrained weighted energy problem and its relation to rational Lanczos iterations Karl Deckers, Andrey Chesnokov, and Marc Van Barel Department of Computer Science, Katholieke Universiteit Leuven, Heverlee, Belgium June 18, 2009 Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 1/40
2 Outline 1 Preliminaries Logarithmic potential and WEP Constrained weighted energy problem 2 Algorithm Main loop Discretization Numerical examples 3 Connection with the rational Lanczos algorithm The rational Lanczos method Characterization of converged Ritz values Numerical examples Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 2/40
3 Outline 1 Preliminaries Logarithmic potential and WEP Constrained weighted energy problem 2 Algorithm Main loop Discretization Numerical examples 3 Connection with the rational Lanczos algorithm The rational Lanczos method Characterization of converged Ritz values Numerical examples Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 3/40
4 Logarithmic potential and energy Definition M(E) = {µ : µ(c) = 1 and supp(µ) E}; Logarithmic potential of a measure µ: U µ 1 (z) = log z z dµ(z ); Logarithmic energy of a measure µ: 1 I(µ) = log z z dµ(z )dµ(z). In remainder: E = J j=1 [a j,b j ] R, with < a 1 < b 1 < a 2 <... < b J 1 < a J < b J <. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 4/40
5 Weighted energy problem WEP min I(µ ν), µ M(E) for a given positive measure ν, with compact supp(ν) (C \ E) bounded away from E, and ν(c) = s [0,1]. Theorem (equivalent formulation of the WEP) Let µ ν M(E) be a solution of the WEP. Then U µν ν (z) = C ν, z E U µν ν (z) < C ν, z / E. The solution µ ν is unique and is called the balayage-measure of the probability measure η = ν + (1 s)δ (µ ν = Bal(η,E)). Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 5/40
6 Example Let E = [ 1,1] and ν = 1 3 (δ α 1 + δ α2 + δ α3 ), where α 1 = i, α 2 = i and α 3 = e2 y x Figure: Density of µ ν. Figure: Weighted potential U µν ν. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 6/40
7 Outline 1 Preliminaries Logarithmic potential and WEP Constrained weighted energy problem 2 Algorithm Main loop Discretization Numerical examples 3 Connection with the rational Lanczos algorithm The rational Lanczos method Characterization of converged Ritz values Numerical examples Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 7/40
8 Constrained weighted energy problem CWEP min I(µ ν), tµ σ, t (0,1), µ M(E) for a given σ M(E), with I(σ) <. Theorem (equivalent formulation of the CWEP) Assume U σ (z) continuous and real-valued, and let µ ν t be a solution of the CWEP. Then The solution µ ν t is unique. U µν t ν (z) = C ν t, z supp(σ tµν t ) U µν t ν (z) C ν t, z C. Note: supp(σ tµ ν t ) = the set where tµ ν t < σ. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 8/40
9 Key lemma to devise the algorithm Lemma Suppose for some µ M(E) (not necessarily with tµ σ): U µ ν (z) = C, z supp(σ tµ) U µ ν (z) C, z C. Then supp(σ tµ ν t ) supp((σ tµ) + ), and µ ν t µ on supp(σ tµ ν t ). Consequence tµ ν t = σ on the region where tµ σ. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 9/40
10 Outline 1 Preliminaries Logarithmic potential and WEP Constrained weighted energy problem 2 Algorithm Main loop Discretization Numerical examples 3 Connection with the rational Lanczos algorithm The rational Lanczos method Characterization of converged Ritz values Numerical examples Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 10/40
11 Sketch of the main Algorithm Sketch Supposing ν, σ and E are given. Solve the CWEP based on the previous lemma: 1 Find µ (1) M(E) s.t. U µ(1) ν = C (1) on S (1) = E. 2 Put µ (2) = σ/t on the region where tµ (1) σ. 3 Require that U µ(2) ν = C (2) on the remaining region S (2) S (1). 4 Repeat until µ (k) σ/t, i.e., until S (k) = S (k 1). µ t = µ (k). Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 11/40
12 Algorithm 1: continuous version of the CWEP algorithm begin I = supp(σ) J = µ = while µ σ/t do µ J = { 1 t σ J U µ I (z) = C U µ J(z) + U ν (z), solve µ I (C) = 1 µ J (C) I = {tµ < σ} J = {tµ σ} end return µ t = µ end z I Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 12/40
13 Correctness of the Algorithm Output: µ t s.t. tµ t σ and U µt ν = C t on supp(σ tµ t ) U µt ν C t outside supp(σ tµ t )? Or, equivalently, µ t = µ ν t? Theorem For every k, U µ(k) ν C (k) outside S (k) = supp(σ tµ (k) ). Will the algorithm ever stop? Not necessarily, but the discrete version always stops. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 13/40
14 Outline 1 Preliminaries Logarithmic potential and WEP Constrained weighted energy problem 2 Algorithm Main loop Discretization Numerical examples 3 Connection with the rational Lanczos algorithm The rational Lanczos method Characterization of converged Ritz values Numerical examples Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 14/40
15 Discretization Similar as for the C(uW)EP (Helsen, Van Barel ( 06)) {y 1,y 2,...,y N } discretization of supp(σ). Consider dµ to be piecewise linear: dµ(y) = (a j y + b j )dy for y [y j 1,y j ] Let v = [µ 1,...,µ N ] T, with µ j = µ (y j ). Let s = [σ 1,...,σ N ] T, with σ j = σ (y j ). Let m s.t. m T v = µ(c) for every µ M(E). Suppose an explicit representation κ(x) exists for U ν (x) on E. Require the (in-)equalities of the CWEP to hold only in the discretization points. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 15/40
16 Discretization Let f (y,x) := log x y dy and g(y,x) := log x y ydy. Then: U µ (x) = N a j (g(y j,x) g(y j 1,x)) + b j (f (y j,x) f (y j 1,x)), j=2 where the a j s and b j s are linear in the µ j s. P s.t. U µ (y j ) = (Pv) j, µ M(E) with discretization v. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 16/40
17 Algorithm 2: discretized version of the CWEP algorithm begin I = {1,2,...,N} J = v = e(i) while v s/t do v(j) = { 1 t s(j) P(I,I) v(i) = Ce(I) P(I,J) v(j) + k(i) solve m(i) T v(i) = 1 m(j) T v(j) I = {tv < s} J = {tv s} end return vt ν = v end Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 17/40
18 Complexity of Algorithm 2 Stopping On every step at least 1 point is added to J. When no point is added, the stopping criterion is fulfilled. Complexity O(N 2 ) ops to construct P, O(M 3 k ) ops to compute v(i k), where M k = lenght(i k ) < M k 1 N total number of iterations is (generally) N Total cost of order O(N 3 ) Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 18/40
19 Outline 1 Preliminaries Logarithmic potential and WEP Constrained weighted energy problem 2 Algorithm Main loop Discretization Numerical examples 3 Connection with the rational Lanczos algorithm The rational Lanczos method Characterization of converged Ritz values Numerical examples Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 19/40
20 Numerical examples Consider the counting measure ν = 1 m δ αk, m n, α k / E. n k=1 Logarithmic potential: U ν (x) = 1 m n log (x α k ). k=1 If E = [a,b], the density of µ ν is given by (Deckers, Bultheel ( 07)): [ { } ] m dµ ν k=1 (x) R (αk b)(α k a) α k x + (n m) = dx nπ, x [a,b], (b x)(x a) where the square root is s.t. R{ } is positive on [a,b]. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 20/40
21 Example (WEP) E = [ 1,1], and ν = δ α, with α = i. 4 computed density 10 1 relative error dµ/dx x x Figure: Computed density of µ ν. Figure: Relative error. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 21/40
22 Example (CWEP) dσ(x) = 2 1 x 2 π dx on E = [ 1,1], and ν = { i, k 50 t (0,1), and α k = i, k > t 100t 1 k=1 α k, with tdµt/dx x Figure: Computed density of µ ν t for t = r, r = 0,...,5. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 22/40
23 10 0tdµt/dx 10 0tdµt/dx 10 0tdµt/dx Example (CWEP) σ = Bal(δ β,e), where β = i and E = [ 1,1], and ν = δ α x x x Figure: Density of tµ ν t for α = β, Figure: for α = i, Figure: and for α = i. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 23/40
24 Outline 1 Preliminaries Logarithmic potential and WEP Constrained weighted energy problem 2 Algorithm Main loop Discretization Numerical examples 3 Connection with the rational Lanczos algorithm The rational Lanczos method Characterization of converged Ritz values Numerical examples Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 24/40
25 Rational Krylov subspaces Let A N Hermitian N N matrix with distinct eigenvalues in E. q N non-zero column vector in C N. A n sequence of complex poles {α 1,...,α n } C { } bounded away from ch(e), and α k 0. Define x j b j (x) = ( ) = xj, j = 1,...,n. j k=1 1 x π j (x) α k Definition The rational Krylov subspace K n+1 (A N,q N, A n ) is given by K n+1 (A N,q N, A n ) = span {q N,b 1 (A N )q N,...,b n (A N )q N }, n = 1,...,N 1. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 25/40
26 Rational Krylov subspaces The rational Lanczos iterations produce an orthonormal basis for K n+1 (n < N): Put v 1 = q N / q N. Compute x k = (I A N /α k ) 1 A N v k, k > 0. Orthogonalize x k against v 1,...,v k, followed by normalization k+1 x k = h j,k v j, k = 1,...,n. j=1 Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 26/40
27 Rational Lanczos iterations, matrix language A n = B [αn] n where h ( n+1,n Vn H A N v n+1 [ ] I n + H n [αn] α n V n (v k ) C N n, projection matrix H [αn] n (h j,k ) C n n, upper Hessenberg D n [αn] diag(1/α 1,...,1/α n ) A n Vn H A N V n B [αn] n H [αn] n ( I n + H [αn] n ) D [αn] 1 n D n [αn] ) 1, Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 27/40
28 Special case α n =...since the left-hand side does not depend on α n, choose α n = which gives the nice projection formula A n = B [ ] n, A n = V H n A N V n = H [ ] n ( I n + H [ ] n D [ ] n ) 1. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 28/40
29 Rational Lanczos minimization problem By definition, v k+1 = ϕ k (A N )q N, where ϕ k (x) = p k(x) π k (x) orthonormal rational function (ORF) with poles in A k. is an The eigenvalues of B [αn] n are zeros of the ORF ϕ n. If α n is real or infinite, they are all real and in ch(e). (Deckers, Bultheel ( 07)) Corollary The Ritz values are the zeros of an ORF ϕ n = pn(x) π n 1 (x). Let P n denote the space of monic polynomials of degree n: Rational Lanczos minimization problem p(a N ) π n 1 (A N ) q N. min p P n Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 29/40
30 Outline 1 Preliminaries Logarithmic potential and WEP Constrained weighted energy problem 2 Algorithm Main loop Discretization Numerical examples 3 Connection with the rational Lanczos algorithm The rational Lanczos method Characterization of converged Ritz values Numerical examples Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 30/40
31 Characterization of converged Ritz values I 1 N,n s.t. n/n t (0,1) 2 sequence of Hermitian matrices (A N ) C N N λ 1,N < λ 2,N <... < λ N,N 3 asymptotic distribution of the eigenvalues: 1 N lim δ λk,n = σ M(E) N N k=1 4 asymptotic distribution of the poles: lim N n(n) 1 n(n) lim N k=1 δ αk = ν t + (1 s t )δ = η t, 5 q N C N : q N = 1 and chosen sufficiently random: ( 1/N min 1 k N q H N k,n ) u = 1 Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 31/40
32 Characterization of converged Ritz values Theorem (cf. Kuijlaars ( 00), Beckermann et al. ( 09)) Under the assumptions 1 5 it holds that the asymptotic distribution of the n-th Ritz values θ 1,n < θ 2,n <... < θ n,n is given by lim N n(n) 1 n(n) k=1 δ θk,n = µ t M(E). The measure µ t satisfies tµ t σ and minimizes the weighted energy I(µ ν t ) among all µ M(E) satisfying tµ σ. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 32/40
33 Characterization of converged Ritz values Definition The free region is the region S t = supp(σ tµ t ). The complement of S t is called the saturated region. Theorem (cf. Kuijlaars ( 00), Beckermann et al. ( 09)) The saturated region is the region where the n-th Ritz values converged to an eigenvalue of A N. The rate of convergence is described by the weighted potential U µt νt. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 33/40
34 Outline 1 Preliminaries Logarithmic potential and WEP Constrained weighted energy problem 2 Algorithm Main loop Discretization Numerical examples 3 Connection with the rational Lanczos algorithm The rational Lanczos method Characterization of converged Ritz values Numerical examples Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 34/40
35 Numerical examples A R diagonal starting vector q = [ ] T rational Lanczos method with full reorthogonalization convergence criterion: Marker Color Distance to nearest Ritz value + Red less than Yellow between and Blue between and Green more than Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 35/40
36 Preliminaries Algorithm Rational Lanczos References Equally spaced eigenvalues, one multiple pole Example Ritz values Ritz values dσ(x) = 12 dx on [ 1, 1], and νt = δα t Number of iterations Figure: Convergence of Ritz values, α = 2. Karl Deckers, Andrey Chesnokov, and Marc Van Barel Number of iterations Figure: Convergence of Ritz values, α = i. A numerical solution of the CWEP 36/40
37 Equally spaced eigenvalues, separate intervals Example dσ(x) = 1 2 dx on [0,1] [2,3], and ν t = ( t ) δα tdµt/dx Ritz values x Number of iterations Figure: CWEP solution, t = {0.05, 0.2, 0.35, 0.5, 0.65, 0.8} Figure: Convergence of Ritz values, α = i. Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 37/40
38 Preliminaries Algorithm Rational Lanczos References Equally spaced eigenvalues, two different poles Example dσ(x) = 12 dx on [ 1, 1], and two different poles α1 = i and α2 = i, each with multiplicity 100. (a) Left: poles are ordered as {α1,..., α1, α2,..., α2 }, Ritz values Ritz values (b) Right: poles are ordered as {α1, α2, α1, α2,...} Number of iterations Karl Deckers, Andrey Chesnokov, and Marc Van Barel Number of iterations A numerical solution of the CWEP 38/40
39 Preliminaries Algorithm Rational Lanczos References Eigenvalues distributed according to a balayage-measure Example δ1.1, [ 1, 1] σ = Bal δα t Ritz values Ritz values 1, and νt = Number of iterations Figure: Convergence of Ritz values, α = 1.1 Karl Deckers, Andrey Chesnokov, and Marc Van Barel Number of iterations Figure: Convergence of Ritz values, α = 2.0 A numerical solution of the CWEP 39/40
40 References B. Beckermann, S. Güttel, and R. Vandebril, On the convergence of rational Ritz values. Preprint, 35 pages, Apr K. Deckers and A. Bultheel, Rational Krylov sequences and orthogonal rational functions, Technical Report TW499, K.U.Leuven, Department of Computer Science, Aug S. Helsen and M. Van Barel, A numerical solution of the constrained energy problem, Journal of Computational and Applied Mathematics, 189 (2006), pp A. B. J. Kuijlaars, Convergence analysis of Krylov subspace iterations with methods from potential theory, SIAM Review, 48 (2006), pp Karl Deckers, Andrey Chesnokov, and Marc Van Barel A numerical solution of the CWEP 40/40
41 Thank you...
Katholieke Universiteit Leuven Department of Computer Science
Convergence of the isometric Arnoldi process S. Helsen A.B.J. Kuijlaars M. Van Barel Report TW 373, November 2003 Katholieke Universiteit Leuven Department of Computer Science Celestijnenlaan 200A B-3001
More informationMatrix Functions and their Approximation by. Polynomial methods
[ 1 / 48 ] University of Cyprus Matrix Functions and their Approximation by Polynomial Methods Stefan Güttel stefan@guettel.com Nicosia, 7th April 2006 Matrix functions Polynomial methods [ 2 / 48 ] University
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 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 informationKatholieke Universiteit Leuven Department of Computer Science
Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal Raf Vandebril, Ellen Van Camp, Marc Van Barel, Nicola Mastronardi Report
More informationUsing semiseparable matrices to compute the SVD of a general matrix product/quotient
Using semiseparable matrices to compute the SVD of a general matrix product/quotient Marc Van Barel Yvette Vanberghen Paul Van Dooren Report TW 508, November 007 n Katholieke Universiteit Leuven Department
More informationKatholieke Universiteit Leuven Department of Computer Science
A convex optimization method to solve a filter design problem Thanh Hieu Le Marc Van Barel Report TW 599, August 2011 Katholieke Universiteit Leuven Department of Computer Science Celestijnenlaan 200A
More informationLarge-scale eigenvalue problems
ELE 538B: Mathematics of High-Dimensional Data Large-scale eigenvalue problems Yuxin Chen Princeton University, Fall 208 Outline Power method Lanczos algorithm Eigenvalue problems 4-2 Eigendecomposition
More informationKrylov subspace projection methods
I.1.(a) Krylov subspace projection methods Orthogonal projection technique : framework Let A be an n n complex matrix and K be an m-dimensional subspace of C n. An orthogonal projection technique seeks
More informationSimultaneous Gaussian quadrature for Angelesco systems
for Angelesco systems 1 KU Leuven, Belgium SANUM March 22, 2016 1 Joint work with Doron Lubinsky Introduced by C.F. Borges in 1994 Introduced by C.F. Borges in 1994 (goes back to Angelesco 1918). Introduced
More informationThe Lanczos and conjugate gradient algorithms
The Lanczos and conjugate gradient algorithms Gérard MEURANT October, 2008 1 The Lanczos algorithm 2 The Lanczos algorithm in finite precision 3 The nonsymmetric Lanczos algorithm 4 The Golub Kahan bidiagonalization
More informationKatholieke Universiteit Leuven Department of Computer Science
The Lanczos-Ritz values appearing in an orthogonal similarity reduction of a matrix into semiseparable form M Van Barel R Vandebril N Mastronardi Report TW 36, May 23 Katholieke Universiteit Leuven Department
More informationRatio Asymptotics for General Orthogonal Polynomials
Ratio Asymptotics for General Orthogonal Polynomials Brian Simanek 1 (Caltech, USA) Arizona Spring School of Analysis and Mathematical Physics Tucson, AZ March 13, 2012 1 This material is based upon work
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 informationProblems Session. Nikos Stylianopoulos University of Cyprus
[ 1 ] University of Cyprus Problems Session Nikos Stylianopoulos University of Cyprus Hausdorff Geometry Of Polynomials And Polynomial Sequences Institut Mittag-Leffler Djursholm, Sweden May-June 2018
More informationEigenvalue Problems CHAPTER 1 : PRELIMINARIES
Eigenvalue Problems CHAPTER 1 : PRELIMINARIES Heinrich Voss voss@tu-harburg.de Hamburg University of Technology Institute of Mathematics TUHH Heinrich Voss Preliminaries Eigenvalue problems 2012 1 / 14
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 informationRational bases for system identification
Rational bases for system identification Adhemar Bultheel, Patrick Van gucht Department Computer Science Numerical Approximation and Linear Algebra Group (NALAG) K.U.Leuven, Belgium adhemar.bultheel.cs.kuleuven.ac.be
More informationOn Gauss-type quadrature formulas with prescribed nodes anywhere on the real line
On Gauss-type quadrature formulas with prescribed nodes anywhere on the real line Adhemar Bultheel, Ruymán Cruz-Barroso,, Marc Van Barel Department of Computer Science, K.U.Leuven, Celestijnenlaan 2 A,
More informationA matricial computation of rational quadrature formulas on the unit circle
A matricial computation of rational quadrature formulas on the unit circle Adhemar Bultheel and Maria-José Cantero Department of Computer Science. Katholieke Universiteit Leuven. Belgium Department of
More information1 Math 241A-B Homework Problem List for F2015 and W2016
1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let
More informationFinding eigenvalues for matrices acting on subspaces
Finding eigenvalues for matrices acting on subspaces Jakeniah Christiansen Department of Mathematics and Statistics Calvin College Grand Rapids, MI 49546 Faculty advisor: Prof Todd Kapitula Department
More informationEigen-solving via reduction to DPR1 matrices
Computers and Mathematics with Applications 56 (2008) 166 171 www.elsevier.com/locate/camwa Eigen-solving via reduction to DPR1 matrices V.Y. Pan a,, B. Murphy a, R.E. Rosholt a, Y. Tang b, X. Wang c,
More informationKatholieke Universiteit Leuven Department of Computer Science
Separation of zeros of para-orthogonal rational functions A. Bultheel, P. González-Vera, E. Hendriksen, O. Njåstad Report TW 402, September 2004 Katholieke Universiteit Leuven Department of Computer Science
More informationZeros of Polynomials: Beware of Predictions from Plots
[ 1 / 27 ] University of Cyprus Zeros of Polynomials: Beware of Predictions from Plots Nikos Stylianopoulos a report of joint work with Ed Saff Vanderbilt University May 2006 Five Plots Fundamental Results
More informationRational Krylov methods for linear and nonlinear eigenvalue problems
Rational Krylov methods for linear and nonlinear eigenvalue problems Mele Giampaolo mele@mail.dm.unipi.it University of Pisa 7 March 2014 Outline Arnoldi (and its variants) for linear eigenproblems Rational
More informationAn Arnoldi Gram-Schmidt process and Hessenberg matrices for Orthonormal Polynomials
[ 1 ] University of Cyprus An Arnoldi Gram-Schmidt process and Hessenberg matrices for Orthonormal Polynomials Nikos Stylianopoulos, University of Cyprus New Perspectives in Univariate and Multivariate
More informationformulas with complex poles
Computing rational Gauss-Chebyshev quadrature formulas with complex poles Karl Deckers Joris Van Deun Adhemar Bultheel Department of Computer Science K.U.Leuven Augustus 7, 2006 Rational Gauss-Chebyshev
More informationThe QR Factorization
The QR Factorization How to Make Matrices Nicer Radu Trîmbiţaş Babeş-Bolyai University March 11, 2009 Radu Trîmbiţaş ( Babeş-Bolyai University) The QR Factorization March 11, 2009 1 / 25 Projectors A projector
More informationRecurrence Relations and Fast Algorithms
Recurrence Relations and Fast Algorithms Mark Tygert Research Report YALEU/DCS/RR-343 December 29, 2005 Abstract We construct fast algorithms for decomposing into and reconstructing from linear combinations
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 informationAlgebraic Multigrid as Solvers and as Preconditioner
Ò Algebraic Multigrid as Solvers and as Preconditioner Domenico Lahaye domenico.lahaye@cs.kuleuven.ac.be http://www.cs.kuleuven.ac.be/ domenico/ Department of Computer Science Katholieke Universiteit Leuven
More informationKatholieke Universiteit Leuven Department of Computer Science
Rank structures preserved by the QR-algorithm: the singular case Steven Delvaux Marc Van Barel Report TW 4, August 24 Katholieke Universiteit Leuven Department of Computer Science Celestijnenlaan 2A B-31
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 informationProblem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that
Problem 1A. Suppose that f is a continuous real function on [, 1]. Prove that lim α α + x α 1 f(x)dx = f(). Solution: This is obvious for f a constant, so by subtracting f() from both sides we can assume
More informationKernel Method: Data Analysis with Positive Definite Kernels
Kernel Method: Data Analysis with Positive Definite Kernels 2. Positive Definite Kernel and Reproducing Kernel Hilbert Space Kenji Fukumizu The Institute of Statistical Mathematics. Graduate University
More informationThe quadratic eigenvalue problem (QEP) is to find scalars λ and nonzero vectors u satisfying
I.2 Quadratic Eigenvalue Problems 1 Introduction The quadratic eigenvalue problem QEP is to find scalars λ and nonzero vectors u satisfying where Qλx = 0, 1.1 Qλ = λ 2 M + λd + K, M, D and K are given
More informationA reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line Karl Meerbergen en Raf Vandebril Karl Meerbergen Department of Computer Science KU Leuven, Belgium
More informationBindel, Fall 2016 Matrix Computations (CS 6210) Notes for
1 Arnoldi Notes for 2016-11-16 Krylov subspaces are good spaces for approximation schemes. But the power basis (i.e. the basis A j b for j = 0,..., k 1) is not good for numerical work. The vectors in the
More informationj=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.
Lecture Notes: Orthogonal and Symmetric Matrices Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Orthogonal Matrix Definition. Let u = [u
More informationKU Leuven Department of Computer Science
Inverse eigenvalue problems linked to rational Arnoldi, and rational (non)symmetric Lanczos Thomas Mach Marc Van Barel Raf Vandebril Report TW 629, June 213 KU Leuven Department of Computer Science Celestijnenlaan
More informationBergman shift operators for Jordan domains
[ 1 ] University of Cyprus Bergman shift operators for Jordan domains Nikos Stylianopoulos University of Cyprus Num An 2012 Fifth Conference in Numerical Analysis University of Ioannina September 2012
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 informationChapter 6 Inner product spaces
Chapter 6 Inner product spaces 6.1 Inner products and norms Definition 1 Let V be a vector space over F. An inner product on V is a function, : V V F such that the following conditions hold. x+z,y = x,y
More informationNotions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy
Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.
More informationConstrained Leja points and the numerical solution of the constrained energy problem
Journal of Computational and Applied Mathematics 131 (2001) 427 444 www.elsevier.nl/locate/cam Constrained Leja points and the numerical solution of the constrained energy problem Dan I. Coroian, Peter
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationECS231 Handout Subspace projection methods for Solving Large-Scale Eigenvalue Problems. Part I: Review of basic theory of eigenvalue problems
ECS231 Handout Subspace projection methods for Solving Large-Scale Eigenvalue Problems Part I: Review of basic theory of eigenvalue problems 1. Let A C n n. (a) A scalar λ is an eigenvalue of an n n A
More informationKeeping σ fixed for several steps, iterating on µ and neglecting the remainder in the Lagrange interpolation one obtains. θ = λ j λ j 1 λ j σ, (2.
RATIONAL KRYLOV FOR NONLINEAR EIGENPROBLEMS, AN ITERATIVE PROJECTION METHOD ELIAS JARLEBRING AND HEINRICH VOSS Key words. nonlinear eigenvalue problem, rational Krylov, Arnoldi, projection method AMS subject
More informationAsymptotic Zero Distribution of Biorthogonal Polynomials
Asymptotic Zero Distribution of Biorthogonal Polynomials D. S. Lubinsky School of Mathematics, Georgia Institute of Technology, Atlanta, GA 3332-6 USA A. Sidi Department of Computer Science, Technion-IIT,
More informationA PROJECTED HESSIAN GAUSS-NEWTON ALGORITHM FOR SOLVING SYSTEMS OF NONLINEAR EQUATIONS AND INEQUALITIES
IJMMS 25:6 2001) 397 409 PII. S0161171201002290 http://ijmms.hindawi.com Hindawi Publishing Corp. A PROJECTED HESSIAN GAUSS-NEWTON ALGORITHM FOR SOLVING SYSTEMS OF NONLINEAR EQUATIONS AND INEQUALITIES
More informationComputation of Rational Szegő-Lobatto Quadrature Formulas
Computation of Rational Szegő-Lobatto Quadrature Formulas Joint work with: A. Bultheel (Belgium) E. Hendriksen (The Netherlands) O. Njastad (Norway) P. GONZÁLEZ-VERA Departament of Mathematical Analysis.
More informationA derivative-free algorithm for computing zeros of analytic functions Peter Kravanja and Marc Van Barel Report TW 285, November 1998 Department of Com
A derivative-free algorithm for computing zeros of analytic functions Peter Kravanja and Marc Van Barel Report TW 285, November 1998 n Katholieke Universiteit Leuven Department of Computer Science Celestijnenlaan
More information08a. Operators on Hilbert spaces. 1. Boundedness, continuity, operator norms
(February 24, 2017) 08a. Operators on Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2016-17/08a-ops
More informationTwo special equations: Bessel s and Legendre s equations. p Fourier-Bessel and Fourier-Legendre series. p
LECTURE 1 Table of Contents Two special equations: Bessel s and Legendre s equations. p. 259-268. Fourier-Bessel and Fourier-Legendre series. p. 453-460. Boundary value problems in other coordinate system.
More informationOn rational approximation of algebraic functions. Julius Borcea. Rikard Bøgvad & Boris Shapiro
On rational approximation of algebraic functions http://arxiv.org/abs/math.ca/0409353 Julius Borcea joint work with Rikard Bøgvad & Boris Shapiro 1. Padé approximation: short overview 2. A scheme of rational
More informationOn the Superlinear Convergence of MINRES. Valeria Simoncini and Daniel B. Szyld. Report January 2012
On the Superlinear Convergence of MINRES Valeria Simoncini and Daniel B. Szyld Report 12-01-11 January 2012 This report is available in the World Wide Web at http://www.math.temple.edu/~szyld 0 Chapter
More informationGreedy control. Martin Lazar University of Dubrovnik. Opatija, th Najman Conference. Joint work with E: Zuazua, UAM, Madrid
Greedy control Martin Lazar University of Dubrovnik Opatija, 2015 4th Najman Conference Joint work with E: Zuazua, UAM, Madrid Outline Parametric dependent systems Reduced basis methods Greedy control
More informationChapter 4 Euclid Space
Chapter 4 Euclid Space Inner Product Spaces Definition.. Let V be a real vector space over IR. A real inner product on V is a real valued function on V V, denoted by (, ), which satisfies () (x, y) = (y,
More informationLARGE SPARSE EIGENVALUE PROBLEMS. General Tools for Solving Large Eigen-Problems
LARGE SPARSE EIGENVALUE PROBLEMS Projection methods The subspace iteration Krylov subspace methods: Arnoldi and Lanczos Golub-Kahan-Lanczos bidiagonalization General Tools for Solving Large Eigen-Problems
More informationM. VAN BAREL Department of Computing Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium
MATRIX RATIONAL INTERPOLATION WITH POLES AS INTERPOLATION POINTS M. VAN BAREL Department of Computing Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium B. BECKERMANN Institut für Angewandte
More informationModel reduction of large-scale dynamical systems
Model reduction of large-scale dynamical systems Lecture III: Krylov approximation and rational interpolation Thanos Antoulas Rice University and Jacobs University email: aca@rice.edu URL: www.ece.rice.edu/
More informationLARGE SPARSE EIGENVALUE PROBLEMS
LARGE SPARSE EIGENVALUE PROBLEMS Projection methods The subspace iteration Krylov subspace methods: Arnoldi and Lanczos Golub-Kahan-Lanczos bidiagonalization 14-1 General Tools for Solving Large Eigen-Problems
More informationMatrix Algorithms. Volume II: Eigensystems. G. W. Stewart H1HJ1L. University of Maryland College Park, Maryland
Matrix Algorithms Volume II: Eigensystems G. W. Stewart University of Maryland College Park, Maryland H1HJ1L Society for Industrial and Applied Mathematics Philadelphia CONTENTS Algorithms Preface xv xvii
More informationIndex. for generalized eigenvalue problem, butterfly form, 211
Index ad hoc shifts, 165 aggressive early deflation, 205 207 algebraic multiplicity, 35 algebraic Riccati equation, 100 Arnoldi process, 372 block, 418 Hamiltonian skew symmetric, 420 implicitly restarted,
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 informationInternational Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994
International Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994 1 PROBLEMS AND SOLUTIONS First day July 29, 1994 Problem 1. 13 points a Let A be a n n, n 2, symmetric, invertible
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 informationRitz Value Bounds That Exploit Quasi-Sparsity
Banff p.1 Ritz Value Bounds That Exploit Quasi-Sparsity Ilse Ipsen North Carolina State University Banff p.2 Motivation Quantum Physics Small eigenvalues of large Hamiltonians Quasi-Sparse Eigenvector
More informationLINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM
LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator
More informationReview of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem
Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem Steven J. Miller June 19, 2004 Abstract Matrices can be thought of as rectangular (often square) arrays of numbers, or as
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 informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationGeneric Behavior of the Density of States in Random Matrix Theory and Equilibrium Problems in the Presence of Real Analytic External Fields
Generic Behavior of the Density of States in Random Matrix Theory and Equilibrium Problems in the Presence of Real Analytic External Fields A. B. J. KUIJLAARS Katholieke Universiteit Leuven AND K. T-R
More informationIntroduction to Iterative Solvers of Linear Systems
Introduction to Iterative Solvers of Linear Systems SFB Training Event January 2012 Prof. Dr. Andreas Frommer Typeset by Lukas Krämer, Simon-Wolfgang Mages and Rudolf Rödl 1 Classes of Matrices and their
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 informationStructured Matrix Methods for Polynomial Root-Finding
Structured Matrix Methods for Polynomial Root-Finding Luca Gemignani Department of Mathematics University of Pisa Largo B. Pontecorvo 5, 5617 Pisa, Italy gemignan@dm.unipi.it ABSTRACT In this paper we
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 informationSymmetric and self-adjoint matrices
Symmetric and self-adjoint matrices A matrix A in M n (F) is called symmetric if A T = A, ie A ij = A ji for each i, j; and self-adjoint if A = A, ie A ij = A ji or each i, j Note for A in M n (R) that
More informationZeros and ratio asymptotics for matrix orthogonal polynomials
Zeros and ratio asymptotics for matrix orthogonal polynomials Steven Delvaux, Holger Dette August 25, 2011 Abstract Ratio asymptotics for matrix orthogonal polynomials with recurrence coefficients A n
More informationKatholieke Universiteit Leuven Department of Computer Science
Structures preserved by matrix inversion Steven Delvaux Marc Van Barel Report TW 414, December 24 Katholieke Universiteit Leuven Department of Computer Science Celestijnenlaan 2A B-31 Heverlee (Belgium)
More informationKatholieke Universiteit Leuven Department of Computer Science
A QR method for computing the singular values via semiseparable matrices. Raf Vandebril Marc Van Barel Nicola Mastronardi Report TW 366, August 2003 Katholieke Universiteit Leuven Department of Computer
More informationAn integral formula for L 2 -eigenfunctions of a fourth order Bessel-type differential operator
An integral formula for L -eigenfunctions of a fourth order Bessel-type differential operator Toshiyuki Kobayashi Graduate School of Mathematical Sciences The University of Tokyo 3-8-1 Komaba, Meguro,
More informationA factorization of the inverse of the shifted companion matrix
Electronic Journal of Linear Algebra Volume 26 Volume 26 (203) Article 8 203 A factorization of the inverse of the shifted companion matrix Jared L Aurentz jaurentz@mathwsuedu Follow this and additional
More informationANY FINITE CONVERGENCE CURVE IS POSSIBLE IN THE INITIAL ITERATIONS OF RESTARTED FOM
Electronic Transactions on Numerical Analysis. Volume 45, pp. 133 145, 2016. Copyright c 2016,. ISSN 1068 9613. ETNA ANY FINITE CONVERGENCE CURVE IS POSSIBLE IN THE INITIAL ITERATIONS OF RESTARTED FOM
More informationSign changes of Fourier coefficients of cusp forms supported on prime power indices
Sign changes of Fourier coefficients of cusp forms supported on prime power indices Winfried Kohnen Mathematisches Institut Universität Heidelberg D-69120 Heidelberg, Germany E-mail: winfried@mathi.uni-heidelberg.de
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
More informationLinear Algebra. Paul Yiu. 6D: 2-planes in R 4. Department of Mathematics Florida Atlantic University. Fall 2011
Linear Algebra Paul Yiu Department of Mathematics Florida Atlantic University Fall 2011 6D: 2-planes in R 4 The angle between a vector and a plane The angle between a vector v R n and a subspace V is the
More informationVector Spaces. Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms.
Vector Spaces Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms. For each two vectors a, b ν there exists a summation procedure: a +
More informationSOLUTIONS OF SELECTED PROBLEMS
SOLUTIONS OF SELECTED PROBLEMS Problem 36, p. 63 If µ(e n < and χ En f in L, then f is a.e. equal to a characteristic function of a measurable set. Solution: By Corollary.3, there esists a subsequence
More informationSolutions: Problem Set 4 Math 201B, Winter 2007
Solutions: Problem Set 4 Math 2B, Winter 27 Problem. (a Define f : by { x /2 if < x
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 informationA multiple shift QR-step for structured rank matrices
A multiple shift QR-step for structured rank matrices Raf Vandebril, Marc Van Barel and Nicola Mastronardi Raf Vandebril Department of Computer Science KU Leuven, Belgium Raf.Vandebril@cs.kuleuven.be Marc
More informationError Estimation and Evaluation of Matrix Functions
Error Estimation and Evaluation of Matrix Functions Bernd Beckermann Carl Jagels Miroslav Pranić Lothar Reichel UC3M, Nov. 16, 2010 Outline: Approximation of functions of matrices: f(a)v with A large and
More informationPDEs, Matrix Functions and Krylov Subspace Methods
PDEs, Matrix Functions and Krylov Subspace Methods Oliver Ernst Institut für Numerische Mathematik und Optimierung TU Bergakademie Freiberg, Germany LMS Durham Symposium Computational Linear Algebra for
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 informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationThe Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment
he Nearest Doubly Stochastic Matrix to a Real Matrix with the same First Moment William Glunt 1, homas L. Hayden 2 and Robert Reams 2 1 Department of Mathematics and Computer Science, Austin Peay State
More informationCHILE LECTURES: MULTIPLICATIVE ERGODIC THEOREM, FRIENDS AND APPLICATIONS
CHILE LECTURES: MULTIPLICATIVE ERGODIC THEOREM, FRIENDS AND APPLICATIONS. Motivation Context: (Ω, P) a probability space; σ : Ω Ω is a measure-preserving transformation P(σ A) = P(A) for all measurable
More information