Полный текст статьи можно найти по адресу: http://scitation.aip.org/content/aip/proceeding/aipcp/10.1063/1.4854793We consider the application of the graph theory for construction of solutions of underdetermined systems with special sparse matrices. We study different types of sparsity. The theory of decomposition for support of the graph will be applied to construct the solutions of systems with rectangular sparse matrices
The computational complexity of partitioning sparse matrices is developed graph-theoretically. The r...
The methods of decomposition and the theory of graphs partitioning are applied for constructing the...
In this paper the minimum fill-in problem which arises at the application of the sparse matrix metho...
Полный текст статьи можно найти по адресу: http://scitation.aip.org/content/aip/proceeding/aipcp/10...
This book presents the results of the research of the sparse underdetermined systems of linear algeb...
Полный текст статьи: AIP Conference Proceedings 1789, 060014 (2016); http://doi.org/10.1063/1.496850...
The excellent research in the area of sparse derivative matrix determination over the last three dec...
We consider the problem of approximate solution ex of a linear system Ax = b over the reals, such th...
A unified theory of finite sparse matrix techniques based on a literature search and new results is ...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
Numerical linear algebra and combinatorial optimization are vast subjects; as is their interaction. ...
AbstractWe consider the problem of approximate solution x̄ of of a linear system Ax = b over the rea...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
This work investigates the problem of permuting a sparse rectangular matrix into block diagonal form...
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on ...
The computational complexity of partitioning sparse matrices is developed graph-theoretically. The r...
The methods of decomposition and the theory of graphs partitioning are applied for constructing the...
In this paper the minimum fill-in problem which arises at the application of the sparse matrix metho...
Полный текст статьи можно найти по адресу: http://scitation.aip.org/content/aip/proceeding/aipcp/10...
This book presents the results of the research of the sparse underdetermined systems of linear algeb...
Полный текст статьи: AIP Conference Proceedings 1789, 060014 (2016); http://doi.org/10.1063/1.496850...
The excellent research in the area of sparse derivative matrix determination over the last three dec...
We consider the problem of approximate solution ex of a linear system Ax = b over the reals, such th...
A unified theory of finite sparse matrix techniques based on a literature search and new results is ...
An over view of advanced techniques for solving large sparse linear systems of equations is presente...
Numerical linear algebra and combinatorial optimization are vast subjects; as is their interaction. ...
AbstractWe consider the problem of approximate solution x̄ of of a linear system Ax = b over the rea...
Abstract. Numerical linear algebra and combinatorial optimization are vast subjects; as is their int...
This work investigates the problem of permuting a sparse rectangular matrix into block diagonal form...
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on ...
The computational complexity of partitioning sparse matrices is developed graph-theoretically. The r...
The methods of decomposition and the theory of graphs partitioning are applied for constructing the...
In this paper the minimum fill-in problem which arises at the application of the sparse matrix metho...