Pages that link to "Item:Q4065034"
From MaRDI portal
The following pages link to Time and Parallel Processor Bounds for Linear Recurrence Systems (Q4065034):
Displayed 15 items.
- Limited width parallel prefix circuits (Q547485) (← links)
- Size-depth trade-offs for monotone arithmetic circuits (Q804295) (← links)
- Upper bounds on the complexity of solving systems of linear equations (Q1057647) (← links)
- The semantics and complexity of parallel programs for vector computations. I: A case study using Ada (Q1110310) (← links)
- On some parallel algorithms for inverting tridiagonal and pentadiagonal matrices (Q1159945) (← links)
- Efficient parallel algorithms for linear recurrence computation (Q1165573) (← links)
- Parallel Poisson and biharmonic solvers (Q1232167) (← links)
- Parallel direct linear system solvers - a survey (Q1242427) (← links)
- An improved parallel processor bound in fast matrix inversion (Q1244782) (← links)
- On the numerical evaluation of linear recurrences (Q1863682) (← links)
- \(K\)-dimensional optimal parallel algorithm for the solution of a general class of recurrence equations (Q1907063) (← links)
- Convergence analysis of a \textit{periodic-like} waveform relaxation method for initial-value problems via the diagonalization technique (Q2326376) (← links)
- Parallel solution of recurrences on a tree machine (Q3686036) (← links)
- Parallel computations in linear algebra (Q3876922) (← links)
- A Linear Recurrence System (Q4303801) (← links)