Optimal Preconditioning for the Interval Parametric Gauss Seidel Method
|
|
- Chester Hicks
- 5 years ago
- Views:
Transcription
1 Optimal Preconditioning for the Interval Parametric Gauss Seidel Method Milan Hladík Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic SCAN, Würzburg, Germany September 21 26, /13
2 Interval Linear Equations Interval Linear Equations Ax = b, A A, b b, where A := [A,A] = [A c A,A c +A ], b := [b,b] = [b c b,b c +b ] are an interval matrix and an interval vector, respectively. 2/13
3 Interval Linear Equations Interval Linear Equations Ax = b, A A, b b, where A := [A,A] = [A c A,A c +A ], b := [b,b] = [b c b,b c +b ] are an interval matrix and an interval vector, respectively. The Solution Set Σ := {x R n : A A, b b : Ax = b}. 2/13
4 Interval Linear Equations Interval Linear Equations Ax = b, A A, b b, where A := [A,A] = [A c A,A c +A ], b := [b,b] = [b c b,b c +b ] are an interval matrix and an interval vector, respectively. The Solution Set Σ := {x R n : A A, b b : Ax = b}. Problem formulation Find a tight interval vector enclosing Σ. 2/13
5 Preconditioning Preconditioning Let C R n n. Preconditioning is a relaxation to A x = b, A (CA), b (Cb), 3/13
6 Preconditioning Preconditioning Let C R n n. Preconditioning is a relaxation to Preconditioning A x = b, A (CA), b (Cb), usually we use C = (A c ) 1, theoretically justified by Neumaier (1984, 1990), optimal preconditioning for the interval Gauss Seidel method by Kearfott et al. (1990, 1991, 2008). 3/13
7 Preconditioning Preconditioning Let C R n n. Preconditioning is a relaxation to Preconditioning A x = b, A (CA), b (Cb), usually we use C = (A c ) 1, theoretically justified by Neumaier (1984, 1990), optimal preconditioning for the interval Gauss Seidel method by Kearfott et al. (1990, 1991, 2008). The Interval Gauss Seidel Method z i := 1 (Cb) i (CA) ij x j, x i := x i z i, (CA) ii j i for i = 1,...,n. 3/13
8 Interval Parametric Systems Interval Parametric System A(p)x = b(p), p p, where A(p) = A k p k, b(p) = b k p k, and p k p k, k = 1,...,K. k=1 k=1 4/13
9 Interval Parametric Systems Interval Parametric System A(p)x = b(p), p p, where A(p) = A k p k, b(p) = b k p k, k=1 k=1 and p k p k, k = 1,...,K. The Solution Set Σ p := {x R n : p p : A(p)x = b(p)}. 4/13
10 Interval Parametric Systems Interval Parametric System A(p)x = b(p), p p, where A(p) = A k p k, b(p) = b k p k, k=1 k=1 and p k p k, k = 1,...,K. The Solution Set Σ p := {x R n : p p : A(p)x = b(p)}. Preconditioning and Relaxation Relaxation to Ax = b, where A A := (CA k )p k, b b := (Cb k )p k. k=1 k=1 4/13
11 The Parametric Interval Gauss Seidel Method The Parametric Interval Gauss Seidel Method ( 1 z i := ( K ) k=1 (CAk ) ii p k k=1(cb k ) i p K k (CA k ) ij p k )x j, j i k=1 x i := x i z i, for i = 1,...,n. 5/13
12 The Parametric Interval Gauss Seidel Method The Parametric Interval Gauss Seidel Method ( 1 z i := ( K ) k=1 (CAk ) ii p k k=1(cb k ) i p K k (CA k ) ij p k )x j, j i k=1 x i := x i z i, for i = 1,...,n. Optimal Preconditioner Various criteria of optimality: minimize the resulting width, that is, the objective is min2z i, minimize the resulting upper bound, that is, the objective is minz i, maximize the resulting lower bound, that is, the objective is maxz i. 5/13
13 The Parametric Interval Gauss Seidel Method The Parametric Interval Gauss Seidel Method ( 1 z i := ( K ) k=1 (CAk ) ii p k k=1(cb k ) i p K k (CA k ) ij p k )x j, j i k=1 x i := x i z i, for i = 1,...,n. Optimal Preconditioner Various criteria of optimality: minimize the resulting width, that is, the objective is min2z i, minimize the resulting upper bound, that is, the objective is minz i, maximize the resulting lower bound, that is, the objective is maxz i. 5/13
14 Minimal Width Preconditioner Preliminaries For simplicity assume that 0 x and 0 z Denote by c the ith row of C, Normalize c such that the denominator has the form of [1,r] for some r 1. 6/13
15 Minimal Width Preconditioner Preliminaries For simplicity assume that 0 x and 0 z Denote by c the ith row of C, Normalize c such that the denominator has the form of [1,r] for some r 1. Interval Gauss Seidel Step Then the operation of the ith step of the Interval Gauss Seidel iteration is simplified to ( K ) z i := k=1(cb k )p k (ca k j )p k x j j i k=1 6/13
16 Minimal Width Preconditioner Preliminaries For simplicity assume that 0 x and 0 z Denote by c the ith row of C, Normalize c such that the denominator has the form of [1,r] for some r 1. Interval Gauss Seidel Step Then the operation of the ith step of the Interval Gauss Seidel iteration is simplified to ( K ) z i := k=1(cb k )p k (ca k j )p k x j j i k=1 The objective is minz i. 6/13
17 Minimal Width Preconditioner Denote minimize the width of β k := cb k, k = 1,...,K, k=1(cb k )p k j i α jk := ca k j, j = 1,...,n, k = 1,...,K, ( K ) η j := k=1 (cak j )p k x j, j i, ( K ) ψ j := k=1 (cak j )p k x j, j i. ( K (ca k j)p k )x j. k=1 7/13
18 Minimal Width Preconditioner subject to min k k=12p β k + (η j ψ j ), j i β k := cb k, k = 1,...,K, α jk := ca k j, j = 1,...,n, k = 1,...,K, ( K ) η j := k=1 (cak j )p k x j, j i, ( K ) ψ j := k=1 (cak j )p k x j, j i. 7/13
19 Minimal Width Preconditioner subject to min k k=12p β k + (η j ψ j ), j i β k cb k, β k cb k, k = 1,...,K, α jk := ca k j, j = 1,...,n, k = 1,...,K, ( K ) η j := k=1 (cak j )p k x j, j i, ( K ) ψ j := k=1 (cak j )p k x j, j i. 7/13
20 Minimal Width Preconditioner subject to min k k=12p β k + (η j ψ j ), j i β k cb k, β k cb k, k = 1,...,K, α jk ca k j, α jk ca k j, j = 1,...,n, k = 1,...,K, ( K ) η j := k=1 (cak j )p k x j, j i, ( K ) ψ j := k=1 (cak j )p k x j, j i. 7/13
21 Minimal Width Preconditioner subject to min k k=12p β k + (η j ψ j ), j i β k cb k, β k cb k, k = 1,...,K, α jk ca k j, α jk ca k j, j = 1,...,n, k = 1,...,K, η j c K k=1 Ak j pc k x j ± K k=1 p k x jα jk, j i, η j c K k=1 Ak j pc k x j + K k=1 p k x jα jk, j i, ( K ) ψ j := k=1 (cak j )p k x j, j i. 7/13
22 Minimal Width Preconditioner subject to min k k=12p β k + (η j ψ j ), j i β k cb k, β k cb k, k = 1,...,K, α jk ca k j, α jk ca k j, j = 1,...,n, k = 1,...,K, η j c K k=1 Ak j pc k x j ± K k=1 p k x jα jk, j i, η j c K k=1 Ak j pc k x j + K k=1 p k x jα jk, j i, ψ j c K k=1 Ak j pc k x j ± K k=1 p k x jα jk, j i, ψ j c K k=1 Ak j pc k x j K k=1 p k x jα jk, j i, 7/13
23 Minimal Width Preconditioner subject to min k k=12p β k + (η j ψ j ), j i β k cb k, β k cb k, k = 1,...,K, α jk ca k j, α jk ca k j, j = 1,...,n, k = 1,...,K, η j c K k=1 Ak j pc k x j ± K k=1 p k x jα jk, j i, η j c K k=1 Ak j pc k x j + K k=1 p k x jα jk, j i, ψ j c K k=1 Ak j pc k x j ± K k=1 p k x jα jk, j i, ψ j c K k=1 Ak j pc k x j K k=1 p k x jα jk, j i, and the condition that the denominator is has the form of [1,r] c K k=1 Ak i pc k K k=1 p k α ik = 1. 7/13
24 Minimal Width Preconditioner Optimization problem. Optimal preconditioner C found by n linear programming (LP) problems. each LP has Kn+K +3n 2 unknowns c, β k, α jk, η j, and ψ j, and 2Kn+4n 3 constraints C needn t be calculated in a verified way. The problem is effectively solved in polynomial time. 8/13
25 Minimal Width Preconditioner Optimization problem. Optimal preconditioner C found by n linear programming (LP) problems. each LP has Kn+K +3n 2 unknowns c, β k, α jk, η j, and ψ j, and 2Kn+4n 3 constraints C needn t be calculated in a verified way. The problem is effectively solved in polynomial time. Practical Implementation Call the standard version using midpoint inverse preconditioner (or any other method), and after that tighten the enclosure by using an optimal preconditioner C. In our examples: one iteration with minimization of the upper bound, and one with maximization of the upper bound. 8/13
26 Example I Example (Popova, 2002) ( ) 1 p1 A(p) =, b(p) = p 1 p 2 ( p3 p 3 ), p p = ([0,1], [1,4],[0,2]) T. 9/13
27 Example I Example (Popova, 2002) ( ) 1 p1 A(p) =, b(p) = p 1 p 2 ( p3 p 3 ), p p = ([0,1], [1,4],[0,2]) T. Initial enclosure by the Parametric Interval Gauss Seidel Method with midpoint inverse preconditioner: direct version: 7.66% of the width on average reduced residual form: 0% of the width on average reduced 9/13
28 Example I Example (Popova, 2002) ( ) 1 p1 A(p) =, b(p) = p 1 p 2 ( p3 p 3 ), p p = ([0,1], [1,4],[0,2]) T. Initial enclosure by the Parametric Interval Gauss Seidel Method with midpoint inverse preconditioner: direct version: 7.66% of the width on average reduced residual form: 0% of the width on average reduced Initial enclosure as the interval hull of the relaxed system: direct version: 50% of the width on average reduced residual form: 12.56% of the width on average reduced 9/13
29 Example II Example (Popova and Krämer, 2008) p 1 +p 2 p A(p) = 10 p 1 15+p 1 +p p 4 0, b(p) = 0 0 0, where p p = [8,12] [4,8] [8,12] [8,12]. 10/13
30 Example II Example (Popova and Krämer, 2008) p 1 +p 2 p A(p) = 10 p 1 15+p 1 +p p 4 0, b(p) = 0 0 0, where p p = [8,12] [4,8] [8,12] [8,12]. Initial enclosure by the Parametric Interval Gauss Seidel Method with midpoint inverse preconditioner: direct version: 15% of the width on average reduced residual form: 0% of the width on average reduced 10/13
31 Conclusion Summary Optimal preconditioning matrix for the parametric interval Gauss Seidel iterations. It can be computed effectively by linear programming. Preliminary results show that sometimes can reduce overestimation of the standard enclosures. 11/13
32 Conclusion Summary Optimal preconditioning matrix for the parametric interval Gauss Seidel iterations. It can be computed effectively by linear programming. Preliminary results show that sometimes can reduce overestimation of the standard enclosures. Directions for Further Research Other types of optimality of preconditioners (S-preconditioners, pivoting preconditioners, etc.) Optimal preconditioners for other methods than the parametric interval Gauss Seidel one. 11/13
33 References M. Hladík. Enclosures for the solution set of parametric interval linear systems. Int. J. Appl. Math. Comput. Sci., 22(3): , R. B. Kearfott. Preconditioners for the interval Gauss Seidel method. SIAM J. Numer. Anal., 27(3): , R. B. Kearfott, C. Hu, and M. Novoa III. A review of preconditioners for the interval Gauss Seidel method. Interval Comput., 1991(1):59 85, A. Neumaier. New techniques for the analysis of linear interval equations. Linear Algebra Appl., 58: , E. Popova. Quality of the solution sets of parameter-dependent interval linear systems. ZAMM, Z. Angew. Math. Mech., 82(10): , E. D. Popova and W. Krämer. Visualizing parametric solution sets. BIT, 48(1):95 115, /13
34 SWIM th Small Workshop on Interval Methods Come swim to Prague in June kam.mff.cuni.cz/conferences/swim2015
arxiv: 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 informationOptimal Preconditioners for Interval Gauss Seidel Methods
Optimal Preconditioners for Interval Gauss Seidel Methods R B Kearfott and Xiaofa Shi Introduction Consider the following nonlinear system f 1 x 1, x 2,, x n ) F X) f n x 1, x 2,, x n ) where bounds x
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 informationarxiv: 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 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 informationarxiv: v1 [math.na] 11 Sep 2018
DETERMINANTS OF INTERVAL MATRICES JAROSLAV HORÁČEK, MILAN HLADÍK, AND JOSEF MATĚJKA arxiv:1809.03736v1 [math.na] 11 Sep 2018 Abstract. In this paper we shed more light on determinants of interval matrices.
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 informationFind, with certainty, approximations to all solutions of the nonlinear system
æ A Review of Preconditioners for the Interval Gauss Seidel Method R. Baker Kearfott, Chenyi Hu, and Manuel Novoa III Department of Mathematics University of Southwestern Louisiana Abstract. Interval Newton
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 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 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 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 informationToday s class. Linear Algebraic Equations LU Decomposition. Numerical Methods, Fall 2011 Lecture 8. Prof. Jinbo Bi CSE, UConn
Today s class Linear Algebraic Equations LU Decomposition 1 Linear Algebraic Equations Gaussian Elimination works well for solving linear systems of the form: AX = B What if you have to solve the linear
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 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 informationKey words. conjugate gradients, normwise backward error, incremental norm estimation.
Proceedings of ALGORITMY 2016 pp. 323 332 ON ERROR ESTIMATION IN THE CONJUGATE GRADIENT METHOD: NORMWISE BACKWARD ERROR PETR TICHÝ Abstract. Using an idea of Duff and Vömel [BIT, 42 (2002), pp. 300 322
More informationSolving Linear Systems of Equations
November 6, 2013 Introduction The type of problems that we have to solve are: Solve the system: A x = B, where a 11 a 1N a 12 a 2N A =.. a 1N a NN x = x 1 x 2. x N B = b 1 b 2. b N To find A 1 (inverse
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 informationTotal Least Squares and Chebyshev Norm
Total Least Squares and Chebyshev Norm Milan Hladík 1 & Michal Černý 2 1 Department of Applied Mathematics Faculty of Mathematics & Physics Charles University in Prague, Czech Republic 2 Department of
More informationKey words. numerical linear algebra, global optimization, validated computing, interval analysis
ON PRECONDITIONERS AND SPLITTING IN THE INTERVAL GAUSS SEIDEL METHOD R. BAKER KEARFOTT AND SIRIPORN HONGTHONG Abstract. Finding bounding sets to solutions to systems of algebraic equations with uncertainties
More informationInterval Finite Element Methods for Uncertainty Treatment in Structural Engineering Mechanics Rafi L. Muhanna Georgia Institute of Technology USA
Interval Finite Element Methods for Uncertainty Treatment in Structural Engineering Mechanics Rafi L. Muhanna Georgia Institute of Technology USA Second Scandinavian Workshop on INTERVAL METHODS AND THEIR
More informationNumerical behavior of inexact linear solvers
Numerical behavior of inexact linear solvers Miro Rozložník joint results with Zhong-zhi Bai and Pavel Jiránek Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic The fourth
More informationA NEW METHOD FOR SOLVING ILL-CONDITIONED LINEAR SYSTEMS. Fazlollah Soleymani
Opuscula Math. 33, no. 2 (2013), 337 344 http://dx.doi.org/10.7494/opmath.2013.33.2.337 Opuscula Mathematica A NEW METHOD FOR SOLVING ILL-CONDITIONED LINEAR SYSTEMS Fazlollah Soleymani Communicated by
More informationTight Enclosure of Matrix Multiplication with Level 3 BLAS
Tight Enclosure of Matrix Multiplication with Level 3 BLAS K. Ozaki (Shibaura Institute of Technology) joint work with T. Ogita (Tokyo Woman s Christian University) 8th Small Workshop on Interval Methods
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 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 information9.1 Preconditioned Krylov Subspace Methods
Chapter 9 PRECONDITIONING 9.1 Preconditioned Krylov Subspace Methods 9.2 Preconditioned Conjugate Gradient 9.3 Preconditioned Generalized Minimal Residual 9.4 Relaxation Method Preconditioners 9.5 Incomplete
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 informationKey words. GMRES method, convergence bounds, worst-case GMRES, ideal GMRES, field of values
THE FIELD OF VALUES BOUNDS ON IDEAL GMRES JÖRG LIESEN AND PETR TICHÝ 27.03.2018) Abstract. A widely known result of Elman, and its improvements due to Starke, Eiermann and Ernst, gives a bound on the worst-case
More informationOn the Stability of LU-Factorizations
Australian Journal of Basic and Applied Sciences 5(6): 497-503 2011 ISSN 1991-8178 On the Stability of LU-Factorizations R Saneifard and A Asgari Department of Mathematics Oroumieh Branch Islamic Azad
More informationChapter 7 Iterative Techniques in Matrix Algebra
Chapter 7 Iterative Techniques in Matrix Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128B Numerical Analysis Vector Norms Definition
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 informationOn the influence of eigenvalues on Bi-CG residual norms
On the influence of eigenvalues on Bi-CG residual norms Jurjen Duintjer Tebbens Institute of Computer Science Academy of Sciences of the Czech Republic duintjertebbens@cs.cas.cz Gérard Meurant 30, rue
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 informationFast Verified Solutions of Sparse Linear Systems with H-matrices
Fast Verified Solutions of Sparse Linear Systems with H-matrices A. Minamihata Graduate School of Fundamental Science and Engineering, Waseda University, Tokyo, Japan aminamihata@moegi.waseda.jp K. Sekine
More informationNumerical Methods for Chemical Engineers
Numerical Methods for Chemical Engineers Chapter 3: System of Linear Algebraic Equation Morteza Esfandyari Email: Esfandyari.morteza@yahoo.com Mesfandyari.mihanblog.com Page 4-1 System of Linear Algebraic
More informationEXISTENCE VERIFICATION FOR SINGULAR ZEROS OF REAL NONLINEAR SYSTEMS
EXISTENCE VERIFICATION FOR SINGULAR ZEROS OF REAL NONLINEAR SYSTEMS JIANWEI DIAN AND R BAKER KEARFOTT Abstract Traditional computational fixed point theorems, such as the Kantorovich theorem (made rigorous
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 informationON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH
ON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH V. FABER, J. LIESEN, AND P. TICHÝ Abstract. Numerous algorithms in numerical linear algebra are based on the reduction of a given matrix
More informationA Method for Constructing Diagonally Dominant Preconditioners based on Jacobi Rotations
A Method for Constructing Diagonally Dominant Preconditioners based on Jacobi Rotations Jin Yun Yuan Plamen Y. Yalamov Abstract A method is presented to make a given matrix strictly diagonally dominant
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 informationExclusion regions for systems of equations
Exclusion regions for systems of equations Hermann Schichl and Arnold Neumaier Institut für Mathematik Universität Wien Strudlhofgasse 4 A-1090 Wien Austria email: Hermann.Schichl@esi.ac.at Arnold.Neumaier@univie.ac.at
More informationChapter 7. Iterative methods for large sparse linear systems. 7.1 Sparse matrix algebra. Large sparse matrices
Chapter 7 Iterative methods for large sparse linear systems In this chapter we revisit the problem of solving linear systems of equations, but now in the context of large sparse systems. The price to pay
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 informationTrigonometric Polynomials and Quartic Hyperbolic Ternary Forms
International Journal of Algebra, Vol. 5, 2011, no. 4, 159-166 Trigonometric Polynomials and Quartic Hyperbolic Ternary Forms Seiji Kitamura Graduate School of Science and Technology Hirosaki University,
More informationBoundary Value Problems - Solving 3-D Finite-Difference problems Jacob White
Introduction to Simulation - Lecture 2 Boundary Value Problems - Solving 3-D Finite-Difference problems Jacob White Thanks to Deepak Ramaswamy, Michal Rewienski, and Karen Veroy Outline Reminder about
More informationNotes on Some Methods for Solving Linear Systems
Notes on Some Methods for Solving Linear Systems Dianne P. O Leary, 1983 and 1999 and 2007 September 25, 2007 When the matrix A is symmetric and positive definite, we have a whole new class of algorithms
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 informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
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 informationCharacterization of half-radial matrices
Characterization of half-radial matrices Iveta Hnětynková, Petr Tichý Faculty of Mathematics and Physics, Charles University, Sokolovská 83, Prague 8, Czech Republic Abstract Numerical radius r(a) is the
More informationMAT016: Optimization
MAT016: Optimization M.El Ghami e-mail: melghami@ii.uib.no URL: http://www.ii.uib.no/ melghami/ March 29, 2011 Outline for today The Simplex method in matrix notation Managing a production facility The
More informationFoundations of Operations Research
Solved exercises for the course of Foundations of Operations Research Roberto Cordone The dual simplex method Given the following LP problem: maxz = 5x 1 +8x 2 x 1 +x 2 6 5x 1 +9x 2 45 x 1,x 2 0 1. solve
More information1 Number Systems and Errors 1
Contents 1 Number Systems and Errors 1 1.1 Introduction................................ 1 1.2 Number Representation and Base of Numbers............. 1 1.2.1 Normalized Floating-point Representation...........
More informationAMG for a Peta-scale Navier Stokes Code
AMG for a Peta-scale Navier Stokes Code James Lottes Argonne National Laboratory October 18, 2007 The Challenge Develop an AMG iterative method to solve Poisson 2 u = f discretized on highly irregular
More informationDepartment of Mathematics California State University, Los Angeles Master s Degree Comprehensive Examination in. NUMERICAL ANALYSIS Spring 2015
Department of Mathematics California State University, Los Angeles Master s Degree Comprehensive Examination in NUMERICAL ANALYSIS Spring 2015 Instructions: Do exactly two problems from Part A AND two
More informationMultipole-Based Preconditioners for Sparse Linear Systems.
Multipole-Based Preconditioners for Sparse Linear Systems. Ananth Grama Purdue University. Supported by the National Science Foundation. Overview Summary of Contributions Generalized Stokes Problem Solenoidal
More informationDiscrete ill posed problems
Discrete ill posed problems Gérard MEURANT October, 2008 1 Introduction to ill posed problems 2 Tikhonov regularization 3 The L curve criterion 4 Generalized cross validation 5 Comparisons of methods Introduction
More information10.34: Numerical Methods Applied to Chemical Engineering. Lecture 2: More basics of linear algebra Matrix norms, Condition number
10.34: Numerical Methods Applied to Chemical Engineering Lecture 2: More basics of linear algebra Matrix norms, Condition number 1 Recap Numerical error Operations Properties Scalars, vectors, and matrices
More informationREGULARITY RADIUS: PROPERTIES, APPROXIMATION AND A NOT A PRIORI EXPONENTIAL ALGORITHM
Electronic Journal of Linear Algebra Volume 33 Volume 33: Special Issue for the International Conference on Matrix Analysis and its Applications, MAT TRIAD 207 Article 2 208 REGULARITY RADIUS: PROPERTIES,
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 information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
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 informationHomework 6 Solutions
Homeork 6 Solutions Igor Yanovsky (Math 151B TA) Section 114, Problem 1: For the boundary-value problem y (y ) y + log x, 1 x, y(1) 0, y() log, (1) rite the nonlinear system and formulas for Neton s method
More informationLecture 4: Products of Matrices
Lecture 4: Products of Matrices Winfried Just, Ohio University January 22 24, 2018 Matrix multiplication has a few surprises up its sleeve Let A = [a ij ] m n, B = [b ij ] m n be two matrices. The sum
More informationExploiting hyper-sparsity when computing preconditioners for conjugate gradients in interior point methods
Exploiting hyper-sparsity when computing preconditioners for conjugate gradients in interior point methods Julian Hall, Ghussoun Al-Jeiroudi and Jacek Gondzio School of Mathematics University of Edinburgh
More informationFractions, Projective Representation, Duality, Linear Algebra and Geometry
Fractions, Projective Representation, Duality, Linear Algebra and Geometry Vaclav Skala Department of Computer Science and Engineering, Faculty of Applied Sciences, University of West Bohemia, Univerzitni
More informationFUNCTIONS OVER THE RESIDUE FIELD MODULO A PRIME. Introduction
FUNCTIONS OVER THE RESIDUE FIELD MODULO A PRIME DAVID LONDON and ZVI ZIEGLER (Received 7 March 966) Introduction Let F p be the residue field modulo a prime number p. The mappings of F p into itself are
More informationMath Introduction to Numerical Analysis - Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012.
Math 5620 - Introduction to Numerical Analysis - Class Notes Fernando Guevara Vasquez Version 1990. Date: January 17, 2012. 3 Contents 1. Disclaimer 4 Chapter 1. Iterative methods for solving linear systems
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 informationMultilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses
Multilevel Preconditioning of Graph-Laplacians: Polynomial Approximation of the Pivot Blocks Inverses P. Boyanova 1, I. Georgiev 34, S. Margenov, L. Zikatanov 5 1 Uppsala University, Box 337, 751 05 Uppsala,
More informationOn the interplay between discretization and preconditioning of Krylov subspace methods
On the interplay between discretization and preconditioning of Krylov subspace methods Josef Málek and Zdeněk Strakoš Nečas Center for Mathematical Modeling Charles University in Prague and Czech Academy
More informationJacobi method for small matrices
Jacobi method for small matrices Erna Begović University of Zagreb Joint work with Vjeran Hari CIME-EMS Summer School 24.6.2015. OUTLINE Why small matrices? Jacobi method and pivot strategies Parallel
More informationThe Moore-Penrose Inverse of. Intuitionistic Fuzzy Matrices
Int. Journal of Math. Analysis, Vol. 4, 2010, no. 36, 1779-1786 The Moore-Penrose Inverse of Intuitionistic Fuzzy Matrices S. Sriram 1 and P. Murugadas 2 Abstract In this paper, we define the various g-inverses
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Michaelmas Term 2015 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Michaelmas Term 2015 1 / 15 From equations to matrices For example, if we consider
More informationOn solving linear systems arising from Shishkin mesh discretizations
On solving linear systems arising from Shishkin mesh discretizations Petr Tichý Faculty of Mathematics and Physics, Charles University joint work with Carlos Echeverría, Jörg Liesen, and Daniel Szyld October
More information7.5 Operations with Matrices. Copyright Cengage Learning. All rights reserved.
7.5 Operations with Matrices Copyright Cengage Learning. All rights reserved. What You Should Learn Decide whether two matrices are equal. Add and subtract matrices and multiply matrices by scalars. Multiply
More informationA Note on Solutions of the Matrix Equation AXB = C
SCIENTIFIC PUBLICATIONS OF THE STATE UNIVERSITY OF NOVI PAZAR SER A: APPL MATH INFORM AND MECH vol 6, 1 (214), 45-55 A Note on Solutions of the Matrix Equation AXB C I V Jovović, B J Malešević Abstract:
More informationOn the Preconditioning of the Block Tridiagonal Linear System of Equations
On the Preconditioning of the Block Tridiagonal Linear System of Equations Davod Khojasteh Salkuyeh Department of Mathematics, University of Mohaghegh Ardabili, PO Box 179, Ardabil, Iran E-mail: khojaste@umaacir
More informationOn the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination
On the Skeel condition number, growth factor and pivoting strategies for Gaussian elimination J.M. Peña 1 Introduction Gaussian elimination (GE) with a given pivoting strategy, for nonsingular matrices
More informationA Comparison of Some Methods for Bounding Connected and Disconnected Solution Sets of Interval Linear Systems
A Comparison of Some Methods for Bounding Connected and Disconnected Solution Sets of Interval Linear Systems R. Baker Kearfott December 4, 2007 Abstract Finding bounding sets to solutions to systems of
More informationDEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix to upper-triangular
form) Given: matrix C = (c i,j ) n,m i,j=1 ODE and num math: Linear algebra (N) [lectures] c phabala 2016 DEN: Linear algebra numerical view (GEM: Gauss elimination method for reducing a full rank matrix
More informationSolving Linear Systems
Solving Linear Systems Iterative Solutions Methods Philippe B. Laval KSU Fall 2015 Philippe B. Laval (KSU) Linear Systems Fall 2015 1 / 12 Introduction We continue looking how to solve linear systems of
More informationarxiv: v1 [math.na] 11 Jul 2011
Multigrid Preconditioner for Nonconforming Discretization of Elliptic Problems with Jump Coefficients arxiv:07.260v [math.na] Jul 20 Blanca Ayuso De Dios, Michael Holst 2, Yunrong Zhu 2, and Ludmil Zikatanov
More informationMath/Phys/Engr 428, Math 529/Phys 528 Numerical Methods - Summer Homework 3 Due: Tuesday, July 3, 2018
Math/Phys/Engr 428, Math 529/Phys 528 Numerical Methods - Summer 28. (Vector and Matrix Norms) Homework 3 Due: Tuesday, July 3, 28 Show that the l vector norm satisfies the three properties (a) x for x
More informationChapter 1 Linear Programming. Paragraph 5 Duality
Chapter 1 Linear Programming Paragraph 5 Duality What we did so far We developed the 2-Phase Simplex Algorithm: Hop (reasonably) from basic solution (bs) to bs until you find a basic feasible solution
More informationTotal least squares. Gérard MEURANT. October, 2008
Total least squares Gérard MEURANT October, 2008 1 Introduction to total least squares 2 Approximation of the TLS secular equation 3 Numerical experiments Introduction to total least squares In least squares
More informationSolving Linear Systems
Solving Linear Systems Iterative Solutions Methods Philippe B. Laval KSU Fall 207 Philippe B. Laval (KSU) Linear Systems Fall 207 / 2 Introduction We continue looking how to solve linear systems of the
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 24: Preconditioning and Multigrid Solver Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 5 Preconditioning Motivation:
More informationEquations in Quadratic Form
Equations in Quadratic Form MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this lesson we will learn to: make substitutions that allow equations to be written
More informationRe-nnd solutions of the matrix equation AXB = C
Re-nnd solutions of the matrix equation AXB = C Dragana S. Cvetković-Ilić Abstract In this article we consider Re-nnd solutions of the equation AXB = C with respect to X, where A, B, C are given matrices.
More informationCS 323: Numerical Analysis and Computing
CS 323: Numerical Analysis and Computing MIDTERM #1 Instructions: This is an open notes exam, i.e., you are allowed to consult any textbook, your class notes, homeworks, or any of the handouts from us.
More informationTHE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR
THE PERTURBATION BOUND FOR THE SPECTRAL RADIUS OF A NON-NEGATIVE TENSOR WEN LI AND MICHAEL K. NG Abstract. In this paper, we study the perturbation bound for the spectral radius of an m th - order n-dimensional
More informationGeometric Multigrid Methods
Geometric Multigrid Methods Susanne C. Brenner Department of Mathematics and Center for Computation & Technology Louisiana State University IMA Tutorial: Fast Solution Techniques November 28, 2010 Ideas
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 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 informationIntroduction to Applied Linear Algebra with MATLAB
Sigam Series in Applied Mathematics Volume 7 Rizwan Butt Introduction to Applied Linear Algebra with MATLAB Heldermann Verlag Contents Number Systems and Errors 1 1.1 Introduction 1 1.2 Number Representation
More information3 (Maths) Linear Algebra
3 (Maths) Linear Algebra References: Simon and Blume, chapters 6 to 11, 16 and 23; Pemberton and Rau, chapters 11 to 13 and 25; Sundaram, sections 1.3 and 1.5. The methods and concepts of linear algebra
More informationVerified Solutions of Sparse Linear Systems by LU factorization
Verified Solutions of Sparse Linear Systems by LU factorization TAKESHI OGITA CREST, Japan Science and Technology Agency JST), and Faculty of Science and Engineering, Waseda University, Robert J. Shillman
More information