Показать сокращенную информацию
dc.contributor.author | Panyukov A.V. | en |
dc.contributor.author | Golodov V.A. | en |
dc.date.accessioned | 2018-05-17T10:19:34Z | |
dc.date.available | 2018-05-17T10:19:34Z | |
dc.date.issued | 2013 | |
dc.identifier.issn | 13853139 | |
dc.identifier.uri | http://dspace.susu.ru/handle/0001.74/18866 | |
dc.description.abstract | In the paper, we consider interval linear algebraic systems of equations Ax = b, with an interval matrix A and interval right-hand side vector b, as a model of imprecise systems of linear algebraic equations of the same form. We propose a new regularization procedure that reduces the solution of the imprecise linear system to computing a point from the tolerable solution set for the interval linear system with a widened righthand side. The points from the tolerable solution set to the widened interval linear system are called pseudo-solutions, while the best pseudo-solutions are those corresponding to the minimal extension of the right-hand side that produces a nonempty tolerable solution set. We prove the existence of the best pseudo-solutions and propose a method for their computation, as a solution to a linear programming problem. Since the auxiliary linear programming problem may become nearly degenerate, it is necessary to perform computations with a precision that substantially exceeds that of the standard oating point data types. A simplex method with errorless rational computations gives an eective solution to the problem. Coarsegrained parallelism for distributed computer systems using MPI and the software for errorless rational calculations using CUDA C small-grained parallelism are the main instruments of our suitable implementation. | en] |
dc.language.iso | English | |
dc.relation.ispartof | Reliable Computing | en] |
dc.subject | C (programming language) | en] |
dc.subject | Linear algebra | en] |
dc.subject | Linear equations | en] |
dc.subject | Linear systems | en] |
dc.subject | Exact computations | en] |
dc.subject | Interval linear systems | en] |
dc.subject | Linear programming problem | en] |
dc.subject | Pseudo-solution | en] |
dc.subject | Regularization | en] |
dc.subject | Solution set | en] |
dc.subject | System of linear equations | en] |
dc.subject | Linear programming | en] |
dc.title | Computing best possible pseudo-solutions to interval linear systems of equations | en |
dc.type | Article | en] |
dc.identifier.scopus | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894581896&partnerID=40&md5=155f214deb75a7e52d0237b1388f5401 |