My teacher keeps telling me that my SOR should converge to a solution at least an order of magnitude faster in nearly all cases, for any matrix size N. Gauss-Seidel and Successive Over Relaxation. So I've got two versions of an iterative algorithm that solves a matrix with boundary conditions in two ways. If your post is off-topic, or violates one of our other rules, your post may be removed.ĭisclaimer: This was an assignment and it's already come and gone. Posts about computer science that aren't questions → /r/compsci or /r/programming.Practical questions about computer programming and debugging → /r/AskProgramming.Beginner questions about computer programming → /r/learnprogramming.What classes to take, what university to go to, what topic to write your paper on, etc → /r/csMajors.How to fix your computer, get software to work, etc → /r/techsupport.Suggestions for what laptop to get → /r/SuggestALaptop.How to get hired by a big tech company, how to advance in your company, etc → /r/csCareerQuestions.If you have questions that aren't directly about computer science, here are some other subreddits that can likely offer you more help: All we ask is that your questions be on-topic. Questions do not have to be expert-level - it's perfectly fine to ask beginner questions. This subreddit is intended for questions about topics that might be taught by a computer science department at a university. Ask Computer Science Questions And Get Answers!
