Stability analysis and improvement of the block Gram-Schmidt algorithm:
Abstract: "The advent of supercomputers with hierarchical memory systems has necessitated the use of block algorithms for the linear algebra algorithms. Although block algorithms may result in impressive improvements in performance, their numerical properties are quite different from their scal...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Urbana, Ill.
1990
|
Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
913 |
Schlagworte: | |
Zusammenfassung: | Abstract: "The advent of supercomputers with hierarchical memory systems has necessitated the use of block algorithms for the linear algebra algorithms. Although block algorithms may result in impressive improvements in performance, their numerical properties are quite different from their scalar counterpart and deserve an in-depth study. In this paper, the numerical stability of Block Gram-Schmidt orthogonalization is studied and a variant is proposed which has numerical properties similar to the classical Modified-Gram-Schmidt while retaining most of the performance advantages of the block formulation." |
Beschreibung: | 20 Bl. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008949937 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940206s1990 d||| |||| 00||| eng d | ||
035 | |a (OCoLC)22454178 | ||
035 | |a (DE-599)BVBBV008949937 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
100 | 1 | |a Jalby, William |e Verfasser |4 aut | |
245 | 1 | 0 | |a Stability analysis and improvement of the block Gram-Schmidt algorithm |c W. Jalby and B. Philippe |
264 | 1 | |a Urbana, Ill. |c 1990 | |
300 | |a 20 Bl. |b graph. Darst. | ||
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 913 | |
520 | 3 | |a Abstract: "The advent of supercomputers with hierarchical memory systems has necessitated the use of block algorithms for the linear algebra algorithms. Although block algorithms may result in impressive improvements in performance, their numerical properties are quite different from their scalar counterpart and deserve an in-depth study. In this paper, the numerical stability of Block Gram-Schmidt orthogonalization is studied and a variant is proposed which has numerical properties similar to the classical Modified-Gram-Schmidt while retaining most of the performance advantages of the block formulation." | |
650 | 4 | |a Algorithms | |
650 | 4 | |a Supercomputers | |
700 | 1 | |a Philippe, B. |e Verfasser |4 aut | |
830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 913 |w (DE-604)BV008930033 |9 913 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-005905548 |
Datensatz im Suchindex
_version_ | 1804123283149291520 |
---|---|
any_adam_object | |
author | Jalby, William Philippe, B. |
author_facet | Jalby, William Philippe, B. |
author_role | aut aut |
author_sort | Jalby, William |
author_variant | w j wj b p bp |
building | Verbundindex |
bvnumber | BV008949937 |
ctrlnum | (OCoLC)22454178 (DE-599)BVBBV008949937 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01650nam a2200313 cb4500</leader><controlfield tag="001">BV008949937</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22454178</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008949937</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">Jalby, William</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Stability analysis and improvement of the block Gram-Schmidt algorithm</subfield><subfield code="c">W. Jalby and B. Philippe</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 Bl.</subfield><subfield code="b">graph. Darst.</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">913</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The advent of supercomputers with hierarchical memory systems has necessitated the use of block algorithms for the linear algebra algorithms. Although block algorithms may result in impressive improvements in performance, their numerical properties are quite different from their scalar counterpart and deserve an in-depth study. In this paper, the numerical stability of Block Gram-Schmidt orthogonalization is studied and a variant is proposed which has numerical properties similar to the classical Modified-Gram-Schmidt while retaining most of the performance advantages of the block formulation."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Supercomputers</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Philippe, B.</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">913</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">913</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905548</subfield></datafield></record></collection> |
id | DE-604.BV008949937 |
illustrated | Illustrated |
indexdate | 2024-07-09T17:27:18Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905548 |
oclc_num | 22454178 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 20 Bl. graph. Darst. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
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 | Jalby, William Verfasser aut Stability analysis and improvement of the block Gram-Schmidt algorithm W. Jalby and B. Philippe Urbana, Ill. 1990 20 Bl. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 913 Abstract: "The advent of supercomputers with hierarchical memory systems has necessitated the use of block algorithms for the linear algebra algorithms. Although block algorithms may result in impressive improvements in performance, their numerical properties are quite different from their scalar counterpart and deserve an in-depth study. In this paper, the numerical stability of Block Gram-Schmidt orthogonalization is studied and a variant is proposed which has numerical properties similar to the classical Modified-Gram-Schmidt while retaining most of the performance advantages of the block formulation." Algorithms Supercomputers Philippe, B. Verfasser aut Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 913 (DE-604)BV008930033 913 |
spellingShingle | Jalby, William Philippe, B. Stability analysis and improvement of the block Gram-Schmidt algorithm Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Algorithms Supercomputers |
title | Stability analysis and improvement of the block Gram-Schmidt algorithm |
title_auth | Stability analysis and improvement of the block Gram-Schmidt algorithm |
title_exact_search | Stability analysis and improvement of the block Gram-Schmidt algorithm |
title_full | Stability analysis and improvement of the block Gram-Schmidt algorithm W. Jalby and B. Philippe |
title_fullStr | Stability analysis and improvement of the block Gram-Schmidt algorithm W. Jalby and B. Philippe |
title_full_unstemmed | Stability analysis and improvement of the block Gram-Schmidt algorithm W. Jalby and B. Philippe |
title_short | Stability analysis and improvement of the block Gram-Schmidt algorithm |
title_sort | stability analysis and improvement of the block gram schmidt algorithm |
topic | Algorithms Supercomputers |
topic_facet | Algorithms Supercomputers |
volume_link | (DE-604)BV008930033 |
work_keys_str_mv | AT jalbywilliam stabilityanalysisandimprovementoftheblockgramschmidtalgorithm AT philippeb stabilityanalysisandimprovementoftheblockgramschmidtalgorithm |