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:
Main Author: | |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/16122 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |