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: | RODIAH (NIM : 10108067); Pembimbing : Dr. Yudi Soeharyadi, ISTI |
---|---|
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 |
Similar Items
-
Improved single-tone frequency estimation by averaging and weighted linear prediction
by: So, H.C., et al.
Published: (2014) -
On average degree of power graphs
by: Dario, Marice, et al.
Published: (2013) -
EXTENSIONS TO THE EXPONENTIALLY WEIGHTED MOVING AVERAGE PROCEDURES
by: CHAO AN-KUO
Published: (2017) -
MINIMUM AVERAGE DISTANCES IN STRONG ORIENTATIONS OF GRAPHS
by: TEO KOON SOON
Published: (2021) -
Distributed Average Consensus based on Structural Weight-Balanceability
by: Haghighi, Reza, et al.
Published: (2016)