Algorithms for Solvents of Matrix Polynomials
From MaRDI portal
Cited in
(22)- Approximation of the roots of matrix equations by power series
- Block power method for computing solvent and spectral factors of matrix polynomials
- Bounding the slope of polynomial operators and some applications
- Block decompositions and block modal controls of multivariable control systems
- A computer-aided method for solvents and spectral factors of matrix polynomials
- A fundamental theorem on lambda-matrices with applications. II: Difference equations with constant coefficients
- An eigenvalue method of undetermined coefficients for solving linear rational expectations models
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- An iterative method to compute the dominant zero of a quaternionic unilateral polynomial
- Matrix polynomials: factorization via bisolvents
- A contour integral approach to the computation of invariant pairs
- The effect of anisotropic wall compliance on boundary-layer stability and transition
- Block partial fraction expansion of a rational matrix
- On solutions of second-order matrix polynomial equation of high degree
- Block Krylov subspace methods for functions of matrices. II: Modified block FOM
- Algorithms for hyperbolic quadratic eigenvalue problems
- Intelligent maximum likelihood self-adjustable block roots assignment for a class of MIMO stochastic systems
- Polynomials whose roots are the differences of the roots of a given polynomial
- Stochastic theta methods for free stochastic differential equations
- Analysis of second-order multivariable linear systems
- Improved Newton's method with exact line searches to solve quadratic matrix equation
This page was built for publication: Algorithms for Solvents of Matrix Polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4167476)
