default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLu-Bin Cui
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Rong Yang, Xin-Guang Yang, Lu-Bin Cui, Jinyun Yuan
:
Large time behavior of 3D functional Brinkman-Forchheimer equations with delay term. Comput. Appl. Math. 43(6): 370 (2024)- [j14]Lu-Bin Cui, Jia-Le Yao, Jin-Yun Yuan:
A Projection Method Based on Discrete Normalized Dynamical System for Computing C-eigenpairs. J. Optim. Theory Appl. 200(2): 768-793 (2024) - 2023
- [j13]Lu-Bin Cui, Wen-Li Hu, Jin-Yun Yuan:
Iterative refinement method by higher-order singular value decomposition for solving multi-linear systems. Appl. Math. Lett. 146: 108819 (2023) - [j12]Lu-Bin Cui, Xiao-Jing Zhang:
Bounds of H-eigenvalues of interval tensors. Comput. Appl. Math. 42(6): 280 (2023) - [j11]Peng-Ling Wu, Xi-Le Zhao, Meng Ding, Yu-Bang Zheng, Lu-Bin Cui, Ting-Zhu Huang:
Tensor ring decomposition-based model with interpretable gradient factors regularization for tensor completion. Knowl. Based Syst. 259: 110094 (2023) - 2022
- [j10]Lu-Bin Cui, Ge-Ge Lian, Jin-Yun Yuan:
Existence and uniqueness of positive solution for multilinear systems with generalized strong M-tensor. Appl. Math. Lett. 133: 108262 (2022) - [j9]Lu-Bin Cui, Yu-Dong Fan, Yu-Tao Zheng:
A general preconditioner accelerated SOR-type iterative method for multi-linear systems with $${\mathcal {Z}}$$-tensors. Comput. Appl. Math. 41(1) (2022) - [j8]Lu-Bin Cui, Yu-Dong Fan, Yisheng Song, Shi-Liang Wu:
The Existence and Uniqueness of Solution for Tensor Complementarity Problem and Related Systems. J. Optim. Theory Appl. 192(1): 321-334 (2022) - [j7]Lu-Bin Cui, Qing Hu, Ying Chen, Yi-Sheng Song:
A Rayleigh quotient-gradient neural network method for computing 𝒵-eigenpairs of general tensors. Numer. Linear Algebra Appl. 29(3) (2022) - 2020
- [j6]Lu-Bin Cui, Xiao-Qing Zhang, Shi-Liang Wu:
A new preconditioner of the tensor splitting iterative method for solving multi-linear systems with $$\mathcal {M}$$-tensors. Comput. Appl. Math. 39(3) (2020)
2010 – 2019
- 2019
- [j5]Lu-Bin Cui, Ming-Hui Li, Yisheng Song:
Preconditioned tensor splitting iterations method for solving multi-linear systems. Appl. Math. Lett. 96: 89-94 (2019) - [j4]Lu-Bin Cui, Yisheng Song:
On the uniqueness of the positive Z-eigenvector for nonnegative tensors. J. Comput. Appl. Math. 352: 72-78 (2019) - 2014
- [j3]Lu-Bin Cui, Wen Li, Michael K. Ng:
Birkhoff-von Neumann Theorem for Multistochastic Tensors. SIAM J. Matrix Anal. Appl. 35(3): 956-973 (2014) - 2013
- [j2]Wen Li, Lu-Bin Cui, Michael K. Ng:
The perturbation bound for the Perron vector of a transition probability tensor. Numer. Linear Algebra Appl. 20(6): 985-1000 (2013) - 2012
- [j1]Wen Li, Lu-Bin Cui, Michael K. Ng:
On computation of the steady-state probability distribution of probabilistic Boolean networks with gene perturbation. J. Comput. Appl. Math. 236(16): 4067-4081 (2012)
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-10-24 21:33 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:
