Number of the records: 1  

Effects of Problem Decomposition (Partitioning) on the Rate of Convergence of Parallel Numerical Algorithms

  1. SYS0092642
    LBL
      
    00969^^^^^2200265^^^450
    005
      
    20240103185034.5
    014
      
    $a 000184543600005 $2 WOS
    014
      
    $a 0041340587 $2 SCOPUS
    017
    7-
    $a 10.1002/nla.323 $2 DOI
    100
      
    $a 20071217d m y slo 03 ba
    101
    0-
    $a eng
    102
      
    $a GB
    200
    1-
    $a Effects of Problem Decomposition (Partitioning) on the Rate of Convergence of Parallel Numerical Algorithms
    215
      
    $a 11 s.
    463
    -1
    $1 001 cav_un_epca*0257345 $1 011 $a 1070-5325 $e 1099-1506 $1 200 1 $a Numerical Linear Algebra with Applications $v Roč. 10, - (2003), s. 445-465 $1 210 $c Wiley
    541
    1-
    $a Vliv způsobu dekompozice problému na rychlost konvergence paralelních numerických algoritmů $z cze
    610
    0-
    $a parallel algorithms
    610
    0-
    $a graph partitioning
    610
    0-
    $a problem decomposition
    610
    0-
    $a rate of convergence
    700
    -1
    $3 cav_un_auth*0207794 $a Cullum $b J. K. $y US $4 070
    701
    -1
    $3 cav_un_auth*0234623 $a Johnson $b K. $y US $4 070
    701
    -1
    $3 cav_un_auth*0100849 $a Tůma $b Miroslav $p UIVT-O $w Department of Computational Mathematics $4 070 $T Ústav informatiky AV ČR, v. v. i.
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.