Forward substitution in this case? Is it as simple as I think it is?

  • Thread starter Thread starter bzz77
  • Start date Start date
  • Tags Tags
    Substitution
bzz77
Messages
33
Reaction score
0
Hi everyone:

I am very rusty on linear algebra, so apologies if this is a silly question. The question is, in the system below, is it correct to take the calculated value of uik+1 from each PREVIOUS step and simply plug it in at the NEXT step where (a * ui-1k+1 is required.

I need to incorporate a finite difference calculation for 1-dimensional advection in some code I'm writing. I have derived the system of equations that I need, but my linear algebra is so rusty that I'm stuck on what to do next/how to actually use them. I'm hoping that the solution I proposed will be sufficient. If it isn't, what method from linear algebra should I use?

I would very much appreciate any help. Thank you all.

Here is the system (a and d are constants that I can specify):

u1k+1 = (u1k - a(0, tk+1)/d

u2k+1 = (u2k - a(0, u1k+1)/d

uik+1 = (uik - a(0, ui-1k+1)/d
 
Last edited:
Physics news on Phys.org
Yes, that is a standard technique.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
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