Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Toward efficacy of piecewise polynomial truncated singular value decomposition algorithm in... 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 L and truncating point k are the two most important governing factors affecting identification accuracy and ill-posedness immunity of piecewise polynomial truncated singular value decomposition. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Advances in Structural Engineering SAGE

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

Loading next page...
 
/lp/sage/toward-efficacy-of-piecewise-polynomial-truncated-singular-value-puUXKNVq2s

References (37)

Publisher
SAGE
Copyright
© The Author(s) 2019
ISSN
1369-4332
eISSN
2048-4011
DOI
10.1177/1369433219849817
Publisher site
See Article on Publisher Site

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 L and truncating point k are the two most important governing factors affecting identification accuracy and ill-posedness immunity of piecewise polynomial truncated singular value decomposition.

Journal

Advances in Structural EngineeringSAGE

Published: Sep 1, 2019

There are no references for this article.