Implementing sparse matrix-vector multiplication on throughput-oriented processors
Sparse matrix-vector multiplication (SpMV) is of singular importance in sparse linear
algebra. In contrast to the uniform regularity of dense linear algebra, sparse operations …
algebra. In contrast to the uniform regularity of dense linear algebra, sparse operations …
Exponential integrators
M Hochbruck, A Ostermann - Acta Numerica, 2010 - cambridge.org
In this paper we consider the construction, analysis, implementation and application of
exponential integrators. The focus will be on two types of stiff problems. The first one is …
exponential integrators. The focus will be on two types of stiff problems. The first one is …
[PDF][PDF] Efficient sparse matrix-vector multiplication on CUDA
The massive parallelism of graphics processing units (GPUs) offers tremendous
performance in many high-performance computing applications. While dense linear algebra …
performance in many high-performance computing applications. While dense linear algebra …
Expokit: A software package for computing matrix exponentials
RB Sidje - ACM Transactions on Mathematical Software (TOMS), 1998 - dl.acm.org
Expokit provides a set of routines aimed at computing matrix exponentials. More precisely, it
computes either a small matrix exponential in full, the action of a large sparse matrix …
computes either a small matrix exponential in full, the action of a large sparse matrix …
[图书][B] Numerical linear algebra for high-performance computers
The purpose of this book is to unify and document in one place many of the techniques and
much of the current understanding about solving systems of linear equations on vector and …
much of the current understanding about solving systems of linear equations on vector and …
Matrix Market: a web resource for test matrix collections
RF Boisvert, R Pozo, K Remington, RF Barrett… - Quality of Numerical …, 1997 - Springer
We describe a repository of data for the testing of numerical algorithms and mathematical
software for matrix computations. The repository is designed to accommodate both dense …
software for matrix computations. The repository is designed to accommodate both dense …
Fast computation of reconciled forecasts for hierarchical and grouped time series
RJ Hyndman, AJ Lee, E Wang - Computational statistics & data analysis, 2016 - Elsevier
It is shown that the least squares approach to reconciling hierarchical time series forecasts
can be extended to much more general collections of time series with aggregation …
can be extended to much more general collections of time series with aggregation …
A combined unifrontal/multifrontal method for unsymmetric sparse matrices
We discuss the organization of frontal matrices in multifrontal methods for the solution of
large sparse sets of unsymmetric linear equations. In the multifrontal method, work on a …
large sparse sets of unsymmetric linear equations. In the multifrontal method, work on a …
Bridging the gap between deep learning and sparse matrix format selection
This work presents a systematic exploration on the promise and special challenges of deep
learning for sparse matrix format selection---a problem of determining the best storage …
learning for sparse matrix format selection---a problem of determining the best storage …
A local directional ghost cell approach for incompressible viscous flow problems with irregular boundaries
PA Berthelsen, OM Faltinsen - Journal of computational physics, 2008 - Elsevier
An immersed boundary method for the incompressible Navier–Stokes equations in irregular
domains is developed using a local ghost cell approach. This method extends the solution …
domains is developed using a local ghost cell approach. This method extends the solution …