default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJian-Jun Zhang 0002
Person information
- affiliation: Shanghai University, Department of Mathematics, China
Other persons with the same name
- Jianjun Zhang (aka: Jian-Jun Zhang, Jian Jun Zhang) — disambiguation page
- Jian J. Zhang 0001
![[0000-0002-7069-5771]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-7069-5771")
(aka: Jian-Jun Zhang 0001, Jian Jun Zhang 0001) — Bournemouth University, Poole, UK - Jian-Jun Zhang 0003 (aka: Jian Jun Zhang 0003) — Chongqing Jiaotong University, Department of Mathematics, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j12]Su-Feng Yue, Jian-Jun Zhang:
An extended shift-invert residual Arnoldi method. Comput. Appl. Math. 40(2) (2021)- [j11]Jian-Jun Zhang, Wan-Zhou Ye:
A modulus-based iterative method for sparse signal recovery. Numer. Algorithms 88(1): 165-190 (2021)
2010 – 2019
- 2019
- [j10]Jian-Jun Zhang:
A new greedy Kaczmarz algorithm for the solution of very large linear systems. Appl. Math. Lett. 91: 207-212 (2019) - 2018
- [j9]Jian-Jun Zhang, Jian-Li Zhang, Wanzhou Ye:
An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems. Numer. Algorithms 78(3): 895-910 (2018) - [c3]Jian-Jun Zhang, Ying Li, Wan-Zhou Ye:
A Smoothing Fast Iterative Shrinkage/Thresholding Algorithm for Compressed Mr Imaging. DSP 2018: 1-5 - [c2]Jian-Jun Zhang, Sufeng Yue:
Linearized Augmented Lagrangian Method For Sparse Solution Of Underdetermined Linear Equations. DSP 2018: 1-5 - 2017
- [j8]Yong Zhang, Wanzhou Ye, Jian-Jun Zhang:
A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery. Comput. Optim. Appl. 68(2): 437-454 (2017) - [j7]Yong Zhang, Wanzhou Ye, Jian-Jun Zhang:
Sparse signal recovery by accelerated lq (0<q<1) thresholding algorithm. Int. J. Comput. Math. 94(12): 2481-2491 (2017) - [c1]Jian-Jun Zhang, Jian-Li Zhang, Meng Gao:
Two Effective Algorithms for Color Image Denoising. ICVS 2017: 207-217 - 2015
- [j6]Jian-Jun Zhang:
The relaxed nonlinear PHSS-like iteration method for absolute value equations. Appl. Math. Comput. 265: 266-274 (2015) - [j5]Jian-Jun Zhang:
MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems. Numer. Algorithms 68(3): 631-644 (2015) - 2012
- [j4]Jian-Jun Zhang:
An Alternating Minimization Algorithm for Binary Image Restoration. IEEE Trans. Image Process. 21(2): 883-888 (2012) - 2011
- [j3]Jian-Jun Zhang:
A note on the iterative solutions of general coupled matrix equation. Appl. Math. Comput. 217(22): 9380-9386 (2011) - 2010
- [j2]Jian-Jun Zhang:
An efficient median filter based method for removing random-valued impulse noise. Digit. Signal Process. 20(4): 1010-1018 (2010)
2000 – 2009
- 2003
- [j1]Gui-Ding Gu, Jian-Jun Zhang, Zhanwen Li:
Restarted GMRES Augmented with Eigenvectors for Shifted Linear Systems. Int. J. Comput. Math. 80(8): 1037-1047 (2003)
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-11-22 20:38 CET 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:
