Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
From MaRDI portal
Publication:4210086
Recommendations
- Computation of eigenvalues of a real matrix
- Computation of roots of real and complex matrices
- Computing eigenvalues of real symmetric matrices with rational filters in real arithmetic
- Real and complex polynomial root-finding with eigen-solving and preprocessing
- Real and complex polynomial root-finding by means of eigen-solving
- Computing bounds to real eigenvalues of real-interval matrices
- Publication:3474211
- Real polynomial root-finding by means of matrix and polynomial iterations
- Real polynomial root-finding by means of matrix and polynomial iterations
- Computing eigenelements of real symmetric matrices via optimization
Cited in
(12)- Computations with quasiseparable polynomials and matrices
- Complexity of quantum impurity problems
- The complexity of the matrix eigenproblem
- Zeros of determinants of \(\lambda\)-matrices
- On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem
- Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros
- Estimating the extremal eigenvalues of a symmetric matrix
- Computation of eigenvalues of a real matrix
- A Fourier Companion Matrix (Multiplication Matrix) with Real-Valued Elements: Finding the Roots of a Trigonometric Polynomial by Matrix Eigensolving
- Additive preconditioning, eigenspaces, and the inverse iteration
- Nearly optimal refinement of real roots of a univariate polynomial
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
This page was built for publication: Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210086)
