Muralidharan, SK and Rajagopal, KS and Janardhan, S (1976) Solution of a large set of simultaneous linear equations by matrix partitioning using random access storage. Technical Report. National Aeronautical Laboratory, Bangalore, India.
![[img]](https://nal-ir.nal.res.in/style/images/fileicons/application_pdf.png) |
PDF
tr_pd_tm_ma_102.3_76_txt.pdf Restricted to Repository staff only Download (2MB) |
![[img]](https://nal-ir.nal.res.in/style/images/fileicons/other.png) |
Indexer Terms (Generate index codes conversion from application/pdf to indexcodes)
indexcodes.txt Restricted to Repository staff only Download (2kB) |
Abstract
The solution of a set of linear algebraic equations has always been a fascinating and challenging field, justifying a lot of research investigation. The advent of digital computers has greatly facilitated these investigations and made it possible to extend the solution procedure to larger systems. However9 the physically available core memory of the computer can restrict the problem size. This difficulty can be overcome by using random access devices such as magnetic drums and discs. In this report we present an algorithm which can be adapted to a system having random access storage.
| Item Type: | Monograph (Technical Report) |
|---|---|
| Uncontrolled Keywords: | Linear algebraic equations;Magnetic drums;Algorithm |
| Subjects: | MATHEMATICAL AND COMPUTER SCIENCES > Mathematical and Computer Scienes(General) |
| Depositing User: | M/S ICAST NAL |
| Date Deposited: | 06 Nov 2006 |
| Last Modified: | 24 May 2010 04:22 |
| URI: | http://nal-ir.nal.res.in/id/eprint/3176 |
Actions (login required)
 |
View Item |
