Prashant Batra

发表

On the Quality of Some Root-Bounds

Prashant Batra, P. Batra, 2015, MACIS.

Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra

Prashant Batra, P. Batra, 2008, CCA.

Globally Convergent, Iterative Path-Following for Algebraic Equations

Prashant Batra, 2010, Math. Comput. Sci..

Near Optimal Subdivision Algorithms for Real Root Isolation

Vikram Sharma, Prashant Batra, P. Batra, 2015, J. Symb. Comput..

Bounds on absolute positiveness of multivariate polynomials

Vikram Sharma, Prashant Batra, P. Batra, 2010, J. Symb. Comput..

Bound for all coefficient diameters of real Schur-stable interval polynomials

Prashant Batra, P. Batra, 2004, IEEE Transactions on Automatic Control.

On necessary conditions for real robust Schur-stability

Prashant Batra, P. Batra, 2003, IEEE Trans. Autom. Control..

On Fibonacci-type polynomial recurrences of order two and the accumulation points of their set of zeros

Prashant Batra, P. Batra, 2018 .

A Framework for Modeling Operating System Mechanisms in the Simulation of Network Protocols for Real-Time Distributed Systems

Giuseppe Lipari, Paolo Pagano, Prashant Batra, 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

Improvements of Lagrange's bound for polynomial roots

Maurice Mignotte, Doru Stefanescu, Prashant Batra, 2017, J. Symb. Comput..

Near optimal subdivision algorithms for real root isolation

Vikram Sharma, Prashant Batra, 2017, J. Symb. Comput..

Complexity of a Root Clustering Algorithm pdf

Vikram Sharma, Prashant Batra, 2019, ArXiv.

On small circles containing zeros and ones of analytic functions

Prashant Batra, 2004 .

Improvement of a convergence condition for the Durand-Kerner iteration

Prashant Batra, P. Batra, 1998 .