Vector- and parallelisation of ODE BVP codes (Q582825)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4131572
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vector- and parallelisation of ODE BVP codes |
scientific article; zbMATH DE number 4131572 |
Statements
Vector- and parallelisation of ODE BVP codes (English)
0 references
1989
0 references
Pure cost analysis for the vectorization of two spline collocation codes with different block diagonal linear equation solvers. The basic operation counts are taken from other papers. Parallelization of this algorithm conflicts with vectorization.
0 references
vectorization
0 references
spline collocation
0 references
block diagonal linear equation solvers
0 references
Parallelization
0 references
0.8995924
0 references
0 references
0.89256716
0 references
0.89250433
0 references
0 references
0.8838945
0 references
0.8830574
0 references
