A parallel algorithm for evaluating general linear recurrence equations

DOI10.1007/BF01183156zbMath0861.65125OpenAlexW2087518631MaRDI QIDQ1922617

Mi Lu, Xiangzhen Qiao, Guan-Rong Chen

Publication date: 29 April 1997

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01183156

zbMATH Keywords

numerical examplesparallel computationcyclic reductionsymmetric tridiagonal eigenproblembisection/multisection methodsfirst-order linear recurrencesWang's partitioning method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel Prefix Computation
• The Proposed COBOL Standard-Its Significance
• The Complexity of Parallel Evaluation of Linear Recurrences
• A Survey of Parallel Algorithms in Numerical Linear Algebra
• A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
• On Direct Methods for Solving Poisson’s Equations
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations

This page was built for publication: A parallel algorithm for evaluating general linear recurrence equations