LINEAR AVERAGING SCHEMES ON WEIGHTED GRAPHS
This study aims to find iterative averaging weight schemes of a graph and its rate of convergent. Averaging is done linearly with iterative method. Linear averaging is related with the discrete Laplace operator that defined on a graph. Finite difference scheme for discretization of Laplace equation...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/16122 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Institut Teknologi Bandung |
| 語言: | Indonesia |