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”

Interval linear algebra and computational complexity

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10365261" target="_blank" >RIV/00216208:11320/17:10365261 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-49984-0_3" target="_blank" >http://dx.doi.org/10.1007/978-3-319-49984-0_3</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-49984-0_3" target="_blank" >10.1007/978-3-319-49984-0_3</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Interval linear algebra and computational complexity

  • Original language description

    This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding solvability of a linear system, computing inverse matrix, eigenvalues, checking positive (semi)definiteness or stability. We discuss these problems and relations between them from the view of computational complexity. Many problems in interval linear algebra are intractable, hence we emphasize subclasses of these problems that are easily solvable or decidable. The aim of this work is to provide a basic insight into this field and to provide materials for further reading and research.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    50201 - Economic Theory

Result continuities

  • Project

    <a href="/en/project/GA13-10660S" target="_blank" >GA13-10660S: Interval methods for optimization problems</a><br>

  • Continuities

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

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

  • Article name in the collection

    Applied and Computational Matrix Analysis. MAT-TRIAD, Coimbra, Portugal, September 2015 Selected, Revised Contributions

  • ISBN

    978-3-319-49984-0

  • ISSN

    2194-1009

  • e-ISSN

    neuvedeno

  • Number of pages

    30

  • Pages from-to

    37-66

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Coimbra, Portugal

  • Event date

    Sep 7, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article