Linearization of matrix polynomials expressed in polynomial bases
From MaRDI portal
Publication:3600860
DOI10.1093/IMANUM/DRM051zbMATH Open1158.15022OpenAlexW1977424948MaRDI QIDQ3600860FDOQ3600860
Authors: Robert M. Corless, P. Lancaster, Amirhossein Amiraslani 
Publication date: 6 February 2009
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/70d410504ac39b6238c40a9217b4a9f30a503dfb
Recommendations
- Linearizations of matrix polynomials in Bernstein bases
- Algebraic linearizations of matrix polynomials
- Linearizations of matrix polynomials in Newton bases
- On vector spaces of linearizations for matrix polynomials in orthogonal bases
- Constructing strong linearizations of matrix polynomials expressed in Chebyshev bases
Cited In (62)
- Title not available (Why is that?)
- Preconditioned Chebyshev BiCG method for parameterized linear systems
- Structured strong $\boldsymbol{\ell}$-ifications for structured matrix polynomials in the monomial basis
- Title not available (Why is that?)
- Solving the quadratic eigenvalue problem expressed in non-monomial bases by the tropical scaling
- Equivalences for linearizations of matrix polynomials
- On the backward error incurred by the compact rational Krylov linearization
- Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach
- Parallel iterative refinement in polynomial eigenvalue problems.
- Efficient reduction of compressed unitary plus low rank matrices to Hessenberg form
- Linear approximation and reproduction of polynomials by Wilson bases
- Linearizations of matrix polynomials in Newton bases
- Orthogonal iterations on companion-like pencils
- Linearizations of matrix polynomials in Bernstein bases
- The infinite Lanczos method for symmetric nonlinear eigenvalue problems
- Block Kronecker linearizations of matrix polynomials and their backward errors
- Block minimal bases \(\ell\)-ifications of matrix polynomials
- Spectral equivalence of matrix polynomials and the index sum theorem
- Fiedler companion linearizations for rectangular matrix polynomials
- Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values
- Linearization of polynomials
- Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group
- A framework for analyzing nonlinear eigenproblems and parametrized linear systems
- On a class of matrix pencils and \(\ell\)-ifications equivalent to a given matrix polynomial
- Backward error of polynomial eigenvalue problems solved by linearization of Lagrange interpolants
- A framework for structured linearizations of matrix polynomials in various bases
- Constructing strong linearizations of matrix polynomials expressed in Chebyshev bases
- Fast Hessenberg reduction of some rank structured matrices
- Localization theorems for nonlinear eigenvalue problems
- Polynomial eigenvalue solver based on tropically scaled Lagrange linearization
- The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
- On vector spaces of linearizations for matrix polynomials in orthogonal bases
- Rayleigh quotient algorithms for nonsymmetric matrix pencils
- Backward error analysis of polynomial eigenvalue problems solved by linearization
- The equivalence of the constrained Rayleigh quotient and Newton methods for matrix polynomials expressed in different polynomial bases along with the confluent case
- Strong Linearizations of Rational Matrices
- Möbius transformations of matrix polynomials
- Block \(\mathbf {LU}\) factors of generalized companion matrix pencils
- Factorization of Hessenberg matrices
- The nonlinear eigenvalue problem
- Fiedler-comrade and Fiedler-Chebyshev pencils
- Local linearizations of rational matrices with application to rational approximations of nonlinear eigenvalue problems
- A rational approximation method for solving acoustic nonlinear eigenvalue problems
- Algebraic linearizations of matrix polynomials
- Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
- Strong linearizations of rational matrices with polynomial part expressed in an orthogonal basis
- Chebyshev interpolation for nonlinear eigenvalue problems
- Generalized standard triples for algebraic linearizations of matrix polynomials
- Linearization of bivariate polynomial matrices expressed in non monomial basis
- Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis.
- Implicit QR for rank-structured matrix pencils
- Linearization of regular matrix polynomials
- Birkhoff Polynomial Basis
- A successive quadratic approximations method for nonlinear eigenvalue problems
- Differentiation matrices in polynomial bases
- Compact rational Krylov methods for nonlinear eigenvalue problems
- Parallel Krylov solvers for the polynomial eigenvalue problem in SLEPc
- Title not available (Why is that?)
- Compact Two-Sided Krylov Methods for Nonlinear Eigenvalue Problems
- Eigenvectors and minimal bases for some families of Fiedler-like linearizations
- Notes on linear factor polynomial deflation in polynomial bases
- On the factorization and the inverse of a tridiagonal matrix
This page was built for publication: Linearization of matrix polynomials expressed in polynomial bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600860)
