default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiovanni Migliorati
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j9]Albert Cohen, Giovanni Migliorati:
Near-optimal approximation methods for elliptic PDEs with lognormal coefficients. Math. Comput. 92(342): 1665-1691 (2023)- 2022
- [j8]Giovanni Migliorati, Fabio Nobile
:
Stable high-order randomized cubature formulae in arbitrary dimension. J. Approx. Theory 275: 105706 (2022) - 2021
- [j7]Frances Y. Kuo, Giovanni Migliorati, Fabio Nobile, Dirk Nuyens:
Function integration, reconstruction and approximation using rank-1 lattices. Math. Comput. 90(330): 1861-1897 (2021) - 2019
- [j6]Giovanni Migliorati:
Adaptive Approximation by Optimal Weighted Least-Squares Methods. SIAM J. Numer. Anal. 57(5): 2217-2245 (2019) - 2015
- [j5]Giovanni Migliorati:
Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets. J. Approx. Theory 189: 137-159 (2015) - [j4]Giovanni Migliorati, Fabio Nobile:
Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets. J. Complex. 31(4): 517-542 (2015) - [j3]Giovanni Migliorati, Fabio Nobile, Raúl Tempone:
Convergence estimates in probability and in expectation for discrete least squares with noisy evaluations at random points. J. Multivar. Anal. 142: 167-182 (2015) - 2014
- [j2]Giovanni Migliorati, Fabio Nobile, Erik von Schwerin, Raúl Tempone:
Analysis of Discrete L2 Projection on Polynomial Spaces with Random Evaluations. Found. Comput. Math. 14(3): 419-456 (2014) - 2013
- [j1]Giovanni Migliorati, Fabio Nobile, Erik von Schwerin, Raúl Tempone:
Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete L2 Projection on Polynomial Spaces. SIAM J. Sci. Comput. 35(3) (2013)
Conference and Workshop Papers
- 2015
- [c2]Giovanni Migliorati:
Learning with Discrete Least Squares on Multivariate Polynomial Spaces Using Evaluations at Random or Low-Discrepancy Point Sets. MOD 2015: 1-13 - 2013
- [c1]Giovanni Migliorati:
Adaptive Polynomial Approximation by Means of Random Discrete Least Squares. ENUMATH 2013: 547-554
Informal and Other Publications
- 2021
- [i3]Albert Cohen, Giovanni Migliorati:
Near-optimal approximation methods for elliptic PDEs with lognormal coefficients. CoRR abs/2103.13935 (2021) - 2019
- [i2]Giovanni Migliorati:
Multivariate approximation of functions on irregular domains by weighted least-squares methods. CoRR abs/1907.12304 (2019) - [i1]Frances Y. Kuo, Giovanni Migliorati, Fabio Nobile, Dirk Nuyens:
Function integration, reconstruction and approximation using rank-1 lattices. CoRR abs/1908.01178 (2019)
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:48 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:
