Skip to main content

On the Comparisons between RLSA and CLA for Solving Arbitrary Linear Simultaneous Equations

  • Conference paper
Intelligent Data Engineering and Automated Learning (IDEAL 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2690))

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.

This work was supported by NSF of China and the Grant of “Hundred Talents Program" of Chinese Academy of Sciences of China.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Huang, D.S.: Systematic Theory of Neural Network for Pattern Recognition. Publishing House of Electronic Industry, Beijing, China (1996)

    Google Scholar 

  2. Huang, D.S.: One-Layer Linear Perceptron for the Inversion of Nonsingular Matrix. In: IC On ROVPIA 1996, Ipoh, Malaysia, November 28 30, pp. 639–643 (1996)

    Google Scholar 

  3. Huang, D.S., Zhao, M.S.: A Neural Network Based Factorization Model for Polynomials in Several Elements. In: 2000 5th International Conference on Signal Processing Proceedings (WCC2000-ICSP2000), August 21–25, pp. 1617–1622. Beijing, China (2000)

    Google Scholar 

  4. Huang, D.S.: Application of neural networks to finding real roots of polynomials in one element. In: ICONIP-2000 Proceedings, Taejon, Korea, November 14-17, vol. II, pp. 1108–1113 (2000)

    Google Scholar 

  5. Rumelhart, D.E., Hinton, G.E., Williams, R.J.: Learning Representations by Backpropagating Errors. Nature 323, 533–536 (1986)

    Article  Google Scholar 

  6. Jiguni, Y., Sakai, H., Tokumaru, H.: A Real-Time Learning Algorithm for a Multilayered Neural Network Based on the Extended Kalman Filter. IEEE Trans. SP 40(4), 959–966 (1992)

    Article  Google Scholar 

  7. Huang, D.S., Lv, X.X., Yuan, K.P.: A Study of Backpropagation Learning Algorithm of Multilayer Perceptron Networks Based on Recursive Least Squares. In: Proc. of the 6th Japan-China International Conference on Computer Applications, Sapporo, Japan, September 16-18, vol. (J-4), pp. 169–172 (1994)

    Google Scholar 

  8. Karras, D.A., Perantonis, S.J.: An Efficient Constrained Training Algorithm for Feedforward Networks. IEEE Trans. Neural Networks 6, 1420–1434 (1995)

    Article  Google Scholar 

  9. Huang, D.S., Chi, Z.: Finding Complex Roots of Polynomials by Feedforward Neural Networks. In: 2001 Int. Joint Conf. On Neural Networks (IJCNN2001), Washington, DC, July 15-19, pp. 13–18 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, DS. (2003). On the Comparisons between RLSA and CLA for Solving Arbitrary Linear Simultaneous Equations. In: Liu, J., Cheung, Ym., Yin, H. (eds) Intelligent Data Engineering and Automated Learning. IDEAL 2003. Lecture Notes in Computer Science, vol 2690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45080-1_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45080-1_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40550-4

  • Online ISBN: 978-3-540-45080-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics