The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Algorithms for Numerical Analysis in High Dimensions
Abstract
Nearly every numerical analysis algorithm has computational complexity that scales exponentially in the underlying physical dimension. The separated representation, introduced previously, allows many operations to be performed with scaling that is formally linear in the dimension. In this paper we further develop this representation by (i) discussing the variety of mechanisms that allow it to be surprisingly efficient; (ii) addressing the issue of conditioning; (iii) presenting algorithms for solving linear systems within this framework; and (iv) demonstrating methods for dealing with antisymmetric functions, as arise in the multiparticle Schrödinger equation in quantum mechanics. Numerical examples are given.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Table of Integrals, Series, and Products
S., D., Gradshteyn, I. S., & Ryzhik, I. M. (1966) · Mathematics of Computation · doi:10.2307/2003554 · Cited by 8,092
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
A Multilinear Singular Value Decomposition
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896305696 · Cited by 4,106
PARAFAC. Tutorial and applications
Bro, R. (1997) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(97)00032-4 · Cited by 2,814
Adaptive Control Processes: A Guided Tour
Bellman, R. E. (1961) · doi:10.1515/9781400874668 · Cited by 2,802
Blind beamforming for non-gaussian signals
Cardoso, J. F., & Souloumiac, A. (1993) · IEE Proceedings F Radar and Signal Processing · doi:10.1049/ip-f-2.1993.0054 · Cited by 2,738
Harshman, R. A. (1970) · Cited by 2,255
On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479898346995 · Cited by 1,567
High-Order Contrasts for Independent Component Analysis
Cardoso, J.-F. (1999) · Neural Computation · doi:10.1162/089976699300016863 · Cited by 1,213
Cited by
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Oseledets, I. V. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090752286 · Cited by 2,636
Cichocki, A., Mandic, D., De Lathauwer, L., Zhou, G., Zhao, Q., Caiafa, C., & PHAN, H. A. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2297439 · Cited by 1,384
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
Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
De Lathauwer, L. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/070690729 · Cited by 479
Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
Oseledets, I. V., & Tyrtyshnikov, E. E. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/090748330 · Cited by 459
De Lathauwer, L. (2006) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/040608830 · Cited by 419
Chinesta, F., Ammar, A., & Cueto, E. (2010) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-010-9049-y · Cited by 394
The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
Holtz, S., Rohwedder, T., & Schneider, R. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/100818893 · Cited by 337
O(dlog N)-Quantics Approximation of N-d Tensors in High-Dimensional Numerical Modeling
Khoromskij, B. N. (2011) · Constructive Approximation · doi:10.1007/s00365-011-9131-1 · Cited by 279
Approximation of $2^d\times2^d$ Matrices Using Tensor Decomposition
Oseledets, I. V. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090757861 · Cited by 174
Metadata
- Authors
- Beylkin, G., & Mohlenkamp, M. J.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2005-01
- Volume
- 26
- Issue
- 6
- Pages
- 2133-2159
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2073469810
- Cited by
- 352
- References
- 26
- FWCI
- 3.80
- Type
- journal article
- 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
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.