A chained-matrices approach for parallel computation of continued fractions and its applications

DOI10.1007/BF01573178zbMath0810.65018MaRDI QIDQ1332396

Shun-Shii Lin

Publication date: 9 April 1995

Published in: Journal of Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

parallel computationcontinued fractionsparallel prefix problem

Mathematics Subject Classification ID

Extrapolation to the limit, deferred corrections (65B05) Computation of special functions and constants, construction of tables (65D20) Parallel numerical computation (65Y05) Convergence and divergence of continued fractions (40A15) Elementary functions (26A09) Exponential and trigonometric functions (33B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An O(log n) algorithm for computing periodic continued fractions and its applications
• A presentation of the Fibonacci algorithm
• Optimal computation of prefix sums on a binary tree of processors
• An O(log n) algorithm for computing general order-k Fibonacci numbers
• Computing Fibonacci numbers (and similarly defined functions) in log time
• An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation
• Optimal algorithms for parallel polynomial evaluation
• Parallel Prefix Computation
• A Regular Layout for Parallel Adders
• A universal interconnection pattern for parallel computers
• A cost-optimal parallel algorithm for B-spline surface fitting
• The Parallel Evaluation of General Arithmetic Expressions
• Size-time complexity of Boolean networks for prefix computations
• Parallel Processing with the Perfect Shuffle
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations

This page was built for publication: A chained-matrices approach for parallel computation of continued fractions and its applications