Curvilinear crosscuts of subdivision for a domain decomposition method in numerical conformal mapping

Detalhes bibliográficos
Autor(a) principal: Falcão, M. I.
Data de Publicação: 1999
Outros Autores: Papamichael, N., Stylianopoulos, N.S.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/1822/1491
Resumo: Let $Q:=\{\Omega;z_1,z_2,z_3,z_4\}$ be a quadrilateral consisting of a Jordan domain $\Omega$ and four distinct points $z_1$, $z_2$, $z_3$ and $z_4$ in counterclockwise order on $\partial \Omega$. We consider a domain decomposition method for computing approximations to the conformal module $m(Q)$ of $Q$ in cases where $Q$ is "long'' or, equivalently, $m(Q)$ is "large''. This method is based on decomposing the original quadrilateral $Q$ into two or more component quadrilaterals $Q_1$, $Q_2,\ldots$ and then approximating $m(Q)$ by the sum of the the modules of the component quadrilaterals. The purpose of this paper is to consider ways for determining appropriate crosscuts of subdivision and, in particular, to show that there are cases where the use of curved crosscuts is much more appropriate than the straight line crosscuts that have been used so far.
id RCAP_de19f8a10d96c8e5330b427bdc1b53e2
oai_identifier_str oai:repositorium.sdum.uminho.pt:1822/1491
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Curvilinear crosscuts of subdivision for a domain decomposition method in numerical conformal mappingNumerical conformal mappingQuadrilateralsConformal modulesDomain decompositionquadrilateralconformal moduleScience & TechnologyLet $Q:=\{\Omega;z_1,z_2,z_3,z_4\}$ be a quadrilateral consisting of a Jordan domain $\Omega$ and four distinct points $z_1$, $z_2$, $z_3$ and $z_4$ in counterclockwise order on $\partial \Omega$. We consider a domain decomposition method for computing approximations to the conformal module $m(Q)$ of $Q$ in cases where $Q$ is "long'' or, equivalently, $m(Q)$ is "large''. This method is based on decomposing the original quadrilateral $Q$ into two or more component quadrilaterals $Q_1$, $Q_2,\ldots$ and then approximating $m(Q)$ by the sum of the the modules of the component quadrilaterals. The purpose of this paper is to consider ways for determining appropriate crosscuts of subdivision and, in particular, to show that there are cases where the use of curved crosscuts is much more appropriate than the straight line crosscuts that have been used so far.ElsevierUniversidade do MinhoFalcão, M. I.Papamichael, N.Stylianopoulos, N.S.19991999-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/1822/1491eng"Journal of computational and applied mathematics". ISSN 0377-0427. 106 (1999) 177-196.0377-042710.1016/S0377-0427(99)00067-9info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-07-21T12:20:33Zoai:repositorium.sdum.uminho.pt:1822/1491Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T19:13:43.267094Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Curvilinear crosscuts of subdivision for a domain decomposition method in numerical conformal mapping
title Curvilinear crosscuts of subdivision for a domain decomposition method in numerical conformal mapping
spellingShingle Curvilinear crosscuts of subdivision for a domain decomposition method in numerical conformal mapping
Falcão, M. I.
Numerical conformal mapping
Quadrilaterals
Conformal modules
Domain decomposition
quadrilateral
conformal module
Science & Technology
title_short Curvilinear crosscuts of subdivision for a domain decomposition method in numerical conformal mapping
title_full Curvilinear crosscuts of subdivision for a domain decomposition method in numerical conformal mapping
title_fullStr Curvilinear crosscuts of subdivision for a domain decomposition method in numerical conformal mapping
title_full_unstemmed Curvilinear crosscuts of subdivision for a domain decomposition method in numerical conformal mapping
title_sort Curvilinear crosscuts of subdivision for a domain decomposition method in numerical conformal mapping
author Falcão, M. I.
author_facet Falcão, M. I.
Papamichael, N.
Stylianopoulos, N.S.
author_role author
author2 Papamichael, N.
Stylianopoulos, N.S.
author2_role author
author
dc.contributor.none.fl_str_mv Universidade do Minho
dc.contributor.author.fl_str_mv Falcão, M. I.
Papamichael, N.
Stylianopoulos, N.S.
dc.subject.por.fl_str_mv Numerical conformal mapping
Quadrilaterals
Conformal modules
Domain decomposition
quadrilateral
conformal module
Science & Technology
topic Numerical conformal mapping
Quadrilaterals
Conformal modules
Domain decomposition
quadrilateral
conformal module
Science & Technology
description Let $Q:=\{\Omega;z_1,z_2,z_3,z_4\}$ be a quadrilateral consisting of a Jordan domain $\Omega$ and four distinct points $z_1$, $z_2$, $z_3$ and $z_4$ in counterclockwise order on $\partial \Omega$. We consider a domain decomposition method for computing approximations to the conformal module $m(Q)$ of $Q$ in cases where $Q$ is "long'' or, equivalently, $m(Q)$ is "large''. This method is based on decomposing the original quadrilateral $Q$ into two or more component quadrilaterals $Q_1$, $Q_2,\ldots$ and then approximating $m(Q)$ by the sum of the the modules of the component quadrilaterals. The purpose of this paper is to consider ways for determining appropriate crosscuts of subdivision and, in particular, to show that there are cases where the use of curved crosscuts is much more appropriate than the straight line crosscuts that have been used so far.
publishDate 1999
dc.date.none.fl_str_mv 1999
1999-01-01T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/1822/1491
url http://hdl.handle.net/1822/1491
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv "Journal of computational and applied mathematics". ISSN 0377-0427. 106 (1999) 177-196.
0377-0427
10.1016/S0377-0427(99)00067-9
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799132577073725440