Abstract
A algorithm of the singular value decomposition for three-way array is proposed in this paper. The algorithm is suitable to deal with the actual problems of pattern recognition and classification model with three-way array data. Similar to the algorithm of the singular value decomposition for matrix, the algorithm is obtained by saving the problem of extremum subject to constraint conditions. Comparing with the existent algorithms of trilinear decomposition the algorithm is simple and fast in calculation, suitable to deal with the actual bigger data problems. The algorithm is easy to expand into the situation for multi-way array spectral data.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
