On the parallel arithmetic complexity of the root-finding problem
From MaRDI portal
Publication:3804187
DOI10.1080/00207168708803583zbMath0656.68042OpenAlexW2074257277MaRDI QIDQ3804187
Publication date: 1987
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168708803583
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Application of Hankel matrices of Markov parameters to the solutions of the Routh-Hurwitz and the Schur-Cohn problems
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- A parallel Wilf algorithm for complex zeros of a polynomial
- A highly concurrent algorithm and pipeleined architecture for solving Toeplitz systems
- Parallel complexities and computations of cholesky's decomposition and QR factorization
- On Certain Parallel Toeplitz Linear System Solvers
- A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
- Inverses of Toeplitz Operators, Innovations, and Orthogonal Polynomials
- The Triangular Decomposition of Hankel Matrices
This page was built for publication: On the parallel arithmetic complexity of the root-finding problem
