Small-world networks have become an important model for understanding many complex phenomena in science and in sociological contexts. One tool for exploring the critical and phase...
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
Random walk simulation is employed in many experimental algorithmic applications. Efficient execution on modern computer architectures demands that the random walk be implemented t...
Ilya Safro, Paul D. Hovland, Jaewook Shin, Michell...
In this paper, we study the theoretical properties of sparse approximate inverse (SAI) preconditioners. Particularly, we show that for Mmatrices, nonnegativeness is the key to com...
- In this paper, we introduce a new parameter iteration method (P-Iteration for short) which can be applied on Adams-Moulton methods to solve initial value problems. Compared with ...