I'm getting ready to start working on a C/C++ project that will be building and solving large tri-diagonal, block tri-diagonal and triangular matrices. I know there are a lot of libraries available ...

Abstract: Numerous studies have proposed hardware architectures to accelerate sparse matrix multiplication, but these approaches often incur substantial area and power overhead, significantly ...

Abstract: The solution of sparse matrix equations is essential in scientific computing. However, traditional solvers on digital computing platforms are limited by memory bottlenecks in largescale ...

We describe a computational procedure for evaluating the quasi-stationary distributions of a continuous-time Markov chain. Our method, which is an 'iterative version' of Arnoldi's algorithm, is ...

This is a preview. Log in through your library . Abstract We observe a N × M matrix Yij = sij + ξij with ξij ~ N(0,1) i.i.d. in i, j, and s¡jϵℝ. We test the null hypothesis s¡j = 0 for all i, j ...