• Bulletin of the Korean Mathematical Society
• /
• v.55 no.5
• /
• pp.1587-1598
• /
• 2018

We study additive decompositions (and generalized additive decompositions with a zero-dimensional scheme instead of a finite sum of rank 1 tensors), which are not of minimal degree (for sums of rank 1 tensors with more terms than the rank of the tensor, for a zero-dimensional scheme a degree higher than the cactus rank of the tensor). We prove their existence for all degrees higher than the rank of the tensor and, with strong assumptions, higher than the cactus rank of the tensor. Examples show that additional assumptions are needed to get the minimally spanning scheme of degree cactus +1.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.27 no.1
• /
• pp.1-22
• /
• 2023

In this paper we settle some polynomial identity which provides a family of explicit Waring decompositions of any monomial Xa00 Xa11··· Xann over a field k. This gives an upper bound for the Waring rank of a given monomial and naturally leads to an explicit Waring decomposition of any homogeneous form and, eventually, of any polynomial via (de)homogenization. Note that such decomposition is very useful in many applications dealing with polynomial computations, symmetric tensor problems and so on. We discuss some computational aspect of our result as comparing with other known methods and also present a computer implementation for potential use in the end.

• ETRI Journal
• /
• v.45 no.1
• /
• pp.138-149
• /
• 2023

In this study, the problem of blind signal separation for coprime planar arrays is investigated. For coprime planar arrays comprising two uniform rectangular subarrays, we link the signal separation to the tensor-based model called coupled canonical polyadic decomposition (CPD) and propose an improved coupled trilinear decomposition approach. The output data of coprime planar arrays are modeled as a coupled tensor set that can be further interpreted as a coupled CPD model, allowing a signal separation to be achieved using coupled trilinear alternating least squares (TALS). Furthermore, in the procedure of the coupled TALS, a Vandermonde structure enforcing approach is explicitly applied, which is shown to ensure fast convergence. The results of Monto Carlo simulations show that our proposed algorithm has the same separation accuracy as the basic coupled TALS but with a faster convergence speed.

• Journal of the Society of Naval Architects of Korea
• /
• v.33 no.3
• /
• pp.94-102
• /
• 1996

An interpretation for the additive and multiplicative decomposition theory of the deformation gradient tensor in finite deformation problems is presented. the conventional methods have not provided the additive deformation velocity gradient. Moreover the plastic deformation velocity gradients are not free from elastic deformations. In this paper, a modified multiplicative decomposition is introduced with the assumption of coaxial plastic deformation velocity gradient. This strategy well gives the additive deformation velocity gradient in which the plastic deformation velocity gradient is not affect4d by the elastic deformation.