default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStuart C. Hawkins
- > Home > Persons > Stuart C. Hawkins
Publications
- 2024
[i2]Mahadevan Ganesh, Stuart C. Hawkins, Darko Volkov:
An all-frequency stable surface integral equation algorithm for electromagnetism in 3-D unbounded penetrable media: Continuous and fully-discrete model analysis. CoRR abs/2402.17713 (2024)- 2022
- [j16]J. Barkhan, Mahadevan Ganesh
, Stuart C. Hawkins:
Approximation of radiating waves in the near-field: Error estimates and application to a class of inverse problems. J. Comput. Appl. Math. 401: 113769 (2022) - 2020
- [i1]Mahadevan Ganesh, Stuart C. Hawkins, Alexandre M. Tartakovsky, Ramakrishna Tipireddy:
An efficient epistemic uncertainty quantification algorithm for a class of stochastic models: A post-processing and domain decomposition framework. CoRR abs/2010.07863 (2020) - 2019
- [j14]Mahadevan Ganesh, Stuart C. Hawkins:
A fast high order algorithm for multiple scattering from large sound-hard three dimensional configurations. J. Comput. Appl. Math. 362: 324-340 (2019) - [j13]Mahadevan Ganesh, Stuart C. Hawkins, Darko Volkov:
An efficient algorithm for a class of stochastic forward and inverse Maxwell models in R3. J. Comput. Phys. 398 (2019) - 2017
- [j12]Mahadevan Ganesh, Stuart C. Hawkins:
Algorithm 975: TMATROM - A T-Matrix Reduced Order Model Software. ACM Trans. Math. Softw. 44(1): 9:1-9:18 (2017) - 2016
- [j11]Mahadevan Ganesh, Stuart C. Hawkins:
An offline/online algorithm for a class of stochastic multiple obstacle scattering configurations in the half-plane. J. Comput. Appl. Math. 307: 52-64 (2016) - 2015
- [j10]Mahadevan Ganesh, Stuart C. Hawkins:
A High Performance Computing and Sensitivity Analysis Algorithm for Stochastic Many-Particle Wave Scattering. SIAM J. Sci. Comput. 37(3) (2015) - 2011
- [j9]Mahadevan Ganesh, Stuart C. Hawkins:
A fully discrete Galerkin method for high frequency exterior acoustic scattering in three dimensions. J. Comput. Phys. 230(1): 104-125 (2011) - 2010
- [j8]Mahadevan Ganesh, Stuart C. Hawkins:
Three dimensional electromagnetic scattering T-matrix computations. J. Comput. Appl. Math. 234(6): 1702-1709 (2010) - 2009
- [j7]Mahadevan Ganesh, Stuart C. Hawkins:
A high-order algorithm for multiple electromagnetic scattering in three dimensions. Numer. Algorithms 50(4): 469-510 (2009) - 2008
- [j6]Mahadevan Ganesh, Stuart C. Hawkins:
A high-order tangential basis algorithm for electromagnetic scattering by curved surfaces. J. Comput. Phys. 227(9): 4543-4562 (2008) - 2007
- [j5]Mahadevan Ganesh, Stuart C. Hawkins:
A Hybrid High-Order Algorithm for Radar Cross Section Computations. SIAM J. Sci. Comput. 29(3): 1217-1243 (2007) - 2006
- [j4]Mahadevan Ganesh, Stuart C. Hawkins:
A spectrally accurate algorithm for electromagnetic scattering in three dimensions. Numer. Algorithms 43(1): 25-60 (2006)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
