All
All

What are you looking for?

All
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”

Efficient iterative solvers for large sparse systems of equations preconditioned by aggregation

Project goals

It is a general opinion that Scientific Computing as discipline is heavily influenced by Linear Algebra and in particular by the state of the art of efficient solution of large scale systems of linear algebraic equations. To this purpose some sophisticated preconditioners are to be constructed. Construction of efficient preconditioners depends upon the structure of the matrices of the systems under consideration. Our problems originate as objects of research in the area of Civil Engineering. Many  of the problems we want to solve are described by nonsymmetric differential and integral operators. As appropriate to this situation we choose ascomputational means the methods of aggregation and disaggregation. The aggregates may correspond either to smallerparts of a given one model of a given construction or to a complex of models consistingof models of substructures of the whole construction. We want to show that the aggregation/disaggregation methods are efficient not only in computations but also in modelling complex constructions andan interaction of these two approaches.

Keywords

agregaceřešení soustav rovnicpředpodmínění

Public support

  • Provider

    Czech Science Foundation

  • Programme

    Standard projects

  • Call for proposals

    Standardní projekty 12 (SGA02009GA-ST)

  • Main participants

  • Contest type

    VS - Public tender

  • Contract ID

    201/09/1544

Alternative language

  • Project name in Czech

    Efektivní iterační metody řešení rozsáhlých soustav rovnic předpodmíněné na bázi agregací

  • Annotation in Czech

    Cílem projektu je vytvořit a implementovat předpodmínění iteračních metod pro symetrické i nesymetrické soustavy rovnic, které je založeno na agregačních algoritmech.

Scientific branches

  • R&D category

    ZV - Basic research

  • CEP classification - main branch

    BA - General mathematics

  • CEP - secondary branch

  • CEP - another secondary branch

  • 10101 - Pure mathematics

Completed project evaluation

  • Provider evaluation

    U - Uspěl podle zadání (s publikovanými či patentovanými výsledky atd.)

  • Project results evaluation

    The project gone according to plan both in terms of expertise and in terms of disbursement of funds.

Solution timeline

  • Realization period - beginning

    Jan 1, 2009

  • Realization period - end

    Dec 31, 2011

  • Project status

    U - Finished project

  • Latest support payment

    Apr 16, 2011

Data delivery to CEP

  • Confidentiality

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

  • Data delivery code

    CEP12-GA0-GA-U/02:2

  • Data delivery date

    May 2, 2016

Finance

  • Total approved costs

    1,857 thou. CZK

  • Public financial support

    1,857 thou. CZK

  • Other public sources

    0 thou. CZK

  • Non public and foreign sources

    0 thou. CZK

Basic information

Recognised costs

1 857 CZK thou.

Public support

1 857 CZK thou.

100%


Provider

Czech Science Foundation

CEP

BA - General mathematics

Solution period

01. 01. 2009 - 31. 12. 2011