9 M ay 2 00 1 COMPUTATIONAL EXPERIMENTS WITH ABS ALGORITHMS FOR KKT LINEAR SYSTEMS
نویسنده
چکیده
(A) Let x1 ∈ R n be arbitrary and H1 ∈ R n,n be nonsingular arbitrary. Set i = 1. (B) Compute the residual ri = Axi − b. If ri = 0, then stop, xi solves the problem. Otherwise compute si = HiA T vi, where vi ∈ R n is arbitrary, save that v1, . . . , vi are linearly independent. If si 6= 0, then go to (C). If si = 0 and r T i vi = 0, then set xi+1 = xi, Hi+1 = Hi and go to (F). If si = 0 and r T i vi 6= 0, then stop, the system is incompatible. (C) Compute the search vector pi by pi = H T i zi, where zi ∈ R n is arbitrary, save that z i HiA T vi 6= 0.
منابع مشابه
9 M ay 2 00 1 COMPUTATIONAL EXPERIMENTS WITH ABS ALGORITHMS FOR OVERDETERMINED LINEAR SYSTEMS
متن کامل
A new multi-step ABS model to solve full row rank linear systems
ABS methods are direct iterative methods for solving linear systems of equations, where the i-th iteration satisfies the first i equations. Thus, a system of m equations is solved in at most m ABS iterates. In 2004 and 2007, two-step ABS methods were introduced in at most [((m+1))/2] steps to solve full row rank linear systems of equations. These methods consuming less space, are more compress ...
متن کاملNEW MODELS AND ALGORITHMS FOR SOLUTIONS OF SINGLE-SIGNED FULLY FUZZY LR LINEAR SYSTEMS
We present a model and propose an approach to compute an approximate solution of Fully Fuzzy Linear System $(FFLS)$ of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. First, in discussing an $FFLS$ with a nonnegative coefficient matrix, we consider an equivalent $FFLS$ by using an appropriate permutation to simplify fuzzy multiplications. T...
متن کاملExact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملWZ factorization via Abay-Broyden-Spedicato algorithms
Classes of Abaffy-Broyden-Spedicato (ABS) methods have been introduced for solving linear systems of equations. The algorithms are powerful methods for developing matrix factorizations and many fundamental numerical linear algebra processes. Here, we show how to apply the ABS algorithms to devise algorithms to compute the WZ and ZW factorizations of a nonsingular matrix as well as...
متن کامل