Toward efficacy of piecewise polynomial truncated singular value decomposition algorithm in moving force identification

Abstract

This article introduces and evaluates the piecewise polynomial truncated singular value decomposition algorithm toward an effective use for moving force identification. Suffering from numerical non-uniqueness and noise disturbance, the moving force identification is known to be associated with ill-posedness. An important method for solving this problem is the truncated singular value decomposition algorithm, but the truncated small singular values removed by truncated singular value decomposition may contain some useful information. The piecewise polynomial truncated singular value decomposition algorithm extracts the useful responses from truncated small singular values and superposes it into the solution of truncated singular value decomposition, which can be useful in moving force identification. In this article, a comprehensive numerical simulation is set up to evaluate piecewise polynomial truncated singular value decomposition, and compare this technique against truncated singular value decomposition and singular value decomposition. Numerically simulated data are processed to validate the novel method, which show that regularization matrix [Formula: see text] and truncating point [Formula: see text] are the two most important governing factors affecting identification accuracy and ill-posedness immunity of piecewise polynomial truncated singular value decomposition.