


default search action
Xin-Yun Zhu
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j10]Hongtao Fan, Yajing Li, Hongbing Zhang, Xin-Yun Zhu:
Preconditioners based on matrix splitting for the structured systems from elliptic PDE-constrained optimization problems. Appl. Math. Comput. 463: 128341 (2024) - 2023
- [j9]Hongbing Zhang
, Hongtao Fan, Yajing Li, Xinyi Liu, Yinlin Ye, Xin-Yun Zhu:
Two new low rank tensor completion methods based on sum nuclear norm. Digit. Signal Process. 135: 103949 (2023) - [j8]Hongbing Zhang
, Hongtao Fan
, Yajing Li
, Xinyi Liu, Chang Liu, Xin-Yun Zhu:
Tensor Recovery Based on a Novel Non-Convex Function Minimax Logarithmic Concave Penalty Function. IEEE Trans. Image Process. 32: 3413-3428 (2023) - 2020
- [j7]Yajing Li, Xin-Yun Zhu, Hong-Tao Fan:
Relaxed block upper-lower triangular preconditioner for generalized saddle point problems from the incompressible Navier-Stokes equations. J. Comput. Appl. Math. 364 (2020) - 2019
- [j6]Hong-Tao Fan, Xin-Yun Zhu, Yajing Li, Bing Zheng:
A variant of relaxed triangular splitting preconditioners for generalized saddle point problems from Navier-Stokes equations. Appl. Math. Comput. 362 (2019) - [j5]Hong-Tao Fan, Xin-Yun Zhu, Yajing Li, Bing Zheng:
A variant of relaxed triangular splitting preconditioners for generalized saddle point problems from Navier-Stokes equations. Appl. Math. Comput. 362 (2019) - 2016
- [j4]Hong-Tao Fan, Xin-Yun Zhu
:
A modified relaxed splitting preconditioner for generalized saddle point problems from the incompressible Navier-Stokes equations. Appl. Math. Lett. 55: 18-26 (2016) - [j3]Hong-Tao Fan, Bing Zheng, Xin-Yun Zhu:
A relaxed positive semi-definite and skew-Hermitian splitting preconditioner for non-Hermitian generalized saddle point problems. Numer. Algorithms 72(3): 813-834 (2016) - 2015
- [j2]Hong-Tao Fan, Xin-Yun Zhu:
A generalized relaxed positive-definite and skew-Hermitian splitting preconditioner for non-Hermitian saddle point problems. Appl. Math. Comput. 258: 36-48 (2015) - [j1]Hong-Tao Fan, Xin-Yun Zhu, Bing Zheng:
On semi-convergence of a class of relaxation methods for singular saddle point problems. Appl. Math. Comput. 261: 68-80 (2015)
Informal and Other Publications
- 2022
- [i2]Hongbing Zhang, Xinyi Liu, Chang Liu, Hongtao Fan, Yajing Li, Xin-Yun Zhu:
Tensor Recovery Based on A Novel Non-convex Function Minimax Logarithmic Concave Penalty Function. CoRR abs/2206.13506 (2022) - 2014
- [i1]Xin-Yun Zhu, Jin-Li Guo:
Weighted Hypernetworks. CoRR abs/1408.4355 (2014)
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 2025-01-21 00:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint