Symmetric orderings for unsymmetric sparse matrices:
Abstract: "The efficient solution of large sparse systems of linear equations is one of the key tasks in many computationally intensive scientific applications. The parallelization and efficiency of codes for solving these systems heavily depends on the sparsity structure of the matrices. As th...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
1989
|
| Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
901 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The efficient solution of large sparse systems of linear equations is one of the key tasks in many computationally intensive scientific applications. The parallelization and efficiency of codes for solving these systems heavily depends on the sparsity structure of the matrices. As the variety of different structured sparse matrices is large, there is no uniform method which is well suited for the whole range of sparse matrices. Investigations in the problem of solving large systems of unsymmetric sparse matrices has led to the development of a collection of new ordering algorithms (heuristics) for unsymmetric sparse matrices." |
| Beschreibung: | 14 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008949518 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)22466835 | ||
| 035 | |a (DE-599)BVBBV008949518 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Wijshoff, Harry A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Symmetric orderings for unsymmetric sparse matrices |c Harry A. G. Wijshoff |
| 264 | 1 | |a Urbana, Ill. |c 1989 | |
| 300 | |a 14 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 901 | |
| 520 | 3 | |a Abstract: "The efficient solution of large sparse systems of linear equations is one of the key tasks in many computationally intensive scientific applications. The parallelization and efficiency of codes for solving these systems heavily depends on the sparsity structure of the matrices. As the variety of different structured sparse matrices is large, there is no uniform method which is well suited for the whole range of sparse matrices. Investigations in the problem of solving large systems of unsymmetric sparse matrices has led to the development of a collection of new ordering algorithms (heuristics) for unsymmetric sparse matrices." | |
| 650 | 4 | |a Differential equations, Linear | |
| 650 | 4 | |a Matrices | |
| 830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 901 |w (DE-604)BV008930033 |9 901 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005905175 | ||
Datensatz im Suchindex
| _version_ | 1804123282645975040 |
|---|---|
| any_adam_object | |
| author | Wijshoff, Harry A. |
| author_facet | Wijshoff, Harry A. |
| author_role | aut |
| author_sort | Wijshoff, Harry A. |
| author_variant | h a w ha haw |
| building | Verbundindex |
| bvnumber | BV008949518 |
| ctrlnum | (OCoLC)22466835 (DE-599)BVBBV008949518 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01617nam a2200301 cb4500</leader><controlfield tag="001">BV008949518</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22466835</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008949518</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wijshoff, Harry A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Symmetric orderings for unsymmetric sparse matrices</subfield><subfield code="c">Harry A. G. Wijshoff</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 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">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">901</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The efficient solution of large sparse systems of linear equations is one of the key tasks in many computationally intensive scientific applications. The parallelization and efficiency of codes for solving these systems heavily depends on the sparsity structure of the matrices. As the variety of different structured sparse matrices is large, there is no uniform method which is well suited for the whole range of sparse matrices. Investigations in the problem of solving large systems of unsymmetric sparse matrices has led to the development of a collection of new ordering algorithms (heuristics) for unsymmetric sparse matrices."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Differential equations, Linear</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matrices</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">901</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">901</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905175</subfield></datafield></record></collection> |
| id | DE-604.BV008949518 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905175 |
| oclc_num | 22466835 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 14 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
| series2 | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
| spelling | Wijshoff, Harry A. Verfasser aut Symmetric orderings for unsymmetric sparse matrices Harry A. G. Wijshoff Urbana, Ill. 1989 14 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 901 Abstract: "The efficient solution of large sparse systems of linear equations is one of the key tasks in many computationally intensive scientific applications. The parallelization and efficiency of codes for solving these systems heavily depends on the sparsity structure of the matrices. As the variety of different structured sparse matrices is large, there is no uniform method which is well suited for the whole range of sparse matrices. Investigations in the problem of solving large systems of unsymmetric sparse matrices has led to the development of a collection of new ordering algorithms (heuristics) for unsymmetric sparse matrices." Differential equations, Linear Matrices Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 901 (DE-604)BV008930033 901 |
| spellingShingle | Wijshoff, Harry A. Symmetric orderings for unsymmetric sparse matrices Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Differential equations, Linear Matrices |
| title | Symmetric orderings for unsymmetric sparse matrices |
| title_auth | Symmetric orderings for unsymmetric sparse matrices |
| title_exact_search | Symmetric orderings for unsymmetric sparse matrices |
| title_full | Symmetric orderings for unsymmetric sparse matrices Harry A. G. Wijshoff |
| title_fullStr | Symmetric orderings for unsymmetric sparse matrices Harry A. G. Wijshoff |
| title_full_unstemmed | Symmetric orderings for unsymmetric sparse matrices Harry A. G. Wijshoff |
| title_short | Symmetric orderings for unsymmetric sparse matrices |
| title_sort | symmetric orderings for unsymmetric sparse matrices |
| topic | Differential equations, Linear Matrices |
| topic_facet | Differential equations, Linear Matrices |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT wijshoffharrya symmetricorderingsforunsymmetricsparsematrices |