TOLERANCE-CONTROL SOLUTIONS TO INTERVAL LINEAR EQUATIONS
|
|
- Jasper Hugh Walsh
- 5 years ago
- Views:
Transcription
1 International Conference on Artificial Intelligence and Software Engineering (ICAISE 013 TOLERANCE-CONTROL SOLUTIONS TO INTERVAL LINEAR EQUATIONS LI TIAN 1, WEI LI 1, QIN WANG 1 Institute of Operational Research & Cybernetics, Hangzhou Dianzi University, Hangzhou, , PR China College of Science, China Jiliang University, , PR China t @yahoo.cn, weilihz@16.com, wq@cjlu.edu.cn Abstract: In this paper, we discuss the solution of interval linear equations from the point of view of the vector components. Tolerance solutions, control solutions, algebraic solutions and localized solutions are defined based on the relationship of two vectors as a whole, this paper detailed considerate the relationship of components between the two vectors. A new type of solutions, tolerance-control solutions, to interval linear equations are proposed, and the characteristics of the new solutions are described, which is similar to the well-know Oettli-Prager inequality. Keywords: Interval linear equations; Tolerance solutions;control solutions; Algebraic solutions; L-localized solutions; R-localized solutions; Tolerance-control solutions. 1. Introduction In recent years, a lot of uncertainty problems have been proposed,interval often be used as a special method to deal with these problems[]. Owing to this,many scholars [3,6,8,10,11] have made some results about the methods for the interval linear equations Ax = b, especially the solutions to Ax = b. The united solutions were introduced from different viewpoint [3,5], and M.Hladík [9], S.P.Shary [14], J.Rohn [16] give some methods to bound the solution set. Some research has initially applied to practical problems, such as bounding roundoff errors in scientific computing. As is know to all of us, tolerance solutions are defined based on Ax b, control solutions are defined based on Ax b, algebraic solutions based on Ax = b. These solutions focus on the relationship of Ax and b, in this paper, the relationship of (Ax i and b i are considered. And this paper divided the solution set of weak solution set. Through the division, we see that tolerance solutions, control solutions and algebraic solutions are weak solutions with special, neat form. This paper introduced another solution of Ax = b, based on the relationship of (Ax i and b i. And the characterizations of the new solution is given, which is similar to Oettli-Prager inequality.. Preliminaries Throughout this paper, we follow the definitions and notations given in [0]. X, X R, X = [X, X] is called an interval number, where X and X are referred to as its lower and upper bounds. Similarly, if A, A R m n, anda A, A = [A, A] = {A A A A} is called an interval matrix, and A, A are referred to as its lower and upper bounds. If A = (a ij, A = (a ij, then we have A = {A = (a ij a ij a ij a ij, i = 1,, m, j = 1, n}. The center and radius matrices are denoted by A c and A A c = 1 (A + A, A = 1 (A A. An interval vector b can be defined as an one-column interval matrix. Similarly, b = {b b b b}, b, b R m. The center and radius vectors are defined as Let b c = 1 (b + b, b = 1 (b b. Y m = {y R m y = e}, where e = (1,, 1 T. For each x R n,we define its diagonal vector as { 1, xi 0; (sgnx i = 1, x i < The authors - Published by Atlantis Press 18
2 have k i a i b i, which implies k = (k 1,, k n T a b. For two interval vectors a b φ, i.e. a b, b a. if we consider the sequence relationship of their components, we can get some results. Let Figure 1. For a given vector y R m,we define y y 0 T y = diag(y 1,, y m = y m Then we can write x = T z x, where z = sgnx. For a given matrix A = [A c A, A c + A ] and y Y m, z Y n, we introduce the following matrices: A yz = A c T y A T z. Lemma 1 For two interval vectors a = (a 1,, a n T, b = (b 1,, b n T, a b φ is equivalent to a b, b a. Proof. If a b φ, then c R n,c a, c b, which means We have so a c a, b c b a c b, b c a a b, b a Conversely, if a b, b a, then a i b i, b i a i. We have the following four cases: (1a i b i b i a i, (a i b i a i b i, (3b i a i b i a i, (4b i a i a i b i. Figures 1 is more clearer to explain the four inequality. For case (1, (b c i a i b i ; for case (, bi+ai a i b i ; for case (3, ai+bi a i b i ; for case (4, (b c i a i b i. No matter what case, one of the four numbers (b c i, bi+ai, ai+bi, (b c i belongs to a i b i, we denote it with k i (i = 1,, n. so we U = {1,,, n} Ω 1 = {i a i < b i }, Ω = {i a i = b i }, Ω 3 = {i a i > b i } Γ 1 = {j b j < a j }, Γ = {j b j = a j }, Γ 3 = {j b j > a j } We can see that for every subscript i, there are c 1 3c 1 3 cases. So if the weak solutions are divided by component, there are 9 n cases. Lemma If interval number a = [a, a], x R, then (ax c = a c x. Proof. (i If x 0, we have ax ax, which gives ax = [ax, ax], (ax c = ax+ax = (a+ax = a c x. (ii If x < 0, then ax = [ax, ax], we have (ax c = ax+ax = (a+ax = a c x. We can conclude that (ax c = a c x. Lemma 3 For interval vector a, x R, we have (ax = a x. Proof. When x 0, we have ax = [ax, ax], (ax = ax ax = a x ; When x < 0, we have (ax = ax ax = a x = a x. So we conclude that (ax = a x. Lemma 4 Interval matrix A, x R n, then there holds Ax = [A c x A x, A c x + A x ] = [A ez x, A ez x], where z = sgnx. Proof. Firstly, we prove The first equation, Ax = (Ax c (Ax = A c x A x. Similarly, Ax = (Ax c + (Ax = A c x + A x. Now we prove the second equation, for x = T z x,we have A c x A x = A c x A T z x = (A c A T z x = A ez x. Similarly, A c x + A x = A c x + A T z x = (A c + A T z x = A ez x. we have (Ax i = [(Ax i, (Ax i ] = [(A c x i (A x i, (A c x i + (A x i ] = [(A ez x i, (A ez x i ] 3. Division of the weak solution x is a weak solution of interval linear equations Ax = b is equivalent to Ax b φ. The set of weak solution is (A, b = {x R n Ax b} φ If x is a weak solution of Ax = b, then according to lemma 1, there holds Ax b, b Ax, that is A ez x b, b A ez x. For interval linear equations Ax = b, the set of weak solution has the maximum range. If we consider based on components 19
3 of vector, the set of weak solution can be divided into many parts. Let U = {1,, m}, Ω 1 = {i (Ax i < b i }, Ω = {i (Ax i = b i }, Ω 3 = {i (Ax i > b i }. Γ 1 = {j b j < (Ax j },Γ = {j b j = (Ax j }, Γ 3 = {j b j > (Ax j }. So we have: (1Ω 1 Ω = U, Γ 1 Γ = U Ax b b Ax b Ax, which implies x is a control solution. (Ω Ω 3 = U, Γ Γ 3 = U b Ax Ax b Ax b, which implies x is a tolerance solution. (3Ω = U, Γ = U Ax = b b = Ax Ax = b, which implies x is an algebraic solution. In addition, if Ax b,b Ax, we have Ω 1 Ω = U, Γ Γ 3 = U Ax b Ax b, which implies x is a L-localized solution. Ω Ω 3 = U, Γ 1 Γ = U b Ax b Ax, which implies x is a R-localized solution. These are just some special form of weak solutions, there are also a lot of weak solution which has not be discussed. For example, x = (1, 3 T is an weak solution of We can see that ( [1,] [4,6] [-1,3] [,5] x = ( [1,1] [6,0] ( [1,] [4,6] x = [13, 0] [1, 1] ( [-1,3] [,5] x = [5, 18] [6, 0] φ. x isn t a tolerance solution, nor is it a control solution, it is just a weak solution with Ω 1 = {}, Ω = φ, Ω 3 = {1},Γ 1 = φ, Γ = φ, Γ 3 = {1, }. For another example, x = ( 1, T is a weak solution of We can see that ( [-1,3] [,5] [1,] [-,1] x = ( [0,11] [-4,0] ( [-1,3] [,5] x = [1, 11] [0, 11] ( [1,] [-,1] x = [ 6, 1] [ 4, 0] x is a weak solution with Ω 1 = {}, Ω = φ, Ω 3 = {1}, Γ 1 = {}, Γ = {1}, Γ 3 = φ. Based on the examples, we know that tolerance solutions, control solutions and algebraic solutions are weak solutions of special type. Different combinations of Ω 1, Ω, Ω 3 and Γ 1, Γ, Γ 3 Figure. make up difference types of weak solutions. Next, we introduce another type of weak solution. 4. The definition of tolerance-control solution to interval linear equations For interval linear equations Ax = b, let T = {i (Ax i b i }, C = {i (Ax i b i }, U = {1,, m}. A vector x R n is called a tolerance-control solution of interval linear equations if there holds T C = U. Especially, if T = U, x is a tolerance solution; if C = U, x is a control solution. We can see the differences between tolerance solution, control solution, L-localized solution, R-localized solution and the new solution, tolerance-control solution in the two-dimensional case(see figure and figure 3. The introduction of tolerance-control solution make solutions of interval linear equations more perfect, what s more, it has important significance and application value, take black box (see Figure4 for example. x R n is the input data, the input-output relationship is y = Ax, where A R m n, A = (a ij. Suppose that we don t know the precise data of the element a ij, but we know it is within a interval a ij, i.e. a ij a ij, which constitutes an interval matrix A = (a ij. In this case, the black box has been transformed into interval linear equations. Sergey P.Shary use this model to introduce the tolerance solution and the control solution. For the required tolerance b and any values of the parameters a ij a ij. if the input signals x satisfies Ax b, x is called a tolerance solu- 0
4 Figure 4. Figure 3. tion. If the input signal x satisfies Ax b, x is called a control solution. But for a input signal x, if some components satisfy (Ax i b i, the rest components satisfy (Ax i b i, we call this x is a tolerance-control solution. 5. The characterizations of tolerance-control solution of interval linear equations Theorem 1 A vector x R n is called a tolerance-control solution of interval linear equations Ax = b if and only if there holds (A c x i (b c i (A x i + (b i, i T (A c x i (b c i (A x i (b i, i C where T C = U. Proof. If x is a tolerance-control solution, there holds i T, satisfies (Ax i b i. i C satisfies (Ax i b i. We have (Ax i = [(A c x i (A x i, (A c x i + (A x i ]. (Ax i b i (i T implies i.e. b i (Ax i (Ax i b i (i T, (b c i (b i (A c x i (A x i (A c x i +(A x i (b c i +(b i where(i T. which implies (A c x i (b c i (A x i + (b i, (i T. Similarly, (Ax i b i, (i C can deduced we also have (A c x i (b c i (A x i (b i, (i C. Conversely, if there holds T C = U (A c x i (b c i (A x i + (b i, (i T then it can deduced that (Ax i b i, (i T. Similarly, (A c x i (b c i (A x i (b i, (i C can deduced that (Ax i b i, (i C. In addition, T C = U, which gives that x is a tolerance-control solution. Theorem A vector x R n is called a tolerance-control solution of interval linear equations Ax = b if and only if there holds (A ez x i b i, i T (A ez x i b i, i T (A ez x i b i, i C (A ez x i b i, i C where T C = U. Proof. According to lemma 6, there holdsax = A ez x,ax = A ez x, then we have (Ax i = (A ez x i, (Ax i = (A ez x i, (i T So (Ax i b i, (i T is equivalent to (A ez x i b i, (A ez x i b i, (i T (Ax i b i, (i C is equivalent to (A ez x i b i, (A ez x i b i, (i C. 1
5 6. Conclusions In this paper, we have divided weak solutions of interval linear equations based on vector components, we know that tolerance solutions, control solutions and algebraic solutions are weak solutions with special form. In addition, there are many other types of weak solutions we haven t discussed. Another important solution, the tolerance-control solution is introduced, the paper described the characterizations of the new solutions. 7 Acknowledgements This project was supported by the National Natural Science Foundation of China (Grant No , and Zhejiang province university students innovative and undertaking incubator program (R References [1] Wei Li,Huping Wang,Qing Wang.Localized solutions to interval linear equations.journal of computational and applied mathematics, 01,38(15:9-38. [] Baoding Liu, Theory and practice of uncertain programming, third ed., Springer, Berlin, 009. [3] G. Alefeld, J. Herzberger, Introduction to Interval Computations, Academic Press, NewYork, [4] A. Neumaier, Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, [5] J. Rohn, Systems of linear interval equations, Linear Algebra Appl. 16 ( [6] G. Alefeld, V. Kreinovich, G. Mayer, On the solution sets of particular classes of linear interval systems, J. Comput. Appl. Math. 15 ( [7] M. Hladík, Interval Linear Programming: A Survey, In: Zoltan Adam Mann Edits, Linear Programming New Frontiers. Nova Science Publishers Inc., 011. [8] M. Hladík, Optimal value bounds in nonlinear programming with interval data, TOP 19 (1 ( doi: /s y. [9] M. Hladík, Description of symmetric and skewsymmetric solution set, SIAM J. Matrix Anal. Appl. 30 (( [10] M. Hladík, Optimal value range in interval linear programming, Fuzzy Optim. Decis. Mak. 8(3 ( [11] M. Hladík, Additive and multiplicative tolerance in multiobjective linear programming, Oper. Res. Lett. 36(3 ( [1] M. Hladík, Multiparametric linear programming: support set and optimal partition invariancy, Technical Report KAMDIMATIA Series( , Department of Applied Mathematics, Prague, 007. [13] M. Hladłk, Tolerance analysis in linear programming, Technical Report KAMDIMATIA Series ( , Department of Applied Mathematics, Prague, 008. [14] Aharon Ben-Tal, A.Goryashko, E.Guslitzer, Arkadi Nemirovski, Adjustable robust solutions of uncertain linear programs, Math. Program. 99 (004, no.. [15] E. Nuding and J. Wilhelm, Über Gleichungen und über Lösungen, Zeitschrift für Angewandte Mathematik und Mechanik, 5 ( [16] J. Rohn, Input-output planning with inexact data, Freiburger Intervall-Berichte 78/9, Albert-Ludwigs- Universität, Freiburg, [17] Wei Li, Xiaoli Tian, Numerical solution method for general interval quadratic programming, Applied Mathematics and Computation, 0 ( [18] Wei Li, Xiaoli Tian, Fault detection in discrete dynamic systems with uncertainty based on interval optimization, Mathematical modelling and analysis, 16(4 ( [19] A. Neumaier, Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, [0] M. Fiedler, J. Nedoma, J. Ramik, J. Rohn, K. Zimmermann, Linear optimization problems within exact data, Springer, New York, 006. [1] A. Neumaier, Tolerance analysis with interval arithmetic, Freiburger Intervall-Berichte 86(9 ( [] B. Kelling, D. Oelschliagel, Zur Losung von linearen Toleranzproblemen, Wiss. Z. TH Leuna-Merseburg 33(1 ( [3] S. P. Shary, Solving the interval linear tolerance problem, Math. Comput Simulation 39 ( [4] S. P. Shary, Controllable solution set to interval static systems, Math. Comput Simulation 86 (
arxiv: v1 [cs.na] 7 Jul 2017
AE regularity of interval matrices Milan Hladík October 4, 2018 arxiv:1707.02102v1 [cs.na] 7 Jul 2017 Abstract Consider a linear system of equations with interval coefficients, and each interval coefficient
More informationInstitute of Computer Science. Compact Form of the Hansen-Bliek-Rohn Enclosure
Institute of Computer Science Academy of Sciences of the Czech Republic Compact Form of the Hansen-Bliek-Rohn Enclosure Jiří Rohn http://uivtx.cs.cas.cz/~rohn Technical report No. V-1157 24.03.2012 Pod
More informationNP-hardness results for linear algebraic problems with interval data
1 NP-hardness results for linear algebraic problems with interval data Dedicated to my father, Mr. Robert Rohn, in memoriam J. Rohn a a Faculty of Mathematics and Physics, Charles University, Malostranské
More informationAN IMPROVED THREE-STEP METHOD FOR SOLVING THE INTERVAL LINEAR PROGRAMMING PROBLEMS
Yugoslav Journal of Operations Research xx (xx), Number xx, xx DOI: https://doi.org/10.2298/yjor180117020a AN IMPROVED THREE-STEP METHOD FOR SOLVING THE INTERVAL LINEAR PROGRAMMING PROBLEMS Mehdi ALLAHDADI
More informationInterval solutions for interval algebraic equations
Mathematics and Computers in Simulation 66 (2004) 207 217 Interval solutions for interval algebraic equations B.T. Polyak, S.A. Nazin Institute of Control Sciences, Russian Academy of Sciences, 65 Profsoyuznaya
More informationSolving Interval Linear Equations with Modified Interval Arithmetic
British Journal of Mathematics & Computer Science 10(2): 1-8, 2015, Article no.bjmcs.18825 ISSN: 2231-0851 SCIENCEDOMAIN international www.sciencedomain.org Solving Interval Linear Equations with Modified
More informationInverse interval matrix: A survey
Electronic Journal of Linear Algebra Volume 22 Volume 22 (2011) Article 46 2011 Inverse interval matrix: A survey Jiri Rohn Raena Farhadsefat Follow this and additional works at: http://repository.uwyo.edu/ela
More informationPositive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix
Positive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix Milan Hladík Charles University, Faculty of Mathematics and Physics, Department of Applied Mathematics, Malostranské
More informationRobust optimal solutions in interval linear programming with forall-exists quantifiers
Robust optimal solutions in interval linear programming with forall-exists quantifiers Milan Hladík October 5, 2018 arxiv:1403.7427v1 [math.oc] 28 Mar 2014 Abstract We introduce a novel kind of robustness
More informationA Solution Algorithm for a System of Interval Linear Equations Based on the Constraint Interval Point of View
A Solution Algorithm for a System of Interval Linear Equations Based on the Constraint Interval Point of View M. Keyanpour Department of Mathematics, Faculty of Sciences University of Guilan, Iran Kianpour@guilan.ac.ir
More informationLINEAR INTERVAL INEQUALITIES
LINEAR INTERVAL INEQUALITIES Jiří Rohn, Jana Kreslová Faculty of Mathematics and Physics, Charles University Malostranské nám. 25, 11800 Prague, Czech Republic 1.6.1993 Abstract We prove that a system
More informationarxiv: v1 [math.na] 28 Jun 2013
A New Operator and Method for Solving Interval Linear Equations Milan Hladík July 1, 2013 arxiv:13066739v1 [mathna] 28 Jun 2013 Abstract We deal with interval linear systems of equations We present a new
More informationInterval Gauss-Seidel Method for Generalized Solution Sets to Interval Linear Systems
Reliable Computing 7: 141 155, 2001. 141 c 2001 Kluwer Academic Publishers. Printed in the Netherlands. Interval Gauss-Seidel Method for Generalized Solution Sets to Interval Linear Systems SERGEY P. SHARY
More informationA NOTE ON CHECKING REGULARITY OF INTERVAL MATRICES
A NOTE ON CHECKING REGULARITY OF INTERVAL MATRICES G. Rex and J. Rohn Abstract It is proved that two previously known sufficient conditions for regularity of interval matrices are equivalent in the sense
More informationSeparation of convex polyhedral sets with uncertain data
Separation of convex polyhedral sets with uncertain data Milan Hladík Department of Applied Mathematics Charles University Malostranské nám. 25 118 00 Prague Czech Republic e-mail: milan.hladik@matfyz.cz
More informationYimin Wei a,b,,1, Xiezhang Li c,2, Fanbin Bu d, Fuzhen Zhang e. Abstract
Linear Algebra and its Applications 49 (006) 765 77 wwwelseviercom/locate/laa Relative perturbation bounds for the eigenvalues of diagonalizable and singular matrices Application of perturbation theory
More informationInterval linear algebra
Charles University in Prague Faculty of Mathematics and Physics HABILITATION THESIS Milan Hladík Interval linear algebra Department of Applied Mathematics Prague 204 Contents Preface 3 Interval linear
More informationRobust linear optimization under general norms
Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn
More informationMultiplicative Perturbation Bounds of the Group Inverse and Oblique Projection
Filomat 30: 06, 37 375 DOI 0.98/FIL67M Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Multiplicative Perturbation Bounds of the Group
More informationGlobal Optimization by Interval Analysis
Global Optimization by Interval Analysis Milan Hladík Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic, http://kam.mff.cuni.cz/~hladik/
More informationInterval Robustness in Linear Programming
Interval Robustness in Linear Programming Milan Hladík Department of Applied Mathematics Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic http://kam.mff.cuni.cz/~hladik/
More informationHistogram Arithmetic under Uncertainty of. Probability Density Function
Applied Mathematical Sciences, Vol. 9, 015, no. 141, 7043-705 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ams.015.510644 Histogram Arithmetic under Uncertainty of Probability Density Function
More informationFor δa E, this motivates the definition of the Bauer-Skeel condition number ([2], [3], [14], [15])
LAA 278, pp.2-32, 998 STRUCTURED PERTURBATIONS AND SYMMETRIC MATRICES SIEGFRIED M. RUMP Abstract. For a given n by n matrix the ratio between the componentwise distance to the nearest singular matrix and
More informationOn Interval Valued Fuzzy Det-Norm Matrix with Partitions
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 14, Issue 3 Ver. I (May - June 2018), PP 73-83 www.iosrjournals.org On Interval Valued Fuzzy Det-Norm Matrix with Partitions
More informationINTERVAL MATHEMATICS TECHNIQUES FOR CONTROL THEORY COMPUTATIONS
INTERVAL MATHEMATICS TECHNIQUES FOR CONTROL THEORY COMPUTATIONS R. Baker Kearfott Department of Mathematics University of Southwestern Louisiana Lafayette, Louisiana 70504-1010 1 Introduction and motivation
More informationRobust goal programming
Control and Cybernetics vol. 33 (2004) No. 3 Robust goal programming by Dorota Kuchta Institute of Industrial Engineering Wroclaw University of Technology Smoluchowskiego 25, 50-371 Wroc law, Poland Abstract:
More informationQuality of the Solution Sets of Parameter-Dependent Interval Linear Systems
Popova, E.: Quality of the Parameterised Solution Sets 7 ZAMM Z. angew. Math. Mech. 8 (00) 0, 7 77 Popova, E. Quality of the Solution Sets of Parameter-Dependent Interval Linear Systems Consider linear
More informationVarious proofs of the Cauchy-Schwarz inequality
OCTOGON MATHEMATICAL MAGAZINE Vol 17, No1, April 009, pp 1-9 ISSN 1-5657, ISBN 978-973-8855-5-0, wwwhetfaluro/octogon 1 Various proofs of the Cauchy-Schwarz inequality Hui-Hua Wu and Shanhe Wu 0 ABSTRACT
More informationSQUARE-ROOT FAMILIES FOR THE SIMULTANEOUS APPROXIMATION OF POLYNOMIAL MULTIPLE ZEROS
Novi Sad J. Math. Vol. 35, No. 1, 2005, 59-70 SQUARE-ROOT FAMILIES FOR THE SIMULTANEOUS APPROXIMATION OF POLYNOMIAL MULTIPLE ZEROS Lidija Z. Rančić 1, Miodrag S. Petković 2 Abstract. One-parameter families
More informationELA THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE. 1. Introduction. Let C m n be the set of complex m n matrices and C m n
Electronic Journal of Linear Algebra ISSN 08-380 Volume 22, pp. 52-538, May 20 THE OPTIMAL PERTURBATION BOUNDS FOR THE WEIGHTED MOORE-PENROSE INVERSE WEI-WEI XU, LI-XIA CAI, AND WEN LI Abstract. In this
More informationParallel Iterations for Cholesky and Rohn s Methods for Solving over Determined Linear Interval Systems
Research Journal of Mathematics and Statistics 2(3): 86-90, 2010 ISSN: 2040-7505 Maxwell Scientific Organization, 2010 Submitted Date: January 23, 2010 Accepted Date: February 11, 2010 Published Date:
More informationRobust portfolio selection under norm uncertainty
Wang and Cheng Journal of Inequalities and Applications (2016) 2016:164 DOI 10.1186/s13660-016-1102-4 R E S E A R C H Open Access Robust portfolio selection under norm uncertainty Lei Wang 1 and Xi Cheng
More informationIntroduction to Interval Computation
Introduction to Interval Computation Interval Programming 1 Milan Hladík 1 Michal Černý 2 1 Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic http://kam.mff.cuni.cz/~hladik/
More informationSolving Global Optimization Problems by Interval Computation
Solving Global Optimization Problems by Interval Computation Milan Hladík Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic, http://kam.mff.cuni.cz/~hladik/
More informationA note on the unique solution of linear complementarity problem
COMPUTATIONAL SCIENCE SHORT COMMUNICATION A note on the unique solution of linear complementarity problem Cui-Xia Li 1 and Shi-Liang Wu 1 * Received: 13 June 2016 Accepted: 14 November 2016 First Published:
More informationA Chance-Constrained Programming Model for Inverse Spanning Tree Problem with Uncertain Edge Weights
A Chance-Constrained Programming Model for Inverse Spanning Tree Problem with Uncertain Edge Weights 1 Xiang Zhang, 2 Qina Wang, 3 Jian Zhou* 1, First Author School of Management, Shanghai University,
More informationIN many real-life situations we come across problems with
Algorithm for Interval Linear Programming Involving Interval Constraints Ibraheem Alolyan Abstract In real optimization, we always meet the criteria of useful outcomes increasing or expenses decreasing
More informationTensor Complementarity Problem and Semi-positive Tensors
DOI 10.1007/s10957-015-0800-2 Tensor Complementarity Problem and Semi-positive Tensors Yisheng Song 1 Liqun Qi 2 Received: 14 February 2015 / Accepted: 17 August 2015 Springer Science+Business Media New
More informationPermutation transformations of tensors with an application
DOI 10.1186/s40064-016-3720-1 RESEARCH Open Access Permutation transformations of tensors with an application Yao Tang Li *, Zheng Bo Li, Qi Long Liu and Qiong Liu *Correspondence: liyaotang@ynu.edu.cn
More informationEXPLICIT CHARACTERIZATION OF A CLASS OF PARAMETRIC SOLUTION SETS
Доклади на Българската академия на науките Comptes rendus de l Académie bulgare des Sciences Tome 6, No 10, 009 MATHEMATIQUES Algèbre EXPLICIT CHARACTERIZATION OF A CLASS OF PARAMETRIC SOLUTION SETS Evgenija
More informationBounds on the radius of nonsingularity
Towards bounds on the radius of nonsingularity, Milan Hladík Department of Applied Mathematics, Charles University, Prague and Institute of Computer Science of the Academy of Czech Republic SCAN 2014,
More informationGoal Programming Approach for Solving Interval MOLP Problems
In the name of Absolute Power & Absolute Knowledge Goal Programming Approach for Solving Interval MOLP Problems S Rivaz, MA Yaghoobi and M Hladí 8th Small Worshop on Interval Methods Charles University
More informationarxiv: v1 [math.oc] 27 Feb 2018
arxiv:1802.09872v1 [math.oc] 27 Feb 2018 Interval Linear Programming under Transformations: Optimal Solutions and Optimal Value Range Elif Garajová Milan Hladík Miroslav Rada February 28, 2018 Abstract
More informationCONVERGENCE OF MULTISPLITTING METHOD FOR A SYMMETRIC POSITIVE DEFINITE MATRIX
J. Appl. Math. & Computing Vol. 182005 No. 1-2 pp. 59-72 CONVERGENCE OF MULTISPLITTING METHOD FOR A SYMMETRIC POSITIVE DEFINITE MATRIX JAE HEON YUN SEYOUNG OH AND EUN HEUI KIM Abstract. We study convergence
More informationSharp Interval Estimates for Finite Element Solutions with Fuzzy Material Properties
Sharp Interval Estimates for Finite Element Solutions with Fuzzy Material Properties R. L. Mullen, F.ASCE Department of Civil Engineering, Case Western Reserve University, Cleveland, Ohio 44106-7201 rlm@po.cwru.edu
More informationResearch Article An Equivalent LMI Representation of Bounded Real Lemma for Continuous-Time Systems
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 28, Article ID 67295, 8 pages doi:1.1155/28/67295 Research Article An Equivalent LMI Representation of Bounded Real Lemma
More informationOPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY
published in IMA Journal of Numerical Analysis (IMAJNA), Vol. 23, 1-9, 23. OPTIMAL SCALING FOR P -NORMS AND COMPONENTWISE DISTANCE TO SINGULARITY SIEGFRIED M. RUMP Abstract. In this note we give lower
More informationTwo Results About The Matrix Exponential
Two Results About The Matrix Exponential Hongguo Xu Abstract Two results about the matrix exponential are given. One is to characterize the matrices A which satisfy e A e AH = e AH e A, another is about
More informationELA ON THE GROUP INVERSE OF LINEAR COMBINATIONS OF TWO GROUP INVERTIBLE MATRICES
ON THE GROUP INVERSE OF LINEAR COMBINATIONS OF TWO GROUP INVERTIBLE MATRICES XIAOJI LIU, LINGLING WU, AND JULIO BENíTEZ Abstract. In this paper, some formulas are found for the group inverse of ap +bq,
More informationStability of interval positive continuous-time linear systems
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES, Vol. 66, No. 1, 2018 DOI: 10.24425/119056 Stability of interval positive continuous-time linear systems T. KACZOREK Białystok University of
More informationA NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES
Journal of Mathematical Sciences: Advances and Applications Volume, Number 2, 2008, Pages 3-322 A NEW EFFECTIVE PRECONDITIONED METHOD FOR L-MATRICES Department of Mathematics Taiyuan Normal University
More informationOn the convergence of uncertain random sequences
Fuzzy Optim Decis Making (217) 16:25 22 DOI 1.17/s17-16-9242-z On the convergence of uncertain random sequences H. Ahmadzade 1 Y. Sheng 2 M. Esfahani 3 Published online: 4 June 216 Springer Science+Business
More informationA Class of Interval-Newton-Operators. R. Krawczyk, Clausthal-Zellerfeld. Received March 26, 1984; revised July 17, Abstract -- Zusammenfassung
Computing 37, 179-183 (1986) Computin9 9 by Springer-Verlag 1986 A Class of Interval-Newton-Operators R. Krawczyk, Clausthal-Zellerfeld Received March 26, 1984; revised July 17, 1985 Abstract -- Zusammenfassung
More informationProperties for the Perron complement of three known subclasses of H-matrices
Wang et al Journal of Inequalities and Applications 2015) 2015:9 DOI 101186/s13660-014-0531-1 R E S E A R C H Open Access Properties for the Perron complement of three known subclasses of H-matrices Leilei
More informationConvergence Theorems of Approximate Proximal Point Algorithm for Zeroes of Maximal Monotone Operators in Hilbert Spaces 1
Int. Journal of Math. Analysis, Vol. 1, 2007, no. 4, 175-186 Convergence Theorems of Approximate Proximal Point Algorithm for Zeroes of Maximal Monotone Operators in Hilbert Spaces 1 Haiyun Zhou Institute
More informationarxiv: v1 [math.co] 10 Aug 2016
POLYTOPES OF STOCHASTIC TENSORS HAIXIA CHANG 1, VEHBI E. PAKSOY 2 AND FUZHEN ZHANG 2 arxiv:1608.03203v1 [math.co] 10 Aug 2016 Abstract. Considering n n n stochastic tensors (a ijk ) (i.e., nonnegative
More informationAlgorithmen zur digitalen Bildverarbeitung I
ALBERT-LUDWIGS-UNIVERSITÄT FREIBURG INSTITUT FÜR INFORMATIK Lehrstuhl für Mustererkennung und Bildverarbeitung Prof. Dr.-Ing. Hans Burkhardt Georges-Köhler-Allee Geb. 05, Zi 01-09 D-79110 Freiburg Tel.
More informationInverse Perron values and connectivity of a uniform hypergraph
Inverse Perron values and connectivity of a uniform hypergraph Changjiang Bu College of Automation College of Science Harbin Engineering University Harbin, PR China buchangjiang@hrbeu.edu.cn Jiang Zhou
More informationEnergy, Laplacian Energy and Zagreb Index of Line Graph, Middle Graph and Total Graph
Int. J. Contemp. Math. Sciences, Vol. 5, 21, no. 18, 895-9 Energy, Laplacian Energy and Zagreb Index of Line Graph, Middle Graph and Total Graph Zhongzhu Liu Department of Mathematics, South China Normal
More informationRobust l 1 and l Solutions of Linear Inequalities
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Applications and Applied Mathematics: An International Journal (AAM) Vol. 6, Issue 2 (December 2011), pp. 522-528 Robust l 1 and l Solutions
More informationarxiv: v1 [math.ra] 27 Jul 2013
Additive and product properties of Drazin inverses of elements in a ring arxiv:1307.7229v1 [math.ra] 27 Jul 2013 Huihui Zhu, Jianlong Chen Abstract: We study the Drazin inverses of the sum and product
More informationRunge-Kutta Method for Solving Uncertain Differential Equations
Yang and Shen Journal of Uncertainty Analysis and Applications 215) 3:17 DOI 1.1186/s4467-15-38-4 RESEARCH Runge-Kutta Method for Solving Uncertain Differential Equations Xiangfeng Yang * and Yuanyuan
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics NOTES ON AN INTEGRAL INEQUALITY QUÔ C ANH NGÔ, DU DUC THANG, TRAN TAT DAT, AND DANG ANH TUAN Department of Mathematics, Mechanics and Informatics,
More informationA Smoothing Newton Method for Solving Absolute Value Equations
A Smoothing Newton Method for Solving Absolute Value Equations Xiaoqin Jiang Department of public basic, Wuhan Yangtze Business University, Wuhan 430065, P.R. China 392875220@qq.com Abstract: In this paper,
More informationAcceleration of Levenberg-Marquardt method training of chaotic systems fuzzy modeling
ISSN 746-7233, England, UK World Journal of Modelling and Simulation Vol. 3 (2007) No. 4, pp. 289-298 Acceleration of Levenberg-Marquardt method training of chaotic systems fuzzy modeling Yuhui Wang, Qingxian
More informationInclusion Relationship of Uncertain Sets
Yao Journal of Uncertainty Analysis Applications (2015) 3:13 DOI 10.1186/s40467-015-0037-5 RESEARCH Open Access Inclusion Relationship of Uncertain Sets Kai Yao Correspondence: yaokai@ucas.ac.cn School
More informationSharp Bounds for Seiffert Mean in Terms of Arithmetic and Geometric Means 1
Int. Journal of Math. Analysis, Vol. 7, 01, no. 6, 1765-177 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ijma.01.49 Sharp Bounds for Seiffert Mean in Terms of Arithmetic and Geometric Means 1
More informationTHE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL
THE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL 1 MINXIA LUO, 2 NI SANG, 3 KAI ZHANG 1 Department of Mathematics, China Jiliang University Hangzhou, China E-mail: minxialuo@163.com ABSTRACT
More informationFinite-time hybrid synchronization of time-delay hyperchaotic Lorenz system
ISSN 1746-7659 England UK Journal of Information and Computing Science Vol. 10 No. 4 2015 pp. 265-270 Finite-time hybrid synchronization of time-delay hyperchaotic Lorenz system Haijuan Chen 1 * Rui Chen
More informationThe chromatic number and the least eigenvalue of a graph
The chromatic number and the least eigenvalue of a graph Yi-Zheng Fan 1,, Gui-Dong Yu 1,, Yi Wang 1 1 School of Mathematical Sciences Anhui University, Hefei 30039, P. R. China fanyz@ahu.edu.cn (Y.-Z.
More informationSome inequalities for unitarily invariant norms of matrices
Wang et al Journal of Inequalities and Applications 011, 011:10 http://wwwjournalofinequalitiesandapplicationscom/content/011/1/10 RESEARCH Open Access Some inequalities for unitarily invariant norms of
More informationMatrix Inequalities by Means of Block Matrices 1
Mathematical Inequalities & Applications, Vol. 4, No. 4, 200, pp. 48-490. Matrix Inequalities by Means of Block Matrices Fuzhen Zhang 2 Department of Math, Science and Technology Nova Southeastern University,
More informationConstraint propagation for univariate quadratic constraints
Constraint propagation for univariate quadratic constraints Arnold Neumaier Institut für Mathematik, Universität Wien Strudlhofgasse 4, A-1090 Wien, Austria email: Arnold.Neumaier@univie.ac.at WWW: http://www.mat.univie.ac.at/
More informationOn the Approximation of Linear AE-Solution Sets
On the Approximation of Linear AE-Solution Sets Alexandre Goldsztejn University of California, Irvine Irvine CA, USA agoldy@ics.uci.edu Gilles Chabert INRIA Sophia-Antipolis, France Gilles.Chabert@sophia.inria.fr
More informationON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES
olume 10 2009, Issue 2, Article 41, 10 pp. ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES HANYU LI, HU YANG, AND HUA SHAO COLLEGE OF MATHEMATICS AND PHYSICS CHONGQING UNIERSITY
More informationOptimal Preconditioning for the Interval Parametric Gauss Seidel Method
Optimal Preconditioning for the Interval Parametric Gauss Seidel Method Milan Hladík Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic http://kam.mff.cuni.cz/~hladik/ SCAN,
More informationKrylov Subspace Methods for the Evaluation of Matrix Functions. Applications and Algorithms
Krylov Subspace Methods for the Evaluation of Matrix Functions. Applications and Algorithms 2. First Results and Algorithms Michael Eiermann Institut für Numerische Mathematik und Optimierung Technische
More informationc 2009 Society for Industrial and Applied Mathematics
SIAM J MATRIX ANAL APPL Vol 30, No 4, pp 1761 1772 c 2009 Society for Industrial and Applied Mathematics INTERVAL GAUSSIAN ELIMINATION WITH PIVOT TIGHTENING JÜRGEN GARLOFF Abstract We present a method
More informationCheap and Tight Bounds: The Recent Result by E. Hansen Can Be Made More Efficient
Interval Computations No 4, 1993 Cheap and Tight Bounds: The Recent Result by E. Hansen Can Be Made More Efficient Jiří Rohn Improving the recent result by Eldon Hansen, we give cheap and tight bounds
More informationOn angle conditions in the finite element method. Institute of Mathematics, Academy of Sciences Prague, Czech Republic
On angle conditions in the finite element method Michal Křížek Institute of Mathematics, Academy of Sciences Prague, Czech Republic Joint work with Jan Brandts (University of Amsterdam), Antti Hannukainen
More informationON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES
ON WEIGHTED PARTIAL ORDERINGS ON THE SET OF RECTANGULAR COMPLEX MATRICES HANYU LI, HU YANG College of Mathematics and Physics Chongqing University Chongqing, 400030, P.R. China EMail: lihy.hy@gmail.com,
More informationANALYSIS AND APPLICATION OF DIFFUSION EQUATIONS INVOLVING A NEW FRACTIONAL DERIVATIVE WITHOUT SINGULAR KERNEL
Electronic Journal of Differential Equations, Vol. 217 (217), No. 289, pp. 1 6. ISSN: 172-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ANALYSIS AND APPLICATION OF DIFFUSION EQUATIONS
More informationResearch Article Stabilization Analysis and Synthesis of Discrete-Time Descriptor Markov Jump Systems with Partially Unknown Transition Probabilities
Research Journal of Applied Sciences, Engineering and Technology 7(4): 728-734, 214 DOI:1.1926/rjaset.7.39 ISSN: 24-7459; e-issn: 24-7467 214 Maxwell Scientific Publication Corp. Submitted: February 25,
More informationRecognition of hidden positive row diagonally dominant matrices
Electronic Journal of Linear Algebra Volume 10 Article 9 2003 Recognition of hidden positive row diagonally dominant matrices Walter D. Morris wmorris@gmu.edu Follow this and additional works at: http://repository.uwyo.edu/ela
More informationof Orthogonal Matching Pursuit
A Sharp Restricted Isometry Constant Bound of Orthogonal Matching Pursuit Qun Mo arxiv:50.0708v [cs.it] 8 Jan 205 Abstract We shall show that if the restricted isometry constant (RIC) δ s+ (A) of the measurement
More informationELA INTERVAL SYSTEM OF MATRIX EQUATIONS WITH TWO UNKNOWN MATRICES
INTERVAL SYSTEM OF MATRIX EQUATIONS WITH TWO UNKNOWN MATRICES A RIVAZ, M MOHSENI MOGHADAM, AND S ZANGOEI ZADEH Abstract In this paper, we consider an interval system of matrix equations contained two equations
More informationResearch Article Sharp Bounds by the Generalized Logarithmic Mean for the Geometric Weighted Mean of the Geometric and Harmonic Means
Applied Mathematics Volume 2012, Article ID 480689, 8 pages doi:10.1155/2012/480689 Research Article Sharp Bounds by the Generalized Logarithmic Mean for the Geometric Weighted Mean of the Geometric and
More informationThe Normalized Laplacian Estrada Index of a Graph
Filomat 28:2 (204), 365 37 DOI 0.2298/FIL402365L Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat The Normalized Laplacian Estrada
More informationELA ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES
ON A SCHUR COMPLEMENT INEQUALITY FOR THE HADAMARD PRODUCT OF CERTAIN TOTALLY NONNEGATIVE MATRICES ZHONGPENG YANG AND XIAOXIA FENG Abstract. Under the entrywise dominance partial ordering, T.L. Markham
More informationHopf Bifurcation and Limit Cycle Analysis of the Rikitake System
ISSN 749-3889 (print), 749-3897 (online) International Journal of Nonlinear Science Vol.4(0) No.,pp.-5 Hopf Bifurcation and Limit Cycle Analysis of the Rikitake System Xuedi Wang, Tianyu Yang, Wei Xu Nonlinear
More informationThe least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices
Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 22 2013 The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices Ruifang Liu rfliu@zzu.edu.cn
More informationComputers and Mathematics with Applications. Convergence analysis of the preconditioned Gauss Seidel method for H-matrices
Computers Mathematics with Applications 56 (2008) 2048 2053 Contents lists available at ScienceDirect Computers Mathematics with Applications journal homepage: wwwelseviercom/locate/camwa Convergence analysis
More informationBounds on eigenvalues of complex interval matrices
Bounds on eigenvalues of complex interval matrices Milan Hladík Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic SWIM 20, Bourges, France
More informationZhenjiang, Jiangsu, , P.R. China (Received 7 June 2010, accepted xx, will be set by the editor)
ISSN 1749-3889 print), 1749-3897 online) International Journal of Nonlinear Science Vol.132012) No.3,pp.380-384 Fractal Interpolation Functions on the Stability of Vertical Scale Factor Jiao Xu 1, Zhigang
More informationResearch on robust control of nonlinear singular systems. XuYuting,HuZhen
Advances in Engineering Research (AER), volume 107 2nd International Conference on Materials Engineering and Information Technology Applications (MEITA 2016) Research on robust control of nonlinear singular
More informationSome results on the reverse order law in rings with involution
Some results on the reverse order law in rings with involution Dijana Mosić and Dragan S. Djordjević Abstract We investigate some necessary and sufficient conditions for the hybrid reverse order law (ab)
More informationGeneralized Numerical Radius Inequalities for Operator Matrices
International Mathematical Forum, Vol. 6, 011, no. 48, 379-385 Generalized Numerical Radius Inequalities for Operator Matrices Wathiq Bani-Domi Department of Mathematics Yarmouk University, Irbed, Jordan
More informationOn the Laplacian Energy of Windmill Graph. and Graph D m,cn
International Journal of Contemporary Mathematical Sciences Vol. 11, 2016, no. 9, 405-414 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2016.6844 On the Laplacian Energy of Windmill Graph
More informationOn the computation of Hermite-Humbert constants for real quadratic number fields
Journal de Théorie des Nombres de Bordeaux 00 XXXX 000 000 On the computation of Hermite-Humbert constants for real quadratic number fields par Marcus WAGNER et Michael E POHST Abstract We present algorithms
More informationThe skew-symmetric orthogonal solutions of the matrix equation AX = B
Linear Algebra and its Applications 402 (2005) 303 318 www.elsevier.com/locate/laa The skew-symmetric orthogonal solutions of the matrix equation AX = B Chunjun Meng, Xiyan Hu, Lei Zhang College of Mathematics
More information