2003
DOI: 10.1016/s0889-9746(02)00160-3
|View full text |Cite
|
Sign up to set email alerts
|

Flow-rate limitation in a uniform thin-walled collapsible tube, with comparison to a uniform thick-walled tube and a tube of tapering thickness

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
31
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 35 publications
(33 citation statements)
references
References 17 publications
2
31
0
Order By: Relevance
“…Three-dimensional fluid-structure interactions in smooth collapsible tubes have been examined extensively both experimentally, 3,4,7,14,24,25,28,32 and numerically. 22,23,33,40,43 However, it seems that very little attention has been paid to non-Newtonian flow in compliant ducts with staggered baffles.…”
Section: Introductionmentioning
confidence: 99%
“…Three-dimensional fluid-structure interactions in smooth collapsible tubes have been examined extensively both experimentally, 3,4,7,14,24,25,28,32 and numerically. 22,23,33,40,43 However, it seems that very little attention has been paid to non-Newtonian flow in compliant ducts with staggered baffles.…”
Section: Introductionmentioning
confidence: 99%
“…Hence, the domain decomposition discussed previously is not only natural, but it also helps to resolve regions around the membrane ends. We map subdomains [b 1 , 0], [0, 1] and [1, b 2 ] into the [−1, 1] interval, so that the interpolation points represent the extrema of the Nth-order Chebyshev polynomial and we use Chebyshev collocation differential matrices to approximate x-derivatives of functions at the collocation points. The number of collocation points is different in different domains and so are the lengths of the different segments.…”
Section: Appendix B Computational Methodsmentioning
confidence: 99%
“…The resulting matrix is dense since we are using a spectral method for the spatial discretization, but the number of collocation points is relatively small. For b 1 = −10 and b 2 = 11, 200 collocation points in each of the subdomains x ∈ [b 1 , 0] and x ∈ [1, b 2 ], and 20 collocation points for x ∈ [0, 1] was found to be sufficient. Therefore, it is possible to invert the matrices by applying a straightforward LU-decomposition [32].…”
Section: Appendix B Computational Methodsmentioning
confidence: 99%
See 2 more Smart Citations