default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhengda Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j16]Shengzhong Song, Zhengda Huang:
A two-parameter shift-splitting preconditioner for saddle point problems. Comput. Math. Appl. 124: 7-20 (2022)- 2020
- [j15]Zhengda Huang
, Hui-Di Wang:
On a progressive and iterative approximation method with memory for least square fitting. Comput. Aided Geom. Des. 82: 101931 (2020)
2010 – 2019
- 2019
- [i1]Zhengda Huang, Hui-Di Wang:
On a progressive and iterative approximation method with memory for least square fitting. CoRR abs/1908.06417 (2019) - 2018
- [j14]Hui-Di Wang, Zhengda Huang:
On convergence and semi-convergence of SSOR-like methods for augmented linear systems. Appl. Math. Comput. 326: 87-104 (2018) - [j13]Zhengda Huang, Hui-Di Wang:
On the optimal convergence factor of the accelerated parameterized inexact Uzawa method with three parameters for augmented systems. Numer. Linear Algebra Appl. 25(5) (2018) - 2017
- [j12]Yonghui Ling, Zhengda Huang:
An analysis on the efficiency of Euler's method for computing the matrix pth root. Numer. Linear Algebra Appl. 24(6) (2017) - 2015
- [j11]Qin Gao, Zhengda Huang, Xiaoliang Cheng:
Inverse spectral problem for the density of a vibrating elastic membrane. Comput. Math. Appl. 70(5): 980-993 (2015) - [j10]Zhengda Huang, Xiaoyan Zhou:
On the minimum convergence factor of a class of GSOR-like methods for augmented systems. Numer. Algorithms 70(1): 113-132 (2015) - [j9]Qin Gao, Zhengda Huang, Xiaoliang Cheng:
A finite difference method for an inverse Sturm-Liouville problem in impedance form. Numer. Algorithms 70(3): 669-690 (2015) - 2014
- [j8]Qin Gao, Xiaoliang Cheng, Zhengda Huang:
On a boundary value method for computing Sturm-Liouville potentials from two spectra. Int. J. Comput. Math. 91(3): 490-513 (2014) - 2013
- [j7]Xiangyin Kong, Zhengda Huang:
A way of updating the density function for the design of the drum. Comput. Math. Appl. 66(1): 62-80 (2013) - [j6]Qin Gao, Xiaoliang Cheng, Zhengda Huang:
Modified Numerov's method for inverse Sturm-Liouville problems. J. Comput. Appl. Math. 253: 181-199 (2013) - 2010
- [j5]Zhengda Huang, Xiangyin Kong, Weidong Hu:
The King-Werner method for solving nonsymmetric algebraic Riccati equation. Appl. Math. Comput. 216(6): 1790-1804 (2010) - [j4]Shishun Li, Zhengda Huang:
Two-grid algorithms for some linear and nonlinear elliptic systems. Computing 89(1-2): 69-86 (2010)
2000 – 2009
- 2009
- [j3]Zhengda Huang, Ma Guochun:
On the local convergence of a family of Euler-Halley type iterations with a parameter. Numer. Algorithms 52(3): 419-433 (2009) - 2003
- [j2]Zhengda Huang:
Newton method under weak Lipschitz continuous derivative in Banach spaces. Appl. Math. Comput. 140(1): 115-126 (2003)
1990 – 1999
- 1999
- [j1]Zhengda Huang:
On the error estimates of several Newton-like methods. Appl. Math. Comput. 106(1): 1-16 (1999)
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-04-24 22:47 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:
