Neumann–Neumann methods: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

31 March 2020

  • curprev 16:5516:55, 31 March 2020 imported>Suaviloquence 3,183 bytes +3,183 Fix the boundary conditions of the Neumann problem. Define the initial guess for the trace in the Dirichlet problem. Define the iteration counter k. Designate the normal vector in each subdomain by a subscript.