No Cover Image

Journal article 526 views 86 downloads

Novel semi-implicit, locally conservative Galerkin (SILCG) methods: Application to blood flow in a systemic circulation / Hayder Hasan, Alberto Coccarelli, Perumal Nithiarasu

Computer Methods in Applied Mechanics and Engineering, Volume: 332, Pages: 217 - 233

Swansea University Authors: Hayder Hasan, Alberto Coccarelli, Perumal Nithiarasu

  • hasan2017v2.pdf

    PDF | Accepted Manuscript

    Released with a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND).

    Download (9.92MB)

Abstract

Three novel, locally conservative Galerkin (LCG) methods in their semi-implicit form are proposed for 1D blood flow modelling in arterial networks. These semi-implicit discretizations are: the second order Taylor expansion (SILCG-TE) method, the streamline upwind Petrov–Galerkin (SILCG-SUPG) procedu...

Full description

Published in: Computer Methods in Applied Mechanics and Engineering
ISSN: 0045-7825
Published: 2018
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa37572
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2017-12-12T19:49:28Z
last_indexed 2021-01-15T03:58:37Z
id cronfa37572
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2021-01-14T13:10:16.6627596</datestamp><bib-version>v2</bib-version><id>37572</id><entry>2017-12-12</entry><title>Novel semi-implicit, locally conservative Galerkin (SILCG) methods: Application to blood flow in a systemic circulation</title><swanseaauthors><author><sid>5bc44c87491bc2dbdee27829a20f6342</sid><firstname>Hayder</firstname><surname>Hasan</surname><name>Hayder Hasan</name><active>true</active><ethesisStudent>false</ethesisStudent></author><author><sid>06fd3332e5eb3cf4bb4e75a24f49149d</sid><ORCID>0000-0003-1511-9015</ORCID><firstname>Alberto</firstname><surname>Coccarelli</surname><name>Alberto Coccarelli</name><active>true</active><ethesisStudent>false</ethesisStudent></author><author><sid>3b28bf59358fc2b9bd9a46897dbfc92d</sid><ORCID>0000-0002-4901-2980</ORCID><firstname>Perumal</firstname><surname>Nithiarasu</surname><name>Perumal Nithiarasu</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2017-12-12</date><deptcode>FGSEN</deptcode><abstract>Three novel, locally conservative Galerkin (LCG) methods in their semi-implicit form are proposed for 1D blood flow modelling in arterial networks. These semi-implicit discretizations are: the second order Taylor expansion (SILCG-TE) method, the streamline upwind Petrov&#x2013;Galerkin (SILCG-SUPG) procedure and the forward in time and central in space (SILCG-FTCS) method. In the LCG method, enforcement of the flux continuity condition at the element interfaces allows to solve the discretized system of equations at element level. For problems with a large number of degrees of freedoms, this offers a significant advantage over the standard continuous Galerkin (CG) procedure. The well established fully explicit LCG method is used for assessing the accuracy of the proposed new methods. Results presented in this work demonstrate that the proposed SILCG methods are stable and as accurate as the explicit LCG method. Among the three methods proposed, the SILCG-FTCS method requires considerably lower number of iterations per element, and thus requires lowest amount of CPU time. On the other hand, the SILCG-TE and SILCG-SUPG methods are stable and accurate for larger time step sizes. Although the standard Newton method requires evaluation of both the Jacobian matrix and the residual for every single iteration, which may be expensive for standard implicit solvers, the computed results show that the maximum number of iterations per element for SILCG-TE and SILCG-SUPG is less than unity (less than 0.3 and 0.7 respectively). Also, numerical experiments show that the Jacobian matrix can be calculated only once per time step, allowing to save a significant amount of computational time.</abstract><type>Journal Article</type><journal>Computer Methods in Applied Mechanics and Engineering</journal><volume>332</volume><journalNumber/><paginationStart>217</paginationStart><paginationEnd>233</paginationEnd><publisher/><placeOfPublication/><isbnPrint/><isbnElectronic/><issnPrint>0045-7825</issnPrint><issnElectronic/><keywords>Semi-implicit; Locally conservative Galerkin (SILCG) methods; SILCG-TE; SILCG-SUPG and SILCG-FTCS methods; Elastic tubes; Systemic circulation; Arterial flow</keywords><publishedDay>15</publishedDay><publishedMonth>4</publishedMonth><publishedYear>2018</publishedYear><publishedDate>2018-04-15</publishedDate><doi>10.1016/j.cma.2017.12.017</doi><url/><notes/><college>COLLEGE NANME</college><department>Science and Engineering - Faculty</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>FGSEN</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2021-01-14T13:10:16.6627596</lastEdited><Created>2017-12-12T16:01:37.2263979</Created><path><level id="1"/><level id="2"/></path><authors><author><firstname>Hayder</firstname><surname>Hasan</surname><order>1</order></author><author><firstname>Alberto</firstname><surname>Coccarelli</surname><orcid>0000-0003-1511-9015</orcid><order>2</order></author><author><firstname>Perumal</firstname><surname>Nithiarasu</surname><orcid>0000-0002-4901-2980</orcid><order>3</order></author></authors><documents><document><filename>0037572-02012018120533.pdf</filename><originalFilename>hasan2017v2.pdf</originalFilename><uploaded>2018-01-02T12:05:33.0570000</uploaded><type>Output</type><contentLength>10367041</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><action/><embargoDate>2018-12-19T00:00:00.0000000</embargoDate><documentNotes>Released with a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND).</documentNotes><copyrightCorrect>true</copyrightCorrect><language>eng</language></document></documents><OutputDurs/></rfc1807>
spelling 2021-01-14T13:10:16.6627596 v2 37572 2017-12-12 Novel semi-implicit, locally conservative Galerkin (SILCG) methods: Application to blood flow in a systemic circulation 5bc44c87491bc2dbdee27829a20f6342 Hayder Hasan Hayder Hasan true false 06fd3332e5eb3cf4bb4e75a24f49149d 0000-0003-1511-9015 Alberto Coccarelli Alberto Coccarelli true false 3b28bf59358fc2b9bd9a46897dbfc92d 0000-0002-4901-2980 Perumal Nithiarasu Perumal Nithiarasu true false 2017-12-12 FGSEN Three novel, locally conservative Galerkin (LCG) methods in their semi-implicit form are proposed for 1D blood flow modelling in arterial networks. These semi-implicit discretizations are: the second order Taylor expansion (SILCG-TE) method, the streamline upwind Petrov–Galerkin (SILCG-SUPG) procedure and the forward in time and central in space (SILCG-FTCS) method. In the LCG method, enforcement of the flux continuity condition at the element interfaces allows to solve the discretized system of equations at element level. For problems with a large number of degrees of freedoms, this offers a significant advantage over the standard continuous Galerkin (CG) procedure. The well established fully explicit LCG method is used for assessing the accuracy of the proposed new methods. Results presented in this work demonstrate that the proposed SILCG methods are stable and as accurate as the explicit LCG method. Among the three methods proposed, the SILCG-FTCS method requires considerably lower number of iterations per element, and thus requires lowest amount of CPU time. On the other hand, the SILCG-TE and SILCG-SUPG methods are stable and accurate for larger time step sizes. Although the standard Newton method requires evaluation of both the Jacobian matrix and the residual for every single iteration, which may be expensive for standard implicit solvers, the computed results show that the maximum number of iterations per element for SILCG-TE and SILCG-SUPG is less than unity (less than 0.3 and 0.7 respectively). Also, numerical experiments show that the Jacobian matrix can be calculated only once per time step, allowing to save a significant amount of computational time. Journal Article Computer Methods in Applied Mechanics and Engineering 332 217 233 0045-7825 Semi-implicit; Locally conservative Galerkin (SILCG) methods; SILCG-TE; SILCG-SUPG and SILCG-FTCS methods; Elastic tubes; Systemic circulation; Arterial flow 15 4 2018 2018-04-15 10.1016/j.cma.2017.12.017 COLLEGE NANME Science and Engineering - Faculty COLLEGE CODE FGSEN Swansea University 2021-01-14T13:10:16.6627596 2017-12-12T16:01:37.2263979 Hayder Hasan 1 Alberto Coccarelli 0000-0003-1511-9015 2 Perumal Nithiarasu 0000-0002-4901-2980 3 0037572-02012018120533.pdf hasan2017v2.pdf 2018-01-02T12:05:33.0570000 Output 10367041 application/pdf Accepted Manuscript true 2018-12-19T00:00:00.0000000 Released with a Creative Commons Attribution Non-Commercial No Derivatives License (CC-BY-NC-ND). true eng
title Novel semi-implicit, locally conservative Galerkin (SILCG) methods: Application to blood flow in a systemic circulation
spellingShingle Novel semi-implicit, locally conservative Galerkin (SILCG) methods: Application to blood flow in a systemic circulation
Hayder, Hasan
Alberto, Coccarelli
Perumal, Nithiarasu
title_short Novel semi-implicit, locally conservative Galerkin (SILCG) methods: Application to blood flow in a systemic circulation
title_full Novel semi-implicit, locally conservative Galerkin (SILCG) methods: Application to blood flow in a systemic circulation
title_fullStr Novel semi-implicit, locally conservative Galerkin (SILCG) methods: Application to blood flow in a systemic circulation
title_full_unstemmed Novel semi-implicit, locally conservative Galerkin (SILCG) methods: Application to blood flow in a systemic circulation
title_sort Novel semi-implicit, locally conservative Galerkin (SILCG) methods: Application to blood flow in a systemic circulation
author_id_str_mv 5bc44c87491bc2dbdee27829a20f6342
06fd3332e5eb3cf4bb4e75a24f49149d
3b28bf59358fc2b9bd9a46897dbfc92d
author_id_fullname_str_mv 5bc44c87491bc2dbdee27829a20f6342_***_Hayder, Hasan
06fd3332e5eb3cf4bb4e75a24f49149d_***_Alberto, Coccarelli
3b28bf59358fc2b9bd9a46897dbfc92d_***_Perumal, Nithiarasu
author Hayder, Hasan
Alberto, Coccarelli
Perumal, Nithiarasu
author2 Hayder Hasan
Alberto Coccarelli
Perumal Nithiarasu
format Journal article
container_title Computer Methods in Applied Mechanics and Engineering
container_volume 332
container_start_page 217
publishDate 2018
institution Swansea University
issn 0045-7825
doi_str_mv 10.1016/j.cma.2017.12.017
document_store_str 1
active_str 0
description Three novel, locally conservative Galerkin (LCG) methods in their semi-implicit form are proposed for 1D blood flow modelling in arterial networks. These semi-implicit discretizations are: the second order Taylor expansion (SILCG-TE) method, the streamline upwind Petrov–Galerkin (SILCG-SUPG) procedure and the forward in time and central in space (SILCG-FTCS) method. In the LCG method, enforcement of the flux continuity condition at the element interfaces allows to solve the discretized system of equations at element level. For problems with a large number of degrees of freedoms, this offers a significant advantage over the standard continuous Galerkin (CG) procedure. The well established fully explicit LCG method is used for assessing the accuracy of the proposed new methods. Results presented in this work demonstrate that the proposed SILCG methods are stable and as accurate as the explicit LCG method. Among the three methods proposed, the SILCG-FTCS method requires considerably lower number of iterations per element, and thus requires lowest amount of CPU time. On the other hand, the SILCG-TE and SILCG-SUPG methods are stable and accurate for larger time step sizes. Although the standard Newton method requires evaluation of both the Jacobian matrix and the residual for every single iteration, which may be expensive for standard implicit solvers, the computed results show that the maximum number of iterations per element for SILCG-TE and SILCG-SUPG is less than unity (less than 0.3 and 0.7 respectively). Also, numerical experiments show that the Jacobian matrix can be calculated only once per time step, allowing to save a significant amount of computational time.
published_date 2018-04-15T03:58:23Z
_version_ 1714468215988420608
score 10.830003