A domain decomposition method for 3d elasticity problems:
Abstract: "The symmetric-and-antisymmetric (SAS) domain decomposition method is a special matrix decomposition scheme for certain classes of discretized physical problems. This scheme decomposes the original problem into independent or loosely coupled subproblems by taking advantage of symmetry...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Urbana, Ill.
1989
|
| Series: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
890 |
| Subjects: | |
| Summary: | Abstract: "The symmetric-and-antisymmetric (SAS) domain decomposition method is a special matrix decomposition scheme for certain classes of discretized physical problems. This scheme decomposes the original problem into independent or loosely coupled subproblems by taking advantage of symmetry or partial symmetry. This is achieved by exploiting important properties possessed by two special classes of matrices A and B, A and B [are elements of] C[superscript nxn], which satisfy the relations A = PAP and B = - PBP where P is some symmetric signed permutation matrix In this paper we present the application of the SAS decomposition method to 3D isotropic elasticity problems using the (preconditioned) conjugate gradient algorithm. The method is first applied to problems with symmetric domains and boundary conditions. We then extend its application to general asymmetric problems by choosing the preconditioner to be the stiffness matrix of some symmetrically discretized substructure. This method is not only superior to classical schemes on sequential computers, but also lends itself to efficient implementation on multiprocessors with several levels of parallelism. |
| Physical Description: | 18 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009258330 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)21429783 | ||
| 035 | |a (DE-599)BVBBV009258330 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Chen, Hsin-Chu |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A domain decomposition method for 3d elasticity problems |c Hsin-Chu Chen and Ahmed Sameh |
| 264 | 1 | |a Urbana, Ill. |c 1989 | |
| 300 | |a 18 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 890 | |
| 520 | 3 | |a Abstract: "The symmetric-and-antisymmetric (SAS) domain decomposition method is a special matrix decomposition scheme for certain classes of discretized physical problems. This scheme decomposes the original problem into independent or loosely coupled subproblems by taking advantage of symmetry or partial symmetry. This is achieved by exploiting important properties possessed by two special classes of matrices A and B, A and B [are elements of] C[superscript nxn], which satisfy the relations A = PAP and B = - PBP where P is some symmetric signed permutation matrix | |
| 520 | 3 | |a In this paper we present the application of the SAS decomposition method to 3D isotropic elasticity problems using the (preconditioned) conjugate gradient algorithm. The method is first applied to problems with symmetric domains and boundary conditions. We then extend its application to general asymmetric problems by choosing the preconditioner to be the stiffness matrix of some symmetrically discretized substructure. This method is not only superior to classical schemes on sequential computers, but also lends itself to efficient implementation on multiprocessors with several levels of parallelism. | |
| 650 | 4 | |a Decomposition method | |
| 650 | 4 | |a Symmetric domains | |
| 700 | 1 | |a Sameh, Ahmed |e Verfasser |4 aut | |
| 830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 890 |w (DE-604)BV008930033 |9 890 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006160386 | ||
Record in the Search Index
| _version_ | 1804123705584910337 |
|---|---|
| any_adam_object | |
| author | Chen, Hsin-Chu Sameh, Ahmed |
| author_facet | Chen, Hsin-Chu Sameh, Ahmed |
| author_role | aut aut |
| author_sort | Chen, Hsin-Chu |
| author_variant | h c c hcc a s as |
| building | Verbundindex |
| bvnumber | BV009258330 |
| ctrlnum | (OCoLC)21429783 (DE-599)BVBBV009258330 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02222nam a2200325 cb4500</leader><controlfield tag="001">BV009258330</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)21429783</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009258330</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">Chen, Hsin-Chu</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A domain decomposition method for 3d elasticity problems</subfield><subfield code="c">Hsin-Chu Chen and Ahmed Sameh</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">18 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">890</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The symmetric-and-antisymmetric (SAS) domain decomposition method is a special matrix decomposition scheme for certain classes of discretized physical problems. This scheme decomposes the original problem into independent or loosely coupled subproblems by taking advantage of symmetry or partial symmetry. This is achieved by exploiting important properties possessed by two special classes of matrices A and B, A and B [are elements of] C[superscript nxn], which satisfy the relations A = PAP and B = - PBP where P is some symmetric signed permutation matrix</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In this paper we present the application of the SAS decomposition method to 3D isotropic elasticity problems using the (preconditioned) conjugate gradient algorithm. The method is first applied to problems with symmetric domains and boundary conditions. We then extend its application to general asymmetric problems by choosing the preconditioner to be the stiffness matrix of some symmetrically discretized substructure. This method is not only superior to classical schemes on sequential computers, but also lends itself to efficient implementation on multiprocessors with several levels of parallelism.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decomposition method</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Symmetric domains</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sameh, Ahmed</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">890</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">890</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006160386</subfield></datafield></record></collection> |
| id | DE-604.BV009258330 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:34:01Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006160386 |
| oclc_num | 21429783 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 18 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 | Chen, Hsin-Chu Verfasser aut A domain decomposition method for 3d elasticity problems Hsin-Chu Chen and Ahmed Sameh Urbana, Ill. 1989 18 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 890 Abstract: "The symmetric-and-antisymmetric (SAS) domain decomposition method is a special matrix decomposition scheme for certain classes of discretized physical problems. This scheme decomposes the original problem into independent or loosely coupled subproblems by taking advantage of symmetry or partial symmetry. This is achieved by exploiting important properties possessed by two special classes of matrices A and B, A and B [are elements of] C[superscript nxn], which satisfy the relations A = PAP and B = - PBP where P is some symmetric signed permutation matrix In this paper we present the application of the SAS decomposition method to 3D isotropic elasticity problems using the (preconditioned) conjugate gradient algorithm. The method is first applied to problems with symmetric domains and boundary conditions. We then extend its application to general asymmetric problems by choosing the preconditioner to be the stiffness matrix of some symmetrically discretized substructure. This method is not only superior to classical schemes on sequential computers, but also lends itself to efficient implementation on multiprocessors with several levels of parallelism. Decomposition method Symmetric domains Sameh, Ahmed Verfasser aut Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 890 (DE-604)BV008930033 890 |
| spellingShingle | Chen, Hsin-Chu Sameh, Ahmed A domain decomposition method for 3d elasticity problems Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Decomposition method Symmetric domains |
| title | A domain decomposition method for 3d elasticity problems |
| title_auth | A domain decomposition method for 3d elasticity problems |
| title_exact_search | A domain decomposition method for 3d elasticity problems |
| title_full | A domain decomposition method for 3d elasticity problems Hsin-Chu Chen and Ahmed Sameh |
| title_fullStr | A domain decomposition method for 3d elasticity problems Hsin-Chu Chen and Ahmed Sameh |
| title_full_unstemmed | A domain decomposition method for 3d elasticity problems Hsin-Chu Chen and Ahmed Sameh |
| title_short | A domain decomposition method for 3d elasticity problems |
| title_sort | a domain decomposition method for 3d elasticity problems |
| topic | Decomposition method Symmetric domains |
| topic_facet | Decomposition method Symmetric domains |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT chenhsinchu adomaindecompositionmethodfor3delasticityproblems AT samehahmed adomaindecompositionmethodfor3delasticityproblems |