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 - Poisson and convection-diffusion control

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68145535%3A_____%2F16%3A00468119" target="_blank" >RIV/68145535:_____/16:00468119 - isvavai.cz</a>

  • Result on the web

    <a href="http://link.springer.com/article/10.1007%2Fs11075-016-0111-1" target="_blank" >http://link.springer.com/article/10.1007%2Fs11075-016-0111-1</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Comparison of preconditioned Krylov subspace iteration methods for PDE-constrained optimization problems - Poisson and convection-diffusion control

  • Original language description

    Saddle point matrices of a special structure arise in optimal control problems. In this paper we consider distributed optimal control for various types of scalar stationary partial differential equations and compare the efficiency of several numerical solution methods. We 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 application of an efficient block matrix preconditioner that previously has been applied to solve complex-valued systems in real arithmetic. Under certain assumptions 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 elapsed time is favourably compared with other published methods.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2016

  • 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

    73

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    33

  • Pages from-to

    631-633

  • UT code for WoS article

    000387113700003

  • EID of the result in the Scopus database

    2-s2.0-84959098100