A fast algorithm to solve the Beltrami equation with applications to quasiconformal mappings

DOI10.1016/S0021-9991(83)71113-7zbMath0777.65010OpenAlexW3146123207MaRDI QIDQ1802298

Prabir K. Daripa

Publication date: 9 December 1993

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-9991(83)71113-7

zbMATH Keywords

algorithmscomputational complexityDirichlet problemnumerical quasiconformal mappingBeltrami's equation

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Complexity and performance of numerical algorithms (65Y20) Schwarz-Christoffel-type mappings (30C30)

Related Items

Numerical solution of the Beltrami equation via a purely linear system ⋮ Computing Teichmüller maps between polygons ⋮ The FFTRR-based fast direct algorithms for complex inhomogeneous biharmonic problems with applications to incompressible flows ⋮ A brief review of some application driven fast algorithms for elliptic partial differential equations ⋮ A fast parallel algorithm for the Poisson equation on a disk ⋮ Numerical computation of complex geometrical optics solutions to the conductivity equation ⋮ Conformal mapping in linear time ⋮ Planar domain parameterization for isogeometric analysis based on Teichmüller mapping ⋮ Convergence of a numerical solver for an \(\mathbb R\)-linear Beltrami equation

Cites Work

• On a numerical method for quasi-conformal grid generation
• On applications of a complex variable method in compressible flows
• Quasiconformal mappings in the plane: parametrical methods. In cooperation with Jan Krzyz
• Quasiconformal Mappings and Grid Generation
• The use of a class of quasiconformal mappings to construct difference nets in domains with curvilinear boundaries
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item