Please use this identifier to cite or link to this item: http://repository.iiitd.edu.in/xmlui/handle/123456789/380
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSharma, Pragya
dc.contributor.authorRam, Shobha Sundar (Advisor)
dc.date.accessioned2015-12-07T09:23:30Z
dc.date.available2015-12-07T09:23:30Z
dc.date.issued2015-12-07T09:23:30Z
dc.identifier.urihttps://repository.iiitd.edu.in/jspui/handle/123456789/380
dc.description.abstractThe generalized finite element method (FEM) approach towards solving the Helmholtz equation involves a very high computational complexity of the order of O(n3) where n is the number of nodes of the FEM formulation. Prior research involved exploiting the special properties of FEM matrices for reducing the computation time and memory involved in solving the large FEM problems. These included both direct and iterative solvers. In more recent times, graphical processing units (GPUs) are being used to accelerate the solvers. In this work, we propose an alternative different approach for solving the Helmholtz equation with reduced memory requirements by incorporating compressed sensing (CS) techniques into the original FEM formulation. Our approach is based on the fundamental assumption that electromagnetic fields are continuous except at source locations and can be represented with sparse coefficients in alternate transform domains such as wavelets or DCT. We present different practical aspects of this approach with respect to one-dimensional FEM problems and conclude by pointing out some open-ended questions with respect to this area of researchen_US
dc.language.isoenen_US
dc.subjectFinite Element Methoden_US
dc.subjectCompressed Sensingen_US
dc.subjectl1 minimizationen_US
dc.subjectSparsityen_US
dc.titleSolving helmholtz equation with compressed sensing enhanced finite element methodsen_US
dc.typeThesisen_US
Appears in Collections:Year-2015

Files in This Item:
File Description SizeFormat 
MT13160.pdf1.74 MBAdobe PDFView/Open


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