Skip to main content

Point Estimation of Simultaneous Methods

  • Chapter
Point Estimation of Root Finding Methods

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1933))

In this chapter, we are primarily interested in the construction of computationally verifiable initial conditions and the corresponding convergence analysis of the simultaneous methods presented in Sect. 1.1. These quantitative conditions predict the immediate appearance of the guaranteed and fast convergence of the considered methods. Two original procedures, based on (1) suitable localization theorems for polynomial zeros and (2) the convergence of error sequences, are applied to the most frequently used iterative methods for finding polynomial zeros.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 37.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2008). Point Estimation of Simultaneous Methods. In: Petković, M. (eds) Point Estimation of Root Finding Methods. Lecture Notes in Mathematics, vol 1933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77851-6_3

Download citation

Publish with us

Policies and ethics