Zobrazeno 1 - 10
of 93
pro vyhledávání: '"ZHONGXIAO JIA"'
Autor:
JINZHI HUANG1 jzhuang21@suda.edu.cn, ZHONGXIAO JIA2 jiazx@tsinghua.edu.cn
Publikováno v:
SIAM Journal on Matrix Analysis & Applications. 2024, Vol. 45 Issue 2, p1114-1147. 34p.
Autor:
ZHONGXIAO JIA1 jiazx@tsinghua.edu.cn, KAILIANG ZHANG1 zkl18@mails.tsinghua.edu.cn
Publikováno v:
SIAM Journal on Matrix Analysis & Applications. 2024, Vol. 45 Issue 1, p24-58. 35p.
Autor:
Jinzhi Huang, Zhongxiao Jia
Publikováno v:
Journal of Scientific Computing. 94
A Cross-Product Free (CPF) Jacobi-Davidson (JD) type method is proposed to compute a partial generalized singular value decomposition (GSVD) of a large regular matrix pair $(A,B)$. It implicitly solves the mathematically equivalent generalized eigenv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d37c685f22a074e0e87fd498cf668da
https://doi.org/10.1007/s10915-022-02053-w
https://doi.org/10.1007/s10915-022-02053-w
Autor:
Jinzhi Huang, Zhongxiao Jia
Publikováno v:
Journal of Scientific Computing. 93
Two harmonic extraction based Jacobi--Davidson (JD) type algorithms are proposed to compute a partial generalized singular value decomposition (GSVD) of a large regular matrix pair. They are called cross product-free (CPF) and inverse-free (IF) harmo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7db43b7f49a42bfa06d1fbb7de69b2e0
https://doi.org/10.1007/s10915-022-01993-7
https://doi.org/10.1007/s10915-022-01993-7
Autor:
Zhongxiao Jia Fuhui Lai
Publikováno v:
CSIAM Transactions on Applied Mathematics. 2:297-312
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39535912c7d1e9915c4b41fea6c23325
https://doi.org/10.4208/csiam-am.2021.nla.03
https://doi.org/10.4208/csiam-am.2021.nla.03
Autor:
Zhongxiao Jia, Haibo Li
Publikováno v:
Numerical Algorithms. 88:965-992
The joint bidiagonalization(JBD) process is a useful algorithm for the computation of the generalized singular value decomposition(GSVD) of a matrix pair. However, it always suffers from rounding errors, which causes the Lanczos vectors to loss their
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a771bdc3f56459cdb5d1442fe8617284
https://doi.org/10.1007/s11075-020-01064-8
https://doi.org/10.1007/s11075-020-01064-8
Autor:
Zhongxiao Jia, Fa Wang
Publikováno v:
SIAM Journal on Optimization. 31:887-914
Solving the trust-region subproblem (TRS) plays a key role in numerical optimization and many other applications. The generalized Lanczos trust-region (GLTR) method is a well-known Lanczos type approach for solving a large-scale TRS. The method proje
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18bf445d8aad085060353a937c35f1ce
https://doi.org/10.1137/19m1279691
https://doi.org/10.1137/19m1279691
Autor:
ZHONGXIAO JIA1 jiazx@tsinghua.edu.cn, HAIBO LI1 lee12358@163.com
Publikováno v:
SIAM Journal on Matrix Analysis & Applications. 2023, Vol. 44 Issue 1, p382-407. 26p.
Autor:
Zhongxiao Jia, Yanfei Yang
Publikováno v:
Applied Numerical Mathematics. 157:159-177
Based on the joint bidiagonalization (JBD) process of the matrix pair { A , L } , an iterative regularization algorithm, called JBDQR, is proposed and developed for large scale linear discrete ill-posed problems in general-form Tikhonov regularizatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc1de48298392d10e9a0027de979a730
https://doi.org/10.1016/j.apnum.2020.06.001
https://doi.org/10.1016/j.apnum.2020.06.001
Autor:
ZHONGXIAO JIA1 jiazx@tsinghua.edu.cn
Publikováno v:
SIAM Journal on Matrix Analysis & Applications. 2022, Vol. 43 Issue 2, p584-604. 21p.