A fast algorithm to solve the Beltrami equation with applications to quasiconformal mappings (Q1802298): Difference between revisions
From MaRDI portal
Latest revision as of 17:14, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm to solve the Beltrami equation with applications to quasiconformal mappings |
scientific article |
Statements
A fast algorithm to solve the Beltrami equation with applications to quasiconformal mappings (English)
0 references
9 December 1993
0 references
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.
0 references
Beltrami's equation
0 references
algorithms
0 references
Dirichlet problem
0 references
computational complexity
0 references
numerical quasiconformal mapping
0 references
0 references
0 references
