Munish Kansal

Orcid: 0000-0002-7502-6091

According to our database1, Munish Kansal authored at least 13 papers between 2013 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Extraction of deflating subspaces using disk function of a matrix pencil via matrix sign function with application in generalized eigenvalue problem.
J. Comput. Appl. Math., May, 2024

2022
An efficient matrix iteration family for finding the generalized outer inverse.
Appl. Math. Comput., 2022

2021
New fourth- and sixth-order classes of iterative methods for solving systems of nonlinear equations and their stability analysis.
Numer. Algorithms, 2021

An optimal class of fourth-order multiple-root finders of Chebyshev-Halley type and their basins of attraction.
Int. J. Comput. Sci. Math., 2021

2020
An efficient class of iterative methods for computing generalized outer inverse $${M_{T,S}^{(2)}}$$.
J. Appl. Math. Comput., October, 2020

2019
Modified Optimal Class of Newton-Like Fourth-Order Methods for Multiple Roots.
Symmetry, 2019

Efficient Three-Step Class of Eighth-Order Multiple Root Solvers and Their Dynamics.
Symmetry, 2019

2017
Higher-order derivative-free families of Chebyshev-Halley type methods with or without memory for solving nonlinear equations.
Appl. Math. Comput., 2017

2016
Efficient derivative-free variants of Hansen-Patrick's family with memory for solving nonlinear equations.
Numer. Algorithms, 2016

A stable class of improved second-derivative free Chebyshev-Halley type methods with optimal eighth order convergence.
Numer. Algorithms, 2016

2015
New modifications of Hansen-Patrick's family with optimal fourth and eighth orders of convergence.
Appl. Math. Comput., 2015

An Optimal Eighth-Order Derivative-Free Family of Potra-Pták's Method.
Algorithms, 2015

2013
New optimal class of higher-order methods for multiple roots, permitting f′(x<sub>n</sub>) = 0.
Appl. Math. Comput., 2013


  Loading...