InforLorV4, Main, Merge, bibRecord, 00B175

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

Identifieur interne : 00B175 ( Main/Merge ); précédent : 00B174; suivant : 00B176

Experiments 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.

RBID : Pascal:99-0209438

Descripteurs français

Pascal (Inist)
- Simulation ordinateur, Simulation numérique, Calcul matriciel, Décomposition valeur singulière, Algorithme parallèle, Algorithme rapide.

English descriptors

KwdEn :
- Computer simulation, Fast algorithm, Matrix calculus, Numerical simulation, Parallel algorithm, Singular value decomposition.

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.

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

to stream PascalFrancis, to step Corpus: 000B41
to stream PascalFrancis, to step Curation: 000D29
to stream PascalFrancis, to step Checkpoint: 000A87

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>
<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>
<idno type="wicri:doubleKey">0302-9743:1999:Becka M:experiments:with:parallel</idno>
<idno type="wicri:Area/Main/Merge">00B175</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>
<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/Main/Merge

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00B175 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00B175 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Merge
   |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.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	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.

Serveur d'exploration sur la recherche en informatique en Lorraine

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

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

Source :

Descripteurs français

English descriptors

Abstract

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

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

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