Gaussian Elimination Solution to the 2D Poisson Equation

Hypatio
Messages
147
Reaction score
1
I am trying to use Gaussian elimination to solve the 2D poisson equation. I've done this for the 1D problem without problems, but for some reason my solution for the 2D problem is incorrect; it looks something like the correct solution but it's as if the resulting field were cut in half, so along the top boundary it looks like the solution to the 1D problem.

On slide 7 of some persons powerpoint presentation here,

http://www.ifi.uio.no/~infm3350/slides060904.pdf

there is a matrix A with some of the values =4 and others =-1, and this is the matrix I am trying to solve with the right side source term equal to 1. Is it somehow incorrect to directly apply gaussian elimination over this matrix as it is?

Also note that I do not fully und erstand what the second matrix is on that same slide represents or how to solve it, so if I actuallyneed this then I may be approaching the solution incorrectly.

Thanks.
 
Last edited by a moderator:
Physics news on Phys.org
I found the solution to my problem. Gaussian elimination can be applied without problems. My error was using a shortcut routine for back substitution for tridiagonal matrices which only work for the 1D poisson's problem.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top