Performance of projection methods for low-Reynolds-number flows
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Outros Autores: | , |
Tipo de documento: | Artigo de conferência |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://hdl.handle.net/11449/167776 |
Resumo: | There exists growing interest in modelling flows at millimetric and micrometric scales, characterised by low Reynolds numbers (Re << 1). In this work, we investigate the performance of projection methods (of the algebraic-splitting kind) for the computation of steady-state simple benchmark problems. The most popular approximate factorization methods are assessed, together with two so-called exact factorization methods. The results show that: (a) The error introduced by non-incremental schemes on the steady state solution is unacceptably large even in the simplest of flows. This is well-known for the basic first order scheme and motivated variants aiming at increased accuracy. Unfortunately, the variants studied either become unstable for the time steps of interest, or yield steady states with larger error than the basic first order scheme. (b) Incremental schemes have an optimal time step δt∗ so as to reach the steady state with minimum computational effort. Taking δt = δt∗ the code reaches the steady state in not less than a few hundred time steps. Such a cost is significantly higher than that of solving the velocity-pressure coupled system, which can compute the steady state in one shot. (c) The main difficulty, however, is that if δt is chosen too large (in general δt∗ is not known), then thousands or tens of thousands of time steps are required to reach the numerical steady state with incremental projection methods. The numerical solutions of these methods follow a time-step-dependent spurious transient which makes the computation of steady states prohibitively expensive. |
id |
UNSP_589a347f8d8b0630d073701d647157fd |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/167776 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Performance of projection methods for low-Reynolds-number flowsAlgebraic splittingIncompressible flowLow Reynolds numberMicrofluidicsNavier-Stokes equationsProjection methodThere exists growing interest in modelling flows at millimetric and micrometric scales, characterised by low Reynolds numbers (Re << 1). In this work, we investigate the performance of projection methods (of the algebraic-splitting kind) for the computation of steady-state simple benchmark problems. The most popular approximate factorization methods are assessed, together with two so-called exact factorization methods. The results show that: (a) The error introduced by non-incremental schemes on the steady state solution is unacceptably large even in the simplest of flows. This is well-known for the basic first order scheme and motivated variants aiming at increased accuracy. Unfortunately, the variants studied either become unstable for the time steps of interest, or yield steady states with larger error than the basic first order scheme. (b) Incremental schemes have an optimal time step δt∗ so as to reach the steady state with minimum computational effort. Taking δt = δt∗ the code reaches the steady state in not less than a few hundred time steps. Such a cost is significantly higher than that of solving the velocity-pressure coupled system, which can compute the steady state in one shot. (c) The main difficulty, however, is that if δt is chosen too large (in general δt∗ is not known), then thousands or tens of thousands of time steps are required to reach the numerical steady state with incremental projection methods. The numerical solutions of these methods follow a time-step-dependent spurious transient which makes the computation of steady states prohibitively expensive.Department of Applied Mathematics and Statistics, Universidade de São Paulo (ICMC-USP)Department of Mathematics and Computer Science, Universidade Estadual Paulista (UNESP)Department of Mathematics and Computer Science, Universidade Estadual Paulista (UNESP)Universidade de São Paulo (USP)Universidade Estadual Paulista (Unesp)Sousa, Fabricio S.Oishi, Cassio M. [UNESP]Buscaglia, Gustavo C.2018-12-11T16:38:17Z2018-12-11T16:38:17Z2014-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject4950-496111th World Congress on Computational Mechanics, WCCM 2014, 5th European Conference on Computational Mechanics, ECCM 2014 and 6th European Conference on Computational Fluid Dynamics, ECFD 2014, p. 4950-4961.http://hdl.handle.net/11449/1677762-s2.0-84923950378Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPeng11th World Congress on Computational Mechanics, WCCM 2014, 5th European Conference on Computational Mechanics, ECCM 2014 and 6th European Conference on Computational Fluid Dynamics, ECFD 2014info:eu-repo/semantics/openAccess2021-10-23T21:47:00Zoai:repositorio.unesp.br:11449/167776Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T22:06:33.667906Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Performance of projection methods for low-Reynolds-number flows |
title |
Performance of projection methods for low-Reynolds-number flows |
spellingShingle |
Performance of projection methods for low-Reynolds-number flows Sousa, Fabricio S. Algebraic splitting Incompressible flow Low Reynolds number Microfluidics Navier-Stokes equations Projection method |
title_short |
Performance of projection methods for low-Reynolds-number flows |
title_full |
Performance of projection methods for low-Reynolds-number flows |
title_fullStr |
Performance of projection methods for low-Reynolds-number flows |
title_full_unstemmed |
Performance of projection methods for low-Reynolds-number flows |
title_sort |
Performance of projection methods for low-Reynolds-number flows |
author |
Sousa, Fabricio S. |
author_facet |
Sousa, Fabricio S. Oishi, Cassio M. [UNESP] Buscaglia, Gustavo C. |
author_role |
author |
author2 |
Oishi, Cassio M. [UNESP] Buscaglia, Gustavo C. |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Universidade de São Paulo (USP) Universidade Estadual Paulista (Unesp) |
dc.contributor.author.fl_str_mv |
Sousa, Fabricio S. Oishi, Cassio M. [UNESP] Buscaglia, Gustavo C. |
dc.subject.por.fl_str_mv |
Algebraic splitting Incompressible flow Low Reynolds number Microfluidics Navier-Stokes equations Projection method |
topic |
Algebraic splitting Incompressible flow Low Reynolds number Microfluidics Navier-Stokes equations Projection method |
description |
There exists growing interest in modelling flows at millimetric and micrometric scales, characterised by low Reynolds numbers (Re << 1). In this work, we investigate the performance of projection methods (of the algebraic-splitting kind) for the computation of steady-state simple benchmark problems. The most popular approximate factorization methods are assessed, together with two so-called exact factorization methods. The results show that: (a) The error introduced by non-incremental schemes on the steady state solution is unacceptably large even in the simplest of flows. This is well-known for the basic first order scheme and motivated variants aiming at increased accuracy. Unfortunately, the variants studied either become unstable for the time steps of interest, or yield steady states with larger error than the basic first order scheme. (b) Incremental schemes have an optimal time step δt∗ so as to reach the steady state with minimum computational effort. Taking δt = δt∗ the code reaches the steady state in not less than a few hundred time steps. Such a cost is significantly higher than that of solving the velocity-pressure coupled system, which can compute the steady state in one shot. (c) The main difficulty, however, is that if δt is chosen too large (in general δt∗ is not known), then thousands or tens of thousands of time steps are required to reach the numerical steady state with incremental projection methods. The numerical solutions of these methods follow a time-step-dependent spurious transient which makes the computation of steady states prohibitively expensive. |
publishDate |
2014 |
dc.date.none.fl_str_mv |
2014-01-01 2018-12-11T16:38:17Z 2018-12-11T16:38:17Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/conferenceObject |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
11th World Congress on Computational Mechanics, WCCM 2014, 5th European Conference on Computational Mechanics, ECCM 2014 and 6th European Conference on Computational Fluid Dynamics, ECFD 2014, p. 4950-4961. http://hdl.handle.net/11449/167776 2-s2.0-84923950378 |
identifier_str_mv |
11th World Congress on Computational Mechanics, WCCM 2014, 5th European Conference on Computational Mechanics, ECCM 2014 and 6th European Conference on Computational Fluid Dynamics, ECFD 2014, p. 4950-4961. 2-s2.0-84923950378 |
url |
http://hdl.handle.net/11449/167776 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
11th World Congress on Computational Mechanics, WCCM 2014, 5th European Conference on Computational Mechanics, ECCM 2014 and 6th European Conference on Computational Fluid Dynamics, ECFD 2014 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
4950-4961 |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1808129393119199232 |