Pages that link to "Item:Q4210086"
From MaRDI portal
The following pages link to Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real (Q4210086):
Displaying 11 items.
- Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros (Q597271) (← links)
- Estimating the extremal eigenvalues of a symmetric matrix (Q753418) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- Additive preconditioning, eigenspaces, and the inverse iteration (Q958010) (← links)
- On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem (Q1861969) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- Computations with quasiseparable polynomials and matrices (Q2378490) (← links)
- Complexity of quantum impurity problems (Q2411633) (← links)
- The complexity of the matrix eigenproblem (Q2819583) (← links)
- Computation of eigenvalues of a real matrix (Q3545675) (← links)
- A Fourier Companion Matrix (Multiplication Matrix) with Real-Valued Elements: Finding the Roots of a Trigonometric Polynomial by Matrix Eigensolving (Q4980821) (← links)
