A parallel algorithm for large sparse symbolic and numeric Cholesky facto rization on a multiprocessor:
We develop an algorithm for computing the symbolic and numeric Cholesky factorization of a large sparse symmetric positive definite matrix. The algorithm is intended for a message-passing multiprocessor system, such as the hypercube, and is based on the concept of elimination forests. In addition, w...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Ithaca, New York
1986
|
| Series: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
733 |
| Subjects: | |
| Summary: | We develop an algorithm for computing the symbolic and numeric Cholesky factorization of a large sparse symmetric positive definite matrix. The algorithm is intended for a message-passing multiprocessor system, such as the hypercube, and is based on the concept of elimination forests. In addition, we provide an algorithm for computing these forests along with a discussion of the algorithm's complexity and a proof of its correctness. We also examine the related issue of load balancing. |
| Physical Description: | 28 S.5 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010592982 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960131s1986 |||| 00||| engod | ||
| 035 | |a (OCoLC)14906722 | ||
| 035 | |a (DE-599)BVBBV010592982 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Zmijewski, Earl |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A parallel algorithm for large sparse symbolic and numeric Cholesky facto rization on a multiprocessor |c Earl Zmijewski ; John R. Gilbert |
| 264 | 1 | |a Ithaca, New York |c 1986 | |
| 300 | |a 28 S.5 | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 733 | |
| 520 | 3 | |a We develop an algorithm for computing the symbolic and numeric Cholesky factorization of a large sparse symmetric positive definite matrix. The algorithm is intended for a message-passing multiprocessor system, such as the hypercube, and is based on the concept of elimination forests. In addition, we provide an algorithm for computing these forests along with a discussion of the algorithm's complexity and a proof of its correctness. We also examine the related issue of load balancing. | |
| 650 | 4 | |a Matrices | |
| 650 | 4 | |a Multiprocessors | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 700 | 1 | |a Gilbert, John R. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 733 |w (DE-604)BV006185504 |9 733 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007063791 | ||
Record in the Search Index
| _version_ | 1804125063937523712 |
|---|---|
| any_adam_object | |
| author | Zmijewski, Earl Gilbert, John R. |
| author_facet | Zmijewski, Earl Gilbert, John R. |
| author_role | aut aut |
| author_sort | Zmijewski, Earl |
| author_variant | e z ez j r g jr jrg |
| building | Verbundindex |
| bvnumber | BV010592982 |
| ctrlnum | (OCoLC)14906722 (DE-599)BVBBV010592982 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01630nam a2200325 cb4500</leader><controlfield tag="001">BV010592982</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960131s1986 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)14906722</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010592982</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">Zmijewski, Earl</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A parallel algorithm for large sparse symbolic and numeric Cholesky facto rization on a multiprocessor</subfield><subfield code="c">Earl Zmijewski ; John R. Gilbert</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">28 S.5</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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">733</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We develop an algorithm for computing the symbolic and numeric Cholesky factorization of a large sparse symmetric positive definite matrix. The algorithm is intended for a message-passing multiprocessor system, such as the hypercube, and is based on the concept of elimination forests. In addition, we provide an algorithm for computing these forests along with a discussion of the algorithm's complexity and a proof of its correctness. We also examine the related issue of load balancing.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matrices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</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">Gilbert, John R.</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: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">733</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">733</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007063791</subfield></datafield></record></collection> |
| id | DE-604.BV010592982 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:37Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007063791 |
| oclc_num | 14906722 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 28 S.5 |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Zmijewski, Earl Verfasser aut A parallel algorithm for large sparse symbolic and numeric Cholesky facto rization on a multiprocessor Earl Zmijewski ; John R. Gilbert Ithaca, New York 1986 28 S.5 txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 733 We develop an algorithm for computing the symbolic and numeric Cholesky factorization of a large sparse symmetric positive definite matrix. The algorithm is intended for a message-passing multiprocessor system, such as the hypercube, and is based on the concept of elimination forests. In addition, we provide an algorithm for computing these forests along with a discussion of the algorithm's complexity and a proof of its correctness. We also examine the related issue of load balancing. Matrices Multiprocessors Parallel processing (Electronic computers) Gilbert, John R. Verfasser aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 733 (DE-604)BV006185504 733 |
| spellingShingle | Zmijewski, Earl Gilbert, John R. A parallel algorithm for large sparse symbolic and numeric Cholesky facto rization on a multiprocessor Matrices Multiprocessors Parallel processing (Electronic computers) |
| title | A parallel algorithm for large sparse symbolic and numeric Cholesky facto rization on a multiprocessor |
| title_auth | A parallel algorithm for large sparse symbolic and numeric Cholesky facto rization on a multiprocessor |
| title_exact_search | A parallel algorithm for large sparse symbolic and numeric Cholesky facto rization on a multiprocessor |
| title_full | A parallel algorithm for large sparse symbolic and numeric Cholesky facto rization on a multiprocessor Earl Zmijewski ; John R. Gilbert |
| title_fullStr | A parallel algorithm for large sparse symbolic and numeric Cholesky facto rization on a multiprocessor Earl Zmijewski ; John R. Gilbert |
| title_full_unstemmed | A parallel algorithm for large sparse symbolic and numeric Cholesky facto rization on a multiprocessor Earl Zmijewski ; John R. Gilbert |
| title_short | A parallel algorithm for large sparse symbolic and numeric Cholesky facto rization on a multiprocessor |
| title_sort | a parallel algorithm for large sparse symbolic and numeric cholesky facto rization on a multiprocessor |
| topic | Matrices Multiprocessors Parallel processing (Electronic computers) |
| topic_facet | Matrices Multiprocessors Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT zmijewskiearl aparallelalgorithmforlargesparsesymbolicandnumericcholeskyfactorizationonamultiprocessor AT gilbertjohnr aparallelalgorithmforlargesparsesymbolicandnumericcholeskyfactorizationonamultiprocessor |