| Attributes | Values |
|---|
| rdf:type
| |
| Description
| - We focus on the interplay between the choice of partition (problem decomposition) and the corresponding rate of convergence of parallel numerical algorithms. Using a specific algorithm, for which the numerics depend upon the partition, we demonstrate that the rate of convergence can depend strongly on the choice of the partition. This dependence is shown to be a function of the algorithm and of the choice of problem. Information gleaned from tests using various 2-way partitions leads to new partitions for which some degree of convergence robustness is exhibited. The incorporation of a known correction for approximate Schur complements into the original algorithm yields a modified parallel algorithm which numerical experiments indicate achieves robust convergence behaviour with respect to the choice of partition. We conclude that tests of a parallel algorithm which vary the method of partitioning can provide constructive information regarding the robustness of the algorithm ...
- We focus on the interplay between the choice of partition (problem decomposition) and the corresponding rate of convergence of parallel numerical algorithms. Using a specific algorithm, for which the numerics depend upon the partition, we demonstrate that the rate of convergence can depend strongly on the choice of the partition. This dependence is shown to be a function of the algorithm and of the choice of problem. Information gleaned from tests using various 2-way partitions leads to new partitions for which some degree of convergence robustness is exhibited. The incorporation of a known correction for approximate Schur complements into the original algorithm yields a modified parallel algorithm which numerical experiments indicate achieves robust convergence behaviour with respect to the choice of partition. We conclude that tests of a parallel algorithm which vary the method of partitioning can provide constructive information regarding the robustness of the algorithm ... (en)
- V tomto článku je hlavním obsahem vzájemná role dělení grafu, který vyjadřuje oblast modelu, ze které vznikl problém a rychlosti konvergence odpovídajících paralelních numerických algoritmů. Problémem je v tomto případě řešení rozsáhlé soustavy lineárních algebraických rovnic. Specifickým postupem ukazujeme jak toto dělení rychlost konvergence ovlivňuje. Závislost je vyjádřena volbou problému i algoritmem dělení. V článku dále ukazujeme jak zvýšit v některých případech robustnost dělení zavedením korekce Schurova doplňku. Naše numerické experimenty ukazují, že metoda dělení může poskytnout cenné informace pro zýšení robustnosti specifických implementací paralelních algoritmů. (cs)
|
| Title
| - Effects of Problem Decomposition (Partitioning) on the Rate of Convergence of Parallel Numerical Algorithms
- Effects of Problem Decomposition (Partitioning) on the Rate of Convergence of Parallel Numerical Algorithms (en)
- Vliv způsobu dekompozice problému na rychlost konvergence paralelních numerických algoritmů (cs)
|
| skos:prefLabel
| - Effects of Problem Decomposition (Partitioning) on the Rate of Convergence of Parallel Numerical Algorithms
- Effects of Problem Decomposition (Partitioning) on the Rate of Convergence of Parallel Numerical Algorithms (en)
- Vliv způsobu dekompozice problému na rychlost konvergence paralelních numerických algoritmů (cs)
|
| skos:notation
| - RIV/67985807:_____/03:00092642!RIV08-AV0-67985807
|
| http://linked.open.../vavai/riv/strany
| |
| http://linked.open...avai/riv/aktivita
| |
| http://linked.open...avai/riv/aktivity
| - P(GA201/02/0595), P(IAA1030103), Z(AV0Z1030915)
|
| http://linked.open...iv/cisloPeriodika
| |
| http://linked.open...vai/riv/dodaniDat
| |
| http://linked.open...aciTvurceVysledku
| |
| http://linked.open.../riv/druhVysledku
| |
| http://linked.open...iv/duvernostUdaju
| |
| http://linked.open...titaPredkladatele
| |
| http://linked.open...dnocenehoVysledku
| |
| http://linked.open...ai/riv/idVysledku
| - RIV/67985807:_____/03:00092642
|
| http://linked.open...riv/jazykVysledku
| |
| http://linked.open.../riv/klicovaSlova
| - parallel algorithms; graph partitioning; problem decomposition; rate of convergence (en)
|
| http://linked.open.../riv/klicoveSlovo
| |
| http://linked.open...odStatuVydavatele
| - GB - Spojené království Velké Británie a Severního Irska
|
| http://linked.open...ontrolniKodProRIV
| |
| http://linked.open...i/riv/nazevZdroje
| - Numerical Linear Algebra with Applications
|
| http://linked.open...in/vavai/riv/obor
| |
| http://linked.open...ichTvurcuVysledku
| |
| http://linked.open...cetTvurcuVysledku
| |
| http://linked.open...vavai/riv/projekt
| |
| http://linked.open...UplatneniVysledku
| |
| http://linked.open...v/svazekPeriodika
| |
| http://linked.open...iv/tvurceVysledku
| - Tůma, Miroslav
- Cullum, J. K.
- Johnson, K.
|
| http://linked.open...n/vavai/riv/zamer
| |
| issn
| |
| number of pages
| |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)