default search action
Jingjing Cui 0004
Person information
- affiliation: Guangxi Minzu University, Center for Applied Mathematics of Guangxi, Nanning, China
- affiliation: Guangxi University for Nationalities, Nanning, China
- affiliation: Northwestern Polytechnical University, Department of Applied Mathematics, School of Science, Xi'an, Shaanxi, China
Other persons with the same name
- Jingjing Cui (aka: Jing-Jing Cui) — disambiguation page
- Jingjing Cui 0001
— University of Southampton, School of Electronics and Computer Science, UK (and 2 more)
- Jingjing Cui 0002
- Jingjing Cui 0003
- Jingjing Cui 0005 — Imperial College London, Department of Electrical and Electronic Engineering, UK
- Jingjing Cui 0006 — United Imaging Intelligence Co.,Ltd, Department of Research and Development, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Xiaofeng Xie, Zhengge Huang, Jingjing Cui, Beibei Li:
A preconditioned version of the MBP iteration method for a class of complex symmetric linear systems. Comput. Appl. Math. 43(3): 123 (2024) - [j19]Zhengge Huang, Jingjing Cui:
Modified and accelerated relaxed gradient-based iterative algorithms for the complex conjugate and transpose matrix equations. Numer. Algorithms 97(4): 1955-2009 (2024) - 2023
- [j18]Xiaowen Wu, Zhengge Huang, Jingjing Cui, Yanping Long:
The Weighted, Relaxed Gradient-Based Iterative Algorithm for the Generalized Coupled Conjugate and Transpose Sylvester Matrix Equations. Axioms 12(11): 1062 (2023) - [j17]Xiaofeng Xie, Zhengge Huang, Jingjing Cui, Beibei Li:
Minimum residual two-parameter TSCSP method for solving complex symmetric linear systems. Comput. Appl. Math. 42(1) (2023) - [j16]Zhengge Huang, Jingjing Cui:
The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems. J. Comput. Appl. Math. 427: 115138 (2023) - 2022
- [j15]Zhengge Huang, Jingjing Cui:
An efficient modulus-based matrix splitting iteration method for quasi-complementarity problems. Comput. Appl. Math. 41(6) (2022) - [j14]Beibei Li, Jingjing Cui, Zhengge Huang, Xiaofeng Xie:
On preconditioned MQHSS iterative method for solving a class of complex symmetric linear systems. Comput. Appl. Math. 41(6) (2022) - 2020
- [j13]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
An efficient preconditioned variant of the PSS preconditioner for generalized saddle point problems. Appl. Math. Comput. 376: 125110 (2020) - [j12]Jingjing Cui, Guohua Peng, Quan Lu, Zhengge Huang:
A special modified Tikhonov regularization matrix for discrete ill-posed problems. Appl. Math. Comput. 377: 125165 (2020) - [j11]Jing-Jing Cui, Guohua Peng, Quan Lu, Zheng-Ge Huang:
Modified special HSS method for discrete ill-posed problems and image restoration. Int. J. Comput. Math. 97(4): 739-758 (2020)
2010 – 2019
- 2019
- [j10]Zheng-Ge Huang, Li-Gong Wang
Preconditioned accelerated generalized successive overrelaxation method for solving complex symmetric linear systems. Comput. Math. Appl. 77(7): 1902-1916 (2019) - [j9]Zheng-Ge Huang, Ligong Wang, Zhong Xu, Jing-Jing Cui:
The improvements of the generalized shift-splitting preconditioners for non-singular and singular saddle point problems. Int. J. Comput. Math. 96(4): 797-820 (2019) - [j8]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
Modified PHSS iterative methods for solving nonsingular and singular saddle point problems. Numer. Algorithms 80(2): 485-519 (2019) - 2018
- [j7]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
Parameterized generalized shift-splitting preconditioners for nonsymmetric saddle point problems. Comput. Math. Appl. 75(2): 349-373 (2018) - [j6]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
An efficient two-step iterative method for solving a class of complex symmetric linear systems. Comput. Math. Appl. 75(7): 2473-2498 (2018) - [j5]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
A modified generalized shift-splitting preconditioner for nonsymmetric saddle point problems. Numer. Algorithms 78(1): 297-331 (2018) - 2017
- [j4]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
The generalized modified shift-splitting preconditioners for nonsymmetric saddle point problems. Appl. Math. Comput. 299: 95-118 (2017) - [j3]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
A generalized variant of the deteriorated PSS preconditioner for nonsymmetric saddle point problems. Numer. Algorithms 75(4): 1161-1191 (2017) - 2016
- [j2]Zheng-Ge Huang, Li-Gong Wang, Zhong Xu, Jing-Jing Cui:
Improved PPHSS iterative methods for solving nonsingular and singular saddle point problems. Comput. Math. Appl. 72(1): 92-109 (2016) - 2015
- [j1]Zheng-Ge Huang, Zhong Xu, Quan Lu, Jing-Jing Cui:
Some new preconditioned generalized AOR methods for generalized least-squares problems. Appl. Math. Comput. 269: 87-104 (2015)
Coauthor Index
aka: Zheng-Ge Huang
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-12-16 23:20 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: