Linearization of matrix polynomials expressed in polynomial bases
From MaRDI portal
Publication:3600860
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)- A rational approximation method for solving acoustic nonlinear eigenvalue problems
- Differentiation matrices in polynomial bases
- Implicit QR for rank-structured matrix pencils
- Efficient reduction of compressed unitary plus low rank matrices to Hessenberg form
- Spectral equivalence of matrix polynomials and the index sum theorem
- Birkhoff Polynomial Basis
- Linearizations of matrix polynomials in Bernstein bases
- On vector spaces of linearizations for matrix polynomials in orthogonal bases
- Block \(\mathbf {LU}\) factors of generalized companion matrix pencils
- Eigenvectors and minimal bases for some families of Fiedler-like linearizations
- Linearizations of matrix polynomials in Newton bases
- A framework for analyzing nonlinear eigenproblems and parametrized linear systems
- Fast Hessenberg reduction of some rank structured matrices
- Localization theorems for nonlinear eigenvalue problems
- On a class of matrix pencils and \(\ell\)-ifications equivalent to a given matrix polynomial
- The infinite Lanczos method for symmetric nonlinear eigenvalue problems
- Backward error of polynomial eigenvalue problems solved by linearization of Lagrange interpolants
- Fiedler companion linearizations for rectangular matrix polynomials
- A successive quadratic approximations method for nonlinear eigenvalue problems
- Compact rational Krylov methods for nonlinear eigenvalue problems
- Computing the topology of a real algebraic plane curve whose defining equations are available only ``by values
- Parallel iterative refinement in polynomial eigenvalue problems.
- Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable?
- Rayleigh quotient algorithms for nonsymmetric matrix pencils
- On the backward error incurred by the compact rational Krylov linearization
- Parallel Krylov solvers for the polynomial eigenvalue problem in SLEPc
- Linearization of polynomials
- Factorization of Hessenberg matrices
- Polynomial eigenvalue solver based on tropically scaled Lagrange linearization
- Chebyshev interpolation for nonlinear eigenvalue problems
- Vector spaces of linearizations for matrix polynomials: a bivariate polynomial approach
- Orthogonal iterations on companion-like pencils
- A framework for structured linearizations of matrix polynomials in various bases
- Generalized standard triples for algebraic linearizations of matrix polynomials
- Block Kronecker linearizations of matrix polynomials and their backward errors
- Constructing strong linearizations of matrix polynomials expressed in Chebyshev bases
- Algebraic linearizations of matrix polynomials
- Notes on linear factor polynomial deflation in polynomial bases
- On the factorization and the inverse of a tridiagonal matrix
- Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group
- scientific article; zbMATH DE number 3904768 (Why is no real title available?)
- Block minimal bases \(\ell\)-ifications of matrix polynomials
- The nonlinear eigenvalue problem
- Linear approximation and reproduction of polynomials by Wilson bases
- Möbius transformations of matrix polynomials
- Fiedler-comrade and Fiedler-Chebyshev pencils
- Strong linearizations of rational matrices with polynomial part expressed in an orthogonal basis
- The equivalence of the constrained Rayleigh quotient and Newton methods for matrix polynomials expressed in different polynomial bases along with the confluent case
- Local linearizations of rational matrices with application to rational approximations of nonlinear eigenvalue problems
- Backward error analysis of polynomial eigenvalue problems solved by linearization
- Linearization of regular matrix polynomials
- Linearization of bivariate polynomial matrices expressed in non monomial basis
- Strong Linearizations of Rational Matrices
- The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
- Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis.
- Compact Two-Sided Krylov Methods for Nonlinear Eigenvalue Problems
- scientific article; zbMATH DE number 1827580 (Why is no real title available?)
- Preconditioned Chebyshev BiCG method for parameterized linear systems
- Structured strong $\boldsymbol{\ell}$-ifications for structured matrix polynomials in the monomial basis
- Solving the quadratic eigenvalue problem expressed in non-monomial bases by the tropical scaling
- Equivalences for linearizations of matrix polynomials
- scientific article; zbMATH DE number 7351224 (Why is no real title available?)
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)
