Full Index for Scripted foilset 
Secs 66.2
| This lecture covers two distinct areas. |
| Firstly a short discussion of LInear Programming -- what type of problems its used for, what the equations look like and basic issues in the difficult use of parallel processing |
Then we give an abbreviated discussion of Full Matrix algorithms covering
|
)(focus style:
) Denote Foils where Image Critical
)(focus style:
) Denote Foils where HTML is sufficient
(focus style:
) Denote Foils where Image is not available
Indicates Available audio which is greyed out if missing
1
Delivered Lectures for CPS615 -- Base Course for the Simulation Track of Computational Science
2
Abstract of Dec 5 1996 CPS615 Lecture
3
5:Examples IV -- Linear Programming
4
46:Linear Programming
5
47:Convex Regions and Linear Programming
6
48:Matrix Formulation of Linear Programming
7
Review of Matrices seen in PDE's
8
Examples of Full Matrices in Chemistry
9
Operations used with Hamiltonian operator
10
Examples of Full Matrices in Electromagnetics
11
Computational Electromagnetics Formalism I
12
Computational Electromagnetics Formalism II
13
Comments on Computational Electromagnetics
14
Summary of Use of Full Matrices in Chemistry
15
Notes on the use of full matrices
16
Full Matrix Multiplication
17
Sub-block definition of Matrix Multiply
18
Some References
19
The First Algorithm
20
The first stage -- index n=0 in sub-block sum -- of the algorithm on N=16 example
21
The second stage -- n=1 in sum over subblock indices -- of the algorithm on N=16 example
22
Second stage, continued
23
Look at the whole algorithm on one element
24
Cartesian Topology in MPI -- General
25
Matrix Multiplication MPI Style Pseudocode
26
Matrix Multiplication Pseudocode, continued
27
Performance Analysis of Matrix Multiplication
28
Cannon's Algorithm for Matrix Multiplication
29
Parallel Decomposition Full WebWisdom URL and this Foilset Search
This contains all WebWisdom links preceded by those referenced in this foilset