Computing Low-Rank Approximation of a Dense Matrix on Multicore CPUs with a GPU and Its Application to Solving a Hierarchically Semiseparable Linear System of Equations

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/sp/volume-2015/246019/figures/246019.fig.007a.svgz" name="246019.fig.007a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Square Matrices</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/sp/volume-2015/246019/figures/246019.fig.007b.svgz" name="246019.fig.007b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Short-wide Matrices</td></tr></table>

<div>Performance comparison of different QP3 implementations on random matrices.</div>

Scientific Programming

fig7

Figure 7

Figure 7: Computing Low-Rank Approximation of a Dense Matrix on Multicore CPUs with a GPU and Its Application to Solving a Hierarchically Semiseparable Linear System of Equations 

Figure 7 | Computing Low-Rank Approximation of a Dense Matrix on Multicore CPUs with a GPU and Its Application to Solving a Hierarchically Semiseparable Linear System of Equations 