A fast algorithm to solve the Beltrami equation with applications to quasiconformal mappings (Q1802298): Difference between revisions

The author studies Beltrami's equation \(u_{\overline\sigma}=\mu(\sigma)u_ \sigma\) in the unit disk \(\{\sigma\in\mathbb{C}: |\sigma|<1\}\) and under suitable conditions on \(\mu\) he provides two algorithms for solving the Dirichlet problem. For radial-circular grids estimates of computational complexity are derived. Applications to numerical quasiconformal mapping problems onto the exterior of a perturbed ellipse are given and experimental data are shown.