图的拉普拉斯矩阵:算法和应用Laplacian Matrices of Graphs: Algorithms and Applications |
|
课程网址: | http://videolectures.net/colt2015_spielman_laplacian_matrices/ |
主讲教师: | Daniel A. Spielman |
开课单位: | 耶鲁大学计算机科学系 |
开课时间: | 2015-08-20 |
课程语种: | 英语 |
中文简介: | 图的拉普拉斯矩阵出现在许多领域,包括机器学习,计算机视觉,优化,计算科学,当然还有网络分析。我们将解释这些矩阵是什么以及为什么它们出现在如此多的应用中。然后,我们将调查算法设计的最新进展,这些算法允许我们在接近线性的时间内求解这样的线性方程组。特别是,我们将展示图形稀疏化的快速算法如何直接导致快速的拉普拉斯系统求解器。作为一个应用,我们将解释如何使用拉普拉斯系统求解器来快速求解由自然图问题引起的线性规划。 |
课程简介: | The Laplacian matrices of graphs arise in many fields including Machine Learning, Computer Vision, Optimization, Computational Science, and of course Network Analysis. We will explain what these matrices are and why they arise in so many applications. We then will survey recent progress on the design of algorithms that allow us to solve such systems of linear equations in nearly linear time. In particular, we will show how fast algorithms for graph sparsification directly lead to fast Laplacian system solvers. As an application, we will explain how Laplacian system solvers can be used to quickly solve linear programs arising from natural graph problems. |
关 键 词: | 算法设计; 线性时间; 线性规划 |
课程来源: | 视频讲座网 |
数据采集: | 2023-04-24:chenxin01 |
最后编审: | 2023-05-18:chenxin01 |
阅读次数: | 69 |