Prof. D.K.Gupta has more than 30 years of teaching and research experience. His research interest is in Computer science, Numerical Analysis and Interval analysis. In Computer science, the main focous is in developing efficient combinatorial and meta-heuristic algorithms for enumerating, generating, ranking and unranking binary trees of n nodes, Sudoku puzzles, University Course Timetabling Problems and Constraint and Partial Constraint Satisfaction Problems. In Numerical analysis, the interest is in developing higher order iterative methods and continuation methods for solving nonlinear equations, their local, semilocal and global convergence analysis along with the estimation of error bounds using both majorizing sequences and recurrence relations under a number of continuity conditons on first or second order Frechet derivatives in Banach spaces. Other topics are computation of generalized inverses and eigenvalues and eigenvector of matrices. In Interval analysis, the focous is in developing two sided iterative methods for enclosing the solutions of nonlinear equations in R and n-dimensional spaces and enclosing eigenvalue bounds for symmetric and non symmetric matrices.
Area of Research: Combinatorial algorithms
Area of Research: Numerical analysis
Area of Research: Numerical Analysis