✦ LIBER ✦

Robustness of convergence in finite time for linear programming neural networks

✍ Scribed by Mauro Di Marco; Mauro Forti; Massimo Grazzini

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 121 KB
Volume: 34
Category: Article
ISSN: 0098-9886
DOI: 10.1002/cta.352

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Issues in convergence improvement for no

Issues in convergence improvement for non-linear finite element programs

✍ Sven K. Esche; Gary L. Kinzel; Taylan Altan 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 2 views

Systems of non-linear equations as they arise when analysing various physical phenomena and technological processes by the implicit Finite Element Method (FEM) are commonly solved by the Newton-Raphson method. The modelling of sheet metal forming processes is one example of highly non-linear problem

A Robust Procedure for On-Line Learning

A Robust Procedure for On-Line Learning of Neural Networks in Control Strategy Development

✍ L. Ender; R. Maciel Filho 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 German ⚖ 84 KB 👁 2 views

Focusing on one component each time—comp

Focusing on one component each time—comparison of single and multiple component prediction algorithms in artificial neural networks for x-ray fluorescence analysis

✍ Liqiang Luo; Ang Ji; Guangzu Ma; Changlin Guo 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 438 KB 👁 2 views

An algorithm of single component prediction based on backward error propagation is proposed, in which only one component concentration in a multivariate system is predicted each time. The algorithm was compared with a multiple component prediction model. In general, the predictive accuracy of the si