Austrian Academy of Sciences Johann Radon Institute for Computational and Applied Mathematics
Logo des RICAM
  • Login
  • Internal
  • RSS
    • DE
    • EN
  • Institute
    • About
    • Jobs
    • Contact
    • Links
    • Scientific Advisory Board
  • News & Events
    • News
    • Events
    • Event Series
    • Special Semesters
  • People
    • Current members
    • Former Members
  • Research
    • Research Groups
    • Projects
  • Publications
    • RICAM Publications
    • Preprints
    • Lectures
    • Annual Reports
    • Radon Series
    • ETNA
  • HPC
  • Login
  • Internal
  • RSS
    • DE
    • EN

Research

  • Research Groups
    • Computational Methods for PDEs
      • Team
      • Research Topics
      • Projects
      • Publications
    • Inverse Problems and Mathematical Imaging
      • Team
      • Research Topics
      • Projects
      • Publications
      • Editorial Board Memberships
    • Mathematical Data Science
      • Team
      • Publications
    • Mathematical Methods in Medicine and Life Sciences
      • Team
      • Projects
      • Publications
    • Optimization and Optimal Control
      • Team
      • Projects
      • Publications
    • Symbolic Computation
      • Team
      • Research Topics
      • Projects
      • Publications
    • Transfer Group
      • Team
      • Projects
      • Publications
    • Applied Discrete Mathematics and Cryptography
      • Team
      • Research Topics
      • Projects
      • Highlights
      • Publications
      • Editorial Board Memberships
    • Geometry in Simulations
      • Team
      • Research Topics
      • Projects
      • Publications
    • Multivariate Algorithms and Quasi-Monte Carlo Methods
      • Team
      • Research Topics
      • Highlights
      • Publications
      • Projects
  • Projects
    • Completed Projects
  • RICAM
  • Research
  • Research Groups
  • Multivariate Algorithms and Quasi-Monte Carlo Methods
    • Research Topics
    • Team
    • Research Topics
    • Highlights
    • Publications
    • Projects

Multivariate Algorithms and Quasi-Monte Carlo Methods - Research Topics

Numerical integration

Numerical integration

Linear algorithms for numerical integration of functions are an important tool in computational mathematics. We are particularly interested in quasi-Monte Carlo and related algorithms for particularly high-dimensional integration problems. Introductions to quasi-Monte Carlo integration can be found in several monographs as for example the books of Niederreiter [2], Dick and Pillichshammer [1], and Sloan and Joe [3].

[1] J. Dick, F. Pillichshammer. Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge University Press, Cambridge, 2010.
[2] H. Niederreiter. Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia, 1992.
[3] I.H. Sloan, S. Joe. Lattice Methods for Multiple Integration. Oxford University Press, Oxford, 1994.

Function approximation

Function approximation

There are literally thousands of articles and books on the problem of approximating a given function. In our project, we focus on approximation of multivariate functions based on quasi-Monte Carlo algorithms. The application of modern quasi-Monte Carlo algorithms to approximation problems is relatively new, for an introduction see, e.g., [1]. We are also interested in function approximation in the context of using more general linear approximation algorithms.

[1] F.Y. Kuo, I.H. Sloan, H. Wozniakowski. Lattice rules for multivariate approximation in the worst case setting. In: H. Niederreiter, D. Talay (eds.). Monte Carlo and Quasi-Monte Carlo Methods 2004, pp. 289-330. Springer, Berlin, 2006.

Information-based complexity

Information-based complexity

When dealing with multivariate algorithms and analyzing their errors, we are interested in how much information about a given problem we need to guarantee an error not exceeding a certain (small) threshold. This, roughly speaking, is the subject of the field of information-based complexity. This is particularly relevant for problems where we have to deal with a large number of variables. For introductions to this field, we refer to the books [1]-[4].

[1] E. Novak, H. Wozniakowski. Tractability of Multivariate Problems, Volume I: Linear Information. EMS, Zürich, 2008.
[2] E. Novak, H. Wozniakowski. Tractability of Multivariate Problems, Volume II: Standard Information for Functionals. EMS, Zürich, 2010.
[3] E. Novak, H. Woznaikowski. Tractability of Multivariate Problems, Volume III: Standard Information for Operators. EMS, Zürich, 2012.
[4] J.F. Traub, G.W. Wasilkowski, H. Wozniakowski. Information-Based Complexity. Academic Press, New York, 1988.

Component-by-component algorithms

Component-by-component algorithms

When dealing with quasi-Monte carlo and related methods, as for example integration rules, there are not always explicit methods at hand that yield a low error. This is why one frequently has to resort to algorithms for constructing a good method for a specific problem. The state of the art in this context are so-called component-by-component algorithms. These algorithms choose good parameters for a suitable method one component after the other, thereby increasing the efficiency of search algorithms. In our research we deal with methods to speed up existing constructions and finding new and computationally efficient algorithms for certain multivariate problems.

Back
share

RICAM

Johann Radon Institute for Computational and Applied Mathematics
of the Austrian Academy of Sciences

Altenberger Straße 69
4040 Linz, Austria

T: +43 732 2468 - 5222
office(at)ricam.oeaw.ac.at

 

QUICKLINKS

  • News
  • Events
  • Jobs
  • Contact
  • Internal
© Copyright OEAW Imprint Data Protection Accessibility
Notice about cookies

This site uses cookies. They ensure essential functionalities of the website and enable us to continuously optimize content. Help us by agreeing to the collection of statistical data and the presentation of external multimedia content. You can change your cookie settings at any time. Further information can be found in the privacy settings and by clicking the Data Protection Link.

Necessary

These cookies are required for the smooth functioning of our website.

NamePurposeStorage durationTypeProvider
CookieConsent Remembers your consent to the use of cookies. 1 year HTML Web Consent
fe_typo_user Assigns your browser to a session on the server. This only affects the content you see and is not evaluated or processed by us - HTTP Web User
Statistics

With the help of these cookies, we strive to make our offer even more attractive for you. The user flow can be analyzed and assessed using pseudonymised data from website users. This gives us the opportunity to optimize website content.

NamePurposeStorage durationTypeProvider
_pk_id Used to store a few details about the user like unique visitor ID. 13 months HTML Matomo-id
_pk_ref Used to store information about the user's referring website. 6 months HTML Matomo-ref
_pk_ses Short-term cookie to save temporary data from the visit. 30 minutes HTML Matomo-ses
_pk_cvar Short-term cookie to save temporary data from the visit. 30 minutes HTML Matomo-cvar
_pk_hsr Short lived cookie used to temporarily store data for the visit. 30 minutes HTML Matomo
Multimedia

With the help of these cookies, we strive to improve the information we offer users by providing multimedia or interactive content such as videos.

NamePurposeStorage durationTypeProvider
YouTube A connection to YouTube will be established to view videos. - Connection YouTube
SoundCloud A connection to SoundCloud will be established to play audio files. - Connection SoundCloud
Twitter A connection to Twitter will be established to display tweets. - missing translation: type. Twitter