Time and Parallel Processor Bounds for Linear Recurrence Systems
From MaRDI portal
Publication:4065034
DOI10.1109/T-C.1975.224291zbMATH Open0307.68035MaRDI QIDQ4065034FDOQ4065034
Authors: S. C. Chen, David Kuck 
Publication date: 1975
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
General topics in the theory of software (68N01) Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Iterative numerical methods for linear systems (65F10)
Cited In (15)
- Parallel solution of recurrences on a tree machine
- Upper bounds on the complexity of solving systems of linear equations
- Parallel Poisson and biharmonic solvers
- Limited width parallel prefix circuits
- 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
- Parallel direct linear system solvers - a survey
- \(K\)-dimensional optimal parallel algorithm for the solution of a general class of recurrence equations
- Parallel computations in linear algebra
- A Linear Recurrence System
- On the numerical evaluation of linear recurrences
- Size-depth trade-offs for monotone arithmetic circuits
- Convergence analysis of a \textit{periodic-like} waveform relaxation method for initial-value problems via the diagonalization technique
- An improved parallel processor bound in fast matrix inversion
This page was built for publication: Time and Parallel Processor Bounds for Linear Recurrence Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4065034)
