default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMunish Kansal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Pallvi Sharma, Munish Kansal
:
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. 442: 115730 (2024)- [j14]Himani Sharma, Ramandeep Behl, Munish Kansal, Higinio Ramos:
A robust iterative family for multiple roots of nonlinear equations: Enhancing accuracy and handling critical points. J. Comput. Appl. Math. 444: 115795 (2024) - [j13]Munish Kansal, Vanita Sharma, Pallvi Sharma, Lorentz Jäntschi:
A Globally Convergent Iterative Method for Matrix Sign Function and Its Application for Determining the Eigenvalues of a Matrix Pencil. Symmetry 16(4): 481 (2024) - 2022
- [j12]Munish Kansal, Sanjeev Kumar, Manpreet Kaur:
An efficient matrix iteration family for finding the generalized outer inverse. Appl. Math. Comput. 430: 127292 (2022) - 2021
- [j11]Raj Bala, Munish Kansal, Vinay Kanwar:
An optimal class of fourth-order multiple-root finders of Chebyshev-Halley type and their basins of attraction. Int. J. Comput. Sci. Math. 14(1): 17-35 (2021) - [j10]Munish Kansal, Alicia Cordero, Sonia Bhalla, Juan R. Torregrosa:
New fourth- and sixth-order classes of iterative methods for solving systems of nonlinear equations and their stability analysis. Numer. Algorithms 87(3): 1017-1060 (2021) - 2020
- [j9]Manpreet Kaur, Munish Kansal:
An efficient class of iterative methods for computing generalized outer inverse $${M_{T,S}^{(2)}}$$. J. Appl. Math. Comput. 64(1-2): 709-736 (2020)
2010 – 2019
- 2019
- [j8]Munish Kansal, Ramandeep Behl, Mohammed Ali A. Mahnashi, Fouad Othman Mallawi:
Modified Optimal Class of Newton-Like Fourth-Order Methods for Multiple Roots. Symmetry 11(4): 526 (2019) - [j7]Rania A. Alharbey, Munish Kansal, Ramandeep Behl, J. A. Tenreiro Machado:
Efficient Three-Step Class of Eighth-Order Multiple Root Solvers and Their Dynamics. Symmetry 11(7): 837 (2019) - 2017
- [j6]Ioannis K. Argyros, Munish Kansal, Vinay Kanwar, Sugandha Bajaj:
Higher-order derivative-free families of Chebyshev-Halley type methods with or without memory for solving nonlinear equations. Appl. Math. Comput. 315: 224-245 (2017) - 2016
- [j5]Alicia Cordero, Munish Kansal, Vinay Kanwar, Juan R. Torregrosa:
A stable class of improved second-derivative free Chebyshev-Halley type methods with optimal eighth order convergence. Numer. Algorithms 72(4): 937-958 (2016) - [j4]Munish Kansal, Vinay Kanwar, Saurabh Bhatia:
Efficient derivative-free variants of Hansen-Patrick's family with memory for solving nonlinear equations. Numer. Algorithms 73(4): 1017-1036 (2016) - 2015
- [j3]Munish Kansal, Vinay Kanwar, Saurabh Bhatia:
An Optimal Eighth-Order Derivative-Free Family of Potra-Pták's Method. Algorithms 8(2): 309-320 (2015) - [j2]Munish Kansal, Vinay Kanwar, Saurabh Bhatia:
New modifications of Hansen-Patrick's family with optimal fourth and eighth orders of convergence. Appl. Math. Comput. 269: 507-519 (2015) - 2013
- [j1]Vinay Kanwar, Saurabh Bhatia, Munish Kansal:
New optimal class of higher-order methods for multiple roots, permitting f′(xn) = 0. Appl. Math. Comput. 222: 564-574 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
