A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation:
Several preconditioned conjugate gradient (PCG)-based domain decomposition techniques for self-adjoint elliptic partial differential equations in two dimensions are compared against each other and against conventional PCG iterative techniques in serial and parallel contexts. The authors consider pre...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New Haven, Connecticut
1985
|
| Schriftenreihe: | Yale University <New Haven, Conn.> / Department of Computer Science: Research report
448 |
| Schlagworte: | |
| Zusammenfassung: | Several preconditioned conjugate gradient (PCG)-based domain decomposition techniques for self-adjoint elliptic partial differential equations in two dimensions are compared against each other and against conventional PCG iterative techniques in serial and parallel contexts. The authors consider preconditioners that make use of fast Poisson solvers on the subdomain interiors. Several preconditioners for the interfacial equations are tested on a set of model problems involving two or four subdomains, which are prototype of the stripwise and boxwise decompositions of a two-dimensional region. Selected methods have been implemented on the Intel Hypercube by assigning one processor to each subdomain, making use of up to 64 processors. The choice of a 'best' method for a given problem depends in general upon: (a) the domain geometry, (b) the variability of the operator, and (c) machine characteristics such as the number of processors available and their interconnection scheme, the memory available per processor, and communication and computation rates. Emphasized is the importance of the third category, which has not been as extensively explored as the first two in the domain decomposition literature to date. (Author). |
| Beschreibung: | 53 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035582192 | ||
| 003 | DE-604 | ||
| 005 | 20200228 | ||
| 007 | t | ||
| 008 | 090624s1985 |||| 00||| engod | ||
| 035 | |a (OCoLC)227672081 | ||
| 035 | |a (DE-599)BVBBV035582192 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Keyes, David E. |e Verfasser |0 (DE-588)1203407645 |4 aut | |
| 245 | 1 | 0 | |a A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation |
| 264 | 1 | |a New Haven, Connecticut |c 1985 | |
| 300 | |a 53 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 448 | |
| 520 | 3 | |a Several preconditioned conjugate gradient (PCG)-based domain decomposition techniques for self-adjoint elliptic partial differential equations in two dimensions are compared against each other and against conventional PCG iterative techniques in serial and parallel contexts. The authors consider preconditioners that make use of fast Poisson solvers on the subdomain interiors. Several preconditioners for the interfacial equations are tested on a set of model problems involving two or four subdomains, which are prototype of the stripwise and boxwise decompositions of a two-dimensional region. Selected methods have been implemented on the Intel Hypercube by assigning one processor to each subdomain, making use of up to 64 processors. The choice of a 'best' method for a given problem depends in general upon: (a) the domain geometry, (b) the variability of the operator, and (c) machine characteristics such as the number of processors available and their interconnection scheme, the memory available per processor, and communication and computation rates. Emphasized is the importance of the third category, which has not been as extensively explored as the first two in the domain decomposition literature to date. (Author). | |
| 650 | 4 | |a Domain decomposition | |
| 650 | 7 | |a Computations |2 dtict | |
| 650 | 7 | |a Decomposition |2 dtict | |
| 650 | 7 | |a Ellipses |2 dtict | |
| 650 | 7 | |a Gradients |2 dtict | |
| 650 | 7 | |a Interfaces |2 dtict | |
| 650 | 7 | |a Iterations |2 dtict | |
| 650 | 7 | |a Partial differential equations |2 dtict | |
| 650 | 7 | |a Processing equipment |2 dtict | |
| 650 | 7 | |a Rates |2 dtict | |
| 650 | 7 | |a Theoretical Mathematics |2 scgdst | |
| 700 | 1 | |a Gropp, William |d 1955- |e Verfasser |0 (DE-588)133539989 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Research report |t Yale University <New Haven, Conn.> |v 448 |w (DE-604)BV006663362 |9 448 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017637585 | ||
Datensatz im Suchindex
| _version_ | 1804139240795144192 |
|---|---|
| any_adam_object | |
| author | Keyes, David E. Gropp, William 1955- |
| author_GND | (DE-588)1203407645 (DE-588)133539989 |
| author_facet | Keyes, David E. Gropp, William 1955- |
| author_role | aut aut |
| author_sort | Keyes, David E. |
| author_variant | d e k de dek w g wg |
| building | Verbundindex |
| bvnumber | BV035582192 |
| ctrlnum | (OCoLC)227672081 (DE-599)BVBBV035582192 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02719nam a2200421 cb4500</leader><controlfield tag="001">BV035582192</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200228 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090624s1985 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227672081</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035582192</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">Keyes, David E.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1203407645</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New Haven, Connecticut</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">53 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">448</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Several preconditioned conjugate gradient (PCG)-based domain decomposition techniques for self-adjoint elliptic partial differential equations in two dimensions are compared against each other and against conventional PCG iterative techniques in serial and parallel contexts. The authors consider preconditioners that make use of fast Poisson solvers on the subdomain interiors. Several preconditioners for the interfacial equations are tested on a set of model problems involving two or four subdomains, which are prototype of the stripwise and boxwise decompositions of a two-dimensional region. Selected methods have been implemented on the Intel Hypercube by assigning one processor to each subdomain, making use of up to 64 processors. The choice of a 'best' method for a given problem depends in general upon: (a) the domain geometry, (b) the variability of the operator, and (c) machine characteristics such as the number of processors available and their interconnection scheme, the memory available per processor, and communication and computation rates. Emphasized is the importance of the third category, which has not been as extensively explored as the first two in the domain decomposition literature to date. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Domain decomposition</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Decomposition</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Ellipses</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Gradients</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Interfaces</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Iterations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Partial differential equations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Processing equipment</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Rates</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">Gropp, William</subfield><subfield code="d">1955-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)133539989</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">448</subfield><subfield code="w">(DE-604)BV006663362</subfield><subfield code="9">448</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017637585</subfield></datafield></record></collection> |
| id | DE-604.BV035582192 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T21:40:57Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017637585 |
| oclc_num | 227672081 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 53 S. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | Yale University <New Haven, Conn.> / Department of Computer Science: Research report |
| spelling | Keyes, David E. Verfasser (DE-588)1203407645 aut A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation New Haven, Connecticut 1985 53 S. txt rdacontent n rdamedia nc rdacarrier Yale University <New Haven, Conn.> / Department of Computer Science: Research report 448 Several preconditioned conjugate gradient (PCG)-based domain decomposition techniques for self-adjoint elliptic partial differential equations in two dimensions are compared against each other and against conventional PCG iterative techniques in serial and parallel contexts. The authors consider preconditioners that make use of fast Poisson solvers on the subdomain interiors. Several preconditioners for the interfacial equations are tested on a set of model problems involving two or four subdomains, which are prototype of the stripwise and boxwise decompositions of a two-dimensional region. Selected methods have been implemented on the Intel Hypercube by assigning one processor to each subdomain, making use of up to 64 processors. The choice of a 'best' method for a given problem depends in general upon: (a) the domain geometry, (b) the variability of the operator, and (c) machine characteristics such as the number of processors available and their interconnection scheme, the memory available per processor, and communication and computation rates. Emphasized is the importance of the third category, which has not been as extensively explored as the first two in the domain decomposition literature to date. (Author). Domain decomposition Computations dtict Decomposition dtict Ellipses dtict Gradients dtict Interfaces dtict Iterations dtict Partial differential equations dtict Processing equipment dtict Rates dtict Theoretical Mathematics scgdst Gropp, William 1955- Verfasser (DE-588)133539989 aut Department of Computer Science: Research report Yale University <New Haven, Conn.> 448 (DE-604)BV006663362 448 |
| spellingShingle | Keyes, David E. Gropp, William 1955- A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation Domain decomposition Computations dtict Decomposition dtict Ellipses dtict Gradients dtict Interfaces dtict Iterations dtict Partial differential equations dtict Processing equipment dtict Rates dtict Theoretical Mathematics scgdst |
| title | A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation |
| title_auth | A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation |
| title_exact_search | A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation |
| title_full | A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation |
| title_fullStr | A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation |
| title_full_unstemmed | A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation |
| title_short | A comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation |
| title_sort | a comparison of domain decomposition techniques for elliptic partial differential equations and their parallel implementation |
| topic | Domain decomposition Computations dtict Decomposition dtict Ellipses dtict Gradients dtict Interfaces dtict Iterations dtict Partial differential equations dtict Processing equipment dtict Rates dtict Theoretical Mathematics scgdst |
| topic_facet | Domain decomposition Computations Decomposition Ellipses Gradients Interfaces Iterations Partial differential equations Processing equipment Rates Theoretical Mathematics |
| volume_link | (DE-604)BV006663362 |
| work_keys_str_mv | AT keyesdavide acomparisonofdomaindecompositiontechniquesforellipticpartialdifferentialequationsandtheirparallelimplementation AT groppwilliam acomparisonofdomaindecompositiontechniquesforellipticpartialdifferentialequationsandtheirparallelimplementation |