Filter your results
- 4
- 2
- 3
- 2
- 1
- 1
- 6
- 2
- 2
- 2
- 6
- 6
- 6
- 3
- 2
- 1
- 6
- 5
- 5
- 5
6 Results
|
|
sorted by
|
|
Improving the memory and time overhead of low-rank parallel linear sparse direct solversData Structures and Algorithms [cs.DS]. Université de Bordeaux, 2022. English. ⟨NNT : 2022BORD0254⟩
Theses
tel-03875858v1
|
||
|
Reaching the Quality of SVD for Low-Rank Compression Through QR Variants[Research Report] RR-9476, Inria Bordeaux - Sud Ouest. 2022, pp.43
Reports
hal-03718312v4
|
||
Rank Revealing QR Methods for Sparse Block Low Rank SolversSparse Days 2019, Jul 2019, Toulouse, France
Conference papers
hal-02326070v1
|
|||
|
Deciding Non-Compressible Blocks in Sparse Direct Solvers using Incomplete FactorizationHiPC 2021 - 28th IEEE International Conference on High Performance Computing, Data, and Analytics, Dec 2021, Bangalore, India. pp.1-10, ⟨10.1109/HiPC53243.2021.00024⟩
Conference papers
hal-03361299v1
|
||
|
Deciding Non-Compressible Blocks in Sparse Direct Solvers using Incomplete Factorization[Research Report] RR-9396, Inria Bordeaux - Sud Ouest. 2021, pp.16
Reports
hal-03152932v2
|
||
Rank Revealing QR Methods for Sparse Block Low Rank SolversCOMPAS 2019 - Conférence d'informatique en Parallélisme, Architecture et Système, Jun 2019, Anglet, France
Conference papers
hal-02326084v1
|