A Cartesian parallel nested dissectional algorithm:
Abstract: "This paper is concerned with the distributed parallel computation of an ordering for a symmetric positive definite sparse matrix. The purpose of the ordering is to limit fill and enhance concurrency in the subsequent computation of the Cholesky factorization of the matrix. We use a g...
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Urbana, Ill.
University of Illinois at Urbana-Champaign, Dept. of Computer Science
1992
|
| Schlagwörter: | |
| Zusammenfassung: | Abstract: "This paper is concerned with the distributed parallel computation of an ordering for a symmetric positive definite sparse matrix. The purpose of the ordering is to limit fill and enhance concurrency in the subsequent computation of the Cholesky factorization of the matrix. We use a geometric approach to nested dissection based on a given Cartesian embedding of the graph of the matrix in Euclidean space. The resulting algorithm can be implemented efficiently on massively parallel, distributed memory computers |
| Umfang: | 23 Bl. ill. 28 cm |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035638906 | ||
| 003 | DE-604 | ||
| 005 | 20090728 | ||
| 007 | t| | ||
| 008 | 090721s1992 xx a||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)27639332 | ||
| 035 | |a (DE-599)BVBBV035638906 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 082 | 0 | |a 510.78 | |
| 088 | |a UILU-ENG-92-1752 | ||
| 088 | |a UIUCDCS-R-92-1772 | ||
| 100 | 1 | |a Heath, Michael T. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A Cartesian parallel nested dissectional algorithm |c by Michael T. Heath and Padma Raghavan |
| 246 | 1 | 3 | |a UIUCDCS-R 92 1772 |
| 264 | 1 | |a Urbana, Ill. |b University of Illinois at Urbana-Champaign, Dept. of Computer Science |c 1992 | |
| 300 | |a 23 Bl. |b ill. |c 28 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | |a Abstract: "This paper is concerned with the distributed parallel computation of an ordering for a symmetric positive definite sparse matrix. The purpose of the ordering is to limit fill and enhance concurrency in the subsequent computation of the Cholesky factorization of the matrix. We use a geometric approach to nested dissection based on a given Cartesian embedding of the graph of the matrix in Euclidean space. The resulting algorithm can be implemented efficiently on massively parallel, distributed memory computers | ||
| 650 | 4 | |a Matrices | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Matrices | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 700 | 1 | |a Raghavan, Padma |e Verfasser |4 aut | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-017693735 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6132-1772 |
|---|---|
| DE-BY-TUM_katkey | 1700591 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010285397 |
| _version_ | 1821933718592290816 |
| any_adam_object | |
| author | Heath, Michael T. Raghavan, Padma |
| author_facet | Heath, Michael T. Raghavan, Padma |
| author_role | aut aut |
| author_sort | Heath, Michael T. |
| author_variant | m t h mt mth p r pr |
| building | Verbundindex |
| bvnumber | BV035638906 |
| ctrlnum | (OCoLC)27639332 (DE-599)BVBBV035638906 |
| dewey-full | 510.78 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.78 |
| dewey-search | 510.78 |
| dewey-sort | 3510.78 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01643nam a2200361 c 4500</leader><controlfield tag="001">BV035638906</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090728 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">090721s1992 xx a||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27639332</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035638906</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</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="082" ind1="0" ind2=" "><subfield code="a">510.78</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UILU-ENG-92-1752</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UIUCDCS-R-92-1772</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Heath, Michael T.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Cartesian parallel nested dissectional algorithm</subfield><subfield code="c">by Michael T. Heath and Padma Raghavan</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">UIUCDCS-R 92 1772</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="b">University of Illinois at Urbana-Champaign, Dept. of Computer Science</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23 Bl.</subfield><subfield code="b">ill.</subfield><subfield code="c">28 cm</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="520" ind1=" " ind2=" "><subfield code="a">Abstract: "This paper is concerned with the distributed parallel computation of an ordering for a symmetric positive definite sparse matrix. The purpose of the ordering is to limit fill and enhance concurrency in the subsequent computation of the Cholesky factorization of the matrix. We use a geometric approach to nested dissection based on a given Cartesian embedding of the graph of the matrix in Euclidean space. The resulting algorithm can be implemented efficiently on massively parallel, distributed memory computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matrices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matrices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Raghavan, Padma</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017693735</subfield></datafield></record></collection> |
| id | DE-604.BV035638906 |
| illustrated | Illustrated |
| indexdate | 2024-12-20T13:39:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017693735 |
| oclc_num | 27639332 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 23 Bl. ill. 28 cm |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | University of Illinois at Urbana-Champaign, Dept. of Computer Science |
| record_format | marc |
| spellingShingle | Heath, Michael T. Raghavan, Padma A Cartesian parallel nested dissectional algorithm Matrices Parallel processing (Electronic computers) |
| title | A Cartesian parallel nested dissectional algorithm |
| title_alt | UIUCDCS-R 92 1772 |
| title_auth | A Cartesian parallel nested dissectional algorithm |
| title_exact_search | A Cartesian parallel nested dissectional algorithm |
| title_full | A Cartesian parallel nested dissectional algorithm by Michael T. Heath and Padma Raghavan |
| title_fullStr | A Cartesian parallel nested dissectional algorithm by Michael T. Heath and Padma Raghavan |
| title_full_unstemmed | A Cartesian parallel nested dissectional algorithm by Michael T. Heath and Padma Raghavan |
| title_short | A Cartesian parallel nested dissectional algorithm |
| title_sort | a cartesian parallel nested dissectional algorithm |
| topic | Matrices Parallel processing (Electronic computers) |
| topic_facet | Matrices Parallel processing (Electronic computers) |
| work_keys_str_mv | AT heathmichaelt acartesianparallelnesteddissectionalalgorithm AT raghavanpadma acartesianparallelnesteddissectionalalgorithm AT heathmichaelt uiucdcsr921772 AT raghavanpadma uiucdcsr921772 |