A note on the vectorization of scalar recursions
From MaRDI portal
Publication:1819541
DOI10.1016/0167-8191(86)90008-6zbMath0613.65039OpenAlexW2072701055MaRDI QIDQ1819541
Publication date: 1986
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(86)90008-6
algorithmic complexityNeumann seriesvectorizationcyclic reductionHorner's schemeoptimal rangerecursive doublingproduct expansionbank conflictsfirst order recursionparallel pipeline processorsscalar execution
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Fast Parallel Algorithm for Polynomial Evaluation ⋮ Vectorized algorithms for solving special tridiagonal systems ⋮ Incomplete block-matrix factorization iterative methods for convection- diffusion problems
This page was built for publication: A note on the vectorization of scalar recursions