Experiments with parallel one-sided and two-sided algorithms for SVD
Identifieur interne : 000A87 ( PascalFrancis/Checkpoint ); précédent : 000A86; suivant : 000A88Experiments with parallel one-sided and two-sided algorithms for SVD
Auteurs : M. Becka [Slovaquie] ; S. Robert [France] ; M. Vajtersic [Slovaquie, Autriche]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 1999.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
A paper reports on testing parallel SVD algorithms for matrices arising from selected scientific and industrial applications. The codes for the SVD are based respectively on the one-sided and the two-sided Jacobi approach. The matrices come from solving problems of the diffraction process in the crystallography, the diffusion equation in the reactor physics and from the aircraft industry. A parallelization of each of these approaches is described. Results from computational experiments performed on the Paragon machine with 56 processors are presented and discussed.
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:99-0209438Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Experiments with parallel one-sided and two-sided algorithms for SVD </title>
<author><name sortKey="Becka, M" sort="Becka, M" uniqKey="Becka M" first="M." last="Becka">M. Becka</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute for Informatics, Slovak Academy of Sciences</s1>
<s2>Bratislava</s2>
<s3>SVK</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Slovaquie</country>
<wicri:noRegion>Bratislava</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Robert, S" sort="Robert, S" uniqKey="Robert S" first="S." last="Robert">S. Robert</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>LORIA</s1>
<s2>Vandoeuvre-Lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
<settlement type="city" wicri:auto="agglo">Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Vajtersic, M" sort="Vajtersic, M" uniqKey="Vajtersic M" first="M." last="Vajtersic">M. Vajtersic</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute for Informatics, Slovak Academy of Sciences</s1>
<s2>Bratislava</s2>
<s3>SVK</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Slovaquie</country>
<wicri:noRegion>Bratislava</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Institute for Mathematics, University of Salzburg</s1>
<s3>AUT</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Autriche</country>
<wicri:noRegion>Institute for Mathematics, University of Salzburg</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">99-0209438</idno>
<date when="1999">1999</date>
<idno type="stanalyst">PASCAL 99-0209438 INIST</idno>
<idno type="RBID">Pascal:99-0209438</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000B41</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000D29</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000A87</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000A87</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Experiments with parallel one-sided and two-sided algorithms for SVD </title>
<author><name sortKey="Becka, M" sort="Becka, M" uniqKey="Becka M" first="M." last="Becka">M. Becka</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute for Informatics, Slovak Academy of Sciences</s1>
<s2>Bratislava</s2>
<s3>SVK</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Slovaquie</country>
<wicri:noRegion>Bratislava</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Robert, S" sort="Robert, S" uniqKey="Robert S" first="S." last="Robert">S. Robert</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>LORIA</s1>
<s2>Vandoeuvre-Lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
<settlement type="city" wicri:auto="agglo">Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Vajtersic, M" sort="Vajtersic, M" uniqKey="Vajtersic M" first="M." last="Vajtersic">M. Vajtersic</name>
<affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute for Informatics, Slovak Academy of Sciences</s1>
<s2>Bratislava</s2>
<s3>SVK</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Slovaquie</country>
<wicri:noRegion>Bratislava</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><inist:fA14 i1="03"><s1>Institute for Mathematics, University of Salzburg</s1>
<s3>AUT</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Autriche</country>
<wicri:noRegion>Institute for Mathematics, University of Salzburg</wicri:noRegion>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="1999">1999</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer simulation</term>
<term>Fast algorithm</term>
<term>Matrix calculus</term>
<term>Numerical simulation</term>
<term>Parallel algorithm</term>
<term>Singular value decomposition</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Simulation ordinateur</term>
<term>Simulation numérique</term>
<term>Calcul matriciel</term>
<term>Décomposition valeur singulière</term>
<term>Algorithme parallèle</term>
<term>Algorithme rapide</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">A paper reports on testing parallel SVD algorithms for matrices arising from selected scientific and industrial applications. The codes for the SVD are based respectively on the one-sided and the two-sided Jacobi approach. The matrices come from solving problems of the diffraction process in the crystallography, the diffusion equation in the reactor physics and from the aircraft industry. A parallelization of each of these approaches is described. Results from computational experiments performed on the Paragon machine with 56 processors are presented and discussed.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1557</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Experiments with parallel one-sided and two-sided algorithms for SVD </s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Parallel computation : Salzburg, 16-18 February 1999</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>BECKA (M.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>ROBERT (S.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>VAJTERSIC (M.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>ZINTERHOF (Peter)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>VAJTERSIC (Marian)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>UHL (Andreas)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Institute for Informatics, Slovak Academy of Sciences</s1>
<s2>Bratislava</s2>
<s3>SVK</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA</s1>
<s2>Vandoeuvre-Lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="03"><s1>Institute for Mathematics, University of Salzburg</s1>
<s3>AUT</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA18 i1="01" i2="1"><s1>Austrian Center for Parallel Computation</s1>
<s3>AUT</s3>
<s9>patr.</s9>
</fA18>
<fA20><s1>48-57</s1>
</fA20>
<fA21><s1>1999</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-65641-3</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000073157410050</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1999 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>9 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>99-0209438</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>A paper reports on testing parallel SVD algorithms for matrices arising from selected scientific and industrial applications. The codes for the SVD are based respectively on the one-sided and the two-sided Jacobi approach. The matrices come from solving problems of the diffraction process in the crystallography, the diffusion equation in the reactor physics and from the aircraft industry. A parallelization of each of these approaches is described. Results from computational experiments performed on the Paragon machine with 56 processors are presented and discussed.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B08</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Simulation ordinateur</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Computer simulation</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Simulación computadora</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Simulation numérique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Numerical simulation</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Simulación numérica</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Calcul matriciel</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Matrix calculus</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Cálculo de matrices</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Décomposition valeur singulière</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Singular value decomposition</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Decomposición valor singular</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Algorithme parallèle</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Parallel algorithm</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Algoritmo paralelo</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Algorithme rapide</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Fast algorithm</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Algoritmo rápido</s0>
<s5>06</s5>
</fC03>
<fN21><s1>130</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International ACPC conference</s1>
<s2>4</s2>
<s3>Salzburg AUT</s3>
<s4>1999-02-16</s4>
</fA30>
</pR>
</standard>
</inist>
<affiliations><list><country><li>Autriche</li>
<li>France</li>
<li>Slovaquie</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Nancy</li>
<li>Vandœuvre-lès-Nancy</li>
</settlement>
</list>
<tree><country name="Slovaquie"><noRegion><name sortKey="Becka, M" sort="Becka, M" uniqKey="Becka M" first="M." last="Becka">M. Becka</name>
</noRegion>
<name sortKey="Vajtersic, M" sort="Vajtersic, M" uniqKey="Vajtersic M" first="M." last="Vajtersic">M. Vajtersic</name>
</country>
<country name="France"><region name="Grand Est"><name sortKey="Robert, S" sort="Robert, S" uniqKey="Robert S" first="S." last="Robert">S. Robert</name>
</region>
</country>
<country name="Autriche"><noRegion><name sortKey="Vajtersic, M" sort="Vajtersic, M" uniqKey="Vajtersic M" first="M." last="Vajtersic">M. Vajtersic</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A87 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000A87 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= PascalFrancis |étape= Checkpoint |type= RBID |clé= Pascal:99-0209438 |texte= Experiments with parallel one-sided and two-sided algorithms for SVD }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |