Matrix approach to solve polynomial equations
From MaRDI portal
Recommendations
- Applying a Möbius transformation for solving quartic equations
- A solution for reducing the degree of polynomial composition functions using Faà di Bruno's formula and Fourier transform
- Polynomials, symmetry, and dynamics: an undertaking in aesthetics
- Matrix zeros of polynomials
- On complexity of Boolean matrix polynomials solving
Cites work
- A unifying convergence analysis of second-order methods for secular equations
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Paolo Ruffini's contributions to the quintic
- Polynomial zerofinding iterative matrix algorithms
- Root-finding with eigen-solving
- Solving a Polynomial Equation: Some History and Recent Progress
- Some Modified Matrix Eigenvalue Problems
- The topological proof of Abel-Ruffini theorem
Cited in
(3)
This page was built for publication: Matrix approach to solve polynomial equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6165580)