메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Swamp reducing technique for tensor decomposition

Author keywords

[No Author keywords available]

Indexed keywords

BLIND IDENTIFICATIONS; LEAST SQUARES METHODS; MULTI-USER; NUMERICAL TECHNIQUES; PARAMETER CHOICE; TENSOR ANALYSIS; TENSOR DECOMPOSITION; TIKHONOV REGULARIZATION;

EID: 84863765794     PISSN: 22195491     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (65)

References (33)
  • 3
    • 33750148453 scopus 로고    scopus 로고
    • PARAFACBased unified Tensor modeling for wireless communication systems with Application to blind multiuser equalization
    • A. L. F. de Almeida, G. Favier and J. C. M. Mota, "PARAFACBased Unified Tensor Modeling for Wireless Communication Systems with Application to Blind Multiuser Equalization," Journal of Signal Processing, vol 87, pp. 337-351, 2007.
    • (2007) Journal of Signal Processing , vol.87 , pp. 337-351
    • De Almeida, A.L.F.1    Favier, G.2    Mota, J.C.M.3
  • 4
    • 0013178793 scopus 로고
    • Remarks on choosing a regularization parameter using the quasioptimality and ratio criterion
    • A. Bakushinsky, "Remarks on Choosing a Regularization Parameter Using the Quasioptimality and Ratio Criterion," USSR Comput. Maths. Math. Phys., vol 24, pp. 181-182, 1984.
    • (1984) USSR Comput. Maths. Math. Phys. , vol.24 , pp. 181-182
    • Bakushinsky, A.1
  • 5
    • 0003203438 scopus 로고
    • Templates for the solution of linear systems: Building blocks for iterative methods
    • R. Barrett et al., Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, 1994.
    • (1994) SIAM
    • Barrett, R.1
  • 6
    • 55549125912 scopus 로고    scopus 로고
    • On the performance of tensor methods for solving ill-conditioned problems
    • B. W. Bader and R. B. Schnabel, "On the Performance of Tensor Methods for Solving Ill-conditioned Problems," SIAM J. Scientific Computing, 2007.
    • (2007) SIAM J. Scientific Computing
    • Bader, B.W.1    Schnabel, R.B.2
  • 8
    • 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., vol. 26, pp. 2133-2159, 2005.
    • (2005) SIAM J. Sci. Comput. , vol.26 , pp. 2133-2159
    • Beylkin, G.1    Mohlenkamp, M.J.2
  • 9
    • 0000592482 scopus 로고
    • Analysis of individual differences in multidimensional scaling via an n-way generalization of
    • J. Carrol and J. Chang, "Analysis of Individual Differences in Multidimensional Scaling via an N-way Generalization of "Eckart-Young" Decomposition" Psychometrika, 9, 267-283, 1970.
    • (1970) Eckart-Young" Decomposition" Psychometrika , vol.9 , pp. 267-283
    • Carrol, J.1    Chang, J.2
  • 10
    • 54949113878 scopus 로고    scopus 로고
    • Decompositions of a higher-order tensor in block terms - Part I: Lemmas for partitioned matrices
    • to appear
    • L. De Lathauwer, "Decompositions of a Higher-Order Tensor in Block Terms - Part I: Lemmas for Partitioned Matrices," SIAM J. Matrix Anal. Appl., to appear.
    • SIAM J. Matrix Anal. Appl.
    • De Lathauwer, L.1
  • 11
    • 67349118082 scopus 로고    scopus 로고
    • Decompositions of a higher-order tensor in block terms - Part II: Definitions and uniqueness
    • to appear
    • L. De Lathauwer, "Decompositions of a Higher-Order Tensor in Block Terms - Part II: Definitions and Uniqueness," SIAM J. Matrix Anal. Appl., to appear.
    • SIAM J. Matrix Anal. Appl.
    • De Lathauwer, L.1
  • 13
    • 54949129274 scopus 로고    scopus 로고
    • Decompositions of a higher-order tensor in block terms - Part III: Alternating least squares algorithms
    • to appear
    • L. De Lathauwer and D. Nion, "Decompositions of a Higher-Order Tensor in Block Terms - Part III: Alternating Least Squares Algorithms," SIAM J. Matrix Anal. Appl., to appear.
    • SIAM J. Matrix Anal. Appl.
    • De Lathauwer, L.1    Nion, D.2
  • 16
    • 21244436795 scopus 로고    scopus 로고
    • Hierarchical kronecker tensor-product approximations
    • W. Hackbush, B.N. Khoromskij and E. Tyrtyshnikov, "Hierarchical Kronecker Tensor-Product Approximations," J. Numer. Math., vol. 13, no. 2, pp. 119-156, 2005.
    • (2005) J. Numer. Math. , vol.13 , Issue.2 , pp. 119-156
    • Hackbush, W.1    Khoromskij, B.N.2    Tyrtyshnikov, E.3
  • 18
    • 34447513756 scopus 로고    scopus 로고
    • Low rank tucker-type tensor approximation to classical potentials
    • B. N. Khoromskij and V. Khoromskaia, "Low Rank Tucker-Type Tensor Approximation to Classical Potentials," Central European Journal of Mathematics, vol. 5, no. 3, pp. 523-550, 2007.
    • (2007) Central European Journal of Mathematics , vol.5 , Issue.3 , pp. 523-550
    • Khoromskij, B.N.1    Khoromskaia, V.2
  • 21
    • 48749101457 scopus 로고
    • Three-way arrays: Rank and uniqueness of trilinear decompositions with application to arithmetic complexity and statistics
    • J. B. Kruskal, "Three-way Arrays: Rank and Uniqueness of Trilinear Decompositions with Application to Arithmetic Complexity and Statistics," Linear Algebra Applicat., vol. 18 pp. 95-138, 1977.
    • (1977) Linear Algebra Applicat. , vol.18 , pp. 95-138
    • Kruskal, J.B.1
  • 23
    • 31044456392 scopus 로고    scopus 로고
    • Parallel factor analysis as an exploratory tool for wavelet transformed event-related EEG
    • M. Mørup, L.K. Hansen, C.S. Herrmann, J. Parnas and S.M. Arnfred, "Parallel Factor Analysis as an Exploratory Tool for Wavelet Transformed Event-Related EEG," NeuroImage, vol. 29, pp. 938-947, 2006.
    • (2006) NeuroImage , vol.29 , pp. 938-947
    • Mørup, M.1    Hansen, L.K.2    Herrmann, C.S.3    Parnas, J.4    Arnfred, S.M.5
  • 24
    • 36049038610 scopus 로고    scopus 로고
    • An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA
    • D. Nion and L. De Lathauwer, "An Enhanced Line Search Scheme for Complex-Valued Tensor Decompositions. Application in DS-CDMA," Signal Processing, vol. 88, no. 3, pp. 749-755, 2008.
    • (2008) Signal Processing , vol.88 , Issue.3 , pp. 749-755
    • Nion, D.1    De Lathauwer, L.2
  • 26
    • 84863647623 scopus 로고    scopus 로고
    • Enhanced line search: A novel method to accelerate PARAFAC
    • Turkey, September 4-8
    • M. Rajih and P. Comon, "Enhanced Line Search: A Novel Method to Accelerate PARAFAC," Proc. EUSIPCO 2005 Antalya, Turkey, September 4-8, 2005.
    • (2005) Proc. EUSIPCO 2005 Antalya
    • Rajih, M.1    Comon, P.2
  • 30
    • 0000666371 scopus 로고
    • The extension of factor analysis to threedimensional matrices
    • H. Gulliksen and N. Frederiksen, eds., Holt, Rinehart & Winston, NY
    • L.R. Tucker, "The Extension of Factor Analysis to Threedimensional Matrices,"in Contributions to mathematical psychology, H. Gulliksen and N. Frederiksen, eds., Holt, Rinehart & Winston, NY, 1964, pp. 109-127.
    • (1964) Contributions to Mathematical Psychology , pp. 109-127
    • Tucker, L.R.1
  • 31
    • 0013953617 scopus 로고
    • Some mathematical notes on three-mode factor analysis
    • L.R. Tucker, "Some Mathematical Notes on Three-mode Factor Analysis," Psychometrika, 31, pp. 279-311, 1966.
    • (1966) Psychometrika , vol.31 , pp. 279-311
    • Tucker, L.R.1
  • 33
    • 70349716362 scopus 로고    scopus 로고
    • A heuristic method for computing the best rank-r approximation to higher-order tensors
    • H.-G. Zhao, "A Heuristic Method for Computing the Best Rank-r Approximation to Higher-Order Tensors," Int. J. Contemp. Math. Sciences, vol 3, no. 10, pp. 471 - 476, 2008.
    • (2008) Int. J. Contemp. Math. Sciences , vol.3 , Issue.10 , pp. 471-476
    • Zhao, H.-G.1


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