摘要

This work is devoted to studying the problem of approximating a given matrix by the product of two low-rank structured matrix which arises in the material processing. Firstly, we analyse some properties of the original problem and utilize the alternating least squares method to reformulate it into two subproblems. Then by using the Gramian representation and a Vandermonde-like transformation, the feasible sets of the subproblems are characterized, which makes them be respectively transformed into two unconstrained minimization problems. Finally, we derive the expressions of the gradients of the objective functions and apply the gradient descent algorithm to solve them. Numerical examples are tested to show that our method performs well in terms of the residual error of the objective function.