Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
From MaRDI portal
Publication:4210086
DOI10.1137/S0097539790182482zbMath0911.68050OpenAlexW1987280464MaRDI QIDQ4210086
Dario Andrea Bini, Pan, Victor Y.
Publication date: 20 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539790182482
computational complexityapproximation algorithmsreal polynomial zerossymmetric tridiagonal eigenvalues
Related Items
Computations with quasiseparable polynomials and matrices, Jacobi-free and complex-free method for finding simultaneously all zeros of polynomials having only real zeros, Complexity of quantum impurity problems, Nearly optimal refinement of real roots of a univariate polynomial, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., Additive preconditioning, eigenspaces, and the inverse iteration, On zeros of polynomial and vector solutions of associated polynomial system from Viëta theorem