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”

Comparison of preconditioned Krylov subspace iteration methods for PDE-constrained optimization problems

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68145535%3A_____%2F17%3A00482333" target="_blank" >RIV/68145535:_____/17:00482333 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/article/10.1007%2Fs11075-016-0136-5" target="_blank" >https://link.springer.com/article/10.1007%2Fs11075-016-0136-5</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s11075-016-0136-5" target="_blank" >10.1007/s11075-016-0136-5</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Comparison of preconditioned Krylov subspace iteration methods for PDE-constrained optimization problems

  • Original language description

    The governing dynamics of fluid flow is stated as a system of partial differential equations referred to as the Navier-Stokes system. In industrial and scientific applications, fluid flow control becomes an optimization problem where the governing partial differential equations of the fluid flow are stated as constraints. When discretized, the optimal control of the Navier-Stokes equations leads to large sparse saddle point systems in two levels. In this paper, we consider distributed optimal control for the Stokes system and test the particular case when the arising linear system can be compressed after eliminating the control function. In that case, a system arises in a form which enables the application of an efficient block matrix preconditioner that previously has been applied to solve complex-valued systems in real arithmetic. Under certain conditions, the condition number of the so preconditioned matrix is bounded by 2. The numerical and computational efficiency of the method in terms of number of iterations and execution time is favorably compared with other published methods.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2017

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Numerical Algorithms

  • ISSN

    1017-1398

  • e-ISSN

  • Volume of the periodical

    74

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    19

  • Pages from-to

    19-37

  • UT code for WoS article

    000391392300002

  • EID of the result in the Scopus database

    2-s2.0-84965082158