Fast verified solutions of linear systems
نویسندگان
چکیده
منابع مشابه
Fast Verified Solutions of Sparse Linear Systems with H-matrices
This paper is concerned with the problem of verifying the accuracy of an approximate solution of a sparse linear system whose coefficient matrix is an H-matrix. Fast and efficient methods of calculating componentwise error bounds of the computed solution are proposed. The methods are based on the verified criterion for an M-matrix. The main point of this article is that the proposed methods can...
متن کاملSolutions of Fuzzy Linear Systems using Ranking function
In this work, we propose an approach for computing the compromised solution of an LR fuzzy linear system by using of a ranking function when the coefficient matrix is a crisp mn matrix. To do this, we use expected interval to find an LR fuzzy vector, X , such that the vector (AX ) has the least distance from (b) in 1 norm and the 1 cut of X satisfies the crisp linear system AX = b ...
متن کاملExact and numerical solutions of linear and non-linear systems of fractional partial differential equations
The present study introduces a new technique of homotopy perturbation method for the solution of systems of fractional partial differential equations. The proposed scheme is based on Laplace transform and new homotopy perturbation methods. The fractional derivatives are considered in Caputo sense. To illustrate the ability and reliability of the method some examples are provided. The results ob...
متن کاملVerified Error Bounds for Isolated Singular Solutions of Polynomial Systems
In this paper, we generalize the algorithm described by Rump and Graillat, as well as our previous work on certifying breadth-one singular solutions of polynomial systems, to compute verified and narrow error bounds such that a slightly perturbed system is guaranteed to possess an isolated singular solution within the computed bounds. Our new verification method is based on deflation techniques...
متن کاملVerified Bounds for Least Squares Problems and Underdetermined Linear Systems
New algorithms are presented for computing verified error bounds for least squares problems and underdetermined linear systems. In contrast to previous approaches the new methods do not rely on normal equations and are applicable to sparse matrices. Computational results demonstrate that the new methods are faster than existing ones.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japan Journal of Industrial and Applied Mathematics
سال: 2009
ISSN: 0916-7005,1868-937X
DOI: 10.1007/bf03186530