default search action
Qiaohua Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j13]Qiaohua Liu, Qian Zhang, Xiangjian Xu:
Accuracy and stability of quaternion Gaussian elimination. Numer. Algorithms 94(3): 1159-1183 (2023) - 2022
- [j12]Huan Ren, Ru-Ru Ma, Qiaohua Liu, Zheng-Jian Bai:
Randomized Quaternion QLP Decomposition for Low-Rank Approximation. J. Sci. Comput. 92(3): 80 (2022) - [j11]Qiaohua Liu, Zhigang Jia:
On condition numbers of the total least squares problem with linear equality constraint. Numer. Algorithms 90(1): 363-385 (2022) - [j10]Qiaohua Liu, Zhigang Jia, Yimin Wei:
Multidimensional Total Least Squares Problem with Linear Equality Constraints. SIAM J. Matrix Anal. Appl. 43(1): 124-150 (2022) - [j9]Qiaohua Liu, Sitao Ling, Zhigang Jia:
Randomized Quaternion Singular Value Decomposition for Low-Rank Matrix Approximation. SIAM J. Sci. Comput. 44(2): 870- (2022) - 2020
- [j8]Qiaohua Liu, Musheng Wei, Cuiping Chen:
A note on the matrix-scaled total least squares problems with multiple solutions. Appl. Math. Lett. 103: 106181 (2020) - [i4]Qiaohua Liu, Zhigang Jia:
On the condition number of the total least squares problem with linear equality constraint. CoRR abs/2008.08233 (2020) - [i3]Qiaohua Liu, Zhigang Jia, Sitao Ling:
Randomized Quaternion Singular Value Decomposition for Low-Rank Approximation. CoRR abs/2011.03368 (2020) - [i2]Qiaohua Liu, Qian Zhang, Dongmei Shen:
Condition numbers of the mixed least squares-total least squares problem: revisited. CoRR abs/2012.01666 (2020) - [i1]Qiaohua Liu, Zhigang Jia, Yimin Wei:
A contribution to condition numbers of the multidimensional total least squares problem with linear equality constraint. CoRR abs/2012.09534 (2020)
2010 – 2019
- 2018
- [j7]Qiaohua Liu, Dongmei Shen, Ziwei Jia:
Making global simpler GMRES more stable. Numer. Linear Algebra Appl. 25(6) (2018) - 2017
- [j6]Qiaohua Liu, Minghui Wang:
On the weighting method for mixed least squares-total least squares problems. Numer. Linear Algebra Appl. 24(5) (2017) - 2013
- [j5]Qiaohua Liu, Fudao Zhang:
Incomplete hyperbolic Gram-Schmidt-based preconditioners for the solution of large indefinite least squares problems. J. Comput. Appl. Math. 250: 210-216 (2013) - 2011
- [j4]Qiaohua Liu:
Modified Gram-Schmidt-based methods for block downdating the Cholesky factorization. J. Comput. Appl. Math. 235(8): 1897-1905 (2011) - 2010
- [j3]Qiaohua Liu, Minghui Wang:
Algebraic properties and perturbation results for the indefinite least squares problem with equality constraints. Int. J. Comput. Math. 87(2): 425-434 (2010) - [j2]Qiaohua Liu, Baozhen Pan, Qian Wang:
The hyperbolic elimination method for solving the equality constrained indefinite least squares problem. Int. J. Comput. Math. 87(13): 2953-2966 (2010)
2000 – 2009
- 2008
- [j1]Musheng Wei, Qiaohua Liu:
On growth factors of the modified Gram-Schmidt algorithm. Numer. Linear Algebra Appl. 15(7): 621-636 (2008)
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-05-25 23:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint