The DOI matches its Crossref record.
How to Find a Good Submatrix
Abstract
Pseudoskeleton approximation and some other problems require the knowledge of sufficiently well-conditioned submatrix in a large-scale matrix. The quality of a submatrix can be measured by modulus of its determinant, also known as volume. In this paper we discuss a search algorithm for the maximum-volume submatrix which already proved to be useful in several matrix and tensor approximation algorithms. We investigate the behavior of this algorithm on random matrices and present some its applications, including maximization of a bivariate functional. 1
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
Cited by
Active learning of linearly parametrized interatomic potentials
Podryabinkin, E. V., & Shapeev, A. V. (2017) · Computational Materials Science · doi:10.1016/j.commatsci.2017.08.031 · Cited by 678
The MLIP package: moment tensor potentials with MPI and active learning
Novikov, I. S., Gubaev, K., Podryabinkin, E. V., & Shapeev, A. V. (2021) · Machine Learning: Science and Technology · doi:10.1088/2632-2153/abc9fe · Cited by 587
A literature survey of low‐rank tensor approximation techniques
Grasedyck, L., Kressner, D., & Tobler, C. (2013) · GAMM-Mitteilungen · doi:10.1002/gamm.201310004 · Cited by 577
TT-cross approximation for multidimensional arrays
Oseledets, I., & Tyrtyshnikov, E. (2010) · Linear Algebra and its Applications · doi:10.1016/j.laa.2009.07.024 · Cited by 555
Self-citationRandomized numerical linear algebra: Foundations and algorithms
Martinsson, P.-G., & Tropp, J. A. (2020) · Acta Numerica · doi:10.1017/s0962492920000021 · Cited by 300
Metadata
- Authors
- Goreinov, S. A., Oseledets, I. V., Savostyanov, D. V., Tyrtyshnikov, E. E., & Zamarashkin, N. L.
- Venue
- Matrix Methods: Theory, Algorithms and Applications
- Publisher
- WORLD SCIENTIFIC
- Published
- 2010-04
- Pages
- 247-256
- OpenAlex
- W2496219407
- Cited by
- 199
- References
- 0
- FWCI
- 13.86
- Type
- book chapter
- Language
- en
- Open access
- closed
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: How to Find a Good Submatrix. https://app.cochat.ai/papers/10.1142/9789812836021_0015
- The paper
- Goreinov, S. A., Oseledets, I. V., Savostyanov, D. V., Tyrtyshnikov, E. E., & Zamarashkin, N. L. (2010). How to Find a Good Submatrix. Matrix Methods: Theory, Algorithms and Applications. https://doi.org/10.1142/9789812836021_0015
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.