Research Matters. February 25, The Nonlinear Eigenvalue Problem. Nick Higham. Part III. Director of Research School of Mathematics
|
|
- Erik Bell
- 5 years ago
- Views:
Transcription
1 Research Matters February 25, 2009 The Nonlinear Eigenvalue Problem Nick Higham Part III Director of Research School of Mathematics Françoise Tisseur School of Mathematics The University of Manchester ESSAM, Kácov, / 6
2 Outline Two lectures: Part I: Mathematical properties of nonlinear eigenproblems (NEPs) Definition and historical aspects Examples and applications Solution structure Part II and Part III: Numerical methods for NEPs Solvers based on Newton s method Solvers using contour integrals Linear interpolation methods S. GÜTTEL AND F. TISSEUR, The nonlinear eigenvalue problem. Acta Numerica 26:1 94, Françoise Tisseur The nonlinear eigenvalue problem 2 / 26
3 Methods based on linear interpolation Instead of solving F(λ)v = 0 directly, we may approximate F by simpler function R m on Σ C and solve R m (λ)v = 0. Françoise Tisseur The nonlinear eigenvalue problem 3 / 26
4 Methods based on linear interpolation Instead of solving F(λ)v = 0 directly, we may approximate F by simpler function R m on Σ C and solve R m (λ)v = 0. Practical approach: Polynomial or rational form R m (z) = b 0 (z)d 0 + b 1 (z)d b m (z)d m where D j C n n are constant coefficient matrices and b j are polynomials or rational functions of type (m, m). Françoise Tisseur The nonlinear eigenvalue problem 3 / 26
5 Methods based on linear interpolation Instead of solving F(λ)v = 0 directly, we may approximate F by simpler function R m on Σ C and solve R m (λ)v = 0. Practical approach: Polynomial or rational form where R m (z) = b 0 (z)d 0 + b 1 (z)d b m (z)d m D j C n n are constant coefficient matrices and b j are polynomials or rational functions of type (m, m). It is crucial that R m F is some sense, for otherwise eigenpairs of F and R m are not related. Françoise Tisseur The nonlinear eigenvalue problem 3 / 26
6 Basic Properties of Approximant R m We impose that the approximation R m on Σ Ω to F H(Ω, C n n ) satisfies for some small ε. F R m Σ := max z Σ F(z) R m(z) 2 ε, Françoise Tisseur The nonlinear eigenvalue problem 4 / 26
7 Basic Properties of Approximant R m We impose that the approximation R m on Σ Ω to F H(Ω, C n n ) satisfies for some small ε. F R m Σ := max z Σ F(z) R m(z) 2 ε, Let λ Σ and v C n s.t. v 2 = 1 and R m (λ)v = 0. Then F(λ)v 2 = ( F(λ) R m (λ) ) v 2 F(λ) R m (λ) 2 ε, i.e., bounded residual. Ideally, R m should not any ei vals in Σ that are in the resolvent set of F (i.e., R m should be free of spurious ei vals). Françoise Tisseur The nonlinear eigenvalue problem 4 / 26
8 Rational Newton Basis Functions Approximate F H(Ω, C n n ) by R m (z) = b 0 (z)d 0 + b 1 (z)d b m (z)d m H(Σ, C n n ), where Σ Ω, D j C n n and b j are rational functions. Particularly useful: (scaled) rational Newton basis b 0 (z) 1 β 0, b j+1 (z) = z σ j β j+1 (1 z/ξ j+1 ) b j(z) with interpolation points σ j Σ, poles ξ j C \ Σ, and scaling factors β j 0. Françoise Tisseur The nonlinear eigenvalue problem 5 / 26
9 Rational Newton Basis Functions Approximate F H(Ω, C n n ) by R m (z) = b 0 (z)d 0 + b 1 (z)d b m (z)d m H(Σ, C n n ), where Σ Ω, D j C n n and b j are rational functions. Particularly useful: (scaled) rational Newton basis b 0 (z) 1 β 0, b j+1 (z) = z σ j β j+1 (1 z/ξ j+1 ) b j(z) with interpolation points σ j Σ, poles ξ j C \ Σ, and scaling factors β j 0. Shifted and scaled monomials: σ j = σ, ξ j =. Scaled Newton polynomials: ξ j =. Françoise Tisseur The nonlinear eigenvalue problem 5 / 26
10 Rational Newton Basis Functions Approximate F H(Ω, C n n ) by R m (z) = b 0 (z)d 0 + b 1 (z)d b m (z)d m H(Σ, C n n ), where Σ Ω, D j C n n and b j are rational functions. Particularly useful: (scaled) rational Newton basis b 0 (z) 1 β 0, b j+1 (z) = z σ j β j+1 (1 z/ξ j+1 ) b j(z) with interpolation points σ j Σ, poles ξ j C \ Σ, and scaling factors β j 0. Shifted and scaled monomials: σ j = σ, ξ j =. Scaled Newton polynomials: ξ j =. Choice of σ j, ξ j, β j by NLEIGS sampling [Güttel et al 2014]. Françoise Tisseur The nonlinear eigenvalue problem 5 / 26
11 NLEIGS sampling Assume F is holomorphic on Ω = C \ Ξ and we target the eigenvalues in Σ Ω. Assume we have chosen nodes σ 0, σ 1,..., σ m Σ and poles ξ 1,..., ξ m Ξ. Define s m (z) := (z σ m )b m (z). By the Hermite Walsh formula we have F(z) R m (z) = 1 s m (z) F(ζ) 2πi s m (ζ) ζ z dζ, and so the uniform approximation error on Σ satisfies F R m Σ := max z Σ F(z) R m(z) 2 C s m Σ s 1 m Γ Γ Aim: Make s m small on Σ and large on Γ. Françoise Tisseur The nonlinear eigenvalue problem 6 / 26
12 NLEIGS sampling of F on Σ Ξ Σ Françoise Tisseur The nonlinear eigenvalue problem 7 / 26
13 NLEIGS sampling of F on Σ 1. Discretize boundaries of Σ and Ξ sufficiently fine. Ξ Σ Françoise Tisseur The nonlinear eigenvalue problem 7 / 26
14 NLEIGS sampling of F on Σ 1. Discretize boundaries of Σ and Ξ sufficiently fine. 2. Choose interpolation node σ 0 Σ and set R 0 (z) F(σ 0 ). Ξ Σ Françoise Tisseur The nonlinear eigenvalue problem 7 / 26
15 NLEIGS sampling of F on Σ 1. Discretize boundaries of Σ and Ξ sufficiently fine. 2. Choose interpolation node σ 0 Σ and set R 0 (z) F(σ 0 ) error F R j Σ Σ Ξ Françoise Tisseur The nonlinear eigenvalue problem 7 / 26
16 NLEIGS sampling of F on Σ 1. Discretize boundaries of Σ and Ξ sufficiently fine. 2. Choose interpolation node σ 0 Σ and set R 0 (z) F(σ 0 ). 3. For j = 1, 2,..., m choose σ j and ξ j such that max s j 1(z) = s j 1 (σ j ) and min s j 1(z) = s j 1 (ξ j ). z Σ z Ξ 10 0 error F R j Σ Σ Ξ Françoise Tisseur The nonlinear eigenvalue problem 7 / 26
17 NLEIGS sampling of F on Σ 1. Discretize boundaries of Σ and Ξ sufficiently fine. 2. Choose interpolation node σ 0 Σ and set R 0 (z) F(σ 0 ). 3. For j = 1, 2,..., m choose σ j and ξ j such that max s j 1(z) = s j 1 (σ j ) and min s j 1(z) = s j 1 (ξ j ). z Σ z Ξ Choose β j such that s j Σ = 1 and set D j = F (σ j ) R j 1 (σ j ) b j (σ j ) error F R j Σ Σ Ξ Françoise Tisseur The nonlinear eigenvalue problem 7 / 26
18 NLEIGS sampling of F on Σ 1. Discretize boundaries of Σ and Ξ sufficiently fine. 2. Choose interpolation node σ 0 Σ and set R 0 (z) F(σ 0 ). 3. For j = 1, 2,..., m choose σ j and ξ j such that max s j 1(z) = s j 1 (σ j ) and min s j 1(z) = s j 1 (ξ j ). z Σ z Ξ Choose β j such that s j Σ = 1 and set D j = F (σ j ) R j 1 (σ j ) b j (σ j ) error F R j Σ Σ Ξ Françoise Tisseur The nonlinear eigenvalue problem 7 / 26
19 NLEIGS sampling of F on Σ 1. Discretize boundaries of Σ and Ξ sufficiently fine. 2. Choose interpolation node σ 0 Σ and set R 0 (z) F(σ 0 ). 3. For j = 1, 2,..., m choose σ j and ξ j such that max s j 1(z) = s j 1 (σ j ) and min s j 1(z) = s j 1 (ξ j ). z Σ z Ξ Choose β j such that s j Σ = 1 and set D j = F (σ j ) R j 1 (σ j ) b j (σ j ) error F R j Σ Σ Ξ Françoise Tisseur The nonlinear eigenvalue problem 7 / 26
20 NLEIGS sampling of F on Σ 1. Discretize boundaries of Σ and Ξ sufficiently fine. 2. Choose interpolation node σ 0 Σ and set R 0 (z) F(σ 0 ). 3. For j = 1, 2,..., m choose σ j and ξ j such that max s j 1(z) = s j 1 (σ j ) and min s j 1(z) = s j 1 (ξ j ). z Σ z Ξ Choose β j such that s j Σ = 1 and set D j = F (σ j ) R j 1 (σ j ) b j (σ j ) error F R j Σ Σ Ξ Françoise Tisseur The nonlinear eigenvalue problem 7 / 26
21 NLEIGS sampling of F on Σ 1. Discretize boundaries of Σ and Ξ sufficiently fine. 2. Choose interpolation node σ 0 Σ and set R 0 (z) F(σ 0 ). 3. For j = 1, 2,..., m choose σ j and ξ j such that max s j 1(z) = s j 1 (σ j ) and min s j 1(z) = s j 1 (ξ j ). z Σ z Ξ Choose β j such that s j Σ = 1 and set D j = F (σ j ) R j 1 (σ j ) b j (σ j ) error F R j Σ Σ Ξ Françoise Tisseur The nonlinear eigenvalue problem 7 / 26
22 NLEIGS sampling of F on Σ 1. Discretize boundaries of Σ and Ξ sufficiently fine. 2. Choose interpolation node σ 0 Σ and set R 0 (z) F(σ 0 ). 3. For j = 1, 2,..., m choose σ j and ξ j such that max s j 1(z) = s j 1 (σ j ) and min s j 1(z) = s j 1 (ξ j ). z Σ z Ξ Choose β j such that s j Σ = 1 and set D j = F (σ j ) R j 1 (σ j ) b j (σ j ) error F R j Σ /cap(Σ,Ξ) Σ Ξ Françoise Tisseur The nonlinear eigenvalue problem 7 / 26
23 Other Interpolation Techniques These include Chebyshev interpolation: for NEPs with ei vals located on the real line or on pre-specified curves in C [Effenberger and Kressner 2012], Automatic rational approximation using the adaptive Antoulas-Anderson (AAA) algorithm [Nakatsukasa et al. (2017)], [Lietaert et al. (2018)]: F(λ) R m (λ) = P(λ) + m (A i λb i )r i (λ), i=1 where P(λ) is a matrix polynomial and r i (λ) are rational approximants in barycentric form. Françoise Tisseur The nonlinear eigenvalue problem 8 / 26
24 Eigenvalue Solution Interpolation techniques can be combined with a linearization of R m, i.e., R m (λ)x = 0 is rewritten as a structured generalized eigenproblem (GEP) of larger dimension. Solve the GEP: Av = λbv e.g., QZ algorithm for small dense problems, (rational) Krylov algorithms for large sparse problems. Françoise Tisseur The nonlinear eigenvalue problem 9 / 26
25 Polynomial Eigenvalue Problems (PEPs) Consider n n matrix polynomial P(λ) = λ d A d + + λa 1 + A 0 (monomial form) = φ d (λ)p d + + φ 1 (λ)p 1 + φ 0 (λ)p 0 (non-monomial form), where φ i (λ) is a polynomial of degree i. Françoise Tisseur The nonlinear eigenvalue problem 10 / 26
26 Polynomial Eigenvalue Problems (PEPs) Consider n n matrix polynomial P(λ) = λ d A d + + λa 1 + A 0 (monomial form) = φ d (λ)p d + + φ 1 (λ)p 1 + φ 0 (λ)p 0 (non-monomial form), where φ i (λ) is a polynomial of degree i. Algorithms for dense and large sparse PEPs (monomial form). Algorithms for PEPs in non-monomial form. Françoise Tisseur The nonlinear eigenvalue problem 10 / 26
27 Condensed Forms P(λ) = d i=0 λi A i, A i C n n, A d 0. Generalized Schur decomposition: there exist U, V unitary s.t. U(λA 1 + A 0 )V = λt + S is upper triangular. λ j = s jj /t jj, j = 1: n. Can be computed by the QZ algorithm. Useful for purging and locking of e vals, implicit restart,... No analog of generalized Schur decomposition when d > 1. Françoise Tisseur The nonlinear eigenvalue problem 11 / 26
28 Condensed Forms P(λ) = d i=0 λi A i, A i C n n, A d 0. Generalized Schur decomposition: there exist U, V unitary s.t. U(λA 1 + A 0 )V = λt + S is upper triangular. λ j = s jj /t jj, j = 1: n. Can be computed by the QZ algorithm. Useful for purging and locking of e vals, implicit restart,... No analog of generalized Schur decomposition when d > 1. Rewrite P(λ)x = 0 as a linear eigenproblem (A λb)ξ = 0 of larger dimension (usually dn dn). Françoise Tisseur The nonlinear eigenvalue problem 11 / 26
29 Standard Solution Process (d = 2) Find all λ and x satisfying Q(λ)x = (λ 2 M + λd + K )x = 0. Commonly solved by linearization: Convert Q(λ)x = 0 into (A λb)ξ = 0, e.g., [ ] [ ] K 0 D M A λb = λ, ξ = 0 I I 0 [ x λx Solve (A λb)ξ = 0 with an eigensolver for generalized eigenproblem (e.g., QZ algorithm). Recover eigenvectors of Q(λ) from those of A λb. Solution process extend to degree d > 2. Numerical issues with this process. ]. Françoise Tisseur The nonlinear eigenvalue problem 12 / 26
30 Example 2: Beam Problem /////// L //////////// Transverse displacement u(x, t) /////// ρa 2 u t 2 + c(x) u t + EI 4 u x 4 = 0. u(0, t) = u (0, t) = u(l, t) = u (L, t) = 0. Finite element method leads to Q(λ)v = (λ 2 M + λd + K )v = 0 with symmetric M, D, K R n n. M > 0, K > 0, D 0 all e vals have Re(λ) 0. D is rank 1. Can show n pure imaginary e vals. [Higham et al, 2018]. Françoise Tisseur The nonlinear eigenvalue problem 13 / 26
31 Computed Spectra of C 1, L 1 and L 2 C 1 (λ) = λ [ ] [ ] M 0 D K +, 0 I I 0 [ ] [ ] [ ] [ ] M 0 D K 0 M M 0 L 1 (λ) = λ +, L 0 K K 0 2 (λ) = λ + M D 0 K Françoise Tisseur The nonlinear eigenvalue problem 14 / 26
32 Computed Spectra of C 1, L 1 and L 2 C 1 (λ) = λ [ ] [ ] M 0 D K +, 0 I I 0 [ ] [ ] [ ] [ ] M 0 D K 0 M M 0 L 1 (λ) = λ +, L 0 K K 0 2 (λ) = λ + M D 0 K C 1 (λ) L 1 (λ) L 2 (λ) 4 x x x Françoise Tisseur The nonlinear eigenvalue problem 14 / 26
33 Sensitivity and Stability of Linearizations Developed theory concerning the sensitivity and stability of linearizations [Higham, Mackey, T. 06, Higham, Li, T. 07, Grammont, Higham, T., 11]. Importance of scaling QEPs/PEPs before computing e vals via linearization. Eigenvalue parameter scaling: λ = γµ, Q(µ) := δq(γµ). Does not affect sparsity of matrix coeffs. γ, δ chosen to improve growth factors κ L (λ)/κ Q (λ) (conditioning), η Q (z i, λ)/η L (z, λ) (backward error). Françoise Tisseur The nonlinear eigenvalue problem 15 / 26
34 Spectrum of C 1, L 2 Before/After Scaling 4 x x x x Françoise Tisseur The nonlinear eigenvalue problem 16 / 26
35 quadeig for Q(λ) = λ 2 M + λd + K. Eigensolver for dense (small to medium size) quadratics quadeig. Incorporates: Appropriate [ choice ] [ of linearization: ] D I M 0 uses λ. K 0 0 I Deflation of 0 and eigenvalues. Eigenvalue parameter scaling (FLV/tropical). Careful recovery of the eigenvectors. Backward stable when D < ( M K ) 1/2. MATLAB and Fortran implementations (NAG, LAPACK) [Hammarling, Munro, T. 2013]. Françoise Tisseur The nonlinear eigenvalue problem 17 / 26
36 Eigensolvers for Large Sparse QEPs Second Order Arnoldi (SOAR) method [Bai & Su, 2005]. Projection applied directly to quadratic. Quadratic Arnoldi method [Meerbergen, 2008]. Two-level Orthogonal Arnoldi method [Lu, Su, Bai, 2016]. Françoise Tisseur The nonlinear eigenvalue problem 18 / 26
37 Eigensolvers for Large Sparse QEPs Second Order Arnoldi (SOAR) method [Bai & Su, 2005]. Projection applied directly to quadratic. Quadratic Arnoldi method [Meerbergen, 2008]. Two-level Orthogonal Arnoldi method [Lu, Su, Bai, 2016]. See Ivana Šain Glibic s talk for implicit restart. Extend to higher degree matrix polynomials. Françoise Tisseur The nonlinear eigenvalue problem 18 / 26
38 PEPs in Non-monomial Form Let P(λ) = P 0 φ 0 (λ) + P 1 φ 1 (λ) + + P d φ d (λ), where P k C n n and the φ k (λ) are rational functions/polynomials. shifted and scaled monomials, φ 0 (λ) = 1/β 0, φ j (λ) = s σφ j 1 (λ)/β j, j 1, orthogonal polynomials, φ 1 (λ) = 0, φ 0 (λ) = 1, sφ j (λ) = α j φ j+1 (λ) + β j φ j (λ) + γ j φ j 1 (λ), j 0, rational Newton basis functions,.... φ 0 (λ) = 1 β 0, φ j (λ) = s σ j β j (1 s/ζ j ) φ j 1(λ), j 1, Françoise Tisseur The nonlinear eigenvalue problem 19 / 26
39 Basis Functions Matrix Relation The linear recurrence relation between the basis functions can be rewritten in matrix form as M d Φ d (λ) = λn d Φ d (λ), where Φ d (λ) = [φ 0 (λ), φ 1 (λ),..., φ d (λ)] T and M d, N d C d (d+1) are well-defined matrices. E.g., for rational Newton basis, σ 1 β 1 1 β 1 /ζ 1 σ 2 β 2 1 β 2 /ζ 2 M d =......, N d = σ d β d 1 β d /ζ d Françoise Tisseur The nonlinear eigenvalue problem 20 / 26
40 CORK Pencil Rewrite P(λ) as d 1 g(λ)p(λ) = (A j λb j )φ j (λ) = (A λb)(φ d 1 (λ) I n ), j=0 A j, B j depend on coeffs P j of P(λ), g(λ) = 1 for poly. bases, g(λ) = (1 λ ζ d ) for rat. basis, A λb = [ A 0 λb 0 A d 1 λb d 1 ] C n nd, The CORK pencil [ ] A λb A λb = C nd nd (M d 1 λn d 1 ) I n satisfies (A λb)(φ d 1 (λ) I n ) = e 1 g(λ)p(λ). [Van Beeumen et al, 2015] Françoise Tisseur The nonlinear eigenvalue problem 21 / 26
41 Properties of CORK Pencil The CORK pencil [ ] A λb A λb = C nd nd (M d 1 λn d 1 ) I n satisfies right- and left-sided factorizations: (A λb)(φ d 1 (λ) I n ) = e 1 g(λ)p(λ), H(λ)(A λb) = e T 1 g(λ)p(λ). Françoise Tisseur The nonlinear eigenvalue problem 22 / 26
42 Properties of CORK Pencil The CORK pencil [ ] A λb A λb = C nd nd (M d 1 λn d 1 ) I n satisfies right- and left-sided factorizations: (A λb)(φ d 1 (λ) I n ) = e 1 g(λ)p(λ), H(λ)(A λb) = e T 1 g(λ)p(λ). If φ d 1 (λ) 0 at λ then Φ d 1 (λ) x is a right ei vec of A λb with ei val λ iff x is a right ei vec of P(λ) with ei val λ. [ ] y If H(λ) has full rank then is a left ei vec of R φ (λ)y A λb with ei val λ iff y is a left ei vec of P(λ) with ei val λ. Françoise Tisseur The nonlinear eigenvalue problem 22 / 26
43 Rational Arnoldi Algorithm Given A, B C dn dn, v C dn \ {0}, shifts (τ j ) k j=1 C. Set v 1 := v/ v 2. for j = 1, 2,..., k Compute w := (A τ j B) 1 Bv j. Orthogonalize ŵ := w j i=1 µ i,jv i, where µ i,j = v i w. Set µ j+1,j = ŵ 2 and normalize v j+1 := w/µ j+1,j. end Françoise Tisseur The nonlinear eigenvalue problem 23 / 26
44 Rational Arnoldi Algorithm Given A, B C dn dn, v C dn \ {0}, shifts (τ j ) k j=1 C. Set v 1 := v/ v 2. for j = 1, 2,..., k Compute w := (A τ j B) 1 Bv j. Orthogonalize ŵ := w j i=1 µ i,jv i, where µ i,j = v i w. Set µ j+1,j = ŵ 2 and normalize v j+1 := w/µ j+1,j. end If A λb is a CORK pencil then v j = (I d+1 Q j )u j, with u j of smaller length v j. Françoise Tisseur The nonlinear eigenvalue problem 23 / 26
45 Gun Problem F(λ)v = [ K λm + i(λ σ 2 1) 1 2 W1 + i(λ σ 2 2) 1 2 W2 ] v = 0. #104 gun: eigenvalues 9 target set ' 8 eigenvalues (a) eigenvalues (b) nodes < j poles 9 j #10 4 Françoise Tisseur The nonlinear eigenvalue problem 24 / 26
46 Krylov solution dynamic increase of degree m during Krylov iteration = infinite Arnoldi method [Jarlebring et al 2012] compact Krylov basis storage of [Lu, Su, Bai 2016] = CORK [Van Beeumen et al 2015]. Françoise Tisseur The nonlinear eigenvalue problem 25 / 26
47 Krylov solution dynamic increase of degree m during Krylov iteration = infinite Arnoldi method [Jarlebring et al 2012] compact Krylov basis storage of [Lu, Su, Bai 2016] = CORK [Van Beeumen et al 2015]. NLEIGS implementations are available in the SLEPc library version 3.7 [Campos & Roman 2016] Rational Krylov Toolbox [Berljafa & Güttel 2015]. S. GÜTTEL, R. VAN BEEUMEN, K. MEERBERGEN, W. MICHIELS, NLEIGS: A class of fully rational Krylov methods for nonlinear eigenvalue problems, SIAM J. Sci. Comput., V. HERNANDEZ, J. E. ROMAN, V. VIDAL, SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems, ACM TOMS, Françoise Tisseur The nonlinear eigenvalue problem 25 / 26
48 Concluding Remarks NEPs have interesting mathematical properties. They arise in many applications and their efficient solution requires ideas from numerical linear algebra, complex analysis, and approximation theory (among other fields). Françoise Tisseur The nonlinear eigenvalue problem 26 / 26
49 Concluding Remarks NEPs have interesting mathematical properties. They arise in many applications and their efficient solution requires ideas from numerical linear algebra, complex analysis, and approximation theory (among other fields). There is more to be said, e.g., Structured NEPs? Higher-order integral moments Preconditioning/scaling of linearizations Implementation, software packages Françoise Tisseur The nonlinear eigenvalue problem 26 / 26
50 References I Z. Bai and Y. Su. SOAR: a second-order Arnoldi method for the solution of the quadratic eigenvalue problem. SIAM J. Matrix Anal. Appl., 26(3): , M. Berljafa and S. Güttel. A Rational Krylov Toolbox for MATLAB. MIMS EPrint , Manchester Institute for Mathematical Sciences, The University of Manchester, UK, pp. Available for download at Françoise Tisseur The nonlinear eigenvalue problem 20 / 26
51 References II C. Campos and J. E. Roman. Parallel iterative refinement in polynomial eigenvalue problems. Numer. Linear Algebra Appl., 23(4): , C. Effenberger and D. Kressner. Chebyshev interpolation for nonlinear eigenvalue problems. BIT, 52(4): , L. Grammont, N. J. Higham, and F. Tisseur. A framework for analyzing nonlinear eigenproblems and parametrized linear systems. Linear Algebra Appl., 435(3): , Françoise Tisseur The nonlinear eigenvalue problem 21 / 26
52 References III S. Güttel and F. Tisseur. The nonlinear eigenvalue problem. In Acta Numerica, volume 26, pages Cambridge University Press, S. Güttel, R. Van Beeumen, K. Meerbergen, and W. Michiels. NLEIGS: A class of fully rational Krylov methods for nonlinear eigenvalue problems. SIAM J. Sci. Comput., 36(6):A2842 A2864, S. Hammarling, C. J. Munro, and F. Tisseur. An algorithm for the complete solution of quadratic eigenvalue problems. ACM Trans. Math. Software, 39(3):18:1 18:19, Apr Françoise Tisseur The nonlinear eigenvalue problem 22 / 26
53 References IV V. Hernandez, J. E. Roman, and V. Vidal. SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems. ACM Transactions on Mathematical Software (TOMS), 31(3): , N. J. Higham, R.-C. Li, and F. Tisseur. Backward error of polynomial eigenproblems solved by linearization. SIAM J. Matrix Anal. Appl., 29(4): , N. J. Higham, D. S. Mackey, and F. Tisseur. The conditioning of linearizations of matrix polynomials. SIAM J. Matrix Anal. Appl., 28(4): , Françoise Tisseur The nonlinear eigenvalue problem 23 / 26
54 References V N. J. Higham, D. S. Mackey, F. Tisseur, and S. D. Garvey. Scaling, sensitivity and stability in the numerical solution of quadratic eigenvalue problems. Internat. J. Numer. Methods Eng., 73(3): , E. Jarlebring, K. Meerbergen, and W. Michiels. Computing a partial Schur factorization of nonlinear eigenvalue problems using the infinite Arnoldi method. SIAM J. Matrix Anal. Appl., 35(2): , Françoise Tisseur The nonlinear eigenvalue problem 24 / 26
55 References VI P. Lietaertand, J. Pérez, B. Vandereycken, and K. Meerbergen. Automatic rational approximation and linearization of nonlinear eigenvalue problems. Technical Report arxiv: v2, D. Lu, Y. Su, and Z. Bai. Stability analysis of the two-level orthogonal Arnoldi procedure. SIAM J. Matrix Anal. Appl., 37(1): , K. Meerbergen. Fast frequency response computation for Rayleigh damping. Internat. J. Numer. Methods Eng., 73(1):96 106, Françoise Tisseur The nonlinear eigenvalue problem 25 / 26
56 References VII Y. Nakatsukasa, O. SÃČÅate, and L. N. Trefethen. The aaa algorithm for rational approximation. SIAM J. Sci. Comput., 40(3):A1494 A1522, R. Van Beeumen, K. Meerbergen, and W. Michiels. Compact rational Krylov methods for nonlinear eigenvalue problems. SIAM J. Matrix Anal. Appl., 36(2): , Françoise Tisseur The nonlinear eigenvalue problem 26 / 26
An Algorithm for. Nick Higham. Françoise Tisseur. Director of Research School of Mathematics.
An Algorithm for the Research Complete Matters Solution of Quadratic February Eigenvalue 25, 2009 Problems Nick Higham Françoise Tisseur Director of Research School of Mathematics The School University
More informationScaling, Sensitivity and Stability in Numerical Solution of the Quadratic Eigenvalue Problem
Scaling, Sensitivity and Stability in Numerical Solution of the Quadratic Eigenvalue Problem Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/
More informationResearch Matters. February 25, The Nonlinear Eigenvalue. Director of Research School of Mathematics
Research Matters February 25, 2009 The Nonlinear Eigenvalue Nick Problem: HighamPart II Director of Research School of Mathematics Françoise Tisseur School of Mathematics The University of Manchester Woudschoten
More informationRecent Advances in the Numerical Solution of Quadratic Eigenvalue Problems
Recent Advances in the Numerical Solution of Quadratic Eigenvalue Problems Françoise Tisseur School of Mathematics The University of Manchester ftisseur@ma.man.ac.uk http://www.ma.man.ac.uk/~ftisseur/
More informationAlgorithms for Solving the Polynomial Eigenvalue Problem
Algorithms for Solving the Polynomial Eigenvalue Problem Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ Joint work with D. Steven Mackey
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 informationSolving the Polynomial Eigenvalue Problem by Linearization
Solving the Polynomial Eigenvalue Problem by Linearization Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ Joint work with Ren-Cang Li,
More informationKU Leuven Department of Computer Science
Backward error of polynomial eigenvalue problems solved by linearization of Lagrange interpolants Piers W. Lawrence Robert M. Corless Report TW 655, September 214 KU Leuven Department of Computer Science
More informationQuadratic Matrix Polynomials
Research Triangularization Matters of Quadratic Matrix Polynomials February 25, 2009 Nick Françoise Higham Tisseur Director School of of Research Mathematics The University of Manchester School of Mathematics
More informationResearch Matters. February 25, The Nonlinear Eigenvalue. Director of Research School of Mathematics
Research Matters February 25, 2009 The Nonlinear Eigenvalue Nick Problem: HighamPart I Director of Research School of Mathematics Françoise Tisseur School of Mathematics The University of Manchester Woudschoten
More informationKU Leuven Department of Computer Science
Compact rational Krylov methods for nonlinear eigenvalue problems Roel Van Beeumen Karl Meerbergen Wim Michiels Report TW 651, July 214 KU Leuven Department of Computer Science Celestinenlaan 2A B-31 Heverlee
More informationSolving Polynomial Eigenproblems by Linearization
Solving Polynomial Eigenproblems by Linearization Nick Higham School of Mathematics University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ Joint work with D. Steven Mackey and Françoise
More informationPolynomial eigenvalue solver based on tropically scaled Lagrange linearization. Van Barel, Marc and Tisseur, Francoise. MIMS EPrint: 2016.
Polynomial eigenvalue solver based on tropically scaled Lagrange linearization Van Barel, Marc and Tisseur, Francoise 2016 MIMS EPrint: 201661 Manchester Institute for Mathematical Sciences School of Mathematics
More informationArnoldi Methods in SLEPc
Scalable Library for Eigenvalue Problem Computations SLEPc Technical Report STR-4 Available at http://slepc.upv.es Arnoldi Methods in SLEPc V. Hernández J. E. Román A. Tomás V. Vidal Last update: October,
More informationSOLVING RATIONAL EIGENVALUE PROBLEMS VIA LINEARIZATION
SOLVNG RATONAL EGENVALUE PROBLEMS VA LNEARZATON YANGFENG SU AND ZHAOJUN BA Abstract Rational eigenvalue problem is an emerging class of nonlinear eigenvalue problems arising from a variety of physical
More informationEigenvector error bound and perturbation for nonlinear eigenvalue problems
Eigenvector error bound and perturbation for nonlinear eigenvalue problems Yuji Nakatsukasa School of Mathematics University of Tokyo Joint work with Françoise Tisseur Workshop on Nonlinear Eigenvalue
More informationin Numerical Linear Algebra
Exploiting ResearchTropical MattersAlgebra in Numerical Linear Algebra February 25, 2009 Nick Françoise Higham Tisseur Director Schoolof ofresearch Mathematics The School University of Mathematics of Manchester
More informationAn Algorithm for the Complete Solution of Quadratic Eigenvalue Problems. Hammarling, Sven and Munro, Christopher J. and Tisseur, Francoise
An Algorithm for the Complete Solution of Quadratic Eigenvalue Problems Hammarling, Sven and Munro, Christopher J. and Tisseur, Francoise 2011 MIMS EPrint: 2011.86 Manchester Institute for Mathematical
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Eigenvector Error Bound and Perturbation for Polynomial and Rational Eigenvalue Problems
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Eigenvector Error Bound and Perturbation for Polynomial and Rational Eigenvalue Problems Yuji NAKATSUKASA and Françoise TISSEUR METR 2016 04 April 2016 DEPARTMENT
More informationPolynomial Jacobi Davidson Method for Large/Sparse Eigenvalue Problems
Polynomial Jacobi Davidson Method for Large/Sparse Eigenvalue Problems Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan April 28, 2011 T.M. Huang (Taiwan Normal Univ.)
More informationSolution of eigenvalue problems. Subspace iteration, The symmetric Lanczos algorithm. Harmonic Ritz values, Jacobi-Davidson s method
Solution of eigenvalue problems Introduction motivation Projection methods for eigenvalue problems Subspace iteration, The symmetric Lanczos algorithm Nonsymmetric Lanczos procedure; Implicit restarts
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 informationNonlinear eigenvalue problems - A Review
Nonlinear eigenvalue problems - A Review Namita Behera Department of Electrical Engineering Indian Institute of Technology Bombay Mumbai 8 th March, 2016 Outline 1 Nonlinear Eigenvalue Problems 2 Polynomial
More informationSolution of eigenvalue problems. Subspace iteration, The symmetric Lanczos algorithm. Harmonic Ritz values, Jacobi-Davidson s method
Solution of eigenvalue problems Introduction motivation Projection methods for eigenvalue problems Subspace iteration, The symmetric Lanczos algorithm Nonsymmetric Lanczos procedure; Implicit restarts
More informationA numerical method for polynomial eigenvalue problems using contour integral
A numerical method for polynomial eigenvalue problems using contour integral Junko Asakura a Tetsuya Sakurai b Hiroto Tadano b Tsutomu Ikegami c Kinji Kimura d a Graduate School of Systems and Information
More informationNonlinear Eigenvalue Problems: An Introduction
Nonlinear Eigenvalue Problems: An Introduction Cedric Effenberger Seminar for Applied Mathematics ETH Zurich Pro*Doc Workshop Disentis, August 18 21, 2010 Cedric Effenberger (SAM, ETHZ) NLEVPs: An Introduction
More informationA Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation
A Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation Tao Zhao 1, Feng-Nan Hwang 2 and Xiao-Chuan Cai 3 Abstract In this paper, we develop an overlapping domain decomposition
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 informationAn Algorithm for the Complete Solution of Quadratic Eigenvalue Problems
An Algorithm for the Complete Solution of Quadratic Eigenvalue Problems SVEN HAMMARLING, Numerical Algorithms Group Ltd. and The University of Manchester CHRISTOPHER J. MUNRO, Rutherford Appleton Laboratory
More informationContour Integral Method for the Simulation of Accelerator Cavities
Contour Integral Method for the Simulation of Accelerator Cavities V. Pham-Xuan, W. Ackermann and H. De Gersem Institut für Theorie Elektromagnetischer Felder DESY meeting (14.11.2017) November 14, 2017
More informationHow to Detect Definite Hermitian Pairs
How to Detect Definite Hermitian Pairs Françoise Tisseur School of Mathematics The University of Manchester ftisseur@ma.man.ac.uk http://www.ma.man.ac.uk/~ftisseur/ Joint work with Chun-Hua Guo and Nick
More informationNonlinear Eigenvalue Problems: Interpolatory Algorithms and Transient Dynamics
Nonlinear Eigenvalue Problems: Interpolatory Algorithms and Transient Dynamics Mark Embree Virginia Tech with Serkan Gugercin Jonathan Baker, Michael Brennan, Alexander Grimm Virginia Tech SIAM Conference
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 informationBarycentric interpolation via the AAA algorithm
Barycentric interpolation via the AAA algorithm Steven Elsworth Stefan Güttel November 217 Contents 1 Introduction 1 2 A simple scalar example 1 3 Solving a nonlinear eigenproblem 2 4 References 6 1 Introduction
More informationRational Krylov Decompositions: Theory and Applications. Berljafa, Mario. MIMS EPrint:
Rational Krylov Decompositions: Theory and Applications Berljafa, Mario 2017 MIMS EPrint: 2017.6 Manchester Institute for Mathematical Sciences School of Mathematics The University of Manchester Reports
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 informationAn Arnoldi method with structured starting vectors for the delay eigenvalue problem
An Arnoldi method with structured starting vectors for the delay eigenvalue problem Elias Jarlebring, Karl Meerbergen, Wim Michiels Department of Computer Science, K.U. Leuven, Celestijnenlaan 200 A, 3001
More informationACCURATE SOLUTIONS OF POLYNOMIAL EIGENVALUE PROBLEMS
ACCURATE SOLUTIONS OF POLYNOMIAL EIGENVALUE PROBLEMS YILING YOU, JOSE ISRAEL RODRIGUEZ, AND LEK-HENG LIM Abstract. Quadratic eigenvalue problems (QEP) and more generally polynomial eigenvalue problems
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 informationA Nonlinear QR Algorithm for Banded Nonlinear Eigenvalue Problems
A Nonlinear QR Algorithm for Banded Nonlinear Eigenvalue Problems C. KRISTOPHER GARRETT, Computational Physics and Methods, Los Alamos National Laboratory ZHAOJUN BAI, Department of Computer Science and
More informationA polynomial Jacobi Davidson solver with support for non-monomial bases and deflation
A polynomial Jacobi Davidson solver with support for non-monomial bases and deflation Carmen Campos Jose E. Roman January 8, 2019 Abstract Large-scale polynomial eigenvalue problems can be solved by Krylov
More informationA Structure-Preserving Method for Large Scale Eigenproblems. of Skew-Hamiltonian/Hamiltonian (SHH) Pencils
A Structure-Preserving Method for Large Scale Eigenproblems of Skew-Hamiltonian/Hamiltonian (SHH) Pencils Yangfeng Su Department of Mathematics, Fudan University Zhaojun Bai Department of Computer Science,
More informationImproved Newton s method with exact line searches to solve quadratic matrix equation
Journal of Computational and Applied Mathematics 222 (2008) 645 654 wwwelseviercom/locate/cam Improved Newton s method with exact line searches to solve quadratic matrix equation Jian-hui Long, Xi-yan
More informationNonlinear palindromic eigenvalue problems and their numerical solution
Nonlinear palindromic eigenvalue problems and their numerical solution TU Berlin DFG Research Center Institut für Mathematik MATHEON IN MEMORIAM RALPH BYERS Polynomial eigenvalue problems k P(λ) x = (
More informationA Framework for Structured Linearizations of Matrix Polynomials in Various Bases
A Framework for Structured Linearizations of Matrix Polynomials in Various Bases Leonardo Robol Joint work with Raf Vandebril and Paul Van Dooren, KU Leuven and Université
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 informationSolving large sparse eigenvalue problems
Solving large sparse eigenvalue problems Mario Berljafa Stefan Güttel June 2015 Contents 1 Introduction 1 2 Extracting approximate eigenpairs 2 3 Accuracy of the approximate eigenpairs 3 4 Expanding the
More informationInverse Eigenvalue Problem with Non-simple Eigenvalues for Damped Vibration Systems
Journal of Informatics Mathematical Sciences Volume 1 (2009), Numbers 2 & 3, pp. 91 97 RGN Publications (Invited paper) Inverse Eigenvalue Problem with Non-simple Eigenvalues for Damped Vibration Systems
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 informationMatrix functions and their approximation. Krylov subspaces
[ 1 / 31 ] University of Cyprus Matrix functions and their approximation using Krylov subspaces Matrixfunktionen und ihre Approximation in Krylov-Unterräumen Stefan Güttel stefan@guettel.com Nicosia, 24th
More informationExponentials of Symmetric Matrices through Tridiagonal Reductions
Exponentials of Symmetric Matrices through Tridiagonal Reductions Ya Yan Lu Department of Mathematics City University of Hong Kong Kowloon, Hong Kong Abstract A simple and efficient numerical algorithm
More informationEfficient computation of transfer function dominant poles of large second-order dynamical systems
Chapter 6 Efficient computation of transfer function dominant poles of large second-order dynamical systems Abstract This chapter presents a new algorithm for the computation of dominant poles of transfer
More informationAlgorithms and Perturbation Theory for Matrix Eigenvalue Problems and the SVD
Algorithms and Perturbation Theory for Matrix Eigenvalue Problems and the SVD Yuji Nakatsukasa PhD dissertation University of California, Davis Supervisor: Roland Freund Householder 2014 2/28 Acknowledgment
More informationON SYLVESTER S LAW OF INERTIA FOR NONLINEAR EIGENVALUE PROBLEMS
ON SYLVESTER S LAW OF INERTIA FOR NONLINEAR EIGENVALUE PROBLEMS ALEKSANDRA KOSTIĆ AND HEINRICH VOSS Key words. eigenvalue, variational characterization, principle, Sylvester s law of inertia AMS subject
More informationA Continuation Approach to a Quadratic Matrix Equation
A Continuation Approach to a Quadratic Matrix Equation Nils Wagner nwagner@mecha.uni-stuttgart.de Institut A für Mechanik, Universität Stuttgart GAMM Workshop Applied and Numerical Linear Algebra September
More informationComputing the Action of the Matrix Exponential
Computing the Action of the Matrix Exponential Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ Joint work with Awad H. Al-Mohy 16th ILAS
More informationarxiv: v1 [math.na] 28 Jun 2016
Noname manuscript No. (will be inserted by the editor Restarting for the Tensor Infinite Arnoldi method Giampaolo Mele Elias Jarlebring arxiv:1606.08595v1 [math.na] 28 Jun 2016 the date of receipt and
More informationFinding Rightmost Eigenvalues of Large, Sparse, Nonsymmetric Parameterized Eigenvalue Problems
Finding Rightmost Eigenvalues of Large, Sparse, Nonsymmetric Parameterized Eigenvalue Problems AMSC 663-664 Final Report Minghao Wu AMSC Program mwu@math.umd.edu Dr. Howard Elman Department of Computer
More informationA Jacobi Davidson Method for Nonlinear Eigenproblems
A Jacobi Davidson Method for Nonlinear Eigenproblems Heinrich Voss Section of Mathematics, Hamburg University of Technology, D 21071 Hamburg voss @ tu-harburg.de http://www.tu-harburg.de/mat/hp/voss Abstract.
More informationKrylov Subspace Methods for the Evaluation of Matrix Functions. Applications and Algorithms
Krylov Subspace Methods for the Evaluation of Matrix Functions. Applications and Algorithms 2. First Results and Algorithms Michael Eiermann Institut für Numerische Mathematik und Optimierung Technische
More informationComputing the pth Roots of a Matrix. with Repeated Eigenvalues
Applied Mathematical Sciences, Vol. 5, 2011, no. 53, 2645-2661 Computing the pth Roots of a Matrix with Repeated Eigenvalues Amir Sadeghi 1, Ahmad Izani Md. Ismail and Azhana Ahmad School of Mathematical
More informationTropical roots as approximations to eigenvalues of matrix polynomials. Noferini, Vanni and Sharify, Meisam and Tisseur, Francoise
Tropical roots as approximations to eigenvalues of matrix polynomials Noferini, Vanni and Sharify, Meisam and Tisseur, Francoise 2014 MIMS EPrint: 2014.16 Manchester Institute for Mathematical Sciences
More informationLecture 2: Numerical linear algebra
Lecture 2: Numerical linear algebra QR factorization Eigenvalue decomposition Singular value decomposition Conditioning of a problem Floating point arithmetic and stability of an algorithm Linear algebra
More informationHOMOGENEOUS JACOBI DAVIDSON. 1. Introduction. We study a homogeneous Jacobi Davidson variant for the polynomial eigenproblem
HOMOGENEOUS JACOBI DAVIDSON MICHIEL E. HOCHSTENBACH AND YVAN NOTAY Abstract. We study a homogeneous variant of the Jacobi Davidson method for the generalized and polynomial eigenvalue problem. Special
More informationStructured Krylov Subspace Methods for Eigenproblems with Spectral Symmetries
Structured Krylov Subspace Methods for Eigenproblems with Spectral Symmetries Fakultät für Mathematik TU Chemnitz, Germany Peter Benner benner@mathematik.tu-chemnitz.de joint work with Heike Faßbender
More informationHermitian Matrix Polynomials with Real Eigenvalues of Definite Type. Part I: Classification. Al-Ammari, Maha and Tisseur, Francoise
Hermitian Matrix Polynomials with Real Eigenvalues of Definite Type. Part I: Classification Al-Ammari, Maha and Tisseur, Francoise 2010 MIMS EPrint: 2010.9 Manchester Institute for Mathematical Sciences
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 informationBackward Error of Polynomial Eigenproblems Solved by Linearization. Higham, Nicholas J. and Li, Ren-Cang and Tisseur, Françoise. MIMS EPrint: 2006.
Backward Error of Polynomial Eigenproblems Solved by Linearization Higham, Nicholas J and Li, Ren-Cang and Tisseur, Françoise 2007 MIMS EPrint: 2006137 Manchester Institute for Mathematical Sciences School
More informationNick Higham. Director of Research School of Mathematics
Exploiting Research Tropical Matters Algebra in Numerical February 25, Linear 2009 Algebra Nick Higham Françoise Tisseur Director of Research School of Mathematics The School University of Mathematics
More informationInduced Dimension Reduction method to solve the Quadratic Eigenvalue Problem
Induced Dimension Reduction method to solve the Quadratic Eigenvalue Problem R. Astudillo and M. B. van Gijzen Email: R.A.Astudillo@tudelft.nl Delft Institute of Applied Mathematics Delft University of
More informationResearch CharlieMatters
Research CharlieMatters Van Loan and the Matrix Exponential February 25, 2009 Nick Nick Higham Director Schoolof ofresearch Mathematics The School University of Mathematics of Manchester http://www.maths.manchester.ac.uk/~higham
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 informationarxiv: v2 [math.na] 8 Aug 2018
THE CONDITIONING OF BLOCK KRONECKER l-ifications OF MATRIX POLYNOMIALS JAVIER PÉREZ arxiv:1808.01078v2 math.na] 8 Aug 2018 Abstract. A strong l-ification of a matrix polynomial P(λ) = A i λ i of degree
More informationRational Interpolation Methods for Nonlinear Eigenvalue Problems
Rational Interpolation Methods for Nonlinear Eigenvalue Problems Michael Brennan Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the
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 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 informationNumerical Methods I Solving Nonlinear Equations
Numerical Methods I Solving Nonlinear Equations Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 16th, 2014 A. Donev (Courant Institute)
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 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 informationarxiv: v1 [math.na] 15 Feb 2012
COMPUTING A PARTIAL SCHUR FACTORIZATION OF NONLINEAR EIGENVALUE PROBLEMS USING THE INFINITE ARNOLDI METHOD ELIAS JARLEBRING, KARL MEERBERGEN, WIM MICHIELS arxiv:1202.3235v1 [math.na] 15 Feb 2012 Abstract.
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 436 (2012) 3954 3973 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Hermitian matrix polynomials
More informationIterative projection methods for sparse nonlinear eigenvalue problems
Iterative projection methods for sparse nonlinear eigenvalue problems Heinrich Voss voss@tu-harburg.de Hamburg University of Technology Institute of Mathematics TUHH Heinrich Voss Iterative projection
More informationm A i x(t τ i ), i=1 i=1
A KRYLOV METHOD FOR THE DELAY EIGENVALUE PROBLEM ELIAS JARLEBRING, KARL MEERBERGEN, AND WIM MICHIELS Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems.
More informationEIGENVALUE PROBLEMS. Background on eigenvalues/ eigenvectors / decompositions. Perturbation analysis, condition numbers..
EIGENVALUE PROBLEMS Background on eigenvalues/ eigenvectors / decompositions Perturbation analysis, condition numbers.. Power method The QR algorithm Practical QR algorithms: use of Hessenberg form and
More informationFitting an artificial frequency response
Fitting an artificial frequency response Mario Berljafa Stefan Güttel February 215 Contents 1 Introduction 1 2 Problem setup 1 3 Testing RKFIT 2 4 The rkfun class 3 5 Some other choices for the initial
More informationRobust successive computation of eigenpairs for nonlinear eigenvalue problems
Robust successive computation of eigenpairs for nonlinear eigenvalue problems C. Effenberger July 21, 2012 Newton-based methods are well-established techniques for solving nonlinear eigenvalue problems.
More informationOn Solving Large Algebraic. Riccati Matrix Equations
International Mathematical Forum, 5, 2010, no. 33, 1637-1644 On Solving Large Algebraic Riccati Matrix Equations Amer Kaabi Department of Basic Science Khoramshahr Marine Science and Technology University
More informationNonlinear Eigenvalue Problems and Contour Integrals
Nonlinear Eigenvalue Problems and Contour Integrals Marc Van Barel a,,, Peter Kravanja a a KU Leuven, Department of Computer Science, Celestijnenlaan 200A, B-300 Leuven (Heverlee), Belgium Abstract In
More informationPreconditioned inverse iteration and shift-invert Arnoldi method
Preconditioned inverse iteration and shift-invert Arnoldi method Melina Freitag Department of Mathematical Sciences University of Bath CSC Seminar Max-Planck-Institute for Dynamics of Complex Technical
More informationThe parallel rational Arnoldi algorithm
The parallel rational Arnoldi algorithm Mario Berljafa Stefan Güttel May 016 Contents 1 Introduction 1 Parallelization strategies 1 3 Basic usage 1 Near-optimal continuation strategy 3 5 Links to numerical
More informationStructured Backward Error for Palindromic Polynomial Eigenvalue Problems
Structured Backward Error for Palindromic Polynomial Eigenvalue Problems Ren-Cang Li Wen-Wei Lin Chern-Shuh Wang Technical Report 2008-06 http://www.uta.edu/math/preprint/ Structured Backward Error for
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 informationThe German word eigen is cognate with the Old English word āgen, which became owen in Middle English and own in modern English.
Chapter 4 EIGENVALUE PROBLEM The German word eigen is cognate with the Old English word āgen, which became owen in Middle English and own in modern English. 4.1 Mathematics 4.2 Reduction to Upper Hessenberg
More informationReliably computing all characteristic roots of delay differential equations in a given right half plane using a spectral method
Reliably computing all characteristic roots of delay differential equations in a given right half plane using a spectral method Zhen Wu Wim Michiels Report TW 596, May 2011 Katholieke Universiteit Leuven
More informationAvailable online at ScienceDirect. Procedia Engineering 100 (2015 ) 56 63
Available online at www.sciencedirect.com ScienceDirect Procedia Engineering 100 (2015 ) 56 63 25th DAAAM International Symposium on Intelligent Manufacturing and Automation, DAAAM 2014 Definite Quadratic
More informationAPPLIED NUMERICAL LINEAR ALGEBRA
APPLIED NUMERICAL LINEAR ALGEBRA James W. Demmel University of California Berkeley, California Society for Industrial and Applied Mathematics Philadelphia Contents Preface 1 Introduction 1 1.1 Basic Notation
More informationA Parallel Scalable PETSc-Based Jacobi-Davidson Polynomial Eigensolver with Application in Quantum Dot Simulation
A Parallel Scalable PETSc-Based Jacobi-Davidson Polynomial Eigensolver with Application in Quantum Dot Simulation Zih-Hao Wei 1, Feng-Nan Hwang 1, Tsung-Ming Huang 2, and Weichung Wang 3 1 Department of
More informationOn a root-finding approach to the polynomial eigenvalue problem
On a root-finding approach to the polynomial eigenvalue problem Dipartimento di Matematica, Università di Pisa www.dm.unipi.it/ bini Joint work with Vanni Noferini and Meisam Sharify Limoges, May, 10,
More informationSolving Regularized Total Least Squares Problems
Solving Regularized Total Least Squares Problems Heinrich Voss voss@tu-harburg.de Hamburg University of Technology Institute of Numerical Simulation Joint work with Jörg Lampe TUHH Heinrich Voss Total
More informationSolving Constrained Rayleigh Quotient Optimization Problem by Projected QEP Method
Solving Constrained Rayleigh Quotient Optimization Problem by Projected QEP Method Yunshen Zhou Advisor: Prof. Zhaojun Bai University of California, Davis yszhou@math.ucdavis.edu June 15, 2017 Yunshen
More information