Regularized Least Squares Recursive Algorithm with Forgetting Factor for Identifying Parameters in the Grinding Process

JOURNAL OF MATHEMATICS(2022)

Cited 0|Views1
No score
Abstract
This paper investigates a parameter identification problem in the grinding process. Due to the data saturated phenomenon and the ill-posed of parameter identification inverse problem, this paper presents a regularized least squares recursive algorithm with a forgetting factor (RLSRAFF), the basic idea of which is to combine the forgetting factor with regularization parameters. Moreover, based on RLSRAFF, this paper verifies the recursive calculation of criterion function, analyzes the effect of calculation error from the gain matrix and proves the convergence of the proposed algorithm. Finally, effectiveness of RLSRAFF is verified by simulation experiments and grinding data. Compared with other algorithms, RLSRAFF can give a more convergence rate to the real data and reduce the error from the true value.
More
Translated text
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined