Computational Physics Lectures: Partial differential equations
compphysics.github.io · 116 words · saved by 1 readers
Computational Physics Lectures: Partial differential equations
Jacobi Algorithm for solving Laplace's Equation, the algorithm Summarized, this algorithm reads Make an initial guess for \( u_{i,j} \) at all interior points \( (i,j) \) for all \( i=1:n \) and \( j=1:n \) Use Eq. (17) to compute \( u^{m} \) at all interior points \( (i,j) \). The index \( m \) stands for iteration number \( m \). Stop if prescribed convergence threshold is reached, otherwise continue to the next step. Update the new value of \( u \) for the given iteration Go to step 2 « 1 ... 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 ... 98 »
saved by
related reading
- Finite difference methoden.wikipedia.org
- num_pde_fub.pdfwias-berlin.de
- theNotes.pdfweb.math.princeton.edu
- A Lecture on Partial Differential Equationspeople.math.harvard.edu
- MATHEMATICA TUTORIAL for the Fourth Course in Applied Differential Equationscfm.brown.edu
- Hamilton-Jacobi Equationsmath.mcgill.ca
- Solving the Poisson equation — FEniCSx tutorialjsdokken.com
- Spectral methoden.wikipedia.org
- Helmholtz equationen.wikipedia.org
- Galerkinfischerp.cs.illinois.edu
- Algorithm - Wikipediaen.wikipedia.org
- On Degenerate Partial Differential Equationsarxiv.org