Zobrazeno 1 - 10
of 13
pro vyhledávání: '"ZHAO LI"'
Publikováno v:
International Journal of Computer Mathematics. 97:1767-1780
Regression analysis has been widely used for face recognition. This paper mainly discuss the following regularized matrix regression problem: Given a set of k image matrices A1,A2,…,Ak∈Rm×n and an ...
Publikováno v:
Symmetry
Volume 13
Issue 8
Symmetry, Vol 13, Iss 1327, p 1327 (2021)
Symmetry, 13(8):1327
Volume 13
Issue 8
Symmetry, Vol 13, Iss 1327, p 1327 (2021)
Symmetry, 13(8):1327
The PageRank model computes the stationary distribution of a Markov random walk on the linking structure of a network, and it uses the values within to represent the importance or centrality of each node. This model is first proposed by Google for ra
Publikováno v:
Journal of Computational and Applied Mathematics, 346, 456-470. ELSEVIER SCIENCE BV
PageRank problem is the cornerstone of Google search engine and is usually stated as solving a huge linear system. Moreover, when the damping factor approaches 1, the spectrum properties of this system deteriorate rapidly and this system becomes diff
Publikováno v:
Linear and Multilinear Algebra. 68:1355-1373
This paper aims to consider the Hermitian solutions of reduced biquaternion matrix equation ( A X B , C X D ) = ( E , G ) , where X is an unknown reduced biquaternion Hermitian matrix, and A, B, C,...
Publikováno v:
Journal of Computational and Applied Mathematics, 381:113034. ELSEVIER SCIENCE BV
For computing PageRank problems, a Power–Arnoldi algorithm is presented by periodically knitting the power method together with the thick restarted Arnoldi algorithm. In this paper, by using the power method with the extrapolation process based on
Publikováno v:
Open Mathematics, Vol 16, Iss 1, Pp 986-998 (2018)
Stochastic Automata Networks (SANs) have a large amount of applications in modelling queueing systems and communication systems. To find the steady state probability distribution of the SANs, it often needs to solve linear systems which involve their
Publikováno v:
Journal of Computational and Applied Mathematics. 315:87-97
Computing PageRank plays an important part in determining the importance of Web pages. Based on the classical power method and the inner-outer iteration proposed by Gleich etźal. (2010), Gu etźal. (2015) presented a two-step splitting iteration, i.
Publikováno v:
Mathematics
Volume 8
Issue 11
Mathematics, Vol 8, Iss 1928, p 1928 (2020)
Volume 8
Issue 11
Mathematics, Vol 8, Iss 1928, p 1928 (2020)
In this paper, the solvability of a class of convolution equations is discussed by using two-dimensional (2D) fractional Fourier transform (FRFT) in polar coordinates. Firstly, we generalize the 2D FRFT to the polar coordinates setting. The relations
Publikováno v:
Applied numerical mathematics, 104, 141-157. ELSEVIER SCIENCE BV
In this paper we introduce an algebraic recursive multilevel incomplete factorization preconditioner, based on a distributed Schur complement formulation, for solving general linear systems. The novelty of the proposed method is to combine factorizat
Publikováno v:
Journal of Computational and Applied Mathematics. 296:397-409
This paper formulates the PageRank problem A x = x into a consistent singular linear system ( I - A ) x = 0 , and applies the full orthogonalization method (FOM) to solve it. This singular system is characterized by index one, namely i n d e x ( I -