Please use this identifier to cite or link to this item: http://hdl.handle.net/2440/16618
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMi, J.en
dc.contributor.authorDeo, R.en
dc.contributor.authorNathan, G.en
dc.date.issued2005en
dc.identifier.citationPhysical Review E. (Statistical, Nonlinear, and Soft Matter Physics), 2005; 71(6):066304-1-066304-5en
dc.identifier.issn1539-3755en
dc.identifier.issn1550-2376en
dc.identifier.urihttp://hdl.handle.net/2440/16618-
dc.description.abstractThe present fundamental knowledge of fluid turbulence has been established primarily from hot- and cold-wire measurements. Unfortunately, however, these measurements necessarily suffer from contamination by noise since no certain method has previously been available to optimally filter noise from the measured signals. This limitation has impeded our progress of understanding turbulence profoundly. We address this limitation by presenting a simple, fast-convergent iterative scheme to digitally filter signals optimally and find Kolmogorov scales definitely. The great efficacy of the scheme is demonstrated by its application to the instantaneous velocity measured in a turbulent jet.en
dc.description.statementofresponsibilityJ. Mi, R. C. Deo, and G. J. Nathanen
dc.language.isoenen
dc.publisherAmerican Physical Socen
dc.rights©2005 American Physical Societyen
dc.titleFast-convergent iterative scheme for filtering velocity signals and finding Kolmogorov scalesen
dc.typeJournal articleen
dc.identifier.rmid0020050656en
dc.identifier.doi10.1103/PhysRevE.71.066304en
dc.identifier.pubid54890-
pubs.library.collectionMechanical Engineering publicationsen
pubs.verification-statusVerifieden
pubs.publication-statusPublisheden
dc.identifier.orcidNathan, G. [0000-0002-6922-848X]en
Appears in Collections:Mechanical Engineering publications
Environment Institute Leaders publications

Files in This Item:
File Description SizeFormat 
hdl_16618.pdfPublished version71.99 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.