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 |
| id |
id-itb.:16122 |
|---|---|
| spelling |
id-itb.:161222017-09-27T11:42:59ZLINEAR AVERAGING SCHEMES ON WEIGHTED GRAPHS RODIAH (NIM : 10108067); Pembimbing : Dr. Yudi Soeharyadi, ISTI Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/16122 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 is one special case of this averaging. The effective averaging criteria given by the eigenvalues properties of the transition matrix. Numerical simulations are given for some examples. These simulations support the conjecture that the rate of convergence depends on the connection graph with rate of convergent is exponential. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
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 is one special case of this averaging. The effective averaging criteria given by the eigenvalues properties of the transition matrix. Numerical simulations are given for some examples. These simulations support the conjecture that the rate of convergence depends on the connection graph with rate of convergent is exponential. |
| format |
Final Project |
| author |
RODIAH (NIM : 10108067); Pembimbing : Dr. Yudi Soeharyadi, ISTI |
| spellingShingle |
RODIAH (NIM : 10108067); Pembimbing : Dr. Yudi Soeharyadi, ISTI LINEAR AVERAGING SCHEMES ON WEIGHTED GRAPHS |
| author_facet |
RODIAH (NIM : 10108067); Pembimbing : Dr. Yudi Soeharyadi, ISTI |
| author_sort |
RODIAH (NIM : 10108067); Pembimbing : Dr. Yudi Soeharyadi, ISTI |
| title |
LINEAR AVERAGING SCHEMES ON WEIGHTED GRAPHS |
| title_short |
LINEAR AVERAGING SCHEMES ON WEIGHTED GRAPHS |
| title_full |
LINEAR AVERAGING SCHEMES ON WEIGHTED GRAPHS |
| title_fullStr |
LINEAR AVERAGING SCHEMES ON WEIGHTED GRAPHS |
| title_full_unstemmed |
LINEAR AVERAGING SCHEMES ON WEIGHTED GRAPHS |
| title_sort |
linear averaging schemes on weighted graphs |
| url |
https://digilib.itb.ac.id/gdl/view/16122 |
| _version_ |
1820737627699019776 |