A shortest path algorithm for banded matrices by a mesh connection without processor penalty.
Aohan MeiYoshihide IgarashiPublished in: ISPAN (1994)
Keyphrases
- shortest path algorithm
- shortest path
- binary matrices
- minimum cost flow
- optimal solution
- d mesh
- singular value decomposition
- high speed
- objective function
- parallel processing
- mesh generation
- matrix completion
- rows and columns
- single processor
- penalty function
- single chip
- instruction set
- high end
- multiprocessor systems
- high curvature
- singular values
- finite element method
- sparse matrix
- positive definite
- feature space