Time and Parallel Processor Bounds for Linear Recurrence Systems

DOI10.1109/T-C.1975.224291zbMath0307.68035MaRDI QIDQ4065034

S. C. Chen, David Kuck

Publication date: 1975

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Related Items (15)

\(K\)-dimensional optimal parallel algorithm for the solution of a general class of recurrence equations ⋮ The semantics and complexity of parallel programs for vector computations. I: A case study using Ada ⋮ On some parallel algorithms for inverting tridiagonal and pentadiagonal matrices ⋮ Efficient parallel algorithms for linear recurrence computation ⋮ Limited width parallel prefix circuits ⋮ A Linear Recurrence System ⋮ Parallel Poisson and biharmonic solvers ⋮ Parallel direct linear system solvers - a survey ⋮ An improved parallel processor bound in fast matrix inversion ⋮ Parallel computations in linear algebra ⋮ Convergence analysis of a \textit{periodic-like} waveform relaxation method for initial-value problems via the diagonalization technique ⋮ Upper bounds on the complexity of solving systems of linear equations ⋮ Size-depth trade-offs for monotone arithmetic circuits ⋮ Parallel solution of recurrences on a tree machine ⋮ On the numerical evaluation of linear recurrences

This page was built for publication: Time and Parallel Processor Bounds for Linear Recurrence Systems