All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Low-Rank Approximation of Stochastic Systems

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21110%2F16%3A00303004" target="_blank" >RIV/68407700:21110/16:00303004 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.esco2016.femhub.com/media/ESCO2016_Book_of_Abstracts.pdf" target="_blank" >http://www.esco2016.femhub.com/media/ESCO2016_Book_of_Abstracts.pdf</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Low-Rank Approximation of Stochastic Systems

  • Original language description

    In this contribution we focus on a development of an efficient solver for parametrized equations. The method is then used to solve a system of linear equations emerging from the discretisation of a stationary stochastic diffusion problem, e.g. the uncertainty propagation in groundwater flow environment. The stochastic part is taking place only in the uncertainty of a spatial distribution of the transport properties and is discretized with a Karhunen-Loeve Expansion (KLE) based on a generalized polynomial chaos (gPC). The spatial discretisation is treated with a standard finite elements and may itself constitute a large system of equations. Finally projecting the KLE to the same gPC basis leads to the tensor product scheme of a parametrized system of equations. Since the dimension of spatial and stochastic Galerkin subspace grows very fast, the standard solvers which are operating on a full tensor product of the solution, may become intractable due to the lack of computational resources. In order to keep the computation feasible even for a very large problems, one can solve the resulting system approximately on a smaller submanifold. This is basically achieved by separating the spatial and stochastic bases of the solution, exploiting its tensor product structure. The bases are then updated and compressed throughout the iteration process using the truncated singular value decomposition (SVD) to keep the number of bases as low as possible. The solutions of given examples are then compared with a high precission Monte-Carlo simulations.

  • Czech name

  • Czech description

Classification

  • Type

    O - Miscellaneous

  • CEP classification

    JD - Use of computers, robotics and its application

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA15-07299S" target="_blank" >GA15-07299S: Numerical tools for model-based design of robust and optimised experiments</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů