The DOI matches its Crossref record; 62 of the 62 references it cites were found in a registry or an index.
Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions
Open accessAbstract
We propose algorithms for the solution of high-dimensional symmetrical positive definite (SPD) linear systems with the matrix and the right-hand side given and the solution sought in a low-rank format. Similarly to density matrix renormalization group (DMRG) algorithms, our methods optimize the components of the tensor product format subsequently. To improve the convergence, we expand the search space by an inexact gradient direction. We prove the geometrical convergence and estimate the convergence rate of the proposed methods utilizing the analysis of the steepest descent algorithm. The complexity of the presented algorithms is linear in the mode size and dimension, and the demonstrated convergence is comparable to or even better than the one of the DMRG algorithm. In the numerical experiment we show that the proposed methods are also efficient for non-SPD systems, for example, those arising from the chemical master equation describing the gene regulatory model at the mesoscopic scale.
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
Stochastic Processes in Physics and Chemistry
(2007) · Elsevier eBooks · doi:10.1016/b978-0-444-52965-7.x5000-4 · Cited by 8,692
Density matrix formulation for quantum renormalization groups
White, S. R. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2863 · Cited by 7,702
Gillespie, D. T. (1976) · Journal of Computational Physics · doi:10.1016/0021-9991(76)90041-3 · Cited by 6,029
The density-matrix renormalization group in the age of matrix product states
Schollwöck, U. (2011) · Annals of Physics · doi:10.1016/j.aop.2010.09.012 · Cited by 4,818
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
Die Grundlage der allgemeinen Relativitätstheorie
Einstein, A. (1916) · Annalen der Physik · doi:10.1002/andp.19163540702 · Cited by 3,468
The density-matrix renormalization group
Schollwöck, U. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.259 · Cited by 3,323
Density-matrix algorithms for quantum renormalization groups
White, S. R. (1993) · Physical Review B · doi:10.1103/physrevb.48.10345 · Cited by 3,244
Oseledets, I. V. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090752286 · Cited by 2,636
Harshman, R. A. (1970) · Cited by 2,255
Finitely correlated states on quantum spin chains
Fannes, M., Nachtergaele, B., & Werner, R. F. (1992) · Communications in Mathematical Physics · doi:10.1007/bf02099178 · Cited by 1,422
The Expression of a Tensor or a Polyadic as a Sum of Products
Hitchcock, F. L. (1927) · Journal of Mathematics and Physics · doi:10.1002/sapm192761164 · Cited by 1,345
Tensor Spaces and Numerical Tensor Calculus
Hackbusch, W. (2012) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-28027-6 · Cited by 607
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
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
A New Scheme for the Tensor Representation
Hackbusch, W., & Kühn, S. (2009) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-009-9094-9 · Cited by 453
A new notation for quantum mechanics
Dirac, P. A. M. (1939) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100021162 · Cited by 429
On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
Stewart, G. W. (1977) · SIAM Review · doi:10.1137/1019104 · Cited by 416
Dynamical density-matrix renormalization-group method
Jeckelmann, E. (2002) · Physical Review B · doi:10.1103/physrevb.66.045114 · Cited by 373
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
Density matrix renormalization group algorithms with a single center site
White, S. R. (2005) · Physical Review B · doi:10.1103/physrevb.72.180403 · Cited by 238
Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
Simoncini, V., & Szyld, D. B. (2003) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827502406415 · Cited by 231
A projection method to solve linear systems in tensor format
Ballani, J., & Grasedyck, L. (2013) · Numerical Linear Algebra with Applications · doi:10.1002/nla.1818 · Cited by 203
Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
Kressner, D., & Tobler, C. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/100799010 · Cited by 193
Tensors-structured numerical methods in scientific computing: Survey on recent advances
Khoromskij, B. N. (2012) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2011.09.001 · Cited by 189
Solution of Linear Systems and Matrix Inversion in the TT-Format
Oseledets, I. V., & Dolgov, S. V. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/110833142 · Cited by 187
Self-citationDirect Solution of the Chemical Master Equation Using Quantized Tensor Trains
Kazeev, V. A., Khammash, M., Nip, M., & Schwab, C. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003359 · Cited by 183
A projector-splitting integrator for dynamical low-rank approximation
Lubich, C., & Oseledets, I. V. (2014) · BIT Numerical Mathematics · doi:10.1007/s10543-013-0454-0 · Cited by 175
Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors
Lubich, C., Rohwedder, T., Schneider, R., & Vandereycken, B. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/120885723 · Cited by 163
Dolgov, S., Khoromskij, B. N., & Oseledets, I. V. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/120864210 · Cited by 149
Self-citationA solver for the stochastic master equation applied to gene regulatory networks
Hegland, M., Burden, C. J., Santoso, L. M., MacNamara, S., & Booth, H. S. (2006) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2006.02.053 · Cited by 133
Dynamical Tensor Approximation
Koch, O., & Lubich, C. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/09076578x · Cited by 131
Inexact Krylov Subspace Methods for Linear Systems
van den Eshof, J., & Sleijpen, G. L. G. (2004) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479802403459 · Cited by 130
Fast adaptive interpolation of multi-dimensional arrays in tensor train format
Savostyanov, D., & Oseledets, I. V. (2011) · International Workshop on Multidimensional (nD) Systems (nDS) · doi:10.1109/nds.2011.6076873 · Cited by 125
Self-citationLow-Rank Explicit QTT Representation of the Laplace Operator and Its Inverse
Kazeev, V. A., & Khoromskij, B. N. (2012) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/100820479 · Cited by 118
Constructive Representation of Functions in Low-Rank Tensor Formats
Oseledets, I. V. (2012) · Constructive Approximation · doi:10.1007/s00365-012-9175-x · Cited by 111
Computation of extreme eigenvalues in higher dimensions using block tensor train format
Dolgov, S., Khoromskij, B. N., Oseledets, I. V., & Savostyanov, D. (2014) · Computer Physics Communications · doi:10.1016/j.cpc.2013.12.017 · Cited by 106
Self-citationRohwedder, T., & Uschmajew, A. (2013) · SIAM Journal on Numerical Analysis · doi:10.1137/110857520 · Cited by 101
Matrix versions of the Cauchy and Kantorovich inequalities
Marshall, A. W., & Olkin, I. (1990) · Aequationes Mathematicae · doi:10.1007/bf02112284 · Cited by 100
TT-GMRES: solution to a linear system in the structured tensor format
Dolgov, S. (2013) · Russian Journal of Numerical Analysis and Mathematical Modelling · doi:10.1515/rnam-2013-0009 · Cited by 91
Self-citationBris, C. L., Lelièvre, T., & Maday, Y. (2009) · Constructive Approximation · doi:10.1007/s00365-009-9071-1 · Cited by 91
Approximate iterations for structured matrices
Hackbusch, W., Khoromskij, B. N., & Tyrtyshnikov, E. E. (2008) · Numerische Mathematik · doi:10.1007/s00211-008-0143-0 · Cited by 86
A Dynamical Low-Rank Approach to the Chemical Master Equation
Jahnke, T., & Huisinga, W. (2008) · Bulletin of Mathematical Biology · doi:10.1007/s11538-008-9346-x · Cited by 85
Superfast Fourier Transform Using QTT Approximation
Dolgov, S., Khoromskij, B. N., & Savostyanov, D. (2012) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-012-9227-4 · Cited by 78
Self-citationSimultaneous state‐time approximation of the chemical master equation using tensor product formats
Dolgov, S., & Khoromskij, B. N. (2014) · Numerical Linear Algebra with Applications · doi:10.1002/nla.1942 · Cited by 73
Self-citationQuantics-TT Collocation Approximation of Parameter-Dependent and Stochastic Elliptic PDEs
Khoromskij, B. N., & Oseledets, I. V. (2010) · Computational Methods in Applied Mathematics · doi:10.2478/cmam-2010-0023 · Cited by 67
Preconditioned Low-Rank Methods for High-Dimensional Elliptic PDE Eigenvalue Problems
Kreßner, D., & Tobler, C. (2011) · Computational Methods in Applied Mathematics · doi:10.2478/cmam-2011-0020 · Cited by 66
Low-Rank Tensor Methods with Subspace Correction for Symmetric Eigenvalue Problems
Kreßner, D., Steinlechner, M., & Uschmajew, A. (2014) · SIAM Journal on Scientific Computing · doi:10.1137/130949919 · Cited by 66
DMRG Approach to Fast Linear Algebra in the TT-Format
Oseledets, I. V. (2011) · Computational Methods in Applied Mathematics · doi:10.2478/cmam-2011-0021 · Cited by 65
Computations in quantum tensor networks
Huckle, T., Waldherr, K., & Schulte‐Herbrüggen, T. (2012) · Linear Algebra and its Applications · doi:10.1016/j.laa.2011.12.019 · Cited by 58
Linear algebra for tensor problems
Oseledets, I. V., Savostyanov, D., & Tyrtyshnikov, E. E. (2009) · Computing · doi:10.1007/s00607-009-0047-6 · Cited by 50
Self-citationAndreev, R., & Tobler, C. (2014) · Numerical Linear Algebra with Applications · doi:10.1002/nla.1951 · Cited by 41
Exact NMR simulation of protein-size spin systems using tensor train formalism
Savostyanov, D., Dolgov, S., Werner, J. M., & Kuprov, I. (2014) · Physical Review B · doi:10.1103/physrevb.90.085139 · Cited by 32
Self-citationWedderburn Rank Reduction and Krylov Subspace Method for Tensor Approximation. Part 1: Tucker Case
Goreinov, S. A., Oseledets, I. V., & Savostyanov, D. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/100792056 · Cited by 25
Self-citationEfficient time-stepping scheme for dynamics on TT-manifolds
Khoromskij, B. N., Oseledets, I. V., & Schneider, R. (2012) · Cited by 20
Cited by
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
Cichocki, A., Lee, N., Oseledets, I., Phan, A.-H., Zhao, Q., & Mandic, D. P. (2016) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000059 · Cited by 456
Hand-waving and interpretive dance: an introductory course on tensor networks
Bridgeman, J. C., & Chubb, C. T. (2017) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8121/aa6dc3 · Cited by 407
Zhao, Q., Zhou, G., Xie, S., Zhang, L., & Cichocki, A. S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.05535 · Cited by 284
Smooth PARAFAC Decomposition for Tensor Completion
Yokota, T., Zhao, Q., & Cichocki, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2586759 · Cited by 279
Metadata
- Authors
- Dolgov, S. V., & Savostyanov, D. V.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2014-01
- Volume
- 36
- Issue
- 5
- Pages
- A2248-A2271
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W1996869553
- Cited by
- 253
- References
- 62
- FWCI
- 7.24
- 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
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.