Reduction of nonlinear eigenproblems with JD

Similar documents
Jacobi s Ideas on Eigenvalue Computation in a modern context

Eigenvalue Problems CHAPTER 1 : PRELIMINARIES

Davidson Method CHAPTER 3 : JACOBI DAVIDSON METHOD

Polynomial Jacobi Davidson Method for Large/Sparse Eigenvalue Problems

ITERATIVE PROJECTION METHODS FOR SPARSE LINEAR SYSTEMS AND EIGENPROBLEMS CHAPTER 11 : JACOBI DAVIDSON METHOD

1. Introduction. In this paper we consider the large and sparse eigenvalue problem. Ax = λx (1.1) T (λ)x = 0 (1.2)

HOMOGENEOUS JACOBI DAVIDSON. 1. Introduction. We study a homogeneous Jacobi Davidson variant for the polynomial eigenproblem

HARMONIC RAYLEIGH RITZ EXTRACTION FOR THE MULTIPARAMETER EIGENVALUE PROBLEM

MICHIEL E. HOCHSTENBACH

A Jacobi Davidson Method for Nonlinear Eigenproblems

Multiparameter eigenvalue problem as a structured eigenproblem

Numerical Methods for Large Scale Eigenvalue Problems

of dimension n 1 n 2, one defines the matrix determinants

Lecture 3: Inexact inverse iteration with preconditioning

Inexact inverse iteration with preconditioning

A comparison of solvers for quadratic eigenvalue problems from combustion

1. Select the unique answer (choice) for each problem. Write only the answer.

The parallel computation of the smallest eigenpair of an. acoustic problem with damping. Martin B. van Gijzen and Femke A. Raeven.

Iterative projection methods for sparse nonlinear eigenvalue problems

The quadratic eigenvalue problem (QEP) is to find scalars λ and nonzero vectors u satisfying

ABSTRACT OF DISSERTATION. Ping Zhang

235 Final exam review questions

Math 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination

U AUc = θc. n u = γ i x i,

Computing Transfer Function Dominant Poles of Large Second-Order Systems

Solving large sparse eigenvalue problems

Chap 3. Linear Algebra

Ma/CS 6b Class 23: Eigenvalues in Regular Graphs

Alternative correction equations in the Jacobi-Davidson method

The Singular Value Decomposition

ECS231 Handout Subspace projection methods for Solving Large-Scale Eigenvalue Problems. Part I: Review of basic theory of eigenvalue problems

Preconditioned Locally Minimal Residual Method for Computing Interior Eigenpairs of Symmetric Operators

A HARMONIC RESTARTED ARNOLDI ALGORITHM FOR CALCULATING EIGENVALUES AND DETERMINING MULTIPLICITY

LARGE SPARSE EIGENVALUE PROBLEMS. General Tools for Solving Large Eigen-Problems

JUST THE MATHS SLIDES NUMBER 9.6. MATRICES 6 (Eigenvalues and eigenvectors) A.J.Hobson

LARGE SPARSE EIGENVALUE PROBLEMS

Efficient computation of transfer function dominant poles of large second-order dynamical systems

A JACOBI DAVIDSON METHOD FOR SOLVING COMPLEX-SYMMETRIC EIGENVALUE PROBLEMS

Conceptual Questions for Review

Solving Regularized Total Least Squares Problems

Two-sided Eigenvalue Algorithms for Modal Approximation

Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems

Model order reduction of large-scale dynamical systems with Jacobi-Davidson style eigensolvers

A Note on Inverse Iteration

A Jacobi Davidson-type projection method for nonlinear eigenvalue problems

Math 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008

Symmetric and self-adjoint matrices

Numerical Methods for Solving Large Scale Eigenvalue Problems

Problem # Max points possible Actual score Total 120

A Jacobi Davidson Method with a Multigrid Solver for the Hermitian Wilson-Dirac Operator

Chapter 3 Transformations

A Jacobi-Davidson method for solving complex symmetric eigenvalue problems Arbenz, P.; Hochstenbach, M.E.

ALGEBRAIC GEOMETRY HOMEWORK 3

Variational Principles for Nonlinear Eigenvalue Problems

Direct methods for symmetric eigenvalue problems

Chapters 5 & 6: Theory Review: Solutions Math 308 F Spring 2015

ABSTRACT. Professor G.W. Stewart

Solving Polynomial Eigenproblems by Linearization

Universiteit-Utrecht. Department. of Mathematics. The convergence of Jacobi-Davidson for. Hermitian eigenproblems. Jasper van den Eshof.

A Jacobi Davidson type method for the generalized singular value problem

AMS526: Numerical Analysis I (Numerical Linear Algebra)

COMP 558 lecture 18 Nov. 15, 2010

Block Iterative Eigensolvers for Sequences of Dense Correlated Eigenvalue Problems

A Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation

GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.

Rational Krylov methods for linear and nonlinear eigenvalue problems

Solution of eigenvalue problems. Subspace iteration, The symmetric Lanczos algorithm. Harmonic Ritz values, Jacobi-Davidson s method

Quadratic forms. Here. Thus symmetric matrices are diagonalizable, and the diagonalization can be performed by means of an orthogonal matrix.

Iterative methods for symmetric eigenvalue problems

ẋ n = f n (x 1,...,x n,u 1,...,u m ) (5) y 1 = g 1 (x 1,...,x n,u 1,...,u m ) (6) y p = g p (x 1,...,x n,u 1,...,u m ) (7)

Computational Methods CMSC/AMSC/MAPL 460. Eigenvalues and Eigenvectors. Ramani Duraiswami, Dept. of Computer Science

Linear Algebra and its Applications

Efficient Methods For Nonlinear Eigenvalue Problems. Diploma Thesis

AMS526: Numerical Analysis I (Numerical Linear Algebra)

An Arnoldi Method for Nonlinear Symmetric Eigenvalue Problems

Nonlinear Eigenvalue Problems: A Challenge for Modern Eigenvalue Methods

Solution of eigenvalue problems. Subspace iteration, The symmetric Lanczos algorithm. Harmonic Ritz values, Jacobi-Davidson s method

Iterative methods for Linear System

Controlling inner iterations in the Jacobi Davidson method

ABSTRACT. Name: Daniil R. Sarkissian Department: Mathematical Sciences

T(λ)x = 0 (1.1) k λ j A j x = 0 (1.3)

A Jacobi Davidson type method for the product eigenvalue problem

AMS526: Numerical Analysis I (Numerical Linear Algebra)

Bindel, Fall 2016 Matrix Computations (CS 6210) Notes for

MATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors.

Topic 1 [145 marks] Markscheme. Examiners report. since. I is the identity A1 and. R is reflexive. it follows that B = AX 1 A1 and.

Numerical Methods I: Eigenvalues and eigenvectors

1. Diagonalize the matrix A if possible, that is, find an invertible matrix P and a diagonal

Notes on singular value decomposition for Math 54. Recall that if A is a symmetric n n matrix, then A has real eigenvalues A = P DP 1 A = P DP T.

What s Eigenanalysis? Matrix eigenanalysis is a computational theory for the matrix equation

Math Linear Algebra Final Exam Review Sheet

YORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #1. July 11, 2013 Solutions

SOLVING MESH EIGENPROBLEMS WITH MULTIGRID EFFICIENCY

Eigenvalues and Eigenvectors

1. Introduction. In this paper we consider variants of the Jacobi Davidson (JD) algorithm [27] for computing a few eigenpairs of

Domain decomposition on different levels of the Jacobi-Davidson method

A Jacobi-Davidson method for two real parameter nonlinear eigenvalue problems arising from delay differential equations

OVERVIEW. Basics Generalized Schur Form Shifts / Generalized Shifts Partial Generalized Schur Form Jacobi-Davidson QZ Algorithm

APPLIED NUMERICAL LINEAR ALGEBRA

EIGIFP: A MATLAB Program for Solving Large Symmetric Generalized Eigenvalue Problems

Transcription:

Reduction of nonlinear eigenproblems with JD Henk van der Vorst H.A.vanderVorst@math.uu.nl Mathematical Institute Utrecht University July 13, 2005, SIAM Annual New Orleans p.1/16

Outline Polynomial Eigenproblems (λ l C l + λc 1 + C 0 )x = 0) or ψ(λ)x = 0 For examples: quadratic eigenproblems - Reduction to standard problem - Newton for Rayleigh quotient Jacobi Davidson approach Alternatives for Rayleigh quotient July 13, 2005, SIAM Annual New Orleans p.2/16

Classical: Reduction From (λ 2 M + λc + K)x = 0 To Az = λbz ( 0 I with A = K C ) B = ( I 0 0 M ) z = ( x λx ) and then B 1 Az = λz Problems: - matrices twice as big - how to select wanted solutions? - inversion of B July 13, 2005, SIAM Annual New Orleans p.3/16

Classical: Newton for RQ x ψ(λ)x = 0 λ 2 (x Mx) + λ(x Cx) + x Kx = 0 Two roots; one useful, one spurious In subspace methods: approximations How to select? July 13, 2005, SIAM Annual New Orleans p.4/16

Jacobi-Davidson the basic ideas for Ax = λx: Given some subspace V m = {v 1,...,v m } (orthonormal) Determine approximations z = V m s, θ such that AV m s θv m s {v 1,...,v m } or VmAV m s = θs θ is Rayleigh quotient for V m s July 13, 2005, SIAM Annual New Orleans p.5/16

Jacobi-Davidson (2) θ, s eigenpair of V mav m Select proper eigenpair Determine t s such that A(s + t) = λ(s + t) t satisfies: (1 ss )(A λi)(i ss )t = (AV m s θv m s) Replace λ by θ Solve (approximately) for t and expand V m with t July 13, 2005, SIAM Annual New Orleans p.6/16

Other viewpoint Ax = λx, Let θ = y Ay with y y = 1 write x = y + y, y y, λ = θ + θ Ignore quadratic terms Then (I yy )(A θi)(i yy ) y = r with r = Ay θy Newton method; quadratic convergence July 13, 2005, SIAM Annual New Orleans p.7/16

Nonlinear eigenproblems Similar Newton approach for Rayleigh quotient: x ψ(λ)x = 0 leads to the projected problem: V mψ(θ)v m s = 0 V m is expanded with approximate t y = V m s from (I py y p )ψ(θ)(i yy )t = ψ(θ)y with p = ψ (θ)y for this choice of p: quadratic convergence July 13, 2005, SIAM Annual New Orleans p.8/16

QEP Expansion of subspace with (I py y p )(A + θb + θ2 C)(I yy )t = (Ay + θby + θ 2 Cy) V m is expanded with t New s and θ from: W mav m s + θv mbv m s + θ 2 V mcv m s = 0 Problem: selection of proper θ and s Rayleigh quotient has two solutions for θ July 13, 2005, SIAM Annual New Orleans p.9/16

Example from acoustics Ax + λbx + λ 2 Cx = 0 A,C 19 nonzero s per row, B complex, n = 136161 Results for interior isolated eigenvalue on CRAY T3D Processors Elapsed time 16 206.4 32 101.3 64 52.1 one (sparse) matrix inversion takes about 5 minutes on 64 processors when at peak performance July 13, 2005, SIAM Annual New Orleans p.10/16

Rayleigh Quotient for QEP Work with Hochstenbach With y an approximation for eigenvector: (A + θb + θ 2 C)y y Hence αθ 2 + βθ + γ = 0 α = y Cy, β = y By, γ = y Ay For y close to eigenvector: One θ meaningful Decision based on value of (A + θb + θ 2 C)y 2 If y not accurate: difficult to decide July 13, 2005, SIAM Annual New Orleans p.11/16

Inaccurate approximations Situation occurs in subspace methods Rayleigh quotient for standard eigenproblem is accurate: First order perturbation in eigenvector gives second order perturbation in Rayleigh quotient For QEP: if β 2 4αγ is small then both solutions for θ are very sensitive for perturbations in y QEP (and higher order) offer more possibilities for eigenvalue approximations July 13, 2005, SIAM Annual New Orleans p.12/16

Alternatives for RQ For standard problem Ay and y θ follows from projecting Ay onto y For QEP three vectors: Ay, By, and Cy Form asymptotically one plane Consider projection of these vectors on plane {p, q} with p, q combinations of the three vectors Consider generalized residual r = (µc + νb + A)y µ λ 2, ν λ Hence µ/ν and ν both approximations for λ July 13, 2005, SIAM Annual New Orleans p.13/16

Alternatives for RQ (2) Galerkin conditions for {p,q}: r p and r q ( ) [p q] µ [Ay By] = [p q] Cy ν Good choices for p,q: two largest left singular vectors of [Cy By Ay] δµ/ν δy (x) = 1 λ This suggests: δµ δν δy (x) δy (x) If θ is small then ν may be better otherwise µ/nu also good candidate quality judged by residual July 13, 2005, SIAM Annual New Orleans p.14/16

Example Results for randomly generated A, B, c, n = 100 Method Approx error r 1-dim Gal 7.218 + 2.738i 0.0428 0.307 2-dim Gal 7.230 + 2.769i 0.0110 0.290 2-dim ν 7.189 + 2.800i 0.0445 0.329 for situation with small discriminant Method Approx error r 1-dim Gal 1.0117 0.0444i 0.0444 0.0431 2-dim Gal 1.0076 0.0025i 0.0034 0.0034 2-dim ν 1.0095 0.0014i 0.0015 0.0027 July 13, 2005, SIAM Annual New Orleans p.15/16

Relevant references SIAM Templates for Eigenproblems Hochstenbach and VDV SIAM J. Sci. Comput., 25(2), p. 591-603, 2003 July 13, 2005, SIAM Annual New Orleans p.16/16