메뉴 건너뛰기




Volumn , Issue , 2010, Pages 145-164

On the best low multilinear rank approximation of higher-order tensors

Author keywords

[No Author keywords available]

Indexed keywords


EID: 80051813983     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-12598-0_13     Document Type: Chapter
Times cited : (5)

References (75)
  • 5
    • 0345447647 scopus 로고    scopus 로고
    • Newton's method on Riemannian manifolds and a geometric model for the human spine
    • R. L. Adler, J.-P. Dedieu, J. Y. Margulies, M. Martens, M. Shub. Newton's method on Riemannian manifolds and a geometric model for the human spine. IMA J. Numer. Anal., 22(3):359-390, 2002.
    • (2002) IMA J. Numer. Anal. , vol.22 , Issue.3 , pp. 359-390
    • Adler, R.L.1    Dedieu, J.-P.2    Margulies, J.Y.3    Martens, M.4    Shub, M.5
  • 7
    • 67651098983 scopus 로고    scopus 로고
    • Fast multilinear singular value decomposition for structured tensors
    • R. Badeau, R. Boyer. Fast multilinear singular value decomposition for structured tensors. SIAM J. Matrix Anal. Appl., 30(3):1008-1021, 2008.
    • (2008) SIAM J. Matrix Anal. Appl. , vol.30 , Issue.3 , pp. 1008-1021
    • Badeau, R.1    Boyer, R.2
  • 9
    • 34250499792 scopus 로고
    • Analysis of individual differences in multidimensional scaling via an N-way generalization of "Eckart-Young" decomposition
    • J. Carroll, J. Chang. Analysis of individual differences in multidimensional scaling via an N-way generalization of "Eckart-Young" decomposition. Psychometrika, 35(3):283-319, 1970.
    • (1970) Psychometrika , vol.35 , Issue.3 , pp. 283-319
    • Carroll, J.1    Chang, J.2
  • 10
    • 70449371517 scopus 로고    scopus 로고
    • On the tensor SVD and the optimal low rank orthogonal approximation of tensors
    • J. Chen, Y. Saad. On the tensor SVD and the optimal low rank orthogonal approximation of tensors. SIAM J. Matrix Anal. Appl., 30(4):1709-1734, 2009.
    • (2009) SIAM J. Matrix Anal. Appl. , vol.30 , Issue.4 , pp. 1709-1734
    • Chen, J.1    Saad, Y.2
  • 12
    • 0028416938 scopus 로고
    • Independent component analysis, a new concept?
    • P. Comon. Independent component analysis, a new concept? Signal Processing, 36(3):287-314, 1994.
    • (1994) Signal Processing , vol.36 , Issue.3 , pp. 287-314
    • Comon, P.1
  • 13
    • 0346238834 scopus 로고    scopus 로고
    • Tensor decompositions
    • J. G. McWhirter, I. K. Proudler (eds), Clarendon Press, Oxford
    • P. Comon. Tensor decompositions. In J. G. McWhirter, I. K. Proudler (eds), Mathematics in Signal Processing V, pp. 1-24. Clarendon Press, Oxford, 2002.
    • (2002) Mathematics in Signal Processing v , pp. 1-24
    • Comon, P.1
  • 17
    • 33746356349 scopus 로고    scopus 로고
    • A link between the canonical decomposition in multilinear algebra and simultaneous matrix diagonalization
    • L. De Lathauwer. A link between the canonical decomposition in multilinear algebra and simultaneous matrix diagonalization. SIAM J. Matrix Anal. Appl., 28(3):642-666, 2006.
    • (2006) SIAM J. Matrix Anal. Appl. , vol.28 , Issue.3 , pp. 642-666
    • De Lathauwer, L.1
  • 18
    • 54949113878 scopus 로고    scopus 로고
    • Decompositions of a higher-order tensor in block terms - Part I: Lemmas for partitioned matrices
    • L. De Lathauwer. Decompositions of a higher-order tensor in block terms - Part I: Lemmas for partitioned matrices. SIAM J. Matrix Anal. Appl., 30(3): 1022-1032, 2008.
    • (2008) SIAM J. Matrix Anal. Appl. , vol.30 , Issue.3 , pp. 1022-1032
    • De Lathauwer, L.1
  • 19
    • 67349118082 scopus 로고    scopus 로고
    • Decompositions of a higher-order tensor in block terms - Part II: Definitions and uniqueness
    • L. De Lathauwer. Decompositions of a higher-order tensor in block terms - Part II: Definitions and uniqueness. SIAM J. Matrix Anal. Appl., 30(3):1033- 1066, 2008.
    • (2008) SIAM J. Matrix Anal. Appl. , vol.30 , Issue.3 , pp. 1033-1066
    • De Lathauwer, L.1
  • 21
    • 33750178584 scopus 로고    scopus 로고
    • Tensor-based techniques for the blind separation of DS-CDMA signals
    • L. De Lathauwer, J. Castaing. Tensor-based techniques for the blind separation of DS-CDMA signals. Signal Processing, 87(2):322-336, 2007.
    • (2007) Signal Processing , vol.87 , Issue.2 , pp. 322-336
    • De Lathauwer, L.1    Castaing, J.2
  • 23
    • 0034144761 scopus 로고    scopus 로고
    • On the best rank-1 and rank- (R1;R2;::: ;RN) approximation of higher-order tensors
    • L. De Lathauwer, B. De Moor, J. Vandewalle. On the best rank-1 and rank- (R1;R2;::: ;RN) approximation of higher-order tensors. SIAM J. Matrix Anal. Appl., 21(4):1324-1342, 2000.
    • (2000) SIAM J. Matrix Anal. Appl. , vol.21 , Issue.4 , pp. 1324-1342
    • De Lathauwer, L.1    De Moor, B.2    Vandewalle, J.3
  • 24
    • 0035485594 scopus 로고    scopus 로고
    • Independent component analysis and (simultaneous) third-order tensor diagonalization
    • L. De Lathauwer, B. De Moor, J. Vandewalle. Independent component analysis and (simultaneous) third-order tensor diagonalization. IEEE Trans. Signal Process., 49(10):2262-2271, 2001.
    • (2001) IEEE Trans. Signal Process. , vol.49 , Issue.10 , pp. 2262-2271
    • De Lathauwer, L.1    De Moor, B.2    Vandewalle, J.3
  • 25
    • 17444379662 scopus 로고    scopus 로고
    • Computation of the canonical decomposition by means of a simultaneous generalized Schur decomposition
    • L. De Lathauwer, B. De Moor, J. Vandewalle. Computation of the canonical decomposition by means of a simultaneous generalized Schur decomposition. SIAM J. Matrix Anal. Appl., 26(2):295-327, 2004.
    • (2004) SIAM J. Matrix Anal. Appl. , vol.26 , Issue.2 , pp. 295-327
    • De Lathauwer, L.1    De Moor, B.2    Vandewalle, J.3
  • 26
    • 54949129274 scopus 로고    scopus 로고
    • Decompositions of a higher-order tensor in block terms - Part III: Alternating least squares algorithms
    • L. De Lathauwer, D. Nion. Decompositions of a higher-order tensor in block terms - Part III: Alternating least squares algorithms. SIAM J. Matrix Anal. Appl., 30(3):1067-1083, 2008.
    • (2008) SIAM J. Matrix Anal. Appl. , vol.30 , Issue.3 , pp. 1067-1083
    • De Lathauwer, L.1    Nion, D.2
  • 27
    • 4644268396 scopus 로고    scopus 로고
    • Dimensionality reduction in higher-order signal processing and rank-(R1;R2;::: ;RN) reduction in multilinear algebra
    • L. De Lathauwer, J. Vandewalle. Dimensionality reduction in higher-order signal processing and rank-(R1;R2;::: ;RN) reduction in multilinear algebra. Linear Algebra Appl., 391:31-55, 2004.
    • (2004) Linear Algebra Appl. , vol.391 , pp. 31-55
    • De Lathauwer, L.1    Vandewalle, J.2
  • 28
    • 55349142218 scopus 로고    scopus 로고
    • Tensor rank and the ill-posedness of the best low-rank approximation problem
    • V. de Silva, L.-H. Lim. Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM J. Matrix Anal. Appl., 30(3):1084-1127, 2008.
    • (2008) SIAM J. Matrix Anal. Appl. , vol.30 , Issue.3 , pp. 1084-1127
    • De Silva, V.1    Lim, L.-H.2
  • 31
    • 3142728626 scopus 로고    scopus 로고
    • Shape from moments - An estimation theory perspective
    • M. Elad, P. Milanfar, G. H. Golub. Shape from moments - an estimation theory perspective. IEEE Trans. on Signal Processing, 52(7):1814-1829, 2004.
    • (2004) IEEE Trans. on Signal Processing , vol.52 , Issue.7 , pp. 1814-1829
    • Elad, M.1    Milanfar, P.2    Golub, G.H.3
  • 32
    • 68149125583 scopus 로고    scopus 로고
    • A Newton-Grassmann method for computing the best multi-linear rank-(r1; R2; r3) approximation of a tensor
    • L. Eldén, B. Savas. A Newton-Grassmann method for computing the best multi-linear rank-(r1; r2; r3) approximation of a tensor. SIAM J. Matrix Anal. Appl., 31(2):248-271, 2009.
    • (2009) SIAM J. Matrix Anal. Appl. , vol.31 , Issue.2 , pp. 248-271
    • Eldén, L.1    Savas, B.2
  • 33
    • 0000615669 scopus 로고
    • Function minimization by conjugate gradients
    • R. Fletcher, C. M. Reeves. Function minimization by conjugate gradients. Comput. J., 7:149-154, 1964.
    • (1964) Comput. J. , vol.7 , pp. 149-154
    • Fletcher, R.1    Reeves, C.M.2
  • 34
    • 0004236492 scopus 로고    scopus 로고
    • Johns Hopkins University Press, Baltimore, Maryland, 3rd edition
    • G. H. Golub, C. F. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, Maryland, 3rd edition, 1996.
    • (1996) Matrix Computations
    • Golub, G.H.1    Van Loan, C.F.2
  • 35
    • 46649109335 scopus 로고    scopus 로고
    • Higher-order SVD-based subspace estimation to improve the parameter estimation accuracy in multidimensional harmonic retrieval problems
    • M. Haardt, F. Roemer, G. Del Galdo. Higher-order SVD-based subspace estimation to improve the parameter estimation accuracy in multidimensional harmonic retrieval problems. IEEE Trans. on Signal Processing, 56(7):3198- 3213, 2008.
    • (2008) IEEE Trans. on Signal Processing , vol.56 , Issue.7 , pp. 3198-3213
    • Haardt, M.1    Roemer, F.2    Del Galdo, G.3
  • 36
    • 33144465578 scopus 로고    scopus 로고
    • A new conjugate gradient method with guaranteed descent and an efficient line search
    • W. W. Hager, H. Zhang. A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM Journal on Optimization, 16(1):170- 192, 2005.
    • (2005) SIAM Journal on Optimization , vol.16 , Issue.1 , pp. 170-192
    • Hager, W.W.1    Zhang, H.2
  • 37
    • 0002740437 scopus 로고
    • Foundations of the PARAFAC procedure: Model and conditions for an "explanatory" multi-mode factor analysis
    • R. A. Harshman. Foundations of the PARAFAC procedure: Model and conditions for an "explanatory" multi-mode factor analysis. UCLA Working Papers in Phonetics, 16(1):1-84, 1970.
    • (1970) UCLA Working Papers in Phonetics , vol.16 , Issue.1 , pp. 1-84
    • Harshman, R.A.1
  • 39
    • 0000135303 scopus 로고
    • Methods of conjugate gradients for solving linear systems
    • M. R. Hestenes, E. Stiefel. Methods of conjugate gradients for solving linear systems. J. Research Nat. Bur. Standards, 49:409-436 (1953), 1952.
    • (1952) J. Research Nat. Bur. Standards , vol.49 , Issue.1953 , pp. 409-436
    • Hestenes, M.R.1    Stiefel, E.2
  • 40
    • 85162707890 scopus 로고
    • The expression of a tensor or a polyadic as a sum of products
    • F. L. Hitchcock. The expression of a tensor or a polyadic as a sum of products. Journal of Mathematical Physics, 6(1):164-189, 1927.
    • (1927) Journal of Mathematical Physics , vol.6 , Issue.1 , pp. 164-189
    • Hitchcock, F.L.1
  • 41
    • 85163188929 scopus 로고
    • Multiple invariants and generalized rank of a p-way matrix or tensor
    • F. L. Hitchcock. Multiple invariants and generalized rank of a p-way matrix or tensor. Journal of Mathematical Physics, 7(1):39-79, 1927.
    • (1927) Journal of Mathematical Physics , vol.7 , Issue.1 , pp. 39-79
    • Hitchcock, F.L.1
  • 47
    • 67349104920 scopus 로고    scopus 로고
    • Differential-geometric Newton method for the best rank-(R1;R2;R3) approximation of tensors
    • M. Ishteva, L. De Lathauwer, P.-A. Absil, S. Van Huffel. Differential-geometric Newton method for the best rank-(R1;R2;R3) approximation of tensors. Numerical Algorithms, 51(2):179-194, 2009.
    • (2009) Numerical Algorithms , vol.51 , Issue.2 , pp. 179-194
    • Ishteva, M.1    De Lathauwer, L.2    Absil, P.-A.3    Van Huffel, S.4
  • 49
    • 0036018642 scopus 로고    scopus 로고
    • On the best rank-1 approximation of higher-order supersymmetric tensors
    • E. Kofidis, P. A. Regalia. On the best rank-1 approximation of higher-order supersymmetric tensors. SIAM J. Matrix Anal. Appl, 23(3):863-884, 2002.
    • (2002) SIAM J. Matrix Anal. Appl , vol.23 , Issue.3 , pp. 863-884
    • Kofidis, E.1    Regalia, P.A.2
  • 50
    • 0036055687 scopus 로고    scopus 로고
    • Orthogonal tensor decompositions
    • T. Kolda. Orthogonal tensor decompositions. SIAM J. Matrix Anal. Appl., 23:243-255, 2001.
    • (2001) SIAM J. Matrix Anal. Appl. , vol.23 , pp. 243-255
    • Kolda, T.1
  • 51
    • 68649096448 scopus 로고    scopus 로고
    • Tensor decompositions and applications
    • T. G. Kolda, B. W. Bader. Tensor decompositions and applications. SIAM Review, 51(3):455-500, 2009.
    • (2009) SIAM Review , vol.51 , Issue.3 , pp. 455-500
    • Kolda, T.G.1    Bader, B.W.2
  • 53
    • 0002332422 scopus 로고
    • Principal component analysis of three-mode data by means of alternating least squares algorithms
    • P. M. Kroonenberg, J. de Leeuw. Principal component analysis of three-mode data by means of alternating least squares algorithms. Psychometrika, 45(1):69- 97, 1980.
    • (1980) Psychometrika , vol.45 , Issue.1 , pp. 69-97
    • Kroonenberg, P.M.1    De Leeuw, J.2
  • 55
    • 0036503069 scopus 로고    scopus 로고
    • Optimization algorithms exploiting unitary constraints
    • J. H. Manton. Optimization algorithms exploiting unitary constraints. IEEE Trans. Signal Process., 50(3):635-650, 2002.
    • (2002) IEEE Trans. Signal Process. , vol.50 , Issue.3 , pp. 635-650
    • Manton, J.H.1
  • 56
    • 67349278428 scopus 로고    scopus 로고
    • A Jacobi-type method for computing orthogonal tensor decompositions
    • C. D. Moravitz Martin, C. F. Van Loan. A Jacobi-type method for computing orthogonal tensor decompositions. SIAM J. Matrix Anal. Appl., 30(3):1219- 1232, 2008.
    • (2008) SIAM J. Matrix Anal. Appl. , vol.30 , Issue.3 , pp. 1219-1232
    • Moravitz Martin, C.D.1    Van Loan, C.F.2
  • 58
    • 0003982971 scopus 로고    scopus 로고
    • Springer Verlag, New York, 2nd edition, Springer Series in Operations Research
    • J. Nocedal, S. J. Wright. Numerical Optimization. Springer Verlag, New York, 2nd edition, 2006. Springer Series in Operations Research.
    • (2006) Numerical Optimization
    • Nocedal, J.1    Wright, S.J.2
  • 59
    • 51849118006 scopus 로고    scopus 로고
    • Tucker dimensionality reduction of three-dimensional arrays in linear time
    • I. V. Oseledets, D. V. Savostianov, E. E. Tyrtyshnikov. Tucker dimensionality reduction of three-dimensional arrays in linear time. SIAM J. Matrix Anal. Appl., 30(3):939-956, 2008.
    • (2008) SIAM J. Matrix Anal. Appl. , vol.30 , Issue.3 , pp. 939-956
    • Oseledets, I.V.1    Savostianov, D.V.2    Tyrtyshnikov, E.E.3
  • 60
    • 26644472198 scopus 로고    scopus 로고
    • Exponential data fitting using multilinear algebra: The single-channel and the multichannel case
    • J.-M. Papy, L. De Lathauwer, S. Van Huffel. Exponential data fitting using multilinear algebra: The single-channel and the multichannel case. Numer. Linear Algebra Appl., 12(8):809-826, 2005.
    • (2005) Numer. Linear Algebra Appl. , vol.12 , Issue.8 , pp. 809-826
    • Papy, J.-M.1    De Lathauwer, L.2    Van Huffel, S.3
  • 61
    • 70349682367 scopus 로고    scopus 로고
    • Exponential data fitting using multilinear algebra: The decimative case
    • J.-M. Papy, L. De Lathauwer, S. Van Huffel. Exponential data fitting using multilinear algebra: The decimative case. J. Chemometrics, 23(7-8):341-351, 2009.
    • (2009) J. Chemometrics , vol.23 , Issue.7-8 , pp. 341-351
    • Papy, J.-M.1    De Lathauwer, L.2    Van Huffel, S.3
  • 65
    • 0009317622 scopus 로고
    • Some remarks on dynamical systems and numerical analysis
    • L. Lara-Carrero, J. Lewowicz (eds), Equinoccio, U. Simón Bolívar, Caracas
    • M. Shub. Some remarks on dynamical systems and numerical analysis. In L. Lara-Carrero, J. Lewowicz (eds), Proc. VII ELAM., pp. 69-92. Equinoccio, U. Simón Bolívar, Caracas, 1986.
    • (1986) Proc. VII ELAM , pp. 69-92
    • Shub, M.1
  • 70
    • 0000305846 scopus 로고
    • The conjugate gradient method and trust regions in large scale optimization
    • T. Steihaug. The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal., 20(3):626-637, 1983.
    • (1983) SIAM J. Numer. Anal. , vol.20 , Issue.3 , pp. 626-637
    • Steihaug, T.1
  • 71
    • 0002633896 scopus 로고
    • Towards an efficient sparsity exploiting Newton method for minimization
    • I. S. Duff (ed), Academic Press, London
    • P. L. Toint. Towards an efficient sparsity exploiting Newton method for minimization. In I. S. Duff (ed), Sparse Matrices and Their Uses, pp. 57-88. Academic Press, London, 1981.
    • (1981) Sparse Matrices and Their Uses , pp. 57-88
    • Toint, P.L.1
  • 72
    • 0000666371 scopus 로고
    • The extension of factor analysis to three-dimensional matrices
    • H. Gulliksen, N. Frederiksen (eds), Holt, Rinehart & Winston, NY
    • L. R. Tucker. The extension of factor analysis to three-dimensional matrices. In H. Gulliksen, N. Frederiksen (eds), Contributions to mathematical psychology, pp. 109-127. Holt, Rinehart & Winston, NY, 1964.
    • (1964) Contributions to Mathematical Psychology , pp. 109-127
    • Tucker, L.R.1
  • 73
    • 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
  • 75
    • 0036056838 scopus 로고    scopus 로고
    • Rank-one approximation to high order tensors
    • T. Zhang, G. H. Golub. Rank-one approximation to high order tensors. SIAM J. Matrix Anal. Appl., 23:534-550, 2001.
    • (2001) SIAM J. Matrix Anal. Appl. , vol.23 , pp. 534-550
    • Zhang, T.1    Golub, G.H.2


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