Boundary Value Problems on Planar Graphs and Flat Surfaces with integer cone singularities, II: The mixed Dirichlet-Neumann Problem

Mathematics – Differential Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

26 pages, 16 figures (color)

Scientific paper

In this paper we continue the study started in part I (posted). We consider a planar, bounded, $m$-connected region $\Omega$, and let $\bord\Omega$ be its boundary. Let $\mathcal{T}$ be a cellular decomposition of $\Omega\cup\bord\Omega$, where each 2-cell is either a triangle or a quadrilateral. From these data and a conductance function we construct a canonical pair $(S,f)$ where $S$ is a special type of a (possibly immersed) genus $(m-1)$ singular flat surface, tiled by rectangles and $f$ is an energy preserving mapping from ${\mathcal T}^{(1)}$ onto $S$. In part I the solution of a Dirichlet problem defined on ${\mathcal T}^{(0)}$ was utilized, in this paper we employ the solution of a mixed Dirichlet-Neumann problem.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Boundary Value Problems on Planar Graphs and Flat Surfaces with integer cone singularities, II: The mixed Dirichlet-Neumann Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Boundary Value Problems on Planar Graphs and Flat Surfaces with integer cone singularities, II: The mixed Dirichlet-Neumann Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Boundary Value Problems on Planar Graphs and Flat Surfaces with integer cone singularities, II: The mixed Dirichlet-Neumann Problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-92790

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.