메뉴 건너뛰기




Volumn 49, Issue 10, 2009, Pages 1662-1677

Approximate multiplication of tensor matrices based on the individual filtering of factors

Author keywords

Canonical decomposition; Coulomb potential; Data compression; Fast recompression; Low parameter representations; Low rank matrices; Multidimensional arrays; Multidimensional operators; Skeleton approximation; Tucker decomposition

Indexed keywords


EID: 76349097551     PISSN: 09655425     EISSN: 15556662     Source Type: Journal    
DOI: 10.1134/S0965542509100029     Document Type: Article
Times cited : (6)

References (38)
  • 1
    • 0036679114 scopus 로고    scopus 로고
    • Numerical Operator Calculus in Higher Dimensions
    • G. Beylkin and M. J. Mohlenkamp, "Numerical Operator Calculus in Higher Dimensions," Proc. Natl. Acad. Sci. USA 99, 10246-10251 (2002).
    • (2002) Proc. Natl. Acad. Sci. USA , vol.99 , pp. 10246-10251
    • Beylkin, G.1    Mohlenkamp, M.J.2
  • 2
    • 2942606241 scopus 로고    scopus 로고
    • Combining Kronecker Product Approximation with Discrete Wavelet Transforms to Solve Dense, Function-Related Systems
    • J. M. Ford and E. E. Tyrtyshnikov, "Combining Kronecker Product Approximation with Discrete Wavelet Transforms to Solve Dense, Function-Related Systems," SIAM J. Sci. Comput. 25, 961-981 (2003).
    • (2003) SIAM J. Sci. Comput. , vol.25 , pp. 961-981
    • Ford, J.M.1    Tyrtyshnikov, E.E.2
  • 3
    • 17144425622 scopus 로고    scopus 로고
    • Tensor Approximations of Matrices Generated by Asymptotically Smooth Functions
    • E. E. Tyrtyshnikov, "Tensor Approximations of Matrices Generated by Asymptotically Smooth Functions," Mat. Sb. 194(5), 147-160 (2003).
    • (2003) Mat. Sb. , vol.194 , Issue.5 , pp. 147-160
    • Tyrtyshnikov, E.E.1
  • 4
    • 0742320626 scopus 로고    scopus 로고
    • Kronecker-Product Approximations for Some Function-Related Matrices
    • E. E. Tyrtyshnikov, "Kronecker-Product Approximations for Some Function-Related Matrices," Linear Algebra Appl. 379, 423-437 (2004).
    • (2004) Linear Algebra Appl. , vol.379 , pp. 423-437
    • Tyrtyshnikov, E.E.1
  • 5
    • 3042756404 scopus 로고    scopus 로고
    • Existence and Computation of Low Kronecker-Rank Approximations for Large Systems in Tensor Product Structure
    • L. Grasedyck, "Existence and Computation of Low Kronecker-Rank Approximations for Large Systems in Tensor Product Structure," Computing 72, 247-265 (2004).
    • (2004) Computing , vol.72 , pp. 247-265
    • Grasedyck, L.1
  • 7
    • 27844496824 scopus 로고    scopus 로고
    • Algorithms for Numerical Analysis in High Dimensions
    • G. Beylkin and M. J. Mohlenkamp, "Algorithms for Numerical Analysis in High Dimensions," SIAM J. Sci. Comput. 26, 2133-2159 (2005).
    • (2005) SIAM J. Sci. Comput. , vol.26 , pp. 2133-2159
    • Beylkin, G.1    Mohlenkamp, M.J.2
  • 8
    • 27644573654 scopus 로고    scopus 로고
    • Approximate Inversion of Matrices in the Process of Solving a Hypersingular Integral Equation
    • I. V. Oseledets and E. E. Tyrtyshnikov, "Approximate Inversion of Matrices in the Process of Solving a Hypersingular Integral Equation," Comput. Math. Math. Phys. 45, 302-313 (2005).
    • (2005) Comput. Math. Math. Phys. , vol.45 , pp. 302-313
    • Oseledets, I.V.1    Tyrtyshnikov, E.E.2
  • 13
    • 0002740437 scopus 로고
    • Foundations of the Parafac Procedure: Models and Conditions for an Explanatory Multimodal Factor Analysis
    • R. A. Harshman, "Foundations of the Parafac Procedure: Models and Conditions for an Explanatory Multimodal Factor Analysis," UCLA Working Papers in Phonetics 16, 1-84 (1970).
    • (1970) UCLA Working Papers in Phonetics , vol.16 , pp. 1-84
    • Harshman, R.A.1
  • 14
    • 0013953617 scopus 로고
    • Some Mathematical Notes on Three-Mode Factor Analysis
    • L. R. Tucker, "Some Mathematical Notes on Three-Mode Factor Analysis," Psychometrika 31, 279-311 (1966).
    • (1966) Psychometrika , vol.31 , pp. 279-311
    • Tucker, L.R.1
  • 15
    • 34250499792 scopus 로고
    • Analysis of Individual Differences in Multidimensional Scaling via n-Way Generalization of Eckart-Young Decomposition
    • J. D. Caroll and J. J. Chang, "Analysis of Individual Differences in Multidimensional Scaling via n-Way Generalization of Eckart-Young Decomposition," Psychometrika 35, 283-319 (1970).
    • (1970) Psychometrika , vol.35 , pp. 283-319
    • Caroll, J.D.1    Chang, J.J.2
  • 16
    • 0030813663 scopus 로고    scopus 로고
    • PARAFAC: Tutorial and Applications
    • R. Bro, "PARAFAC: Tutorial and Applications," Chemometrics Intell. Lab. Syst. 38(2), 149-171 (1997).
    • (1997) Chemometrics Intell. Lab. Syst. , vol.38 , Issue.2 , pp. 149-171
    • Bro, R.1
  • 18
    • 17444379662 scopus 로고    scopus 로고
    • Computing of Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition
    • L. de Lathauwer, B. de Moor, and J. Vandewalle, "Computing of Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition," SIAM J. Matrix Anal. Appl. 26, 295-327 (2004).
    • (2004) SIAM J. Matrix Anal. Appl. , vol.26 , pp. 295-327
    • de Lathauwer, L.1    de Moor, B.2    Vandewalle, J.3
  • 24
  • 25
    • 76349105223 scopus 로고    scopus 로고
    • On Cross Approximation of Multi-Index Array
    • [Dokl. Math. 77, 404-406 (2008)]
    • S. A. Goreinov, "On Cross Approximation of Multi-Index Array," Dokl. Akad. Nauk 420, 439-441 (2008) [Dokl. Math. 77, 404-406 (2008)].
    • (2008) Dokl. Akad. Nauk , vol.420 , pp. 439-441
    • Goreinov, S.A.1
  • 26
    • 84897586218 scopus 로고    scopus 로고
    • Multigrid Accelerated Two-Level Tensor Approximation
    • B. N. Khoromskij and V. Khoromskaia, "Multigrid Accelerated Two-Level Tensor Approximation," SIAM J. Sci. Comput. 31, 3002-3026 (2009).
    • (2009) SIAM J. Sci. Comput. , vol.31 , pp. 3002-3026
    • Khoromskij, B.N.1    Khoromskaia, V.2
  • 27
    • 47849118953 scopus 로고    scopus 로고
    • On Tensor Approximation of Green Iterations for Kohn-Sham Equations
    • B. N. Khoromskij, "On Tensor Approximation of Green Iterations for Kohn-Sham Equations," Comput. Visualization Sci. 11(4-6), 259-271 (2008).
    • (2008) Comput. Visualization Sci. , vol.11 , Issue.4-6 , pp. 259-271
    • Khoromskij, B.N.1
  • 30
    • 0037790752 scopus 로고    scopus 로고
    • The Maximal-Volume Concept in Approximation by Low-Rank Matrices
    • S. A. Goreinov and E. E. Tyrtyshnikov, "The Maximal-Volume Concept in Approximation by Low-Rank Matrices," Contemporary Math. 208, 47-51 (2001).
    • (2001) Contemporary Math. , vol.208 , pp. 47-51
    • Goreinov, S.A.1    Tyrtyshnikov, E.E.2
  • 31
    • 0038805356 scopus 로고    scopus 로고
    • Incomplete Cross Approximation in the Mosaic-Skeleton Method
    • E. E. Tyrtyshnikov, "Incomplete Cross Approximation in the Mosaic-Skeleton Method," Computing 64, 367-380 (2000).
    • (2000) Computing , vol.64 , pp. 367-380
    • Tyrtyshnikov, E.E.1
  • 32
    • 70449519786 scopus 로고    scopus 로고
    • How to Find a Good Submatrix
    • Kowloon Tong, Hong Kong: ICM HKBU
    • S. A. Goreinov, I. V. Oseledets, D. V. Savostyanov, et al., "How to Find a Good Submatrix," Res. Rept. 08-10 (ICM HKBU, Kowloon Tong, Hong Kong, 2008); www. math. hkbu. edu. hk/ICM/pdf/08-10. pdf.
    • (2008) Res. Rept , pp. 08-10
    • Goreinov, S.A.1    Oseledets, I.V.2    Savostyanov, D.V.3
  • 33
    • 5844381624 scopus 로고    scopus 로고
    • Approximation of Boundary Element Matrices
    • M. Bebendorf, "Approximation of Boundary Element Matrices," Numer. Math. 86, 565-589 (2000).
    • (2000) Numer. Math. , vol.86 , pp. 565-589
    • Bebendorf, M.1
  • 36
    • 76349098868 scopus 로고    scopus 로고
    • Preprint No. 3, MPI MIS (Leipzig)
    • D. Braess and W. Hackbusch, Preprint No. 3, MPI MIS (Leipzig, 2009). www. mis. mpg. de/preprints/2009/preprint2009-3. pdf.
    • (2009)
    • Braess, D.1    Hackbusch, W.2
  • 37
    • 76349123116 scopus 로고    scopus 로고
    • Preprint No. 2, MPI MIS (Leipzig)
    • W. Hackbusch and S. Kuhn, Preprint No. 2, MPI MIS (Leipzig, 2009). www. mis. mpg. de/preprints/2009/preprint2009-2. pdf.
    • (2009)
    • Hackbusch, W.1    Kuhn, S.2
  • 38
    • 70449528138 scopus 로고    scopus 로고
    • Breaking the Curse of Dimensionality or How to Use SVD in Many Dimensions
    • I. V. Oseledets and E. E. Tyrtyshnikov, "Breaking the Curse of Dimensionality or How to Use SVD in Many Dimensions," SIAM J. Sci. Comput. (2009); www. math. hkbu. edu. hk/ICM/pdf/09-03. pdf.
    • (2009) SIAM J. Sci. Comput
    • Oseledets, I.V.1    Tyrtyshnikov, E.E.2


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