Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Experiments with parallel one-sided and two-sided algorithms for SVD

Identifieur interne : 000D29 ( PascalFrancis/Curation ); précédent : 000D28; suivant : 000D30

Experiments with parallel one-sided and two-sided algorithms for SVD

Auteurs : M. Becka [Slovaquie] ; S. Robert [France] ; M. Vajtersic [Slovaquie, Autriche]

Source :

RBID : Pascal:99-0209438

Descripteurs français

English descriptors

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.
pA  
A01 01  1    @0 0302-9743
A05       @2 1557
A08 01  1  ENG  @1 Experiments with parallel one-sided and two-sided algorithms for SVD
A09 01  1  ENG  @1 Parallel computation : Salzburg, 16-18 February 1999
A11 01  1    @1 BECKA (M.)
A11 02  1    @1 ROBERT (S.)
A11 03  1    @1 VAJTERSIC (M.)
A12 01  1    @1 ZINTERHOF (Peter) @9 ed.
A12 02  1    @1 VAJTERSIC (Marian) @9 ed.
A12 03  1    @1 UHL (Andreas) @9 ed.
A14 01      @1 Institute for Informatics, Slovak Academy of Sciences @2 Bratislava @3 SVK @Z 1 aut. @Z 3 aut.
A14 02      @1 LORIA @2 Vandoeuvre-Lès-Nancy @3 FRA @Z 2 aut.
A14 03      @1 Institute for Mathematics, University of Salzburg @3 AUT @Z 3 aut.
A18 01  1    @1 Austrian Center for Parallel Computation @3 AUT @9 patr.
A20       @1 48-57
A21       @1 1999
A23 01      @0 ENG
A26 01      @0 3-540-65641-3
A43 01      @1 INIST @2 16343 @5 354000073157410050
A44       @0 0000 @1 © 1999 INIST-CNRS. All rights reserved.
A45       @0 9 ref.
A47 01  1    @0 99-0209438
A60       @1 P @2 C
A61       @0 A
A64 01  1    @0 Lecture notes in computer science
A66 01      @0 DEU
C01 01    ENG  @0 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.
C02 01  X    @0 001D02B08
C03 01  X  FRE  @0 Simulation ordinateur @5 01
C03 01  X  ENG  @0 Computer simulation @5 01
C03 01  X  SPA  @0 Simulación computadora @5 01
C03 02  X  FRE  @0 Simulation numérique @5 02
C03 02  X  ENG  @0 Numerical simulation @5 02
C03 02  X  SPA  @0 Simulación numérica @5 02
C03 03  X  FRE  @0 Calcul matriciel @5 03
C03 03  X  ENG  @0 Matrix calculus @5 03
C03 03  X  SPA  @0 Cálculo de matrices @5 03
C03 04  X  FRE  @0 Décomposition valeur singulière @5 04
C03 04  X  ENG  @0 Singular value decomposition @5 04
C03 04  X  SPA  @0 Decomposición valor singular @5 04
C03 05  X  FRE  @0 Algorithme parallèle @5 05
C03 05  X  ENG  @0 Parallel algorithm @5 05
C03 05  X  SPA  @0 Algoritmo paralelo @5 05
C03 06  X  FRE  @0 Algorithme rapide @5 06
C03 06  X  ENG  @0 Fast algorithm @5 06
C03 06  X  SPA  @0 Algoritmo rápido @5 06
N21       @1 130
pR  
A30 01  1  ENG  @1 International ACPC conference @2 4 @3 Salzburg AUT @4 1999-02-16

Links toward previous steps (curation, corpus...)


Links to Exploration step

Pascal:99-0209438

Le 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>
</affiliation>
</author>
<author>
<name sortKey="Robert, S" sort="Robert, S" uniqKey="Robert S" first="S." last="Robert">S. Robert</name>
<affiliation wicri:level="1">
<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>
</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>
</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>
</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>
</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>
</affiliation>
</author>
<author>
<name sortKey="Robert, S" sort="Robert, S" uniqKey="Robert S" first="S." last="Robert">S. Robert</name>
<affiliation wicri:level="1">
<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>
</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>
</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>
</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>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D29 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000D29 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Curation
   |type=    RBID
   |clé=     Pascal:99-0209438
   |texte=   Experiments with parallel one-sided and two-sided algorithms for SVD 
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022