Computational complexity for a class of multipoint iterative procedures without or with internal memory

DOI10.1007/BF02576813zbMath0383.65026OpenAlexW2312788946MaRDI QIDQ1248896

Donato Trigiante, Vincenzo Casulli

Publication date: 1977

Published in: Calcolo (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to single equations (65H05)

Related Items (1)

Multipoint iterative parallel methods for solving equations

Cites Work

• The convergence order for iterative multipoint procedures
• Optimal Order of One-Point and Multipoint Iteration
• Efficient Algorithms for Polynomial Interpolation and Numerical Differentiation

This page was built for publication: Computational complexity for a class of multipoint iterative procedures without or with internal memory