The Conditioning of Linearizations of Matrix Polynomials

From MaRDI portal
Publication:5422458

DOI10.1137/050628283zbMath1131.65034OpenAlexW2053529276WikidataQ56998775 ScholiaQ56998775MaRDI QIDQ5422458

D. Steven Mackey, Nicholas J. Higham, Françoise Tisseur

Publication date: 22 October 2007

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: http://eprints.maths.manchester.ac.uk/669/1/hmt06c.pdf




Related Items (48)

Block Kronecker linearizations of matrix polynomials and their backward errorsA block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward errorOn a class of matrix pencils and \(\ell\)-ifications equivalent to a given matrix polynomialBlock minimal bases \(\ell\)-ifications of matrix polynomialsFirst order spectral perturbation theory of square singular matrix polynomialsTransformation of high order linear differential-algebraic systems to first orderStratification of full rank polynomial matricesSolving polynomial eigenvalue problems by means of the Ehrlich-Aberth methodUnnamed ItemA polynomial Jacobi-Davidson solver with support for non-monomial bases and deflationConstructing Strong Linearizations of Matrix Polynomials Expressed in Chebyshev BasesRecursive Algorithms to Update a Numerical Basis Matrix of the Null Space of the Block Row, (Banded) Block Toeplitz, and Block Macaulay MatrixThe \(\mathbb{DL}(P)\) vector space of pencils for singular matrix polynomialsStructured strong linearizations from Fiedler pencils with repetition. I.A polynomial eigenvalue test for checking DLMI constraintsVector Spaces of Linearizations for Matrix Polynomials: A Bivariate Polynomial ApproachHermitian matrix polynomials with real eigenvalues of definite type. I: ClassificationSingular quadratic eigenvalue problems: linearization and weak condition numbersOn backward errors of structured polynomial eigenproblems solved by structure preserving linearizationsFiedler companion linearizations for rectangular matrix polynomialsImplicitly Restarted Refined Partially Orthogonal Projection Method with DeflationA comparison of eigenvalue condition numbers for matrix polynomialsA simplified approach to Fiedler-like pencils via block minimal bases pencilsTrimmed linearizations for structured matrix polynomialsEigenvectors and minimal bases for some families of Fiedler-like linearizationsA scaling algorithm for polynomial constraint satisfaction problemsPolynomial eigenvalue solver based on tropically scaled Lagrange linearizationPerturbation, extraction and refinement of invariant pairs for matrix polynomialsA framework for analyzing nonlinear eigenproblems and parametrized linear systemsStructured eigenvalue condition numbers and linearizations for matrix polynomialsStructured backward error analysis for sparse polynomial eigenvalue problemsFast and backward stable computation of eigenvalues and eigenvectors of matrix polynomialsLog-majorization of the moduli of the eigenvalues of a matrix polynomial by tropical rootsConditioning and backward errors of eigenvalues of homogeneous matrix polynomials under Möbius transformationsBackward error and conditioning of Fiedler companion linearizationsExplicit block-structures for block-symmetric Fiedler-like pencilsSensitivity Analysis of Nonlinear EigenproblemsOn the conditioning for heavily damped quadratic eigenvalue problem solved by linearizationsA novel method to compute all eigenvalues of the polynomial eigenvalue problems in an open half planePerturbation analysis for palindromic and anti-palindromic nonlinear eigenvalue problemsTwo complementary block Macaulay matrix algorithms to solve multiparameter eigenvalue problemsMemory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basisThe Polynomial Eigenvalue Problem is Well Conditioned for Random InputsTropical Roots as Approximations to Eigenvalues of Matrix PolynomialsA Rational Even-IRA Algorithm for the Solution of $T$-Even Polynomial Eigenvalue ProblemsAlgorithms for Hessenberg-Triangular Reduction of Fiedler Linearization of Matrix PolynomialsIsospectral families of high-order systemsOn why using \(\mathbb{DL}(P)\) for the symmetric polynomial eigenvalue problem might need to be reconsidered




This page was built for publication: The Conditioning of Linearizations of Matrix Polynomials