Abstract
This paper compares the performance by using constrained learning algorithm (CLA) and recursive least square algorithm (RLSA) to solve linear simultaneous equations. It was found in experiments that the convergent speed for this CLA is much faster than the recursive least square back propagation (RLS-BP) algorithm. Finally, related experimental results are presented. © Springer-Verlag 2003.
Cite
CITATION STYLE
Huang, D. S. (2004). On the comparisons between RLSA and CLA for solving arbitrary linear simultaneous equations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2690, 169–176. https://doi.org/10.1007/978-3-540-45080-1_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
