Parallel spectral division using the matrix sign function for the generalized eigenproblem (Q2711493)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel spectral division using the matrix sign function for the generalized eigenproblem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel spectral division using the matrix sign function for the generalized eigenproblem |
scientific article |
Statements
3 December 2001
0 references
generalized eigenproblem
0 references
matrix sign function
0 references
parallel computation
0 references
numerical experiments
0 references
spectral division algorithm
0 references
divide and conquer algorithm
0 references
0 references
0 references
0 references
0 references
0 references
Parallel spectral division using the matrix sign function for the generalized eigenproblem (English)
0 references
The spectral division algorithm based on the matrix sign function is a divide and conquer algorithm to create recursively smaller problems. Different implementation possibilities are discussed and two are selected and implemented using standard libraries. Numerical experiments with up to 16 processors of an IBM SP (120 MHz P2SC) are executed for two types of problems.
0 references
