A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
From MaRDI portal
Publication:5678425
DOI10.1109/TC.1973.5009159zbMath0262.68015WikidataQ56269100 ScholiaQ56269100MaRDI QIDQ5678425
Harold S. Stone, Peter M. Kogge
Publication date: 1973
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items
A fast algorithm for scalar Nevanlinna-Pick interpolation ⋮ Formal verification of parallel prefix sum and stream compaction algorithms in CUDA ⋮ A chained-matrices approach for parallel computation of continued fractions and its applications ⋮ Multigrid methods with space-time concurrency ⋮ Optimal computation of prefix sums on a binary tree of processors ⋮ OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES ⋮ \(K\)-dimensional optimal parallel algorithm for the solution of a general class of recurrence equations ⋮ A unified \(O(\log N)\) and optimal sorting vector algorithm ⋮ Formal proof of integer adders using all-prefix-sums operation ⋮ Efficient FPGA architecture of optimized Haar wavelet transform for image and video processing applications ⋮ Parallel solution of Fredholm integral equations of the second kind by orthogonal polynomial expansions ⋮ On iterative and cellular tree arrays ⋮ A parallel algorithm for evaluating general linear recurrence equations ⋮ Formal proof of prefix adders ⋮ Conservative algorithms for parallel and sequential integer sorting ⋮ Methods and means of parallel processing of information ⋮ Runtime verification of embedded real-time systems ⋮ Trends in systolic and cellular computation ⋮ The Fork95 programming language: Design, implementation, application. ⋮ Engineering parallel string sorting ⋮ Fast prefix adders for non-uniform input arrival times ⋮ Functional and dynamic programming in the design of parallel prefix networks ⋮ Parallel prefix computation with few processors ⋮ Speedup of linear stationary iteration processes in multiprocessor computers. I ⋮ Limited width parallel prefix circuits ⋮ Arithmetic Addition over Boolean Masking ⋮ 50 Years of Time Parallel Time Integration ⋮ A novel parallel prefix adder for optimized radix-2 FFT processor ⋮ A three-phase parallel algorithm for solving linear recurrences ⋮ A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors ⋮ Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths ⋮ Parallel algorithm for the solution of boundary-value problems for systems of differential equations ⋮ Convergence analysis of a \textit{periodic-like} waveform relaxation method for initial-value problems via the diagonalization technique ⋮ Fast conversion algorithms for orthogonal polynomials ⋮ A general program scheme for finding bridges ⋮ Functional verification of high performance adders in \textsc{Coq} ⋮ Parallel solution of recurrences on a tree machine
