Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Computational Complexity | Rank (linear algebra),Linear algebra,Decision problem,Linear system,System of linear equations,Algebra,Matrix (mathematics),Mathematics,Eigenvalues and eigenvectors,Numerical linear algebra |
DocType | Volume | Citations |
Journal | abs/1602.00349 | 0 |
PageRank | References | Authors |
0.34 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jaroslav Horácek | 1 | 5 | 1.26 |
| Milan Hladík | 2 | 268 | 36.33 |
| Michal Černý | 3 | 20 | 5.12 |