Minimal storage band elimination:
A variation of Gaussian elimination is presented for solving band systems of linear equations on computers with limited core storage, without the use of auxiliary storage such as disk or tape. The method is based on the somewhat unusual idea of recomputing rather than saving most nonzero coefficient...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
[New Haven, Conn.]
1977 circa
|
| Series: | Yale University <New Haven, Conn.> / Department of Computer Science: Research report
105 |
| Subjects: | |
| Summary: | A variation of Gaussian elimination is presented for solving band systems of linear equations on computers with limited core storage, without the use of auxiliary storage such as disk or tape. The method is based on the somewhat unusual idea of recomputing rather than saving most nonzero coefficients in the reduced triangular system, thus trading an increase in work for a decrease in storage. For a five-point problem on an n x n grid, the storage required is approx. n-squared versus approx. n-cubed for band elimination, while surprisingly the work required at most doubles. (Author). |
| Physical Description: | 16 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009905437 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 941121s1977 |||| 00||| engod | ||
| 035 | |a (OCoLC)227477545 | ||
| 035 | |a (DE-599)BVBBV009905437 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Eisenstat, Stanley C. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Minimal storage band elimination |c S. C. Eisenstat ; M. H. Schultz ; A. H. Sherman |
| 264 | 1 | |a [New Haven, Conn.] |c 1977 circa | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Yale University <New Haven, Conn.> / Department of Computer Science: Research report |v 105 | |
| 520 | 3 | |a A variation of Gaussian elimination is presented for solving band systems of linear equations on computers with limited core storage, without the use of auxiliary storage such as disk or tape. The method is based on the somewhat unusual idea of recomputing rather than saving most nonzero coefficients in the reduced triangular system, thus trading an increase in work for a decrease in storage. For a five-point problem on an n x n grid, the storage required is approx. n-squared versus approx. n-cubed for band elimination, while surprisingly the work required at most doubles. (Author). | |
| 650 | 7 | |a Computer Hardware |2 scgdst | |
| 650 | 7 | |a Computer Programming and Software |2 scgdst | |
| 650 | 7 | |a Computer programming |2 dtict | |
| 650 | 7 | |a Data storage systems |2 dtict | |
| 650 | 7 | |a Elimination |2 dtict | |
| 650 | 7 | |a Gaussian quadrature |2 dtict | |
| 650 | 7 | |a Limitations |2 dtict | |
| 650 | 7 | |a Linear algebra |2 dtict | |
| 650 | 7 | |a Linear algebraic equations |2 dtict | |
| 650 | 7 | |a Memory devices |2 dtict | |
| 650 | 7 | |a Numerical analysis |2 dtict | |
| 650 | 7 | |a Solutions(general) |2 dtict | |
| 650 | 7 | |a Theoretical Mathematics |2 scgdst | |
| 700 | 1 | |a Schultz, Martin H. |e Verfasser |4 aut | |
| 700 | 1 | |a Sherman, A. H. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Research report |t Yale University <New Haven, Conn.> |v 105 |w (DE-604)BV006663362 |9 105 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006560363 | ||
Record in the Search Index
| _version_ | 1804124267590189056 |
|---|---|
| any_adam_object | |
| author | Eisenstat, Stanley C. Schultz, Martin H. Sherman, A. H. |
| author_facet | Eisenstat, Stanley C. Schultz, Martin H. Sherman, A. H. |
| author_role | aut aut aut |
| author_sort | Eisenstat, Stanley C. |
| author_variant | s c e sc sce m h s mh mhs a h s ah ahs |
| building | Verbundindex |
| bvnumber | BV009905437 |
| ctrlnum | (OCoLC)227477545 (DE-599)BVBBV009905437 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02181nam a2200457 cb4500</leader><controlfield tag="001">BV009905437</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">941121s1977 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227477545</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009905437</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Eisenstat, Stanley C.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Minimal storage band elimination</subfield><subfield code="c">S. C. Eisenstat ; M. H. Schultz ; A. H. Sherman</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">[New Haven, Conn.]</subfield><subfield code="c">1977 circa</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Yale University <New Haven, Conn.> / Department of Computer Science: Research report</subfield><subfield code="v">105</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">A variation of Gaussian elimination is presented for solving band systems of linear equations on computers with limited core storage, without the use of auxiliary storage such as disk or tape. The method is based on the somewhat unusual idea of recomputing rather than saving most nonzero coefficients in the reduced triangular system, thus trading an increase in work for a decrease in storage. For a five-point problem on an n x n grid, the storage required is approx. n-squared versus approx. n-cubed for band elimination, while surprisingly the work required at most doubles. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Hardware</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Programming and Software</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer programming</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data storage systems</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Elimination</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Gaussian quadrature</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Limitations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Linear algebra</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Linear algebraic equations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Memory devices</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Numerical analysis</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Solutions(general)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theoretical Mathematics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Schultz, Martin H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sherman, A. H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Research report</subfield><subfield code="t">Yale University <New Haven, Conn.></subfield><subfield code="v">105</subfield><subfield code="w">(DE-604)BV006663362</subfield><subfield code="9">105</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006560363</subfield></datafield></record></collection> |
| id | DE-604.BV009905437 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:42:57Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006560363 |
| oclc_num | 227477545 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 S. |
| publishDate | 1977 |
| publishDateSearch | 1977 |
| publishDateSort | 1977 |
| record_format | marc |
| series2 | Yale University <New Haven, Conn.> / Department of Computer Science: Research report |
| spelling | Eisenstat, Stanley C. Verfasser aut Minimal storage band elimination S. C. Eisenstat ; M. H. Schultz ; A. H. Sherman [New Haven, Conn.] 1977 circa 16 S. txt rdacontent n rdamedia nc rdacarrier Yale University <New Haven, Conn.> / Department of Computer Science: Research report 105 A variation of Gaussian elimination is presented for solving band systems of linear equations on computers with limited core storage, without the use of auxiliary storage such as disk or tape. The method is based on the somewhat unusual idea of recomputing rather than saving most nonzero coefficients in the reduced triangular system, thus trading an increase in work for a decrease in storage. For a five-point problem on an n x n grid, the storage required is approx. n-squared versus approx. n-cubed for band elimination, while surprisingly the work required at most doubles. (Author). Computer Hardware scgdst Computer Programming and Software scgdst Computer programming dtict Data storage systems dtict Elimination dtict Gaussian quadrature dtict Limitations dtict Linear algebra dtict Linear algebraic equations dtict Memory devices dtict Numerical analysis dtict Solutions(general) dtict Theoretical Mathematics scgdst Schultz, Martin H. Verfasser aut Sherman, A. H. Verfasser aut Department of Computer Science: Research report Yale University <New Haven, Conn.> 105 (DE-604)BV006663362 105 |
| spellingShingle | Eisenstat, Stanley C. Schultz, Martin H. Sherman, A. H. Minimal storage band elimination Computer Hardware scgdst Computer Programming and Software scgdst Computer programming dtict Data storage systems dtict Elimination dtict Gaussian quadrature dtict Limitations dtict Linear algebra dtict Linear algebraic equations dtict Memory devices dtict Numerical analysis dtict Solutions(general) dtict Theoretical Mathematics scgdst |
| title | Minimal storage band elimination |
| title_auth | Minimal storage band elimination |
| title_exact_search | Minimal storage band elimination |
| title_full | Minimal storage band elimination S. C. Eisenstat ; M. H. Schultz ; A. H. Sherman |
| title_fullStr | Minimal storage band elimination S. C. Eisenstat ; M. H. Schultz ; A. H. Sherman |
| title_full_unstemmed | Minimal storage band elimination S. C. Eisenstat ; M. H. Schultz ; A. H. Sherman |
| title_short | Minimal storage band elimination |
| title_sort | minimal storage band elimination |
| topic | Computer Hardware scgdst Computer Programming and Software scgdst Computer programming dtict Data storage systems dtict Elimination dtict Gaussian quadrature dtict Limitations dtict Linear algebra dtict Linear algebraic equations dtict Memory devices dtict Numerical analysis dtict Solutions(general) dtict Theoretical Mathematics scgdst |
| topic_facet | Computer Hardware Computer Programming and Software Computer programming Data storage systems Elimination Gaussian quadrature Limitations Linear algebra Linear algebraic equations Memory devices Numerical analysis Solutions(general) Theoretical Mathematics |
| volume_link | (DE-604)BV006663362 |
| work_keys_str_mv | AT eisenstatstanleyc minimalstoragebandelimination AT schultzmartinh minimalstoragebandelimination AT shermanah minimalstoragebandelimination |