A new sparse matrix vector multiplication graphics processing unit algorithm designed for finite element problems

E-ISSN： 1097-0207|102|12|1784-1814

ISSN： 0029-5981

Source： INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, Vol.102, Iss.12, 2015-06, pp. : 1784-1814

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A new breakaway mailbox designed using nonlinear finite element analysis

By Reid J.D.

Finite Elements in Analysis and Design, Vol. 32, Iss. 1, 1999-03 ,pp. : 37-49

Elsevier

Access to resources Recommend Favorite

Reducing the bandwidth of a sparse matrix with a genetic algorithm

By Pop Petrică Matei Oliviu Comes Călin-Adrian

Optimization, Vol. 63, Iss. 12, 2014-12 ,pp. : 1851-1876

Taylor & Francis Ltd

Access to resources Recommend Favorite

A fast matrix–vector multiplication method for solving the radiosity equation

By Atkinson Kendall Chien David

Advances in Computational Mathematics, Vol. 12, Iss. 2-3, 2000-02 ,pp. : 151-174

Springer Publishing Company

Access to resources Recommend Favorite

Vector Equilibrium Problems, Minimal Element Problems and Least Element Problems

By Fang Ya-ping Huang Nan-jing

Positivity, Vol. 11, Iss. 2, 2007-05 ,pp. : 251-268

Springer Publishing Company

Access to resources Recommend Favorite

Auto-tuned Krylov methods on cluster of graphics processing unit

International Journal of Computer Mathematics, Vol. 92, Iss. 6, 2015-06 ,pp. : 1222-1250

Taylor & Francis Ltd

Access to resources Recommend Favorite