Investigation of genes, using data analysis and computer-based methods, has gained
widespread attention in solving human cancer classification problem. DNA microarray gene …

Many numerical optimisation problems rely on fast algorithms for solving sparse triangular
systems of linear equations (STLs). To accelerate the solution of such equations, two types …

In Web link structures, similar link distributions often occur, especially for pages from same
hosts. For PageRank problems, similar in-link distributions of pages result in similar row …

We present effective and efficient matrix-free preconditioning techniques for the augmented
immersed interface method (AIIM). AIIM has been developed recently and is shown to be …

In order to simultaneously benefit the computational merits of the Hestenes–Stiefel method
and the worthwhile descent and convergence properties of the Dai–Yuan method, Andrei …

We propose an efficient algorithm to learn the transition probabilities of a Markov chain in a
way that its weighted PageRank scores meet some predefined target values. Our algorithm …

We propose an adaptive reordered method to deal with the PageRank problem. It has been
shown that one can reorder the hyperlink matrix of PageRank problem to calculate a …

Background We develop a new concept that reflects how genes are connected based on
microarray data using the coefficient of determination (the squared Pearson correlation …

In order to find a solution for accurate, topographic data-demanding applications, such as
catchment hydrologic modeling and assessments of anthropic activities impact on …

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 …