Estimation of AE-solution sets of square linear interval systems Alexandre Goldsztejn University of Nice-Sophia Antipolis.

Slides:

Advertisements

Similar presentations

Numerical Solution of Linear Equations

Advertisements

Applied Informatics Štefan BEREŽNÝ

Generalised Inverses Modal Analysis and Modal Testing S. Ziaei Rad.

Matrices A matrix is a rectangular array of quantities (numbers, expressions or function), arranged in m rows and n columns x 3y.

Algebraic, transcendental (i.e., involving trigonometric and exponential functions), ordinary differential equations, or partial differential equations...

Point-wise Discretization Errors in Boundary Element Method for Elasticity Problem Bart F. Zalewski Case Western Reserve University Robert L. Mullen Case.

LU - Factorizations Matrix Factorization into Triangular Matrices.

MATH 685/ CSI 700/ OR 682 Lecture Notes

Solving Linear Systems (Numerical Recipes, Chap 2)

SOLVING SYSTEMS OF LINEAR EQUATIONS. Overview A matrix consists of a rectangular array of elements represented by a single symbol (example: [A]). An individual.

Rayan Alsemmeri Amseena Mansoor. LINEAR SYSTEMS Jacobi method is used to solve linear systems of the form Ax=b, where A is the square and invertible.

MATRICES. EXAMPLES:

Special Matrices and Gauss-Siedel

ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 20 Solution of Linear System of Equations - Iterative Methods.

ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 19 Solution of Linear System of Equations - Iterative Methods.

ECIV 301 Programming & Graphics Numerical Methods for Engineers Lecture 14 Elimination Methods.

1 Neural Nets Applications Vectors and Matrices. 2/27 Outline 1. Definition of Vectors 2. Operations on Vectors 3. Linear Dependence of Vectors 4. Definition.

ECIV 520 Structural Analysis II Review of Matrix Algebra.

Finding Eigenvalues and Eigenvectors What is really important?

Partial differential equations Function depends on two or more independent variables This is a very simple one - there are many more complicated ones.

Matrices MSU CSE 260.

Arithmetic Operations on Matrices. 1. Definition of Matrix 2. Column, Row and Square Matrix 3. Addition and Subtraction of Matrices 4. Multiplying Row.

CE 311 K - Introduction to Computer Methods Daene C. McKinney

Dominant Eigenvalues & The Power Method

Chapter 8 Objectives Understanding matrix notation.

Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.

1 Chapter 6 – Determinant Outline 6.1 Introduction to Determinants 6.2 Properties of the Determinant 6.3 Geometrical Interpretations of the Determinant;

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 11.

1 Integer transform Wen - Chih Hong Graduate Institute of Communication Engineering National Taiwan University, Taipei,

Matrices. A matrix, A, is a rectangular collection of numbers. A matrix with “m” rows and “n” columns is said to have order m x n. Each entry, or element,

Matrix Multiplication The inner dimensions must be the same (or the number of columns in the first matrix is equal to the number of rows in the second.

Matrix Algebra and Regression a matrix is a rectangular array of elements m=#rows, n=#columns  m x n a single value is called a ‘scalar’ a single row.

Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Mar 4, 2011.

Matrices A matrix is a table or array of numbers arranged in rows and columns The order of a matrix is given by stating its dimensions. This is known as.

Elliptic PDEs and the Finite Difference Method

PHARMACOECONOMIC EVALUATIONS & METHODS MARKOV MODELING IN DECISION ANALYSIS FROM THE PHARMACOECONOMICS ON THE INTERNET ®SERIES ©Paul C Langley 2004 Maimon.

Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.

Meeting 18 Matrix Operations. Matrix If A is an m x n matrix - that is, a matrix with m rows and n columns – then the scalar entry in the i th row and.

Part 3 Chapter 12 Iterative Methods

WORKSHOP ERCIM Global convergence for iterative aggregation – disaggregation method Ivana Pultarova Czech Technical University in Prague, Czech Republic.

Monte Carlo Linear Algebra Techniques and Their Parallelization Ashok Srinivasan Computer Science Florida State University

Solving Scalar Linear Systems A Little Theory For Jacobi Iteration

2.5 – Determinants and Multiplicative Inverses of Matrices.

Network Systems Lab. Korea Advanced Institute of Science and Technology No.1 Maximum Norms & Nonnegative Matrices  Weighted maximum norm e.g.) x1x1 x2x2.

Matrices. Variety of engineering problems lead to the need to solve systems of linear equations matrixcolumn vectors.

1 SYSTEM OF LINEAR EQUATIONS BASE OF VECTOR SPACE.

ALGEBRAIC EIGEN VALUE PROBLEMS

Slide INTRODUCTION TO DETERMINANTS Determinants 3.1.

Monte Carlo Linear Algebra Techniques and Their Parallelization Ashok Srinivasan Computer Science Florida State University

Iterative Solution Methods

Part 3 Chapter 12 Iterative Methods

Finding the Inverse of a Matrix

Solving Systems of Linear Equations: Iterative Methods

بسم الله الرحمن الرحيم.

Gauss-Siedel Method.

Numerical Analysis Lecture12.

Definition of “outer” (energy) iteration

Iterative Methods Good for sparse matrices Jacobi Iteration

Section 7.4 Matrix Algebra.

A Comparison of some Iterative Methods in Scientific Computing

Matrix Methods Summary

Unit 3: Matrices

Numerical Analysis Lecture13.

MATRICES Operations with Matrices Properties of Matrix Operations

Linear Systems Numerical Methods.

Engineering Analysis ENG 3420 Fall 2009

Chapter 11 Chapter 11.

Linear Algebra Lecture 16.

Notes Over 6.1 Graphing a Linear Inequality Graph the inequality.

Pivoting, Perturbation Analysis, Scaling and Equilibration

Presentation transcript:

Estimation of AE-solution sets of square linear interval systems Alexandre Goldsztejn University of Nice-Sophia Antipolis

Outline United solution sets and Gauss-Seidel AE-solution sets Generalized intervals Generalized Gauss-Seidel Jacoby algorithm for AE-solution sets Construction of skew boxes

United solution set Consider an interval linear system: United solution set:

Gauss-Seidel iteration (1/2) Gauss-Seidel Algorithm: Fixed point algorithm for outer estimation. Component wise expression:

Gauss-Seidel iteration (2/2) Preconditioned system: Relationship original/preconditioned systems Gauss-Seidel applied to preconditioned system: OK for strongly regular matrices

AE-solution sets [Shary2004] Consider an interval linear system: Consider a quantifier for each parameter. A stands for universally quantified entries of A, A stands for existentially quantified entries of A, …

Special cases United solution set Tolerable solution set Controllable solution set

Generalized intervals (1/3) [Kaucher1973] Main tool for AE-solution sets Analogy with complex numbers: ProblemResolutionSolution

Generalized intervals (1/3) Set of generalized interval denoted Generalized intervals: classical (proper) intervals, [-1,1] Improper intervals, [1,-1] Proper improper intervals: dual[-1,1]=[1,-1] ; dual[1,-1]=[-1,1]

Generalized intervals (1/3) Interval arithmetic replaced by Kaucher arithmetic Addition and subtraction idem classical case. Multiplication and division idem classical for proper intervals.

Generalized Gauss-Seidel Outer estimation (1/2) Gauss Seidel for united solution set Generalized Gauss Seidel for parameter A ij : A ij dual(A ij ) for parameter b i : b i dual(b i )

Generalized Gauss-Seidel Outer estimation (2/2) x contains the AE-solution set Compatible with preconditioning Applied to the generalized interval matrix Works for strongly regular matrices Convention proper inversed for A ij inside Shary[2004] Inversion proposed here is motivated by a simpler presentation…

Jacoby iteration(1/2) Inner estimation Jacoby iteration Component wise expression:

Jacoby iteration(2/2) Inner estimation x inside the AE-solution set if proper Not compatible with preconditioning !!! Works only for strictly diagonally dominant matrix Not useful in practical situations

Postconditioning (1/2) Consider the postconditioned system Estimation of the postconditioned system using previously introduced iterations outer/inner boxes in an other base Apply so as to build a skew box in the original base

Postconditioning (2/2) Advantages: skew boxes more adapted to the shape of the solution set Compatible with both Gauss-Seidel and Jacoby Jacoby will now converge for any strongly regular matrices

Example(1/2) Hansen example, united solution set: Boxes estimatesSkew Boxes estimates

Example(2/2) Neumaier example United solution setTolerable solution set

Conclusion Skew boxes enhance both precision and convergence Can they be used in practical applications ? Strong limitation: Linear systems. Modal intervals for non-linear systems?