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”

A null-space approach for large-scale symmetric saddle point systems with a small and non zero (2, 2) block

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10436703" target="_blank" >RIV/00216208:11320/21:10436703 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=Z_p0rU4492" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=Z_p0rU4492</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s11075-021-01245-z" target="_blank" >10.1007/s11075-021-01245-z</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A null-space approach for large-scale symmetric saddle point systems with a small and non zero (2, 2) block

  • Original language description

    Null-space methods have long been used to solve large sparse nxn symmetric saddle point systems of equations in which the (2, 2) block is zero. This paper focuses on the case where the (1, 1) block is ill conditioned or rank deficient and the k x k (2, 2) block is non zero and small (k n). Additionally, the (2, 1) block may be rank deficient. Such systems arise in a range of practical applications. A novel nullspace approach is proposed that transforms the system matrix into a nicer symmetric saddle point matrix of order n that has a non zero (2, 2) block of order at most 2k and, importantly, the (1, 1) block is symmetric positive definite. Success of any null-space approach depends on constructing a suitable null-space basis. We propose methods for wide matrices having far fewer rows than columns with the aim of balancing stability of the transformed saddle point matrix with preserving sparsity in the (1, 1) block. Linear least squares problems that contain a small number of dense rows are an important motivation and are used to illustrate our ideas and to explore their potential for solving large-scale systems.

  • 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

    2021

  • 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

    90

  • Issue of the periodical within the volume

    4

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    29

  • Pages from-to

    1639-1667

  • UT code for WoS article

    000741876100001

  • EID of the result in the Scopus database

    2-s2.0-85122807545