default search action
Miroslav Stoyanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j7]Stefan Schnake
, Coleman Kendrick
Sparse-grid discontinuous Galerkin methods for the Vlasov-Poisson-Lenard-Bernstein model. J. Comput. Phys. 510: 113053 (2024) - [c7]Sriramkrishnan Muralikrishnan
Scaling and performance portability of the particle-in-cell scheme for plasma physics applications through mini-apps targeting exascale architectures. PP 2024: 26-38 - [i5]Stefan Schnake, Coleman Kendrick, Eirik Endeve, Miroslav Stoyanov
Sparse-grid Discontinuous Galerkin Methods for the Vlasov-Poisson-Lenard-Bernstein Model. CoRR abs/2402.06493 (2024) - 2022
- [j6]Pablo Seleson
Data-driven surrogate modeling of hPIC ion energy-angle distributions for high-dimensional sensitivity analysis of plasma parameters' uncertainty. Comput. Phys. Commun. 279: 108436 (2022) - [c6]Alan Ayala
Performance Analysis of Parallel FFT on Large Multi-GPU Systems. IPDPS Workshops 2022: 372-381 - [i4]Sriramkrishnan Muralikrishnan
ALPINE: A set of performance portable plasma physics particle-in-cell mini-apps for exascale computing. CoRR abs/2205.11052 (2022) - 2021
- [j5]Minglei Yang
A Feynman-Kac based numerical method for the exit time probability of a class of transport problems. J. Comput. Phys. 444: 110564 (2021) - [c5]Alan Ayala
Accelerating Multi - Process Communication for Parallel 3-D FFT. ExaMPI@SC 2021: 46-53 - [c4]Daniel Sharp
A More Portable HeFFTe: Implementing a Fallback Algorithm for Scalable Fourier Transforms. HPEC 2021: 1-5 - [c3]Alan Ayala
Scalability Issues in FFT Computation. PaCT 2021: 279-287 - [i3]Minglei Yang, Guannan Zhang, Diego del-Castillo-Negrete, Miroslav Stoyanov:
A Feynman-Kac based numerical method for the exit time probability of a class of transport problems. CoRR abs/2104.14561 (2021) - [i2]Massimiliano Lupo Pasini, Junqi Yin, Viktor Reshniak, Miroslav Stoyanov:
Stable Anderson Acceleration for Deep Learning. CoRR abs/2110.14813 (2021) - 2020
- [j4]Zachary Morrow
A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions. SIAM J. Sci. Comput. 42(4): A2436-A2460 (2020)
2010 – 2019
- 2019
- [i1]Zack Morrow, Miroslav Stoyanov:
A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions. CoRR abs/1908.10672 (2019) - 2016
- [j3]Miroslav Stoyanov
A dynamically adaptive sparse grids method for quasi-optimal interpolation of multidimensional functions. Comput. Math. Appl. 71(11): 2449-2465 (2016) - 2015
- [j2]Hans-Werner van Wyk, Max D. Gunzburger, John Burkhardt, Miroslav Stoyanov
Power-Law Noises over General Spatial Domains and on Nonstandard Meshes. SIAM/ASA J. Uncertain. Quantification 3(1): 296-319 (2015) - [j1]Miroslav Stoyanov
Numerical Analysis of Fixed Point Algorithms in the Presence of Hardware Faults. SIAM J. Sci. Comput. 37(5) (2015) - 2010
- [c2]Jeff Borggaard
Linear feedback control of a von Kármán street by cylinder rotation. ACC 2010: 5674-5681
2000 – 2009
- 2008
- [c1]Jeff Borggaard
An efficient long-time integrator for Chandrasekhar equations. CDC 2008: 3983-3988
Coauthor Index
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-10-07 21:20 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: