Block stiefel acceleration:
Abstract: "The block Stiefel (BST) method proposed by Y. Saad, A. Sameh, and P. Saylor in 1985 is a modification of the Chebyshev method for linear systems that tries to first isolate s components of the residual corresponding to small eigenvalues, and then eliminate them by a projection step....
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
1989
|
| Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
924 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The block Stiefel (BST) method proposed by Y. Saad, A. Sameh, and P. Saylor in 1985 is a modification of the Chebyshev method for linear systems that tries to first isolate s components of the residual corresponding to small eigenvalues, and then eliminate them by a projection step. Iterating with BST gives a convergent algorithm, and an analysis of the projection step shows that it can remove the s smallest eigenvalues from the problem. However, when the isolation phase is successful the projection step causes a growth in the other components of the residual as large as the s[superscript th] power of the condition number of the problem." |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008949509 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)21941706 | ||
| 035 | |a (DE-599)BVBBV008949509 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Bramley, Randall |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Block stiefel acceleration |
| 264 | 1 | |a Urbana, Ill. |c 1989 | |
| 300 | |a 19 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 924 | |
| 520 | 3 | |a Abstract: "The block Stiefel (BST) method proposed by Y. Saad, A. Sameh, and P. Saylor in 1985 is a modification of the Chebyshev method for linear systems that tries to first isolate s components of the residual corresponding to small eigenvalues, and then eliminate them by a projection step. Iterating with BST gives a convergent algorithm, and an analysis of the projection step shows that it can remove the s smallest eigenvalues from the problem. However, when the isolation phase is successful the projection step causes a growth in the other components of the residual as large as the s[superscript th] power of the condition number of the problem." | |
| 650 | 4 | |a Chebyshev approximation | |
| 650 | 4 | |a Eigenvalues | |
| 650 | 4 | |a Linear systems | |
| 830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 924 |w (DE-604)BV008930033 |9 924 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005905166 | ||
Datensatz im Suchindex
| _version_ | 1804123282623954944 |
|---|---|
| any_adam_object | |
| author | Bramley, Randall |
| author_facet | Bramley, Randall |
| author_role | aut |
| author_sort | Bramley, Randall |
| author_variant | r b rb |
| building | Verbundindex |
| bvnumber | BV008949509 |
| ctrlnum | (OCoLC)21941706 (DE-599)BVBBV008949509 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01607nam a2200313 cb4500</leader><controlfield tag="001">BV008949509</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)21941706</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008949509</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">Bramley, Randall</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Block stiefel acceleration</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">19 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">924</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The block Stiefel (BST) method proposed by Y. Saad, A. Sameh, and P. Saylor in 1985 is a modification of the Chebyshev method for linear systems that tries to first isolate s components of the residual corresponding to small eigenvalues, and then eliminate them by a projection step. Iterating with BST gives a convergent algorithm, and an analysis of the projection step shows that it can remove the s smallest eigenvalues from the problem. However, when the isolation phase is successful the projection step causes a growth in the other components of the residual as large as the s[superscript th] power of the condition number of the problem."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Chebyshev approximation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Eigenvalues</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear systems</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">924</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">924</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905166</subfield></datafield></record></collection> |
| id | DE-604.BV008949509 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905166 |
| oclc_num | 21941706 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 19 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 | Bramley, Randall Verfasser aut Block stiefel acceleration Urbana, Ill. 1989 19 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 924 Abstract: "The block Stiefel (BST) method proposed by Y. Saad, A. Sameh, and P. Saylor in 1985 is a modification of the Chebyshev method for linear systems that tries to first isolate s components of the residual corresponding to small eigenvalues, and then eliminate them by a projection step. Iterating with BST gives a convergent algorithm, and an analysis of the projection step shows that it can remove the s smallest eigenvalues from the problem. However, when the isolation phase is successful the projection step causes a growth in the other components of the residual as large as the s[superscript th] power of the condition number of the problem." Chebyshev approximation Eigenvalues Linear systems Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 924 (DE-604)BV008930033 924 |
| spellingShingle | Bramley, Randall Block stiefel acceleration Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Chebyshev approximation Eigenvalues Linear systems |
| title | Block stiefel acceleration |
| title_auth | Block stiefel acceleration |
| title_exact_search | Block stiefel acceleration |
| title_full | Block stiefel acceleration |
| title_fullStr | Block stiefel acceleration |
| title_full_unstemmed | Block stiefel acceleration |
| title_short | Block stiefel acceleration |
| title_sort | block stiefel acceleration |
| topic | Chebyshev approximation Eigenvalues Linear systems |
| topic_facet | Chebyshev approximation Eigenvalues Linear systems |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT bramleyrandall blockstiefelacceleration |