Systolic designs for Aitken's root finding method

DOI10.1016/0167-8191(92)90137-VMaRDI QIDQ1195177zbMATH OpenFDO

Authors Ocatv Brudaru, D. Comish, Graham M. Megson

Publication date 7 October 1992

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

performancenonlinear equationspolynomial equationssystolic arraystranscendental equationsystolic algorithmsAitken's methodsynthesis techniquessystolic designs1-D and 2-D arraysAitken's root finding methodAitken's table generating methodnonlinear scheduling function

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Numerical computation of solutions to single equations (65H05) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• Systolic designs for the root-squaring method
• scientific article; zbMATH DE number 4112025
• A systolic ring architecture for solving polynomial equations
• scientific article; zbMATH DE number 4062478
• Systolic designs for Bernoulli's method

Cited in

(6)

• A systolic ring architecture for solving polynomial equations
• scientific article; zbMATH DE number 4062478 (Why is no real title available?)
• A systolic design for the Aitken extrapolation formula
• scientific article; zbMATH DE number 4112025 (Why is no real title available?)
• Systolic designs for Bernoulli's method
• Systolic designs for the root-squaring method

This page was built for publication: Systolic designs for Aitken's root finding method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1195177)