Computational problems in graph theory | Graph algorithms | Polynomial-time problems | Graph distance
Seidel's algorithm is an algorithm designed by Raimund Seidel in 1992 for the all-pairs-shortest-path problem for undirected, unweighted, connected graphs. It solves the problem in expected time for a graph with vertices, where is the exponent in the complexity of matrix multiplication. If only the distances between each pair of vertices are sought, the same time bound can be achieved in the worst case. Even though the algorithm is designed for connected graphs, it can be applied individually to each connected component of a graph with the same running time overall. There is an exception to the expected running time given above for computing the paths: if the expected running time becomes . (Wikipedia).
Mod-01 Lec-29 Gauss-Seidel Method
Elementary Numerical Analysis by Prof. Rekha P. Kulkarni,Department of Mathematics,IIT Bombay.For more details on NPTEL visit http://nptel.ac.in
From playlist NPTEL: Elementary Numerical Analysis | CosmoLearning Mathematics
Peter Sarnak - The Selberg Integral, Rankin Selberg Method, Arithmeticity [2008]
http://www.ams.org/notices/200906/rtx090600692p-corrected.pdf Saturday, January 12 12:00 PM Peter Sarnak The Selberg Integral, Rankin Selberg Method, Arithmeticity Atle Selberg Memorial Memorial Program in Honor of His Life & Work January 11-12, 2008 Renowned Norwegian mathematician A
From playlist Number Theory
ch7 4. Iterative Solvers. SOR iterations. Wen Shen
Wen Shen, Penn State University.
From playlist CMPSC/MATH 451 Videos. Wen Shen, Penn State University
Physics - Ch 66 Ch 4 Quantum Mechanics: Schrodinger Eqn (16 of 92) How to Use Schrod. Eqn: 1
Visit http://ilectureonline.com for more math and science lectures! In this video I will show how to use the Schrodinger's equation, part 1/2. Next video in this series can be seen at: https://youtu.be/2kyX3ON7ow0
From playlist PHYSICS 66.1 QUANTUM MECHANICS - SCHRODINGER EQUATION
A. von Pippich - An analytic class number type formula for PSL2(Z)
For any Fuchsian subgroup Γ⊂PSL2(R) of the first kind, Selberg introduced the Selberg zeta function in analogy to the Riemann zeta function using the lengths of simple closed geodesics on Γ∖H instead of prime numbers. In this talk, we report on a formula that determines the special value a
From playlist Ecole d'été 2017 - Géométrie d'Arakelov et applications diophantiennes
The Schrodinger Equation is (Almost) Impossible to Solve.
Sure, the equation is easily solvable for perfect / idealized systems, but almost impossible for any real systems. The Schrodinger equation is the governing equation of quantum mechanics, and determines the relationship between a system, its surroundings, and a system's wave function. Th
From playlist Quantum Physics by Parth G
Dealing with Schrodinger's Equation - The Hamiltonian
https://www.patreon.com/edmundsj If you want to see more of these videos, or would like to say thanks for this one, the best way you can do that is by becoming a patron - see the link above :). And a huge thank you to all my existing patrons - you make these videos possible. Schrodinger's
From playlist Quantum Mechanics
This shows a 3d print of a mathematical sculpture I produced using shapeways.com. This model is available at http://shpws.me/2toQ.
From playlist 3D printing
Lecture: Eigen-decompositions and Iterations
We develop a theoretical approach to understanding how eigen-decompositions of matrices can be used in iterative schemes for Ax=b.
From playlist Beginning Scientific Computing
CMPSC/Math 451. March 20, 2015. Gauss-Seidel, SOR. Wen Shen
Wen Shen, Penn State University Lectures are based on my book: "An Introduction to Numerical Computation", published by World Scientific, 2016. See promo video: https://youtu.be/MgS33HcgA_I
From playlist Numerical Computation spring 2015. Wen Shen. Penn State University.
Separation of variables and the Schrodinger equation
A brief explanation of separation of variables, application to the time-dependent Schrodinger equation, and the solution to the time part. (This lecture is part of a series for a course based on Griffiths' Introduction to Quantum Mechanics. The Full playlist is at http://www.youtube.com/
From playlist Mathematical Physics II - Youtube
Martin Gander: On the invention of iterative methods for linear systems
HYBRID EVENT Recorded during the meeting "1Numerical Methods and Scientific Computing" the November 9, 2021 by the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Guillaume Hennenfent Find this video and other talks given by worldwide mathematicians on
From playlist Numerical Analysis and Scientific Computing
Quadratically regularized optimal transport - Lorenz - Workshop 1 - CEB T1 2019
Lorenz (Univ. Braunschweig) / 07.02.2019 Quadratically regularized optimal transport Among regularization techniques for optimal transport, entropic regularization has played a pivotal rule. The main reason may be its computational simplicity: the Sinkhorn-Knopp iteration can be impleme
From playlist 2019 - T1 - The Mathematics of Imaging
Jacobi, Gauss-Seidel and SOR Methods | Lecture 66 | Numerical Methods for Engineers
Iterative methods for solving the discrete Laplace equation. Join me on Coursera: https://www.coursera.org/learn/numerical-methods-engineers Lecture notes at http://www.math.ust.hk/~machas/numerical-methods-for-engineers.pdf Subscribe to my channel: http://www.youtube.com/user/jchasnov?
From playlist Numerical Methods for Engineers
Computational Methods for Numerical Relativity, Part 1 Frans Pretorius
Computational Methods for Numerical Relativity, Part 1 Frans Pretorius Princeton University July 16, 2009
From playlist PiTP 2009
CMPSC/Math 451. March 23, 2015. Error analysis of iterative methods. Least squares. Wen Shen
Wen Shen, Penn State University. Lectures are based on my book: "An Introduction to Numerical Computation", published by World Scientific, 2016. See promo video: https://youtu.be/MgS33HcgA_I
From playlist Numerical Computation spring 2015. Wen Shen. Penn State University.
Design of a Cooke Triplet | MIT 2.71 Optics, Spring 2009
Design of a Cooke Triplet Instructor: Wonjoon Choi, Ryan Cooper, Qunya Ong, Matthew Smith View the complete course: http://ocw.mit.edu/2-71S09 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
From playlist MIT 2.71 Optics, Spring 2009
ch7 3. Iterative Solvers. Gauss-Seidal iterations. Wen Shen
Wen Shen, Penn State University. Lectures are based on my book: "An Introduction to Numerical Computation", published by World Scientific, 2016. See promo video: https://youtu.be/MgS33HcgA_I
From playlist CMPSC/MATH 451 Videos. Wen Shen, Penn State University
Computational Physics Lecture 12, Special Matrices and Gauss-Seidel
In this lecture, we discuss the systems of linear algebraic equations with banded and symmetric matrices. We introduce the methods to solve them such as the Thomas algorithm and the Cholesky decomposition. Finally, we discuss the Gauss-Seidel iteration and relaxation methods. This video w
From playlist Nazarbayev: PHYS 270 - Computational Physics with Ernazar Ab