Sigmoid-like functions and root finding methods

Applied Mathematics and Computation

Volumn 204, Issue 2, 2008, Pages 784-793

  Petković, Miodrag S ^a   Yun, Beong In ^b  

^a UNIVERSITY OF NI   (Serbia)

^b Kunsan National University   (South Korea)

Author keywords

Cluster of zeros; Hybrid methods; Initial approximations; Nonlinear equations; Numerical integration; Root solvers; Sigmoid functions

Indexed keywords

INTEGRATION; INTERPOLATION; NONLINEAR EQUATIONS; NUMERICAL ANALYSIS; NUMERICAL METHODS;

CLUSTER OF ZEROS; HYBRID METHODS; INITIAL APPROXIMATIONS; NUMERICAL INTEGRATION; ROOT SOLVERS; SIGMOID FUNCTIONS;

ITERATIVE METHODS;

EID: 53549096782     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2008.07.017     Document Type: Article

References (21)

1. Alefeld G., and Herzberger J. Introduction to Interval Computation (1983), Academic Press, New York
2. Bini D.A., and Fiorentino G. Design, analysis, and implementation of a multiprecision polynomial rootfinder. Numer. Algor. 23 (2000) 127-173
3. .
4. Kravanja P., and Haegemans A. A modification of Newton's method for analytic mappings having multiple zeros. Computing 62 (1999) 129-145
5. Kravanja P., and Van Barel M. Computing the Zeros of Analytic Functions (2000), Springer-Verlag, Berlin
6. Lagouanelle J.L. Sur une méthode de calcul de l'ordre de multiplicité des zéros d'un polyôme. C.R. Acad. Sci. Paris Sér. A. 262 (1966) 626-627
7. Marler M.R., Gehrman P., Martin J.L., and Ancoli-Israel S. The sigmoidally transformed cosine curve: a mathematical model for circadian rhythms with symmetric non-sinusoidal shapes. Statist. Med. 25 (2006) 3893-3904
8. Niu X.M., and Sakurai T. A method for finding the zeros of polynomials using a companion matrix. Japan J. Industr. Appl. Math. 20 (2003) 239-256
9. Niu X.M., Sakurai T., and Siguira H. A verified method for bounding clusters of zeros of analytic functions. J. Comput. Appl. Math. 199 (2007) 263-270
10. Neumaier A. An existence test for root clusters and multiple roots. Z. Angew. Math. Mech. 68 (1988) 256-257
11. Neumaier A. Enclosing clusters of zeros of polynomials. J. Comput. Appl. Math. 156 (2003) 389-401
12. Ostrowski A.M. Solutions of Equations and System of Equations (1966), Academic Press, New York
13. Pan V. Optimal and nearly optimal algorithms for approximating polynomial zeros. Comput. Math. Appl. 31 (1996) 97-138
14. Petković M.S. Iterative Methods for Simultaneous Inclusion of Polynomial Zeros (1989), Springer-Verlag, Berlin, Heidelberg, New York
15. Petković M.S., and Milošević D. A higher order family for the simultaneous inclusion of multiple zeros of polynomials. Numer. Algor. 39 (2005) 415-435
16. Petković M.S., and Petković L.D. Complex Interval Arithmetic and Its Applications (1998), Wiley-VCH, Berlin
17. Rump S.M. Ten methods to bound multiple roots of polynomials. J. Comput. Appl. Math. 156 (2003) 403-432
18. von Seggern D. CRC Standard Curves and Surfaces with Mathematics (2007), CRC Press, Boca Raton
19. Traub J.F. Iterative Methods for the Solution of Equations (1982), Prentice Hall, Englewood Cliffs, New Jersey
20. Yakoubsohn J.C. Finding a cluster of zeros of univariate polynomials. J. Complexity 16 (2000) 603-638
21. Yun B.I. A non-iterative method for solving non-linear equations. Appl. Math. Comp. 198 (2008) 691-699