Where to get started with Numerical Solutions to PDEs?

  • Thread starter Thread starter lmedin02
  • Start date Start date
  • Tags Tags
    Numerical Pdes
lmedin02
Messages
52
Reaction score
0
I have established existence and uniqueness of solutions to a nonlinear elliptic system of PDE's and would like to see how the solutions look like numerically. I have some programming background on MatLab and C++. I also understand basic ODE numerical schemes. But I am not so sure, if I need to begin by first reading books on Numerical Analysis or is there a more direct way to learning about numerical solutions to my particular problem?

Thanks in advance for your discussion.
 
Mathematics news on Phys.org
I'm not an expert on numerical methods for PDE's but since you haven't received other replies, I'll suggest that you look at material on "Finite Element" techiques if they apply to your PDE's. The Finite Element books I have glanced at (such as the Shaum's book) are very concrete. You can probably find books that do Finite Element analysis in particular programming languages. I notice the wording in one of the Shaum's books implies that older books on Finite Elements are obsolete because of modern developments. I don't understand any details about that, but it wouldn't hurt to get a modern book.
 
Google 'nonlinear PDE'.
Let your fingers do the walking. There are several references to the numerical solution to nonlinear PDEs on the first page alone.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top