Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Zhaolu Tian"'
Publikováno v:
Journal of the Franklin Institute. 359:8201-8217
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f198c61c1980ac7205bd58b49958c16f
https://doi.org/10.1016/j.jfranklin.2022.08.018
https://doi.org/10.1016/j.jfranklin.2022.08.018
Publikováno v:
Numerical Algorithms. 89:1603-1637
In this paper, based on the splittings of the coefficient matrix in the PageRank problem, the coupled iteration algorithms are presented for computing PageRank vector. Convergence conditions of the proposed algorithms are analyzed in detail. Furtherm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7537daa1a644413198d2ec6d00390a93
https://doi.org/10.1007/s11075-021-01166-x
https://doi.org/10.1007/s11075-021-01166-x
Publikováno v:
Journal of the Franklin Institute. 358:3051-3076
In this paper, combining the multi-step Smith-inner-outer (MSIO) iteration framework with some tunable parameters, a relaxed MSIO iteration method is proposed for solving the Sylvester matrix equation and coupled Lyapunov matrix equations (CLMEs) in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ed167f8ee29338a1330b77c7669ddc5
https://doi.org/10.1016/j.jfranklin.2021.01.040
https://doi.org/10.1016/j.jfranklin.2021.01.040
Publikováno v:
Filomat. 35:679-706
Based on the general inner-outer (GIO) iteration method [5,34] and the iteration framework [6], we present a general multi-step matrix splitting (GMMS) iteration method for computing PageRank, and analyze its overall convergence property. Moreover, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c831dfbc46ee04f0d564c5caa4215eec
https://doi.org/10.2298/fil2102679t
https://doi.org/10.2298/fil2102679t
Autor:
Zhaolu Tian, Tongyang Xu
Publikováno v:
Filomat. 35:3781-3799
In this paper, based on the inner-outer (IO) iteration framework [17], by introducing some tunable parameters, an SOR-type IO (SIO) iteration method is proposed for solving the Sylvester matrix equation and coupled Lyapunov matrix equations (CLMEs) i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10a9a7afb8ce581a8a436d41affefe12
https://doi.org/10.2298/fil2111781t
https://doi.org/10.2298/fil2111781t
Publikováno v:
Journal of the Franklin Institute. 357:3656-3679
In this paper, combining the Smith method [30] with inner-outer (IO) iteration [4], a multi-step Smith-IO (MSIO) iteration algorithm for solving the Sylvester matrix equation and coupled Lyapunov matrix equations (CLMEs) is proposed. Moreover, some c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3acecaa9517125d6218844f0a457a42b
https://doi.org/10.1016/j.jfranklin.2020.02.026
https://doi.org/10.1016/j.jfranklin.2020.02.026
Publikováno v:
Journal of Industrial & Management Optimization. 16:2603-2623
In this paper, we investigate the valuation of dynamic fund protections under the assumption that the market value of the basic fund and the protection level follow regime-switching processes with jumps. The price of the dynamic fund protection (DFP)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e611d0b1b37c65891807fd9230b4efec
https://doi.org/10.3934/jimo.2019072
https://doi.org/10.3934/jimo.2019072
Publikováno v:
Applied Mathematics and Computation. 356:479-501
In this paper, combined the regular splittings of the coefficient matrix I − α P with the inner-outer iteration framework [9], a general inner-outer (GIO) iteration method is presented for solving the PageRank problem. Firstly, the AOR and modifie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::569338907d97c7b498006f272c3779d4
https://doi.org/10.1016/j.amc.2019.02.066
https://doi.org/10.1016/j.amc.2019.02.066
Publikováno v:
Filomat. 33:725-740
In this paper, based on the iteration methods [3,10], we propose a modified multi-step power-inner-outer (MMPIO) iteration method for solving the PageRank problem. In the MMPIO iteration method, we use the multi-step matrix splitting iterations inste
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da7add950b4bef9e49ca76838618df3d
https://doi.org/10.2298/fil1903725t
https://doi.org/10.2298/fil1903725t
Publikováno v:
Applied Mathematics and Computation. 339:346-366
In this paper, the error and stability analysis of the method of fundamental solution (MFS) is explored for biharmonic equations. The bounds of errors are derived for the fundamental solutions r 2 ln r in bounded simply-connected domains, and the pol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c07e3a00f3592dba18587c431df34df
https://doi.org/10.1016/j.amc.2018.07.016
https://doi.org/10.1016/j.amc.2018.07.016