Info

此问题已关闭。 请重新打开它进行编辑或回答。

Square matrix factorization to increase sparsity for GPU use

1 次查看（过去 30 天）
Octavian
Octavian 2015-4-2
关闭： MATLAB Answer Bot 2021-8-20
Dear All,
I have a full (no zeros) real asymmetric square matrix A in a loop on the GPU (to increase execution speed compared with the cpu), which limits the use of the code for smaller A sizes that I need. Is there, and if so, which one, an efficient factorization type for matrix A (full, asymetric, real) leading to sparser output f(A)? When I say sparser, I am not referring to the sparsity of individual output matrices (which may be increased, say with triagular or identity matrix factors), but the sparsity of the whole factorization output f(A), so when taken elementwise f(A) is consistently less memory costly than A. Thank you,
Octavian

此问题已关闭。

回答（0 个）

此问题已关闭。

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by