Many recent applications involve distributed signal processing where a source signal is observed by, say, $p$ local receiver-transmitters and then transmitted to a reconstruction center for the signal estimation. An optimal determination of the receiver-transmitters and the reconstruction center requires extensions of the Karhunen-Loève transform (KLT) and Wiener filter. In this paper, the associated extensions are provided. The proposed optimal multilinear filter is a generalization of the Wiener filter and consists of $p$ terms where each term is associated with a local receiver-transmitter. For the case when the receiver-transmitters must reduce the dimensionality of the observed signals, two associated techniques are proposed: the multilinear KLT-1 and multilinear KLT-2. The multilinear KLT-1 is constructed in terms of pseudo-inverse matrices and therefore always exists. The multilinear KLT-2 is given in terms of non-singular matrices and it may provide a higher associated accuracy than that of the multilinear KLT-1. All three proposed techniques are based on a reduction of the original problem to $p$ separate error minimization problems with small matrices. This allows us to provide a fast computational procedure for the multilinear filter, and decrease the computational cost for constructing the multilinear KLT-1 and KLT-2.
Minimizing a sum of Euclidean norms (MSEN) is a classic minimization problem widely used in several applications, including the determination of single and multifacility locations. The objective of the MSEN problem is to find a vector such that it minimizes a sum of Euclidean norms of systems of equations. In this paper, we propose a modification of the MSEN problem, which we call the problem of minimizing a sum of squared Euclidean norms with rank constraint, or simply the MSSEN-RC problem. The objective of the MSSEN-RC problem is to obtain a vector and rank-constrained matrices such that they minimize a sum of squared Euclidean norms of systems of equations. Additionally, we present an algorithm based on the regularized alternating least-squares (RALS) method for solving the MSSEN-RC problem. We show that given the existence of critical points of the alternating least-squares method, the limit points of the converging sequences of the RALS are the critical points of the objective function. Finally, we show numerical experiments that demonstrate the efficiency of the RALS method.
13 September 2024 in Journal of Mathematics and Computer Science
This paper introduces a novel approach for estimating the Moore-Penrose inverse. The method proposed relies on Tikhonov regularization, which requires the computation of all positive singular values of an \(m \times n\) matrix. Additionally, we present a highly efficient and accurate procedure for estimating these singular values. This procedure assumes the well-determined numerical rank of matrices \(A^*A\) (if \(m \geq n\)) and \(AA^*\) (if \(m \leq n\)). Furthermore, we demonstrate the application of our proposed method in solving linear discrete well-posed problems. The paper concludes with numerical simulations to illustrate the advantages of our novel approach. Notably, we compare the execution time associated with our technique to that of some relevant methods in the existing literature, demonstrating that our method outperforms others in terms of computational efficiency. To further substantiate our findings, we conduct computational experiments to measure execution time and speedup. The results affirm the efficiency of our proposed method, showcasing reduced execution times compared to other methods. This contributes to establishing our approach's practical viability and effectiveness in diverse applications.