Miodrag S. Petkovic

Affiliations:
  • University of Nis, Serbia


According to our database1, Miodrag S. Petkovic authored at least 86 papers between 1981 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Editorial In Memoriam Luc Wuytack.
J. Comput. Appl. Math., 2022

2019
Construction and efficiency of multipoint root-ratio methods for finding multiple zeros.
J. Comput. Appl. Math., 2019

On optimal parameter of Laguerre's family of zero-finding methods.
Int. J. Comput. Math., 2019

On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros.
Appl. Math. Comput., 2019

2018
Dynamic study of Schröder's families of first and second kind.
Numer. Algorithms, 2018

A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros.
J. Comput. Appl. Math., 2018

Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials.
J. Comput. Appl. Math., 2018

2017
On a high-order one-parameter family for the simultaneous determination of polynomial roots.
Appl. Math. Lett., 2017

2016
On some efficient derivative-free iterative methods with memory for solving systems of nonlinear equations.
Numer. Algorithms, 2016

On a general transformation of multipoint root-solvers.
J. Comput. Appl. Math., 2016

New simultaneous root-finding methods with accelerated convergence for analytic functions.
J. Comput. Appl. Math., 2016

2015
Hyper-power methods for the computation of outer inverses.
J. Comput. Appl. Math., 2015

On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method.
Int. J. Comput. Math., 2015

2014
On the guaranteed convergence of new two-point root-finding methods for polynomial zeros.
Numer. Algorithms, 2014

On generalized biparametric multipoint root finding methods with memory.
J. Comput. Appl. Math., 2014

On an efficient simultaneous method for finding polynomial zeros.
Appl. Math. Lett., 2014

An efficient derivative free family of fourth order methods for solving systems of nonlinear equations.
Appl. Math. Comput., 2014

Multipoint methods for solving nonlinear equations: A survey.
Appl. Math. Comput., 2014

Multi-step root solvers of Traub's type in real interval arithmetic.
Appl. Math. Comput., 2014

Improved methods for the simultaneous inclusion of multiple polynomial zeros.
Appl. Math. Comput., 2014

2013
A note on the priority of optimal multipoint methods for solving nonlinear equations.
Appl. Math. Comput., 2013

2012
Ostrowski-Like Method for the Inclusion of a Single Complex Polynomial Zero.
Reliab. Comput., 2012

On generalized multipoint root-solvers with memory.
J. Comput. Appl. Math., 2012

A Family of Three-Point Methods of Ostrowski's Type for Solving Nonlinear Equations.
J. Appl. Math., 2012

The improved Farmer-Loizou method for finding polynomial zeros.
Int. J. Comput. Math., 2012

Efficient Halley-like Methods for the Inclusion of Multiple Zeros of Polynomials.
Comput. Methods Appl. Math., 2012

A cubically convergent Steffensen-like method for solving nonlinear equations.
Appl. Math. Lett., 2012

Three-point methods with and without memory for solving nonlinear equations.
Appl. Math. Comput., 2012

2011
Remarks on "On a General Class of Multipoint Root-Finding Methods of High Computational Efficiency".
SIAM J. Numer. Anal., 2011

Higher Order Methods for the Inclusion of Multiple Zeros of Polynomials.
Reliab. Comput., 2011

New higher-order methods for the simultaneous inclusion of polynomial zeros.
Numer. Algorithms, 2011

On the new fourth-order methods for the simultaneous approximation of polynomial zeros.
J. Comput. Appl. Math., 2011

Traub's accelerating generator of iterative root-finding methods.
Appl. Math. Lett., 2011

Efficient methods for the inclusion of polynomial zeros.
Appl. Math. Comput., 2011

Interpolatory multipoint methods with memory for solving nonlinear equations.
Appl. Math. Comput., 2011

A family of optimal three-point methods for solving nonlinear equations using two parametric functions.
Appl. Math. Comput., 2011

2010
On a General Class of Multipoint Root-Finding Methods of High Computational Efficiency.
SIAM J. Numer. Anal., 2010

A family of three-point methods of optimal order for solving nonlinear equations.
J. Comput. Appl. Math., 2010

On Schröder's families of root-finding methods.
J. Comput. Appl. Math., 2010

On the improved Newton-like methods for the inclusion of polynomial zeros.
Int. J. Comput. Math., 2010

Accelerating generators of iterative methods for finding multiple roots of nonlinear equations.
Comput. Math. Appl., 2010

A class of three-point root-solvers of optimal order of convergence.
Appl. Math. Comput., 2010

Derivative free two-point methods with and without memory for solving nonlinear equations.
Appl. Math. Comput., 2010

Construction of optimal order nonlinear solvers using inverse interpolation.
Appl. Math. Comput., 2010

2009
Chebyshev-like root-finding methods with accelerated convergence.
Numer. Linear Algebra Appl., 2009

Iterative methods based on the signum function approach for solving nonlinear equations.
Numer. Algorithms, 2009

A remark on He's variational iteration technique for solving nonlinear equations.
J. Comput. Appl. Math., 2009

The self-validated method for polynomial zeros of high efficiency.
J. Comput. Appl. Math., 2009

On a simultaneous method of Newton-Weierstrass' type for finding all zeros of a polynomial.
Appl. Math. Comput., 2009

2008
On the convergence condition of generalized root iterations for the inclusion of polynomial zeros.
Math. Comput. Simul., 2008

Sigmoid-like functions and root finding methods.
Appl. Math. Comput., 2008

High order Euler-like method for the inclusion of polynomial zeros.
Appl. Math. Comput., 2008

A highly efficient root-solver of very fast convergence.
Appl. Math. Comput., 2008

2007
A new differential transformation approach for two-dimensional Volterra integral equations.
Int. J. Comput. Math., 2007

A one parameter square root family of two-step root-finders.
Appl. Math. Comput., 2007

A note on some recent methods for solving nonlinear equations.
Appl. Math. Comput., 2007

Construction of zero-finding methods by Weierstrass functions.
Appl. Math. Comput., 2007

Comments on the Basto-Semiao-Calheiros root finding method.
Appl. Math. Comput., 2007

2006
On the convergence of the sequences of Gerschgorin-like disks.
Numer. Algorithms, 2006

On a new family of simultaneous methods with corrections for the inclusion of polynomial zeros.
Int. J. Comput. Math., 2006

A family of root-finding methods with accelerated convergence.
Comput. Math. Appl., 2006

2005
A higher order family for the simultaneous inclusion of multiple zeros of polynomials.
Numer. Algorithms, 2005

Weierstrass-like Methods with Corrections for the Inclusion of Polynomial Zeros.
Computing, 2005

Derivative Free Inclusion Methods for Polynomial Zeros.
Computing, 2005

A new fourth-order family of simultaneous methods for finding polynomial zeros.
Appl. Math. Comput., 2005

Improved Halley-like methods for the inclusion of polynomial zeros.
Appl. Math. Comput., 2005

2004
Ostrowski-Like Method with Corrections for the Inclusion of Polynomial Zeros.
Reliab. Comput., 2004

On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros.
Appl. Math. Comput., 2004

2003
Higher-order simultaneous methods for the determination of polynomial multiple zeros.
Int. J. Comput. Math., 2003

1999
Halley-Like Method with Corrections for the Inclusion of Polynomial Zeros.
Computing, 1999

1998
Safe convergence of simultaneous methods for polynomial zeros.
Numer. Algorithms, 1998

1997
Slope Methods of Higher Order for the Inclusion of Complex Roots of Polynomials.
Reliab. Comput., 1997

Börsch-supan-like methods: point estimation and parallel implementation.
Int. J. Comput. Math., 1997

1996
On Initial Conditions for the Convergence of Simultaneous Root Finding Methods.
Computing, 1996

1993
On the<i>R</i>-order of some accelerated methods for the simultaneous finding of polynomial zeros.
Computing, 1993

On some interval methods for algebraic, exponential and trigonometric polynomials.
Computing, 1993

1992
A family of simultaneous zero finding methods.
Int. J. Comput. Math., 1992

1990
Forward-backward serial iteration methods for simultaneously approximating polynomial zeros.
Int. J. Comput. Math., 1990

Schröder-like algorithms for multiple complex zeros of a polynomial.
Computing, 1990

1989
On some applications of circular complex functions.
Computing, 1989

1986
On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros.
ACM Trans. Math. Softw., 1986

On a second order method for the simultaneous inclusion of polynomial complex zeros in rectangular arithmetic.
Computing, 1986

1985
Arithmetic of Circular Rings.
Proceedings of the Interval Mathemantics 1985: Proceedings of the International Symposium, 1985

1984
On the k-th root in circular arithmetic.
Computing, 1984

1983
On the convergence order of a modified method for simultaneous finding polynomial zeros.
Computing, 1983

1981
On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic.
Computing, 1981


  Loading...