Pages that link to "Item:Q1094135"
From MaRDI portal
The following pages link to Polynomial division and its computational complexity (Q1094135):
Displaying 26 items.
- A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x]\)-lattices (Q504418) (← links)
- Parallel algorithms for matrix polynomial division (Q805151) (← links)
- Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power (Q1085949) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- A logarithmic Boolean time algorithm for parallel polynomial division (Q1107986) (← links)
- Matrix structures in parallel matrix computations (Q1122309) (← links)
- Polynomial division using left shift register (Q1130425) (← links)
- On the evaluation of the eigenvalues of a banded Toeplitz block matrix (Q1186509) (← links)
- Polynomial division with a remainder by means of evaluation and interpolation (Q1205721) (← links)
- Solving certain queueing problems modelled by Toeplitz matrices (Q1346993) (← links)
- Computations with infinite Toeplitz matrices and polynomials (Q1348083) (← links)
- Variations on computing reciprocals of power series (Q1607045) (← links)
- Approximate real polynomial division via approximate inversion of real triangular Toeplitz matrices (Q1808511) (← links)
- Algorithms for fast polynomial division (Q1822958) (← links)
- An algebraic approach to approximate evaluation of a polynomial on a set of real points (Q1899278) (← links)
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant (Q1903781) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Binary segmentation for matrix and vector operations (Q2365929) (← links)
- A fast direct method for block triangular Toeplitz-like with tri-diagonal block systems from time-fractional partial differential equations (Q2374859) (← links)
- Inversion in finite fields using logarithmic depth (Q2638778) (← links)
- Efficient Algorithms for the Evaluation of the Eigenvalues of (Block) Banded Toeplitz Matrices (Q3790545) (← links)
- Improved Parallel Polynomial Division (Q4202215) (← links)
- Toeplitz matrices for LTI systems, an illustration of their application to Wiener filters and estimators (Q4638216) (← links)
- Fast approximate inversion of a block triangular Toeplitz matrix with applications to fractional sub‐diffusion equations (Q5739730) (← links)
- Fast inversion of triangular Toeplitz matrices (Q5893874) (← links)
