Abstract
Two recurrent neural networks are presented for LU decomposition and Cholesky factorization. The proposed recurrent neural networks consist of two bidirectionally connected layers and each layer consists of an array of neurons. The proposed recurrent neural networks are proven to be asymptotically stable in the large and capable of LU decomposition and Cholesky factorization. © 1993.
| Original language | English |
|---|---|
| Pages (from-to) | 1-8 |
| Journal | Mathematical and Computer Modelling |
| Volume | 18 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - Sept 1993 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'Recurrent neural networks for LU decomposition and Cholesky factorization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver