The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Performance and Scalability of the Block Low-Rank Multifrontal Factorization on Multicore Architectures
Open accessAbstract
Matrices coming from elliptic Partial Differential Equations have been shown to have a low-rank property that can be efficiently exploited in multifrontal solvers to provide a substantial reduction of their complexity. Among the possible low-rank formats, the Block Low-Rank format (BLR) is easy to use in a general purpose multifrontal solver and its potential compared to standard (full-rank) solvers has been demonstrated. Recently, new variants have been introduced and it was proved that they can further reduce the complexity but their performance has never been analyzed. In this article, we present a multithreaded BLR factorization and analyze its efficiency and scalability in shared-memory multicore environments. We identify the challenges posed by the use of BLR approximations in multifrontal solvers and put forward several algorithmic variants of the BLR factorization that overcome these challenges by improving its efficiency and scalability. We illustrate the performance analysis of the BLR multifrontal factorization with numerical experiments on a large set of problems coming from a variety of real-life applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Inversion of seismic reflection data in the acoustic approximation
Tarantola, A. (1984) · Geophysics · doi:10.1190/1.1441754 · Cited by 3,759
The university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
Williams, S., Waterman, A., & Patterson, D. A. (2009) · Communications of the ACM · doi:10.1145/1498765.1498785 · Cited by 2,798
Direct Methods for Sparse Matrices
Duff, I. S., Erisman, A. M., & Reid, J. K. (2017) · doi:10.1093/acprof:oso/9780198508380.001.0001 · Cited by 1,604
A Sparse Matrix Arithmetic Based on $\Cal H$ -Matrices. Part I: Introduction to ${\Cal H}$ -Matrices
Hackbusch, W. (1999) · Computing · doi:10.1007/s006070050015 · Cited by 1,179
Approximation of boundary element matrices
Bebendorf, M. (2000) · Numerische Mathematik · doi:10.1007/pl00005410 · Cited by 857
Encyclopedia of Parallel Computing
(2011) · Springer eBooks · doi:10.1007/978-0-387-09766-4 · Cited by 589
Randomized algorithms for the low-rank approximation of matrices
Liberty, E., Woolfe, F., Martinsson, P.-G., Rokhlin, V., & Tygert, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0709640104 · Cited by 559
Numerical Linear Algebra for High-Performance Computers
Dongarra, J. J., Duff, I. S., Sorensen, D. C., & van der Vorst, H. A. (1998) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719611 · Cited by 489
Metadata
- Authors
- Amestoy, P. R., Buttari, A., L'Excellent, J.-Y., & Mary, T.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2019-02-24
- Volume
- 45
- Issue
- 1
- Pages
- 1-26
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2607498875
- Cited by
- 305
- References
- 19
- FWCI
- 23.57
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Performance and Scalability of the Block Low-Rank Multifrontal Factorization on Multicore Architectures. https://app.cochat.ai/papers/10.1145/3242094
- The paper
- Amestoy, P. R., Buttari, A., L'Excellent, J.-Y., & Mary, T. (2019). Performance and Scalability of the Block Low-Rank Multifrontal Factorization on Multicore Architectures. ACM Transactions on Mathematical Software. https://doi.org/10.1145/3242094
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.