Algorithms for Solving the Polynomial Eigenvalue Problem
|
|
- Thomas Casey
- 6 years ago
- Views:
Transcription
1 Algorithms for Solving the Polynomial Eigenvalue Problem Nick Higham School of Mathematics The University of Manchester Joint work with D. Steven Mackey and Françoise Tisseur. TU Berlin March 13, 2006 Nick Higham Polynomial eigenproblem 1
2 Polynomial Eigenproblem P(λ) = m λ i A i, A i C n n, A m 0. i=0 P assumed regular (det P(λ) 0). Find scalars λ and nonzero vectors x and y satisfying P(λ)x = 0 and y P(λ) = 0. Nick Higham Polynomial eigenproblem 2
3 Hyperbolic and Overdamped Quadratics Q(λ)x = (λ 2 A + λb + C)x = 0. Q is hyperbolic if A is Hermitian pos. def., B and C Hermitian, and (x Bx) 2 > 4(x Ax)(x Cx) for all x 0. Hyperbolic implies real e vals with λ 1 λ n > λ n+1 λ 2n. Q is overdamped if it is hyperbolic with B Hermitian pos. def. and C Hermitian pos. semidef. Overdamped implies λ 1 0. Nick Higham Polynomial eigenproblem 3
4 Methods Interested in methods for solving dense problems. Solvent. Bandwidth reduction. Structure-preserving transformations. Linearization. Nick Higham Polynomial eigenproblem 4
5 Solvent Approach Q(X) = AX 2 + BX + C. S is a solvent if Q(S) = 0. Then Q(λ) = (B + AS + λa)(s λi). Eigenproblem reduced to two n n problems: standard and generalized. Existence of solvent guaranteed if λ 1 λ n > λ n+1 λ 2n and lin indep e vecs exist for {λ 1,...,λ n } and {λ n+1,...,λ 2n }. Conditions satisfied for overdamped polys. Nick Higham Polynomial eigenproblem 5
6 Solvent via Newton, Bernoulli Newton s method with exact line searches (H & Kim, 2001). Solve a gen Sylvester equation on each step. Nick Higham Polynomial eigenproblem 6
7 Solvent via Newton, Bernoulli Newton s method with exact line searches (H & Kim, 2001). Solve a gen Sylvester equation on each step. Bernoulli iteration (H & Kim, 2000): (AX i + B)X i 1 + C = 0, X 1 = A 1 B. Convergence requires λ n > λ n+1 and existence of dominant solvent: Λ(S 1 ) = {λ 1,...,λ n }, minimal solvent: Λ(S 2 ) = {λ n+1,...,λ 2n }. Linear convergence to S 1 with constant λ n / λ n+1. H & Kim showed can be faster thanpolyeig. Nick Higham Polynomial eigenproblem 6
8 Solvent via Cyclic Reduction Cyclic reduction (Guo & Lancaster, 2005) on infinite block tridiagonal system with rows [C B A]. Matrix iteration X i+1 = X i A i B 1 i C i etc n3 flops per iteration for overdamped Q. Quadratic convergence for overdamped Q. Dominant and minimal solvents are obtained from limit X as X 1 C and A 1 X. E vals not guaranteed real! Total cost if k iterations: (25 + 6k)n 3 flops e vals only (55 + 6k)n 3 flops e vals and e vecs Nick Higham Polynomial eigenproblem 7
9 Linearization for Hyperbolic Quadratic Assume we know σ such that Q(σ) < 0. Q(λ) := Q(λ + σ) = λ 2 Q (σ) + λq (σ) + Q(σ) X λy = λ 2 }{{} A +λ B + C }{{}. >0 <0 [ ] [ ] B A C 0 λ. A 0 0 A Transform X λy G λi using Cholesky of A and C. Real e vals assured. Total cost: 18n 3 flops e vals only 33n 3 flops e vals and e vecs Nick Higham Polynomial eigenproblem 8
10 Bandwidth Reduction Q(λ) = λ 2 A + λb + C. Transform GQ(λ)H = λ 2Ã + λ B + C with Ã, B, C of minimal bandwidth in fte # operations. Then apply some other method. Tridiagonal form is not achievable (2n 2 parameters, 3n 2 equations). Is pentadiagonal form achievable? Nick Higham Polynomial eigenproblem 9
11 Structure-Preserving Transformations Idea is to produce a diagonal poly with the same spectrum as P. Garvey, Prells & Friswell (2002, 2003) Chu & Del Buono (2005) pursue the approach: Form a linearization (in DL(P)). Iteratively transform it to diagonal form preserving its structure. Generate the transformations via isospectral flows? Many open questions. Nick Higham Polynomial eigenproblem 10
12 Linearizations L(λ) = λx + Y, X, Y C mn mn is a linearization of P(λ) = m i=0 λi A i if [ ] P(λ) 0 E(λ)L(λ)F(λ) = 0 I (m 1)n for some unimodular E(λ) and F(λ). Example Companion form linearization ( [ ] [ A2 0 A1 A E(λ) λ I I 0 ]) F(λ) = [ ] λ 2 A 2 + λa 1 + A I Nick Higham Polynomial eigenproblem 11
13 Solution Process Standard way of solving P(λ)x = 0: Linearize P(λ) into L(λ) = λx + Y. Solve generalized eigenproblem L(λ)z = 0. Recover eigenvectors of P from those of L. Usual choice of L: companion linearization, for which λ m 1 x z =. λx. x Left e vec: more complicated formula. Nick Higham Polynomial eigenproblem 12
14 Desiderata for a Linearization Good conditioning. Backward stability. Preservation of structure, e.g. symmetry. Numerical preservation of key qualitative properties, including location and symmetries of spectrum. Preserve partial multiplicities of e vals (strong linearization). Nick Higham Polynomial eigenproblem 13
15 Meta-Algorithm Preprocess P. E.g., Fan, Lin & Van Dooren { (2004): γ = c/a λ 2 A + λb + C µ 2 (γ 2 δa) + µ(γδb) + δc δ = 2/(c + bγ) for one or more linearizations L Balance L Apply QZ or HZ to L Obtain relevant e vals. Recover left and right e vecs Iteratively refine e vecs Compute/estimate b errs and condition numbers Detect nonregular problem end Nick Higham Polynomial eigenproblem 14
16 Balancing Balancing GEP: Ward (1981) Lemonnier & Van Dooren (2005) To investigate: Exploit structure of pencils arising via linearization of a matrix poly. Can we balance a QEP? To what extent balancing can make the results worse? Cf. Watkins (2005): A Case where Balancing is Harmful. Nick Higham Polynomial eigenproblem 15
17 Iterative Refinement Underlying theory for fixed and extended precision residuals in Tisseur (2001). Done for definite GEPs in Davies, H & Tisseur (2001). Details for QEPs in Berhanu (2005), incl. complex conj. pairs in real arith. Issues: Convergence to wrong eigenpair or non-convergence. Exploiting structure of pencil from a linearization. Nick Higham Polynomial eigenproblem 16
18 L 1 and L 2 Linearizations Λ := [λ m 1,λ m 2,...,1] T. Mackey, Mackey, Mehl & Mehrmann (2005) define L 1 (P) = { L(λ) : L(λ)(Λ I n ) = v P(λ), v C m }, L 2 (P) = { L(λ) : (Λ T I n )L(λ) = w T P(λ), w C m }. They show that L 1 and L 2 are vector spaces of dim m(m 1)n 2 + m. Almost all pencils in L 1, L 2 are linearizations of P. Quadratic case (m = 2): L = λx + Y L 1 (P) iff [ ] [ v1 A 2 v 1 A 1 v 1 A 0 X11 X = 12 + Y 11 Y 12 v 2 A 2 v 2 A 1 v 2 A 0 X 21 X 22 + Y 21 Y 22 ]. Nick Higham Polynomial eigenproblem 17
19 L 1 and L 2 Linearizations cont. Recall Note L 1 (P) = { L(λ) : L(λ)(Λ I n ) = v P(λ), v C m }. L(λ)(Λ x) = L(λ)(Λ I n )(1 x) = (v P(λ))(1 x) = v P(λ)x. So (x,λ) is an e pair of P iff (Λ x,λ) is an e pair of L. Right eigenvectors of P can be recovered from right eigenvectors of linearizations in L 1. Left eigenvectors of P can be recovered from left eigenvectors of linearizations in L 2. Nick Higham Polynomial eigenproblem 18
20 DL(P) Linearizations Mackey, Mackey, Mehl & Mehrmann (2005) define DL(P) = L 1 (P) L 2 (P). They show that L DL(P) iff w = v in the definitions of L 1 and L 2. DL(P) is a vector space of dimension m. Almost all pencils in DL(P) are linearizations of P. Example: For Q(λ) = λ 2 A + λb + C, DL(Q) is the pencils [ ] [ ] v1 A v L(λ) = λ 2 A v1 B v + 2 A v 1 C, v C 2. v 2 A v 2 B v 1 C v 1 C v 2 C Nick Higham Polynomial eigenproblem 19
21 Conditioning in DL(P) Let ρ = max i A i 2 min( A 0 2, A m 2 ) 1. H, D. S. Mackey & Tisseur (2005) show that κ L (λ; e 1 ) ρ 2 m 7/2 κ P (λ), A 0 nonsing, λ 1, κ L (λ; e m ) ρ 2 m 7/2 κ P (λ), A m nonsing, λ 1. For Q not heavily damped, ρ = O(1). With FLV scaling, ρ = O(1) for elliptic quadratics. Nick Higham Polynomial eigenproblem 20
22 Conditioning of Companion Form H, D. S. Mackey & Tisseur (2005) find that κ C1 /κ P depends on ratios w 2 / y 2 1 of norms of left e vecs of C 1 and P, rational functions of the A i 2 and λ. Conclude that If A i 1, i = 0: m then κ C1 κ P. If w 2 / y 2 1 or if A i 2 1, i = 0: m, then κ C1 inf v κ L (λ; v) is possible. Nick Higham Polynomial eigenproblem 21
23 Companion versus DL(P) Companion is always a linearization; for DL(P) need spectrum of P distinct from roots of v. DL(P) pencil symmetric if P is, companion not. Scaling can help both. Easier to check suff. conds for DL(P) well conditioned. Role of L 1 and L 2 Can preserve other structures of P. Conditioning analysis can be extended using new left e vec recovery formula. Nick Higham Polynomial eigenproblem 22
24 Concluding Remarks Only general-purpose current methods are those based on linearization. Recent work opens up opportunities for developing more sophisticated algs based on linearization. Interesting possibilities for hyperbolic polys. How to design an LAPACK QEP solver? Nick Higham Polynomial eigenproblem 23
25 Bibliography I M. Berhanu. The Polynomial Eigenvalue Problem. PhD thesis, University of Manchester, Manchester, England, P. I. Davies, N. J. Higham, and F. Tisseur. Analysis of the Cholesky method with iterative refinement for solving the symmetric definite generalized eigenproblem. SIAM J. Matrix Anal. Appl., 23(2): , Nick Higham Polynomial eigenproblem 24
26 Bibliography II H.-Y. Fan, W.-W. Lin, and P. Van Dooren. Normwise scaling of second order polynomial matrices. SIAM J. Matrix Anal. Appl., 26(1): , C.-H. Guo and P. Lancaster. Algorithms for hyperbolic quadratic eigenvalue problems. Math. Comp., 74(252): , N. J. Higham and H.-M. Kim. Numerical analysis of a quadratic matrix equation. IMA J. Numer. Anal., 20(4): , Nick Higham Polynomial eigenproblem 25
27 Bibliography III N. J. Higham and H.-M. Kim. Solving a quadratic matrix equation by Newton s method with exact line searches. SIAM J. Matrix Anal. Appl., 23(2): , N. J. Higham, D. S. Mackey, N. Mackey, and F. Tisseur. Symmetric linearizations for matrix polynomials. MIMS EPrint , Manchester Institute for Mathematical Sciences, The University of Manchester, UK, Submitted to SIAM J. Matrix Anal. Appl. Nick Higham Polynomial eigenproblem 26
28 Bibliography IV N. J. Higham, D. S. Mackey, and F. Tisseur. The conditioning of linearizations of matrix polynomials. Numerical Analysis Report No. 465, Manchester Centre for Computational Mathematics, Manchester, England, To appear in SIAM J. Matrix Anal. Appl. D. Lemonnier and P. M. Van Dooren. Balancing regular matrix pencils. SIAM J. Matrix Anal. Appl., To appear. Nick Higham Polynomial eigenproblem 27
29 Bibliography V D. S. Mackey, N. Mackey, C. Mehl, and V. Mehrmann. Palindromic polynomial eigenvalue problems: Good vibrations from good linearizations. Numerical Analysis Report No. 466, Manchester Centre for Computational Mathematics, Manchester, England, Submitted to SIAM J. Matrix Anal. Appl. D. S. Mackey, N. Mackey, C. Mehl, and V. Mehrmann. Vector spaces of linearizations for matrix polynomials. Numerical Analysis Report No. 464, Manchester Centre for Computational Mathematics, Manchester, England, To appear in SIAM J. Matrix Anal. Appl. Nick Higham Polynomial eigenproblem 28
30 Bibliography VI F. Tisseur. Newton s method in floating point arithmetic and iterative refinement of generalized eigenvalue problems. SIAM J. Matrix Anal. Appl., 22(4): , R. C. Ward. Balancing the generalized eigenvalue problem. SIAM J. Sci. Statist. Comput., 2(2): , D. S. Watkins. A case where balancing is harmful. Submitted, Nick Higham Polynomial eigenproblem 29
Solving 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 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 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 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 informationAn 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 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 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 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 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 informationResearch Matters. February 25, The Nonlinear Eigenvalue Problem. Nick Higham. Part III. Director of Research School of Mathematics
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
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 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 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 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 informationDefinite Matrix Polynomials and their Linearization by Definite Pencils. Higham, Nicholas J. and Mackey, D. Steven and Tisseur, Françoise
Definite Matrix Polynomials and their Linearization by Definite Pencils Higham Nicholas J and Mackey D Steven and Tisseur Françoise 2007 MIMS EPrint: 200797 Manchester Institute for Mathematical Sciences
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 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 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 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 informationPolynomial Eigenvalue Problems: Theory, Computation, and Structure. Mackey, D. S. and Mackey, N. and Tisseur, F. MIMS EPrint: 2015.
Polynomial Eigenvalue Problems: Theory, Computation, and Structure Mackey, D. S. and Mackey, N. and Tisseur, F. 2015 MIMS EPrint: 2015.29 Manchester Institute for Mathematical Sciences School of Mathematics
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 information1. Introduction. Throughout this work we consider n n matrix polynomials with degree k of the form
LINEARIZATIONS OF SINGULAR MATRIX POLYNOMIALS AND THE RECOVERY OF MINIMAL INDICES FERNANDO DE TERÁN, FROILÁN M. DOPICO, AND D. STEVEN MACKEY Abstract. A standard way of dealing with a regular matrix polynomial
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 informationANALYSIS OF STRUCTURED POLYNOMIAL EIGENVALUE PROBLEMS
ANALYSIS OF STRUCTURED POLYNOMIAL EIGENVALUE PROBLEMS A thesis submitted to the University of Manchester for the degree of Doctor of Philosophy in the Faculty of Engineering and Physical Sciences 2011
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 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 informationTrimmed linearizations for structured matrix polynomials
Trimmed linearizations for structured matrix polynomials Ralph Byers Volker Mehrmann Hongguo Xu January 5 28 Dedicated to Richard S Varga on the occasion of his 8th birthday Abstract We discuss the eigenvalue
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 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 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 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 informationPerturbation theory for eigenvalues of Hermitian pencils. Christian Mehl Institut für Mathematik TU Berlin, Germany. 9th Elgersburg Workshop
Perturbation theory for eigenvalues of Hermitian pencils Christian Mehl Institut für Mathematik TU Berlin, Germany 9th Elgersburg Workshop Elgersburg, March 3, 2014 joint work with Shreemayee Bora, Michael
More informationc 2006 Society for Industrial and Applied Mathematics
SIAM J MATRIX ANAL APPL Vol 28, No 4, pp 971 1004 c 2006 Society for Industrial and Applied Mathematics VECTOR SPACES OF LINEARIZATIONS FOR MATRIX POLYNOMIALS D STEVEN MACKEY, NILOUFER MACKEY, CHRISTIAN
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 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 informationLinearizing Symmetric Matrix Polynomials via Fiedler pencils with Repetition
Linearizing Symmetric Matrix Polynomials via Fiedler pencils with Repetition Kyle Curlett Maribel Bueno Cachadina, Advisor March, 2012 Department of Mathematics Abstract Strong linearizations of a matrix
More informationFiedler Companion Linearizations and the Recovery of Minimal Indices. De Teran, Fernando and Dopico, Froilan M. and Mackey, D.
Fiedler Companion Linearizations and the Recovery of Minimal Indices De Teran, Fernando and Dopico, Froilan M and Mackey, D Steven 2009 MIMS EPrint: 200977 Manchester Institute for Mathematical Sciences
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 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 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 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 informationSOLVING A STRUCTURED QUADRATIC EIGENVALUE PROBLEM BY A STRUCTURE-PRESERVING DOUBLING ALGORITHM
SOLVING A STRUCTURED QUADRATIC EIGENVALUE PROBLEM BY A STRUCTURE-PRESERVING DOUBLING ALGORITHM CHUN-HUA GUO AND WEN-WEI LIN Abstract In studying the vibration of fast trains, we encounter a palindromic
More informationComputing Unstructured and Structured Polynomial Pseudospectrum Approximations
Computing Unstructured and Structured Polynomial Pseudospectrum Approximations Silvia Noschese 1 and Lothar Reichel 2 1 Dipartimento di Matematica, SAPIENZA Università di Roma, P.le Aldo Moro 5, 185 Roma,
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 informationMultiparameter eigenvalue problem as a structured eigenproblem
Multiparameter eigenvalue problem as a structured eigenproblem Bor Plestenjak Department of Mathematics University of Ljubljana This is joint work with M Hochstenbach Będlewo, 2932007 1/28 Overview Introduction
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 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 informationOff-diagonal perturbation, first-order approximation and quadratic residual bounds for matrix eigenvalue problems
Off-diagonal perturbation, first-order approximation and quadratic residual bounds for matrix eigenvalue problems Yuji Nakatsukasa Abstract When a symmetric block diagonal matrix [ A 1 A2 ] undergoes an
More informationDefinite versus Indefinite Linear Algebra. Christian Mehl Institut für Mathematik TU Berlin Germany. 10th SIAM Conference on Applied Linear Algebra
Definite versus Indefinite Linear Algebra Christian Mehl Institut für Mathematik TU Berlin Germany 10th SIAM Conference on Applied Linear Algebra Monterey Bay Seaside, October 26-29, 2009 Indefinite Linear
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 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 informationLinearizations of singular matrix polynomials and the recovery of minimal indices
Electronic Journal of Linear Algebra Volume 18 Volume 18 (2009) Article 32 2009 Linearizations of singular matrix polynomials and the recovery of minimal indices Fernando de Teran fteran@math.uc3m.es Froilan
More informationAnalysis of the Cholesky Method with Iterative Refinement for Solving the Symmetric Definite Generalized Eigenproblem
Analysis of the Cholesky Method with Iterative Refinement for Solving the Symmetric Definite Generalized Eigenproblem Davies, Philip I. and Higham, Nicholas J. and Tisseur, Françoise 2001 MIMS EPrint:
More informationEigenvalue and Eigenvector Problems
Eigenvalue and Eigenvector Problems An attempt to introduce eigenproblems Radu Trîmbiţaş Babeş-Bolyai University April 8, 2009 Radu Trîmbiţaş ( Babeş-Bolyai University) Eigenvalue and Eigenvector Problems
More informationEXPLICIT BLOCK-STRUCTURES FOR BLOCK-SYMMETRIC FIEDLER-LIKE PENCILS
EXPLICIT BLOCK-STRUCTURES FOR BLOCK-SYMMETRIC FIEDLER-LIKE PENCILS M I BUENO, M MARTIN, J PÉREZ, A SONG, AND I VIVIANO Abstract In the last decade, there has been a continued effort to produce families
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 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 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 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 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 informationELA
SHARP LOWER BOUNDS FOR THE DIMENSION OF LINEARIZATIONS OF MATRIX POLYNOMIALS FERNANDO DE TERÁN AND FROILÁN M. DOPICO Abstract. A standard way of dealing with matrixpolynomial eigenvalue problems is to
More informationPseudospectra of Matrix Pencils and some Distance Problems
Pseudospectra of Matrix Pencils and some Distance Problems Rafikul Alam Department of Mathematics Indian Institute of Technology Guwahati Guwahati - 781 039, INDIA Many thanks to Safique Ahmad and Ralph
More information1. Introduction. In this paper we discuss a new class of structured matrix polynomial eigenproblems Q(λ)v = 0, where
STRUCTURED POLYNOMIAL EIGENPROBLEMS RELATED TO TIME-DELAY SYSTEMS H. FASSBENDER, D. S. MACKEY, N. MACKEY, AND C. SCHRÖDER Abstract. A new class of structured polynomial eigenproblems arising in the stability
More informationA Structure-Preserving Doubling Algorithm for Quadratic Eigenvalue Problems Arising from Time-Delay Systems
A Structure-Preserving Doubling Algorithm for Quadratic Eigenvalue Problems Arising from Time-Delay Systems Tie-xiang Li Eric King-wah Chu Wen-Wei Lin Abstract We propose a structure-preserving doubling
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 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 informationSTABILITY FOR PARABOLIC SOLVERS
Review STABILITY FOR PARABOLIC SOLVERS School of Mathematics Semester 1 2008 OUTLINE Review 1 REVIEW 2 STABILITY: EXPLICIT METHOD Explicit Method as a Matrix Equation Growing Errors Stability Constraint
More 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 informationStructured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations Mackey, D. Steven and Mackey, Niloufer and Mehl, Christian and Mehrmann, Volker 006 MIMS EPrint: 006.8 Manchester Institute
More informationSkew-Symmetric Matrix Polynomials and their Smith Forms
Skew-Symmetric Matrix Polynomials and their Smith Forms D. Steven Mackey Niloufer Mackey Christian Mehl Volker Mehrmann March 23, 2013 Abstract Two canonical forms for skew-symmetric matrix polynomials
More informationSymmetric matrices and dot products
Symmetric matrices and dot products Proposition An n n matrix A is symmetric iff, for all x, y in R n, (Ax) y = x (Ay). Proof. If A is symmetric, then (Ax) y = x T A T y = x T Ay = x (Ay). If equality
More informationA Note on Inverse Iteration
A Note on Inverse Iteration Klaus Neymeyr Universität Rostock, Fachbereich Mathematik, Universitätsplatz 1, 18051 Rostock, Germany; SUMMARY Inverse iteration, if applied to a symmetric positive definite
More informationDetecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
Linear Algebra and its Applications 351 352 (2002) 455 474 www.elsevier.com/locate/laa Detecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness
More informationBounds for eigenvalues of matrix polynomials
Linear Algebra and its Applications 358 003 5 wwwelseviercom/locate/laa Bounds for eigenvalues of matrix polynomials Nicholas J Higham,1, Françoise Tisseur Department of Mathematics, University of Manchester,
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 informationStructured Condition Numbers and Backward Errors in Scalar Product Spaces
Structured Condition Numbers and Backward Errors in Scalar Product Spaces Françoise Tisseur Department of Mathematics University of Manchester ftisseur@ma.man.ac.uk http://www.ma.man.ac.uk/~ftisseur/ Joint
More informationPolynomial two-parameter eigenvalue problems and matrix pencil methods for stability of delay-differential equations
Polynomial two-parameter eigenvalue problems and matrix pencil methods for stability of delay-differential equations Elias Jarlebring a, Michiel E. Hochstenbach b,1, a Technische Universität Braunschweig,
More informationInverse Eigenvalue Problems and Their Associated Approximation Problems for Matrices with J-(Skew) Centrosymmetry
Inverse Eigenvalue Problems and Their Associated Approximation Problems for Matrices with -(Skew) Centrosymmetry Zhong-Yun Liu 1 You-Cai Duan 1 Yun-Feng Lai 1 Yu-Lin Zhang 1 School of Math., Changsha University
More informationComputable error bounds for nonlinear eigenvalue problems allowing for a minmax characterization
Computable error bounds for nonlinear eigenvalue problems allowing for a minmax characterization Heinrich Voss voss@tuhh.de Joint work with Kemal Yildiztekin Hamburg University of Technology Institute
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis Volume 31, pp 306-330, 2008 Copyright 2008, ISSN 1068-9613 ETNA STRUCTURED POLYNOMIAL EIGENPROBLEMS RELATED TO TIME-DELAY SYSTEMS HEIKE FASSBENDER, D STEVEN
More informationIsospectral Families of High-order Systems
Isospectral Families of High-order Systems Peter Lancaster Department of Mathematics and Statistics University of Calgary Calgary T2N 1N4, Alberta, Canada and Uwe Prells School of Mechanical, Materials,
More informationA SIMPLIFIED APPROACH TO FIEDLER-LIKE PENCILS VIA STRONG BLOCK MINIMAL BASES PENCILS.
A SIMPLIFIED APPROACH TO FIEDLER-LIKE PENCILS VIA STRONG BLOCK MINIMAL BASES PENCILS. M. I. BUENO, F. M. DOPICO, J. PÉREZ, R. SAAVEDRA, AND B. ZYKOSKI Abstract. The standard way of solving the polynomial
More informationJordan Structures of Alternating Matrix Polynomials
Jordan Structures of Alternating Matrix Polynomials D. Steven Mackey Niloufer Mackey Christian Mehl Volker Mehrmann August 17, 2009 Abstract Alternating matrix polynomials, that is, polynomials whose coefficients
More informationA UNIFIED APPROACH TO FIEDLER-LIKE PENCILS VIA STRONG BLOCK MINIMAL BASES PENCILS.
A UNIFIED APPROACH TO FIEDLER-LIKE PENCILS VIA STRONG BLOCK MINIMAL BASES PENCILS M I BUENO, F M DOPICO, J PÉREZ, R SAAVEDRA, AND B ZYKOSKI Abstract The standard way of solving the polynomial eigenvalue
More informationPALINDROMIC LINEARIZATIONS OF A MATRIX POLYNOMIAL OF ODD DEGREE OBTAINED FROM FIEDLER PENCILS WITH REPETITION.
PALINDROMIC LINEARIZATIONS OF A MATRIX POLYNOMIAL OF ODD DEGREE OBTAINED FROM FIEDLER PENCILS WITH REPETITION. M.I. BUENO AND S. FURTADO Abstract. Many applications give rise to structured, in particular
More informationPolynomial two-parameter eigenvalue problems and matrix pencil methods for stability of delay-differential equations
Polynomial two-parameter eigenvalue problems and matrix pencil methods for stability of delay-differential equations Elias Jarlebring a, Michiel E. Hochstenbach b,1, a Technische Universität Braunschweig,
More informationStructured eigenvalue condition numbers and linearizations for matrix polynomials
Eidgenössische Technische Hochschule Zürich Ecole polytechnique fédérale de Zurich Politecnico federale di Zurigo Swiss Federal Institute of Technology Zurich Structured eigenvalue condition numbers and
More informationResonant MEMS, Eigenvalues, and Numerical Pondering
Resonant MEMS, Eigenvalues, and Numerical Pondering David Bindel UC Berkeley, CS Division Resonant MEMS, Eigenvalues,and Numerical Pondering p.1/27 Introduction I always pass on good advice. It is the
More informationStrong linearizations of rational matrices with polynomial part expressed in an orthogonal basis
Strong linearizations of rational matrices with polynomial part expressed in an orthogonal basis Froilán M Dopico a,1, Silvia Marcaida b,2,, María C Quintana a,1 a Departamento de Matemáticas, Universidad
More informationComputing Matrix Functions by Iteration: Convergence, Stability and the Role of Padé Approximants
Computing Matrix Functions by Iteration: Convergence, Stability and the Role of Padé Approximants Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x
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 informationJ-Orthogonal Matrices: Properties and Generation
SIAM REVIEW Vol. 45,No. 3,pp. 504 519 c 2003 Society for Industrial and Applied Mathematics J-Orthogonal Matrices: Properties and Generation Nicholas J. Higham Abstract. A real, square matrix Q is J-orthogonal
More informationTaylor s Theorem for Matrix Functions with Applications to Condition Number Estimation. Deadman, Edvin and Relton, Samuel. MIMS EPrint: 2015.
Taylor s Theorem for Matrix Functions with Applications to Condition Number Estimation Deadman, Edvin and Relton, Samuel 215 MIMS EPrint: 215.27 Manchester Institute for Mathematical Sciences School of
More information1. Introduction. Throughout this work we consider n n matrix polynomials with degree k 2 of the form
FIEDLER COMPANION LINEARIZATIONS AND THE RECOVERY OF MINIMAL INDICES FERNANDO DE TERÁN, FROILÁN M DOPICO, AND D STEVEN MACKEY Abstract A standard way of dealing with a matrix polynomial P (λ) is to convert
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 informationFactoring block Fiedler Companion Matrices
Chapter Factoring block Fiedler Companion Matrices Gianna M. Del Corso, Federico Poloni, Leonardo Robol, and Raf Vandebril Abstract When Fiedler published his A note on Companion matrices in 00 in Linear
More informationLAPACK-Style Codes for Pivoted Cholesky and QR Updating
LAPACK-Style Codes for Pivoted Cholesky and QR Updating Sven Hammarling 1, Nicholas J. Higham 2, and Craig Lucas 3 1 NAG Ltd.,Wilkinson House, Jordan Hill Road, Oxford, OX2 8DR, England, sven@nag.co.uk,
More informationHARMONIC RAYLEIGH RITZ EXTRACTION FOR THE MULTIPARAMETER EIGENVALUE PROBLEM
HARMONIC RAYLEIGH RITZ EXTRACTION FOR THE MULTIPARAMETER EIGENVALUE PROBLEM MICHIEL E. HOCHSTENBACH AND BOR PLESTENJAK Abstract. We study harmonic and refined extraction methods for the multiparameter
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - (Alberto Bressan, Spring 7) sec: Orthogonal diagonalization of symmetric matrices When we seek to diagonalize a general n n matrix A, two difficulties may arise:
More information