Harmonic Functions and Harmonic Function Theorem - Complex Analysis by a Physicist
In this video we go over harmonic functions in complex analysis. We also go over the harmonic function theorem which tells us that if we have an analytic function then the real and imaginary components of the complex function are harmonic.
Song: Mirror Mind - Bobby Richards, from the YouTube Audio Library
In this video we discuss setting up HEASoft for use with Docker. I also document some of this issues I have encountered with HEASoft v6.31/ Dockerfile v0.9 and Docker and share some some solutions I have found.
HEASoft and Docker Documentation: https://heasarc.gsfc.nasa.gov/lheasoft/docker.html
My HEASoft Dockerfile: https://github.com/nkphysics/heasoft-docker
Table of contents:
00:00 - Introduction
01:00 - Commands for Docker Images and Containers
04:52 - Documenting Issues
10:06 - Conclusion
In this video we finally get to see the full back end procedure for how a random, square, linear system is solved computationally. This is done by combining the backward substitution algorithm with a structured process of Gaussian elimination, which we call "Structured Gaussian Elimination." Understanding how the backward substitution algorithm is used with the structured Gaussian elimination algorithm is critical to understanding how more complex linear algebra solutions are obtained computationally.
Repos for this episode...
Github: https://github.com/nkphysics/Computational-Linear-Algebra-/tree/master/4_Structured_GE
Gitlab: https://gitlab.com/n_space_cowboy/computational-linear-algebra/-/tree/master/4_Structured_GE
Github: https://github.com/nkphysics/Computational-Linear-Algebra-/tree/master/9_Non-Square
Not all linear systems have the convenience of being square.
So how could we solve a non-square linear system computationally?
To show we can even solve a non-square linear system we need to be able to perform a LU decomposition of a non square matrix, so we show how we can perform a LU decomposition of a non-square matrix computationally. While we're at matrix decompositions we examine how to perform the LDV matrix decomposition for non-square matrices.
Then we examine how we can solve a non-square linear system, and some of the issues with solving them.
All credit goes for this problem goes to Griffiths, who wrote an excellent quantum mechanics textbook. In this part of problem 1.5 we find the expectation values of x and x squared based on our normalized wave function we found in part a.
In this fifth video we cover the lu decomposition, which plays a crucial role in understanding how we can solve a linear system computationally. To do the lu decomposition we utilize the Structured Gaussian Elimination algorithm we discussed in the fourth episode. If you need a refresher here is a link to that video.
https://youtu.be/59TAcVWZ0LY
The 4th video's repo directories:
https://github.com/nkphysics/Computational-Linear-Algebra-/tree/master/4_Structured_GE
https://gitlab.com/n_space_cowboy/computational-linear-algebra/-/tree/master/4_Structured_GE
The lu decomposition is a specific configuration of a matrix decomposition that allows us to show that the solutions to the upper triangular system we get from structured Gaussian elimination satisfy the original linear system Ax=b. We explore the lu decomposition computationally in the octave an python languages, utilizing numpy and scipy.
This episodes directory in the series repo can be found in the following links.
https://github.com/nkphysics/Computational-Linear-Algebra-/tree/master/5_LU_Decomposition
https://gitlab.com/n_space_cowboy/computational-linear-algebra/-/tree/master/5_LU_Decomposition
Understanding the lu decomposition if also crucial for understanding other matrix decompositions since it is one of the more general matrix decompositions.
If you have any comments, questions or concerns feel free to let me know in the comment section.
This video is also available on YouTube: https://youtu.be/RklM8O-gjk0
Here we do a simple proof that the general solutions to the time independent Schrodinger equation satisfy the time dependent Schrodinger equation in Quantum Physics. We do this by taking the general solution to the time independent Schrodinger equation and plugging it into the time dependent Schrodinger equation. What we find in the end is that we get out the time independent Schrodinger equation. This is very useful when learning Quantum physics.