메뉴 건너뛰기




Volumn 36, Issue 4, 2014, Pages A1415-A1431

Tree adaptive approximation in the hierarchical tensor format

Author keywords

Black box approximation; Hierarchical tensor format; Hierarchical tucker format; Matrix product states; Tensor train; Tree adaptivity

Indexed keywords

BINARY TREES; TREES (MATHEMATICS);

EID: 84987617473     PISSN: 10648275     EISSN: 10957197     Source Type: Journal    
DOI: 10.1137/130926328     Document Type: Article
Times cited : (41)

References (12)
  • 1
    • 84869490650 scopus 로고    scopus 로고
    • Black box approximation of tensors in hierarchical Tucker format
    • J. Ballani, L. Grasedyck, and M. Kluge, Black box approximation of tensors in hierarchical Tucker format, Linear Algebra Appl., 438 (2013), pp. 639-657.
    • (2013) Linear Algebra Appl , vol.438 , pp. 639-657
    • Ballani, J.1    Grasedyck, L.2    Kluge, M.3
  • 2
    • 5844381624 scopus 로고    scopus 로고
    • Approximation of boundary element matrices
    • M. Bebendorf, Approximation of boundary element matrices, Numer. Math., 86 (2000), pp. 565-589.
    • (2000) Numer. Math , vol.86 , pp. 565-589
    • Bebendorf, M.1
  • 3
    • 55349142218 scopus 로고    scopus 로고
    • Tensor rank and the ill-posedness of the best low-rank approximation problem
    • V. De Silva and L.-H. Lim, Tensor rank and the ill-posedness of the best low-rank approximation problem, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 1084-1127.
    • (2008) SIAM J. Matrix Anal. Appl. , vol.30 , pp. 1084-1127
    • De Silva, V.1    Lim, L.-H.2
  • 4
    • 77956032667 scopus 로고    scopus 로고
    • Hierarchical singular value decomposition of tensors
    • L. Grasedyck, Hierarchical singular value decomposition of tensors, SIAM J. Matrix Anal. Appl., 31 (2010), pp. 2029-2054.
    • (2010) SIAM J. Matrix Anal. Appl , vol.31 , pp. 2029-2054
    • Grasedyck, L.1
  • 5
    • 80053906565 scopus 로고    scopus 로고
    • An introduction to hierarchical (H-) rank and TT-rank of tensors with examples
    • L. Grasedyck and W. Hackbusch, An introduction to hierarchical (H-) rank and TT-rank of tensors with examples, Comput. Methods Appl. Math., 11 (2011), pp. 291-304.
    • (2011) Comput. Methods Appl. Math , vol.11 , pp. 291-304
    • Grasedyck, L.1    Hackbusch, W.2
  • 8
    • 77952289640 scopus 로고    scopus 로고
    • A new scheme for the tensor representation
    • W. Hackbusch and S. Kühn, A new scheme for the tensor representation, J. Fourier Anal. Appl., 15 (2009), pp. 706-722.
    • (2009) J. Fourier Anal. Appl. , vol.15 , pp. 706-722
    • Hackbusch, W.1    Kühn, S.2
  • 9
    • 68649096448 scopus 로고    scopus 로고
    • Tensor decompositions and applications
    • T. G. Kolda and B. W. Bader, Tensor decompositions and applications, SIAM Rev., 51 (2009), pp. 455-500.
    • (2009) SIAM Rev , vol.51 , pp. 455-500
    • Kolda, T.G.1    Bader, B.W.2
  • 10
    • 80053896203 scopus 로고    scopus 로고
    • Tensor-train decomposition
    • I. V. Oseledets, Tensor-train decomposition, SIAM J. Sci. Comput., 33 (2011), pp. 2295-2317.
    • (2011) SIAM J. Sci. Comput , vol.33 , pp. 2295-2317
    • Oseledets, I.V.1
  • 11
    • 70449525345 scopus 로고    scopus 로고
    • TT-cross approximation for multidimensional arrays
    • I. V. Oseledets and E. E. Tyrtyshnikov, TT-cross approximation for multidimensional arrays, Linear Algebra Appl., 432 (2010), pp. 70-88.
    • (2010) Linear Algebra Appl , vol.432 , pp. 70-88
    • Oseledets, I.V.1    Tyrtyshnikov, E.E.2
  • 12
    • 0242425255 scopus 로고    scopus 로고
    • Efficient classical simulation of slightly entangled quantum computations
    • G. Vidal, Efficient classical simulation of slightly entangled quantum computations, Phys. Rev. Lett., 91 (2003).
    • (2003) Phys. Rev. Lett. , vol.91
    • Vidal, G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.