Preprint
Article

This version is not peer-reviewed.

Z-Eigenvector Residual Recovery for Dominant Fourth-Order Structure Missed by PCA

Submitted:

21 July 2026

Posted:

21 July 2026

You are already at the latest version

Abstract
Principal component analysis is a second-order method: it selects covariance dominant directions. In local data models, however, a structural component may be rare or intermittent and therefore have modest variance but large fourth-order response. This note demonstrates a straightforward fourth-order enhancement based on Z-eigenvectors of fourth-order tensors. We prove a separation result showing that, in a fourth-order-dominant regime, rank-\(k\) PCA selects nuisance directions, while successively selected fourth-order maximizing directions recover the structural subspace. In the noiseless case, the resulting structural projection has strictly smaller squared reconstruction error for every nonzero structural vector. For arbitrary deterministic errors, we give an explicit sufficient condition under which the same improvement holds. We also establish the stability of our residual recovery scheme under tensor perturbation. A small example is used to support our method.
Keywords: 
;  ;  ;  

1. Introduction

Principal component analysis (PCA) is one of the standard methods for dimension reduction, approximation, and denoising. Its origins go back to the least-squares geometric construction of Pearson and the variance-based formulation of Hotelling [1,2]; see also [3]. For centered data, PCA orders directions according to the quadratic form determined by the covariance matrix. It is therefore intrinsically a second-order method. A direction with a large second moment is favored, regardless of whether that direction represents the structural component one wishes to preserve.
Higher-order criteria provide a different way to rank directions. Projection pursuit searches for low-dimensional projections that maximize a chosen measure of non-Gaussian or otherwise interesting structure [4,5]. Fourth-order cumulants and related contrast functions also play a central role in independent component analysis and blind source separation [6,7]. Those theories have objectives and normalizations that differ from the present one, but they illustrate the general principle that second-order information need not reveal all distinguished directions in a data set.
In this paper, we introduce a Z-eigenvector residual recovery mechanism based on successive orthogonal maximization. Symmetric tensor eigenvalues and their variational interpretation were developed in [9,10,11]. The maximization problem is also closely related to symmetric best rank-one approximation [12], and shifted higher-order power methods [13]. General background on tensor decompositions may be found in [8].
The method presented here is more specific than a general tensor decomposition. We first compute a PCA subspace B, remove its contribution from the data, and then maximize the residual quartic form over B . The resulting direction is used to augment the original PCA subspace. This residual construction is motivated by a conceivable scenario: a structural component may occur less frequently, or may contribute less covariance energy, than a nuisance component while still producing significantly large fourth moment. In that case, second- and fourth-order methods rank the two directions in opposite order.
The paper is organized as follows. Section 2 introduces fourth-order Z-eigenvectors and the residual recovery procedure. Section 3 proves the exact second- versus fourth-order separation result. Section 4 establishes the perturbation bound and the controlled reconstruction-error comparisons. Section 5 presents a three-dimensional example, and the final section summarizes the conclusions and limitations.

2. Fourth-Order Z-Eigenvectors and Residual Recovery

We first recall the definition of a Z-eigenpair and then describe the residual recovery procedure used throughout the paper. Let C = ( c i 1 i m ) be a real symmetric tensor of order m 2 and dimension n 2 . This means,
c i 1 i m = c i π ( 1 ) i π ( m ) , 1 i 1 , , i m n .
for every permutation π of { 1 , , m } . The homogeneous polynomial associated with C is
f C ( x ) = C x m : = i 1 , , i m = 1 n c i 1 i m x i 1 x i m .
For x R n , the vector contraction C x m 1 R n is defined componentwise via
C x m 1 i : = i 2 , , i m = 1 n c i i 2 i m x i 2 x i m .
We use the standard definition of a Z-eigenpair from [9,10,11].
Definition 1
(Z-eigenpair). A pair ( λ , v ) R × ( R n { 0 } ) is called a Z-eigenpair of C if
C v m 1 = λ v , v 2 = 1 .
The scalar λ is a Z-eigenvalue of C and v is its associated Z-eigenvector.
We shall henceforth focus on real symmetric tensors of order four. By a Lagrange multiplier argument, every unit vector attaining max u 2 = 1 C u 4 is a Z-eigenvector of C . We shall refer to a vector in argmax u 2 = 1 C u 4 as a dominant fourth-order direction of C .
For the remainder of this section, let z 1 , , z K R n be centered data vectors so that
1 K q = 1 K z q = 0 .
We define the associated covariance matrix and fourth-order symmetric tensor by
Σ ^ : = 1 K q = 1 K z q z q and C : = 1 K q = 1 K z q 4 .
For every u R n , we then have
C u 4 = 1 K q = 1 K z q , u 4 and C u 3 = 1 K q = 1 K z q , u 3 z q .
Thus, the tensor-vector contraction can be evaluated directly from the data without explicitly forming or storing all n 4 entries of C .
Our objective is not to compute a complete low-rank decomposition of the fourth-order tensor. Instead, we use a dominant fourth-order direction to augment a PCA subspace and recover residual structure that is weak in covariance. The construction is as follows.
1.
Fix an integer 1 s < n . Let the matrix
U s = [ u 1 , , u s ] R n × s
have orthonormal columns consisting of eigenvectors associated with the s largest eigenvalues of Σ ^ . We define
B : = range ( U s ) and P B : = U s U s .
2.
We also define the residual data vectors by
r q : = ( I P B ) z q , q = 1 , , K ,
and form the residual fourth-order tensor
C res : = 1 K q = 1 K r q 4 .
Since each r q belongs to B , we have that
C res u 3 B for every u R n .
3.
If C res = 0 , then no residual direction is added.
If C res 0 , then we select a unit vector
v ^ argmax u B u 2 = 1 C res u 4 .
It follows immediately v ^ corresponds to a residual direction attaining the largest fourth-order response. Since C res u 3 B for every u R n , applying the Lagrange multiplier argument for the maximization problem on the unit sphere in B gives
C res v ^ 3 = λ ^ v ^ and λ ^ = C res v ^ 4 .
Thus, v ^ is a Z-eigenvector of C res .
4.
In the case C res 0 , let y R n be a target vector to which the constructed projection is applied. The PCA plus residual-recovery estimator is then defined by
y ^ rec : = P B y + v ^ v ^ ( I P B ) y = P B + v ^ v ^ y .
The second equality follows from v ^ B . Thus, P B + v ^ v ^ is an orthogonal projector of rank s + 1 . The first term retains the component of y in the leading covariance subspace, while the second term restores its component along the dominant fourth-order residual direction.
In numerical implementations, the contraction C res u 3 can be evaluated from
C res u 3 = 1 K q = 1 K r q , u 3 r q .
A stationary Z-eigenvector may be sought using the shifted symmetric higher-order power method (SS-HOPM) of [13], preferably with multiple initializations. In general, a numerical iteration may converge to a local stationary point; our results below nevertheless concern global maximizers of the stated quartic forms.
In the next two sections, we first analyze an exact model in which covariance and fourth-order maximization select different subspaces. We then establish stability under controlled perturbations of the residual fourth-order tensor.

3. A Fourth-Order-Dominant Regime in Which Z-Eigenvector Recovery Outperforms PCA

We now present a model in which the distinction between second- and fourth-order is transparent. Let { v 1 , , v k ; w 1 , , w r } be an orthonormal set in R n . Let S = span { v 1 , , v k } denote the structural subspace and N = span { w 1 , , w r } represent the nuisance subspace.
Let Z R n be a centered random vector supported on these coordinate directions as follows. For each structural direction v j , with probability p j / 2 , we assign Z = a j v j , and with probability p j / 2 , we assign Z = a j v j . For each nuisance direction w , with probability q / 2 , we assign Z = b w , and with probability q / 2 , we assign Z = b w . Here p j , q > 0 and a j , b > 0 are chosen such that
j = 1 k p j + = 1 r q = 1 .
Consequently, the covariance matrix and fourth-order tensor are
Σ 2 = j = 1 k p j a j 2 v j v j + = 1 r q b 2 w w
and
C 4 = j = 1 k p j a j 4 v j 4 + = 1 r q b 4 w 4 .
Let ν 1 , , ν k be chosen recursively so that
ν t argmax u 2 = 1 u ν 1 , , ν t 1 C 4 u 4 , t = 1 , , k ,
where the orthogonality condition is vacuous when t = 1 .
It is worth noting for the special fourth-order tensor C 4 constructed in (2), the successive orthogonal maximizers are indeed coordinate directions and therefore are automatically Z-eigenvectors of C 4 . For a general real symmetric tensor, however, an orthogonally constrained maximizer need not be a Z-eigenvector of the original tensor.
Theorem 1
(Fourth-order advantage). Assume r k and
min 1 r q b 2 > max 1 j k p j a j 2 , while
min 1 j k p j a j 4 > max 1 r q b 4 .
We then have:
1.
The leading k covariance eigenvectors of Σ 2 are nuisance directions in N, whereas the successive orthogonal maximizers of C 4 , { ν 1 , , ν k } in (3), coincide with the structural directions { v 1 , , v k } , up to signs and ordering.
2.
Let P S denote the orthogonal projector onto S and let P PCA denote an orthogonal projector onto a leading k-dimensional eigenspace of Σ 2 . Let y = x + ε , where x S and ε R n is an arbitrary error vector. Then
P S y x 2 = P S ε 2 ,
whereas
P PCA y x 2 2 = x 2 2 + P PCA ε 2 2 .
Consequently,
P PCA y x 2 2 P S y x 2 2 = x 2 2 + P PCA ε 2 2 P S ε 2 2 .
Thus, the fourth-order structural projection has smaller squared reconstruction error whenever
P S ε 2 2 P PCA ε 2 2 < x 2 2 .
In particular, the sufficient condition
ε 2 < x 2
guarantees strict improvement. In the noiseless case ε = 0 , the improvement is exactly x 2 2 .
Proof. 
Equation (1) shows that the covariance eigenvalues in the structural directions are p j a j 2 , while the covariance eigenvalues in the nuisance directions are q b 2 . Assumption (a) implies that the leading k covariance directions are nuisance directions.
On the other hand, for the fourth-order tensor C 4 , we set
γ j = p j a j 4 and η = q b 4 .
If u = j = 1 k α j v j + = 1 r β w + h , where h is orthogonal to the span of the displayed directions, then
C 4 u 4 = j = 1 k γ j α j 4 + = 1 r η β 4 M j = 1 k α j 4 + = 1 r β 4 M j = 1 k α j 2 + = 1 r β 2 2 M ,
where
M = max { max j γ j , max η } .
Equalities hold throughout (10) only if h = 0 and exactly one of the coefficients α j , β has absolute value one. By assumption (b), since every γ j is larger than every η , a maximizing coordinate must be structural. After one such direction is selected, its coefficient is zero on the orthogonal complement. Repeating the same argument selects each of the remaining structural directions before any nuisance direction is chosen. Thus, the recursively selected fourth-order directions are exactly { v 1 , , v k } , up to signs and ordering. Assertion (1) follows.
Since x S , we have P S x = x . It follows that
P S y x = P S ( x + ε ) x = P S ε ,
which proves (5).
By assertion (1), the range of P PCA is contained in the nuisance subspace N, which is orthogonal to S. Hence,
P PCA x = 0 and P PCA y x = P PCA ε x .
Since P PCA ε N and x S , P PCA ε x , whence
P PCA y x 2 2 = P PCA ε 2 2 + x 2 2 ,
which proves (6).
Combining (5) and (6) gives (7). Condition (8) is therefore equivalent to strict improvement by the structural projection. Furthermore, since
P S ε 2 2 ε 2 2 and P PCA ε 2 2 0 ,
if ε 2 < x 2 , then
P S y x 2 2 ε 2 2 < x 2 2 P PCA y x 2 2 .
When ε = 0 , the two squared errors are respectively 0 and x 2 2 , which completes the proof. □
Remark 1.
The assumptions (a) and (b) have a straightforward interpretation. The nuisance directions dominate second-order terms, so PCA selects them. The structural directions dominate the fourth-order terms, so successive fourth-order maximization chooses them. For one structural direction with probability p and amplitude a, and one nuisance direction with probability q and amplitude b, it is possible to have p a 2 < q b 2 while p a 4 > q b 4 . Equivalently,
q p 1 / 4 < a b < q p 1 / 2 ,
which is possible whenever p < q . This is the rare, high-amplitude regime in which fourth-order information can reveal structure that covariance missed.
In practice, after a prescribed baseline PCA subspace B has been removed, one can apply Theorem 1 to B . In that situation, both structural and nuisance directions in the theorem are residual directions, so Theorem 1 explains why fourth-order maximization may recover a residual structural component missed by an additional PCA direction.

4. Stable Residual Recovery Under Tensor Perturbations

The previous theorem treats a highly structured fourth-order tensor C 4 . However, in real-world applications, the residual fourth-order tensor will generally contain sampling error, cross terms, or small variations from the idealized model. In this section, we endeavor to show that residual Z-eigenvector recovery is stable under a bounded tensor perturbation.
Let B R n be a fixed s-dimensional PCA subspace, and let P B denote the orthogonal projector onto B. Let the perturbation tensor E be a fourth-order n-dimensional real symmetric tensor. We then define its semi-norm on B by
E B : = max { | E u 4 | : u B , u 2 = 1 } .
Suppose v , w 1 , , w r B are orthonormal. The vector v is regarded as the residual structural direction, while w 1 , , w r are residual nuisance directions. Consider the unperturbed residual tensor
C 0 : = γ v 4 + = 1 r η w 4 , γ > 0 , η 0 .
We set
η max : = max 1 r η and Δ : = γ η max .
The quantity Δ measures the fourth-order spectral gap between the structural direction and the strongest residual nuisance direction.
Theorem 2
(Stability of residual Z-eigenvector recovery). Assume Δ > 0 and the observed residual tensor has the form C res = C 0 + E , where the perturbation tensor E satisfies E B = ρ 0 . Let v ^ argmax { C res u 4 : u B , u 2 = 1 } . Then
1 | v ^ , v | 2 min 1 , 2 ρ Δ .
Equivalently, if θ is the acute angle between v ^ and v , then
sin 2 θ min 1 , 2 ρ Δ .
In particular, if ρ < Δ / 2 , then the recovered direction has nonzero alignment with v .
Proof. 
We write
v ^ = α v + = 1 r β w + h ,
where h B span { v , w 1 , , w r } . It is straightforward to calculate
δ : = 1 | v ^ , v | 2 = 1 cos 2 θ = sin 2 θ .
Since v ^ 2 = 1 , we have α 2 = 1 δ and = 1 r β 2 δ . Consequently,
= 1 r β 4 ( = 1 r β 2 ) 2 δ 2 .
Hence,
C 0 v ^ 4 = γ α 4 + = 1 r η β 4 γ ( 1 δ ) 2 + η max δ 2 .
Since v ^ is a global maximizer of the perturbed quartic form on the unit sphere in B , it is clear C res v ^ 4 C res v 4 .
On one hand, the perturbation bound gives
C res v 4 = γ + E v 4 γ ρ .
On the other hand, (11) gives C res v ^ 4 γ ( 1 δ ) 2 + η max δ 2 + ρ . Thus,
γ ρ γ ( 1 δ ) 2 + η max δ 2 + ρ .
As a consequence,
δ 2 γ ( γ + η max ) δ 2 ρ .
Since 0 δ 1 ,
2 γ ( γ + η max ) δ 2 γ ( γ + η max ) = γ η max = Δ .
It follows from (12) that δ Δ 2 ρ , and hence, δ 2 ρ Δ . By combining this with the trivial bound δ 1 , the assertion follows. □
Remark 2.
In the special case ρ = 0 , it implies | v ^ , v | = 1 , that is, v ^ = ± v , hence, the above theorem provides exact residual recovery. More generally, the direction error is controlled by the ratio of the perturbation tensor’s semi-norm to the fourth-order spectral gap. Thus, bounded perturbations do not bear major impact on the recovery when the fourth-order spectral gap remains sufficiently large.
We next establish some useful reconstruction-error bounds.
Corollary 1
(Controlled reconstruction-error estimate).
Assume the hypotheses of Theorem 2. Let x = x B + τ v ,   x B B , and let y = x + ξ , where ξ R n is an arbitrary error vector. Let
Q rec : = P B + v ^ v ^ and y ^ rec : = Q rec y .
Then the following hold:
1.
y ^ rec x 2 2 = τ 2 1 | v ^ , v | 2 + Q rec ξ 2 2 .
2.
y ^ rec x 2 2 τ 2 min 1 , 2 ρ Δ + Q rec ξ 2 2 .
Suppose additionally that an equal-rank PCA projector has the form
P PCA = P B + w w ,
where
w B , w 2 = 1 , w v .
Then
P PCA y x 2 2 = τ 2 + P PCA ξ 2 2 .
Moreover,
P PCA y x 2 2 y ^ rec x 2 2 = τ 2 | v ^ , v | 2 + | w , ξ | 2 | v ^ , ξ | 2 .
In particular, if ρ < Δ / 2 , then
P PCA y x 2 2 y ^ rec x 2 2 1 2 ρ Δ τ 2 + | w , ξ | 2 | v ^ , ξ | 2 .
Thus, a sufficient condition for residual recovery to have smaller squared error than equal-rank PCA is given by
| v ^ , ξ | 2 | w , ξ | 2 < 1 2 ρ Δ τ 2 .
The residual-recovery estimator can also be compared with the unaugmented rank-s PCA estimate
y ^ B : = P B y .
In this case,
y ^ B x 2 2 = τ 2 + P B ξ 2 2 ,
and
y ^ B x 2 2 y ^ rec x 2 2 = τ 2 | v ^ , v | 2 | v ^ , ξ | 2 .
Therefore, whenever ρ < Δ / 2 , a sufficient condition for the augmented estimator to improve upon rank-s PCA is
| v ^ , ξ | 2 < 1 2 ρ Δ τ 2 .
Proof. 
Since v ^ B , Q rec = P B + v ^ v ^ defines the orthogonal projector onto B span { v ^ } . Since x B B , we have:
Q rec x x = Q rec ( x B + τ v ) ( x B + τ v ) = τ v ^ v ^ v v .
The vector in (22) is clearly orthogonal to B. It is also orthogonal to v ^ , since
v ^ v ^ v v , v ^ = v ^ , v v , v ^ = 0 .
Hence,
Q rec x x range ( Q rec ) .
On the other hand,
Q rec ξ range ( Q rec ) .
The two vectors are therefore orthogonal. Since
y ^ rec x = Q rec x x + Q rec ξ ,
it is immediate that
y ^ rec x 2 2 = Q rec x x 2 2 + Q rec ξ 2 2 .
Furthermore,
Q rec x x 2 2 = τ 2 v ^ v ^ v v 2 2 = τ 2 1 | v ^ , v | 2 .
This proves (13). The estimate (14) follows directly from Theorem 2.
Now consider the equal-rank PCA projector P PCA = P B + w w . Since w v and v B , we have P PCA x = x B . Thus, P PCA x x = τ v . We note the vector v is orthogonal to the range of P PCA , while P PCA ξ belongs to that range. Therefore, the Pythagorean Theorem yields
P PCA y x 2 2 = τ 2 + P PCA ξ 2 2 ,
which proves (15).
Because w , v ^ B , we also have
P PCA ξ 2 2 = P B ξ 2 2 + | w , ξ | 2
and
Q rec ξ 2 2 = P B ξ 2 2 + | v ^ , ξ | 2 .
Subtracting (13) from (15) yields (16). If ρ < Δ / 2 , Theorem 2 shows
| v ^ , v | 2 1 2 ρ Δ ,
which proves (17) and the sufficient condition (18).
Lastly, since v B , P B x x = τ v , which is orthogonal to P B ξ . Hence,
y ^ B x 2 2 = τ 2 + P B ξ 2 2 .
Subtracting (13) gives (20). The sufficient condition (21) again follows from Theorem 2. □

5. A Three-Dimensional Example

We illustrate the residual recovery procedure with a finite data set in R 3 . Let e 1 , e 2 , e 3 denote the standard basis vectors in R 3 , and consider the eight centered data vectors
z 1 = 6 e 1 , z 2 = 6 e 1 , z 3 = 4 e 2 , z 4 = 4 e 2 , z 5 = 3 e 3 , z 6 = 3 e 3 , z 7 = 3 e 3 , z 8 = 3 e 3 .
Their mean is zero. The relative frequencies and the corresponding second- and fourth-order coefficients are carefully chosen to make the calculations more friendly. We summarize the parameters below: Preprints 224234 i001
The covariance matrix is
Σ ^ = 1 8 q = 1 8 z q z q = 9 0 0 0 4 0 0 0 9 2 .
Thus, rank-one PCA selects the subspace
B = span { e 1 } and P B = e 1 e 1 .
Since 9 > 9 2 > 4 , rank-two PCA selects span { e 1 , e 3 } . In particular, after the first PCA direction is removed, covariance prefers the nuisance direction e 3 to the structural direction e 2 .
The residual vectors are
r 1 = 0 , r 2 = 0 , r 3 = 4 e 2 , r 4 = 4 e 2 , r 5 = 3 e 3 , r 6 = 3 e 3 , r 7 = 3 e 3 , and r 8 = 3 e 3 .
Consequently, the residual fourth-order tensor is
C res = 64 e 2 4 + 81 2 e 3 4 .
For a unit vector
u = u 2 e 2 + u 3 e 3 B , u 2 2 + u 3 2 = 1 ,
the residual quartic form is
C res u 4 = 64 u 2 4 + 81 2 u 3 4 .
Since 81 / 2 < 64 , we have
C res u 4 64 u 2 4 + u 3 4 64 u 2 2 + u 3 2 2 = 64 .
Equality holds precisely when u = ± e 2 . Hence, the residual fourth-order method selects v ^ = ± e 2 . We now compare the resulting projections. Let y 0 = ( 6 , 4 , 1 ) be the observed vector, and let x 0 = ( 6 , 4 , 0 ) be the corresponding projected vector. The third coordinate of y 0 is therefore regarded as a nuisance component.
The rank-one PCA estimate is
y ^ PCA , 1 = e 1 e 1 y 0 = ( 6 , 0 , 0 ) ,
and its squared error is
y ^ PCA , 1 x 0 2 2 = 16 .
Rank-two PCA selects span { e 1 , e 3 } and therefore gives
y ^ PCA , 2 = e 1 e 1 + e 3 e 3 y 0 = ( 6 , 0 , 1 ) .
Its squared error is
y ^ PCA , 2 x 0 2 2 = 4 2 + 1 2 = 17 .
Thus, adding the second PCA direction admits the nuisance coordinate without recovering the missing structural component.
By contrast, the PCA plus residual-recovery estimator uses the projector
P rec = e 1 e 1 + e 2 e 2 .
It follows that
y ^ rec = P rec y 0 = ( 6 , 4 , 0 ) = x 0 ,
and hence
y ^ rec x 0 2 2 = 0 .
This example exhibits the separation analyzed in the preceding sections. The nuisance direction e 3 has a larger second-order coefficient than the structural direction e 2 : 9 2 > 4 , so residual PCA prefers e 3 . On the other hand, e 2 has the larger fourth-order coefficient: 64 > 81 2 , so residual fourth-order maximization selects e 2 .
In the notation of Theorem 2, we have
v = e 2 , w 1 = e 3 , γ = 64 , and η 1 = 81 2 .
The fourth-order spectral gap is therefore
Δ = γ η 1 = 64 81 2 = 47 2 .
Because the example is unperturbed, ρ = 0 , and the perturbation Theorem 2 gives exact recovery:
v ^ = ± v .
Thus, even at the same output rank, the fourth-order residual method recovers the structural direction missed by PCA while excluding the variance-dominant nuisance direction.

6. Conclusion

We have introduced a residual dimension-reduction procedure that combines a prescribed PCA subspace with a direction obtained by maximizing a quartic form on its orthogonal complement. The analysis identifies an orthogonal setting in which the quadratic and quartic criteria order the relevant directions differently. In this setting, PCA selects directions with the largest quadratic coefficients, whereas successive quartic maximization recovers structural directions with smaller quadratic coefficients but larger fourth-order tensor coefficients.
Under this model, the proposed procedure recovers a structural direction that may be removed by an equal-rank PCA projection. The improvement is therefore not merely a consequence of enlarging the projection subspace. For an arbitrary perturbation vector, we derived exact bounds for the squared reconstruction errors and explicit conditions under which the residual fourth-order projection improves upon both equal-rank PCA and the original unaugmented PCA projection.
Our residual recovery approach may be useful to supplement PCA- or SVD-based filtering in imaging and spatiotemporal signal processing. In particular, a dominant low-rank component may represent smooth background or clutter, while a weak feature of interest may hide in the residual.

References

  1. Pearson, K. On lines and planes of closest fit to systems of points in space. Philosophical Mag.>, 6th Ser. 1901, 2, 559–572. [Google Scholar] [CrossRef]
  2. Hotelling, H. Hotelling, Analysis of a complex of statistical variables into principal components. J. Educ. Psychol. 1933, 24, 417–441; 498–520. [Google Scholar] [CrossRef]
  3. Jolliffe, I. T. Principal Component Analysis, 2nd ed.; Springer: New York, 2002. [Google Scholar]
  4. Friedman, J. H.; Tukey, J. W. A projection pursuit algorithm for exploratory data analysis. IEEE Trans. Comput.> C-23 1974, 881–890. [Google Scholar] [CrossRef]
  5. Huber, P. J. Projection pursuit. Ann. Stat. 1985, 13, 435–475. [Google Scholar] [CrossRef]
  6. Comon, P. Comon, Independent component analysis, a new concept? Signal Process. 1994, 36, 287–314. [Google Scholar] [CrossRef]
  7. Hyvärinen, A.; Oja, E. Independent component analysis: algorithms and applications. Neural Netw. 2000, 13, 411–430. [Google Scholar] [CrossRef] [PubMed]
  8. Kolda, T. G.; Bader, B. W. Tensor decompositions and applications. SIAM Rev. 2009, 51, 455–500. [Google Scholar] [CrossRef]
  9. Qi, L. Eigenvalues of a real supersymmetric tensor. J. Symb. Comput. 2005, 40, 1302–1324. [Google Scholar] [CrossRef]
  10. Lim, L.-H. Singular values and eigenvalues of tensors: a variational approach. In Proceedings of the First IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP 2005); IEEE, 2005; pp. 129–132. [Google Scholar]
  11. Chang, K. C.; Pearson, K.; Zhang, T. On eigenvalue problems of real symmetric tensors. J. Math. Anal. Appl. 2009, 350, 416–422. [Google Scholar] [CrossRef]
  12. Kofidis, E.; Regalia, P. A. On the best rank-1 approximation of higher-order supersymmetric tensors. SIAM J. Matrix Anal. Appl. 2002, 23, 863–884. [Google Scholar] [CrossRef]
  13. Kolda, T. G.; Mayo, J. R. Shifted power method for computing tensor eigenpairs. SIAM J. Matrix Anal. Appl. 2011, 32, 1095–1124. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2026 MDPI (Basel, Switzerland) unless otherwise stated

Accessibility

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings