Fast Algorithms for Solving FLSR-Factor Block Circulant Linear Systems and Inverse Problem ofAX=b
نویسندگان
چکیده
منابع مشابه
Fast Algorithms for Solving RFPrLR Circulant Linear Systems
In this paper, fast algorithms for solving RFPrLR circulant linear systems are presented by the fast algorithm for computing polynomials. The unique solution is obtained when the RFPrLR circulant matrix over the complex field C is nonsingular, and the special solution and general solution are obtained when the RFPrLR circulant matrix over the complex field C is singular. The extended algorithms...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولFast Algorithms for Solving the Inverse Problem of AX = b in the Class of the ULS r-Circulant (Retrocirculant) Matrices
In this paper, fast algorithms for solving the unique solution of the inverse problem of AX = b in the class of the ULS r-circulant(retrocirculant) matrices over a field F are given by the largest common factor of polynomial. Examples show the effectiveness of the algorithm. Mathematics Subject Classification: 15A29; 65F15
متن کاملFast Randomized Algorithms for Partitioning , Sparsification , and Solving Linear Systems
4 Combinatorial Preconditioners 6 4.1 Graphic Inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.2 Graphic Inequalities with Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.3 Augmented Tree Preconditioners . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.4 Sparsifying . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملSome algorithms for solving special tridiagonal block Toeplitz linear systems
This paper is focused on di1erent methods and algorithms for solving tridiagonal block Toeplitz systems of linear equations. We consider the El-Sayed method (Ph.D. Thesis, 1996) for such systems and propose several modi9cations that lead to di1erent algorithms, which we discuss in detail. Our algorithms are then compared with some classical techniques as far as implementation time is concerned,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2014
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2014/340803