Discrete mathematical models in the analysis of splitting iterative methods for linear systems
|
|
- Marianna Jennings
- 5 years ago
- Views:
Transcription
1 Computers and Mathematics with Applications ) wwwelseviercom/locate/camwa Discrete mathematical models in the analysis of splitting iterative methods for linear systems Begoña Cantó, Carmen Coll, Elena Sánchez Institut de Matemàtica Multidisciplinar, Universitat Politècnica de València, Cami de Vera s/n, 46022, València, Spain Abstract Splitting methods are used to solve most of the linear systems, Ax = b, when the conventional method of Gauss is not efficient These methods use the factorization of the square matrix A into two matrices M and N as A = M N where M is nonsingular Basic iterative methods such as Jacobi or Gauss Seidel define the iterative scheme for matrices that have no zeros along its main diagonal This paper is concerned with the development of an iterative method to approximate solutions when the coefficient matrix A has some zero diagonal entries The algorithm developed in this paper involves the analysis of a discrete-time descriptor system given by the equation Mek + ) = Nek), ek) being the error vector c 2008 Published by Elsevier Ltd Keywords: Iterative methods; Descriptor systems; Stability property; Convergence; Discrete models Introduction Mathematical models of Life Science examine a number of different aspects of life, for instance animal behavior, human perception or the mechanics of human movement, etc, in which a suitable discrete or continuous model can be used to explore possible solutions Numerical simulation of the system is used to test the behavior of the model The theoretical results generated by computer simulations of the discrete model are compared with the observed results in direct experiments If the results from the discrete model simulations confirm the predictions then the model is accepted and the next step is to get the solution of the model This step lies in solving differential or difference equations, which are often not solvable exactly So very often numerical methods are used for investigating the solution This paper is supported by the Spanish grants AGL /AGR and MTM Corresponding author addresses: bcanto@matupves B Cantó), mccoll@matupves C Coll), esanchezj@matupves E Sánchez) /$ - see front matter c 2008 Published by Elsevier Ltd doi:006/jcamwa
2 728 B Cantó et al / Computers and Mathematics with Applications ) Real Problem Mathematical Model Numerical Method Real Solution Exact Solution Approximated Solution Experiment Numerical calculation In this work, the numerical analysis and solution of a linear system using discrete mathematical models are given We will establish a discrete model which consists of a descriptor system given by linear difference equations as follows: Ezk + ) = Fzk), where E can be singular for example, see a wide study of these systems in []) This descriptor model will be used to develop iterative methods which are more general in comparison to classical splitting methods used to solve most of the linear systems In fact, basic iterative methods such as Jacobi or Gauss Seidel suppose that matrix E has no zeros along its main diagonal see, for instance [2]) but our work develops iterative methods to approximate solutions when the coefficient matrix E has some zero diagonal entries The application of these iterative methods is given in many areas of science and technology with the need of an efficient method to solve systems when the coefficient matrix has some zero diagonal entries For carrying out the application of the method, we will illustrate the work with an example of the associated digraph where the basic rules of the networks are applied to obtain the associated matrix basic notions and results can be seen in [3]) For example, a network of pipes can be represented by Fig, where f i represents the flow of pipes considering that half of the flow remains in each node, that is, the model is Ax = b, where A b) = The paper is organized as follows First, we show an iterative method to solve a linear system such that the used factorization of matrix E leads to a descriptor system see )) and the asymptotic condition of convergence of the iterative method is established to see how the error tends to zero Next, two distinct factorizations of matrix E are considered: A convergence criteria and the algorithm for developing the method for each one of them Finally, an example is given to illustrate the results 2 Convergence of iterative methods We consider a linear system, Ax = b, with A R n n and x, b R n It is usual in iterative methods to split the matrix A into two matrices M and N, that is, A = M N with a structure determined see for instance [4]) The original linear system 2) can be rewritten as Mx = N x + b Given a suitable initial condition x0) we can obtain a sequence {xk), k Z}, because Mx) = N x0) + b This iteration continues to infinity and the used ) 2)
3 B Cantó et al / Computers and Mathematics with Applications ) Fig Network of pipes iterative method is convergent if the sequence {xk), k Z} converges to the vector x, x being the solution of Eq 2) In our case, matrix M is singular, then the system Mek + ) = Nek), 3) the error vector being ek) = xk) x, is a descriptor system If the system has a solution, it is given by the following expression see [5]), e k) = k M D N M D Me 0), 4) with M = λm N) N, N = λm N) N, M D is the Drazin inverse of matrix M and e0) X 0, where X 0 denotes the admissible initial condition set It is well-known that the method is globally convergent if, and only if, lim ek) = 0 x The convergence of the general iteration is implied by the asymptotic stability of system 3) and this occurs if ρ M D N < Note that system 3) being asymptotically stable is equivalent to saying that system 3) converges to solution 4) In the following sections we study the convergence of the Jacobi method and the Gauss Seidel method and we give an algorithm to find the solution of the system when the matrix M of the system is singular 3 Iterative method based on the Jacobi method The Jacobi method is an algorithm for determining the solutions of a system of linear equations In this method the matrix A of system 2) is divided into two matrices, A = M N, where M is constructed from the diagonal entries of matrix A and N = L + U, L and U being lower triangular, and upper triangular parts of the coefficient matrix A respectively without the diagonal entries The difference between the Jacobi method and the iterative method displayed in this paper is the singularity of matrix M This forces to us to study the convergence of this new method 3 Convergence of the method By a permutation matrix P R n n it is possible to obtain the following decomposition, D O N N M = and N = 2 5) O O N 3 N 4 In this case, we suppose N 3 = 0 and detn 4 ) 0 and we give the following result
4 730 B Cantó et al / Computers and Mathematics with Applications ) Proposition Consider system 2) and the Jacobi decomposition with the matrices M and N given in 5) Then, the method is convergent if ρd N ) < Proof Firstly we obtain the matrices involved in the solution of the system given by 4) From 5), we have λd N ) M = ) D O λd N ) and N = ) N O O O O I As system is asymptotically stable if ρ M D N) <, since M D D N = ) N O, O O the method converges if ρd N ) < Note that if the matrix A is singular the convergence of the method does not hold, such that if deta) = 0 and since by hypothesis detn 4 ) 0, then detd N ) = 0 That is, deti D N ) = 0, and there exists an eigenvalue with modulus and this fact contradicts that ρd N ) < In this case the next result is useful Proposition 2 Consider system 2) and the Jacobi decomposition with the matrix A singular and the matrix M given in 5) N is a nonsingular matrix Then the method is convergent if ρn M) D ) < Sketch of the proof System 3) has a solution since N is a nonsingular matrix Taking λ = 0, we have M = N M N = I and thus, the system converges if ρn M) D ) < 32 Iterative algorithm The iterative algorithm has the following steps: Step Introduce the matrices A, P and the vector b Step 2 Construct  = P AP T Step 3 Construct M from the diagonal entries of matrix  and N = M  Step 4 Determine the matrices D, N, N 2 and N 4 as in 5) and construct the vector b = [ b T bt 2 ] Step 5 Obtain a numerically solution x 2 from N 4x 2 k) = b 2 Step 6 Solve x ) = D N x 0) + D N 2 x 2 + D b, x 0) being an admissible initial condition Step 7 The new approximation solution is used as a boundary value for the next iteration 4 Iterative method based on the Gauss Seidel method The Gauss Seidel method is an other algorithm for determining the solutions of a system of linear equations In this method the matrix A of system 2) is divided into two matrices, A = M N, where M = D L, D and E being diagonal and lower triangular parts of the coefficient matrix A respectively and N = U is an upper triangular matrix without the diagonal entries of the matrix A In this paper the matrix M is nonsingular and this is the difference between the method presented and the traditional Gauss Seidel method
5 4 Convergence of the method B Cantó et al / Computers and Mathematics with Applications ) In this case with the permutation matrix P R n n we obtain the following decomposition, M O N N M = and N = 2 M 3 M 4 O N 4 M being a lower triangular matrix with different zero diagonal entries, that is detm ) 0, M 4 a lower triangular matrix with zero diagonal entries and N, and N 4 upper triangular matrix with zero diagonal entries and we consider N 2 = 0 The following proposition shows a characterization of the convergence of this iterative method Proposition 3 Consider system 2) and the Gauss Seidel decomposition with the matrices M and N given in 6) The general iteration is convergent if [ ] ) D ρm N ) < and ρ λm 4 N 4 ) M 4 λm4 N 4 ) N 4 < Proof The method is convergent if ρ M D N) < Constructing the matrices given in 6), we have M D M ) N = N O [λm 4 N 4 ) M 4 ] D λm 4 N 4 ) N 4 Then, the system is asymptotically stable and the method converges if ρm N ) < and ρ[λm 4 N 4 ) M 4 ] D λm 4 N 4 ) N 4 ) < 42 Iterative algorithm The iterative algorithm has the following steps: Step Introduce the matrices A, P and the vector b Step 2 Construct  = P AP T Step 3 Construct M from the lower triangular submatrix of  and N = M  Step 4 Determine the matrices M, M 3, M 4, N and N 4 as in 6) and the vector b = [ b T ] bt 2 Step 5 Obtain a numerically solution {x k), k Z} from x k + ) = M N x k) + M ) b Step 6 Solve M 4 x 2 ) = M 3 M N x 0) M 3M b + N 4 x 2 0) b 2, x 2 0) being an admissible initial condition Step 7 The new approximation solution is used as a boundary value for the next iteration 5 Application to a network of pipes We give the graph given in ) where the matrices A, P and the vectors b are given by, A =, P = b = ) T We use the iterative method based on the Jacobi method Thus, we obtain  = P AP T and M =, N = )
6 732 B Cantó et al / Computers and Mathematics with Applications ) In this case the matrix A is a nonsingular matrix, but the matrix M is a singular matrix, N 3 = 0 and detn 4 ) 0 In this case the eigenvalues of D N are 07937, i and i and the Jacobi method is convergent Then, if the initial condition is given by x 0 = [ x T x 2 0) = N 4 b 2 = x ) = D N x 0 D N 2 x 2 0) + D b = N 4 b 2) T] T, with x0 = 0, the first iteration is From iteration 56 the problem is solved with an approach of two units and the solution is x 56) = [ ] T From iteration 67 the problem is solved with an approach of three units and the solution is x 67) = [ ] T Finally, from iteration 80 the problem is solved and the solution is x 80) = [ ] T References [] L Dai, Singular Control Systems, Springer-Verlag, 989 [2] RL Burden, JD Faires, Numerical Analysis, Books/Cole Publishing Pacific Grove, CA, 200 [3] RK Ahuja, TL Magnanti, JB Orlin, Network Flows: Theory, Algorithms and Applications, Prentice Hall, 993 [4] GH Golub, CF Van Loan, Matrix Computations, Johns Hopkins Studies in Mathematical Sciences, 996 [5] SL Campbell, Singular Systems of Differential Equations, Pitman Books Ltd, London, 980
JACOBI S ITERATION METHOD
ITERATION METHODS These are methods which compute a sequence of progressively accurate iterates to approximate the solution of Ax = b. We need such methods for solving many large linear systems. Sometimes
More informationCHAPTER 5. Basic Iterative Methods
Basic Iterative Methods CHAPTER 5 Solve Ax = f where A is large and sparse (and nonsingular. Let A be split as A = M N in which M is nonsingular, and solving systems of the form Mz = r is much easier than
More informationOn the convergence of weighted-average consensus
On the convergence of weighted-average consensus Francisco Pedroche Miguel Rebollo Carlos Carrascosa Alberto Palomares arxiv:307.7562v [math.oc] 29 Jul 203 Abstract In this note we give sufficient conditions
More informationc 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp , March
SIAM REVIEW. c 1995 Society for Industrial and Applied Mathematics Vol. 37, No. 1, pp. 93 97, March 1995 008 A UNIFIED PROOF FOR THE CONVERGENCE OF JACOBI AND GAUSS-SEIDEL METHODS * ROBERTO BAGNARA Abstract.
More informationCAAM 454/554: Stationary Iterative Methods
CAAM 454/554: Stationary Iterative Methods Yin Zhang (draft) CAAM, Rice University, Houston, TX 77005 2007, Revised 2010 Abstract Stationary iterative methods for solving systems of linear equations are
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 informationA basic canonical form of discrete-time compartmental systems
Journal s Title, Vol x, 200x, no xx, xxx - xxx A basic canonical form of discrete-time compartmental systems Rafael Bru, Rafael Cantó, Beatriz Ricarte Institut de Matemàtica Multidisciplinar Universitat
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 informationGeneralized line criterion for Gauss-Seidel method
Computational and Applied Mathematics Vol. 22, N. 1, pp. 91 97, 2003 Copyright 2003 SBMAC Generalized line criterion for Gauss-Seidel method M.V.P. GARCIA 1, C. HUMES JR. 2 and J.M. STERN 2 1 Department
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 informationUp to this point, our main theoretical tools for finding eigenvalues without using det{a λi} = 0 have been the trace and determinant formulas
Finding Eigenvalues Up to this point, our main theoretical tools for finding eigenvalues without using det{a λi} = 0 have been the trace and determinant formulas plus the facts that det{a} = λ λ λ n, Tr{A}
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 informationIterative Methods for Ax=b
1 FUNDAMENTALS 1 Iterative Methods for Ax=b 1 Fundamentals consider the solution of the set of simultaneous equations Ax = b where A is a square matrix, n n and b is a right hand vector. We write the iterative
More informationIntroduction to Iterative Solvers of Linear Systems
Introduction to Iterative Solvers of Linear Systems SFB Training Event January 2012 Prof. Dr. Andreas Frommer Typeset by Lukas Krämer, Simon-Wolfgang Mages and Rudolf Rödl 1 Classes of Matrices and their
More informationHere is an example of a block diagonal matrix with Jordan Blocks on the diagonal: J
Class Notes 4: THE SPECTRAL RADIUS, NORM CONVERGENCE AND SOR. Math 639d Due Date: Feb. 7 (updated: February 5, 2018) In the first part of this week s reading, we will prove Theorem 2 of the previous class.
More informationReachability indices of positive linear systems
Electronic Journal of Linear Algebra Volume 11 Article 9 2004 Reachability indices of positive linear systems Rafael Bru rbru@matupves Carmen Coll Sergio Romero Elena Sanchez Follow this and additional
More informationDiscrete Optimization 23
Discrete Optimization 23 2 Total Unimodularity (TU) and Its Applications In this section we will discuss the total unimodularity theory and its applications to flows in networks. 2.1 Total Unimodularity:
More informationNilpotent completions of partial upper triangular matrices
Linear Algebra and its Applications 390 (2004) 209 254 wwwelseviercom/locate/laa Nilpotent completions of partial upper triangular matrices Ana María Urbano Departamento de Matemática Aplicada, Universidad
More informationIterative Methods. Splitting Methods
Iterative Methods Splitting Methods 1 Direct Methods Solving Ax = b using direct methods. Gaussian elimination (using LU decomposition) Variants of LU, including Crout and Doolittle Other decomposition
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
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 informationQuestion: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?
Section 5. The Characteristic Polynomial Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI? Property The eigenvalues
More informationComputational Methods. Systems of Linear Equations
Computational Methods Systems of Linear Equations Manfred Huber 2010 1 Systems of Equations Often a system model contains multiple variables (parameters) and contains multiple equations Multiple equations
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 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 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 informationIterative Methods for Smooth Objective Functions
Optimization Iterative Methods for Smooth Objective Functions Quadratic Objective Functions Stationary Iterative Methods (first/second order) Steepest Descent Method Landweber/Projected Landweber Methods
More informationComputational Economics and Finance
Computational Economics and Finance Part II: Linear Equations Spring 2016 Outline Back Substitution, LU and other decomposi- Direct methods: tions Error analysis and condition numbers Iterative methods:
More informationAlgebraic Multigrid Preconditioners for Computing Stationary Distributions of Markov Processes
Algebraic Multigrid Preconditioners for Computing Stationary Distributions of Markov Processes Elena Virnik, TU BERLIN Algebraic Multigrid Preconditioners for Computing Stationary Distributions of Markov
More informationModified Gauss Seidel type methods and Jacobi type methods for Z-matrices
Linear Algebra and its Applications 7 (2) 227 24 www.elsevier.com/locate/laa Modified Gauss Seidel type methods and Jacobi type methods for Z-matrices Wen Li a,, Weiwei Sun b a Department of Mathematics,
More information9. Iterative Methods for Large Linear Systems
EE507 - Computational Techniques for EE Jitkomut Songsiri 9. Iterative Methods for Large Linear Systems introduction splitting method Jacobi method Gauss-Seidel method successive overrelaxation (SOR) 9-1
More informationLecture Note 7: Iterative methods for solving linear systems. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 7: Iterative methods for solving linear systems Xiaoqun Zhang Shanghai Jiao Tong University Last updated: December 24, 2014 1.1 Review on linear algebra Norms of vectors and matrices vector
More informationClassical iterative methods for linear systems
Classical iterative methods for linear systems Ed Bueler MATH 615 Numerical Analysis of Differential Equations 27 February 1 March, 2017 Ed Bueler (MATH 615 NADEs) Classical iterative methods for linear
More informationTheory of Iterative Methods
Based on Strang s Introduction to Applied Mathematics Theory of Iterative Methods The Iterative Idea To solve Ax = b, write Mx (k+1) = (M A)x (k) + b, k = 0, 1,,... Then the error e (k) x (k) x satisfies
More informationIntroduction to Scientific Computing
(Lecture 5: Linear system of equations / Matrix Splitting) Bojana Rosić, Thilo Moshagen Institute of Scientific Computing Motivation Let us resolve the problem scheme by using Kirchhoff s laws: the algebraic
More informationPROCEEDINGS OF THE YEREVAN STATE UNIVERSITY MOORE PENROSE INVERSE OF BIDIAGONAL MATRICES. I
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Mathematical Sciences 205, 2, p. 20 M a t h e m a t i c s MOORE PENROSE INVERSE OF BIDIAGONAL MATRICES. I Yu. R. HAKOPIAN, S. S. ALEKSANYAN 2, Chair
More informationChapter 3. Determinants and Eigenvalues
Chapter 3. Determinants and Eigenvalues 3.1. Determinants With each square matrix we can associate a real number called the determinant of the matrix. Determinants have important applications to the theory
More informationScientific Computing WS 2018/2019. Lecture 9. Jürgen Fuhrmann Lecture 9 Slide 1
Scientific Computing WS 2018/2019 Lecture 9 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 9 Slide 1 Lecture 9 Slide 2 Simple iteration with preconditioning Idea: Aû = b iterative scheme û = û
More informationMATH 425-Spring 2010 HOMEWORK ASSIGNMENTS
MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS Instructor: Shmuel Friedland Department of Mathematics, Statistics and Computer Science email: friedlan@uic.edu Last update April 18, 2010 1 HOMEWORK ASSIGNMENT
More informationReachability and controllability of time-variant discrete-time positive linear systems
Control and Cybernetics vol. 33 (2004) No. 1 Reachability and controllability of time-variant discrete-time positive linear systems by Ventsi G. Rumchev 1 and Jaime Adeane 2 1 Department of Mathematics
More informationLINEAR SYSTEMS (11) Intensive Computation
LINEAR SYSTEMS () Intensive Computation 27-8 prof. Annalisa Massini Viviana Arrigoni EXACT METHODS:. GAUSSIAN ELIMINATION. 2. CHOLESKY DECOMPOSITION. ITERATIVE METHODS:. JACOBI. 2. GAUSS-SEIDEL 2 CHOLESKY
More informationA LINEAR SYSTEMS OF EQUATIONS. By : Dewi Rachmatin
A LINEAR SYSTEMS OF EQUATIONS By : Dewi Rachmatin Back Substitution We will now develop the backsubstitution algorithm, which is useful for solving a linear system of equations that has an upper-triangular
More informationSolution of Linear Equations
Solution of Linear Equations (Com S 477/577 Notes) Yan-Bin Jia Sep 7, 07 We have discussed general methods for solving arbitrary equations, and looked at the special class of polynomial equations A subclass
More informationLecture 18 Classical Iterative Methods
Lecture 18 Classical Iterative Methods MIT 18.335J / 6.337J Introduction to Numerical Methods Per-Olof Persson November 14, 2006 1 Iterative Methods for Linear Systems Direct methods for solving Ax = b,
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 informationACM106a - Homework 2 Solutions
ACM06a - Homework 2 Solutions prepared by Svitlana Vyetrenko October 7, 2006. Chapter 2, problem 2.2 (solution adapted from Golub, Van Loan, pp.52-54): For the proof we will use the fact that if A C m
More informationBOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION
K Y BERNETIKA VOLUM E 46 ( 2010), NUMBER 4, P AGES 655 664 BOUNDS OF MODULUS OF EIGENVALUES BASED ON STEIN EQUATION Guang-Da Hu and Qiao Zhu This paper is concerned with bounds of eigenvalues of a complex
More informationx x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
More informationA Refinement of Gauss-Seidel Method for Solving. of Linear System of Equations
Int. J. Contemp. Math. Sciences, Vol. 6, 0, no. 3, 7 - A Refinement of Gauss-Seidel Method for Solving of Linear System of Equations V. B. Kumar Vatti and Tesfaye Kebede Eneyew Department of Engineering
More informationMath 5630: Iterative Methods for Systems of Equations Hung Phan, UMass Lowell March 22, 2018
1 Linear Systems Math 5630: Iterative Methods for Systems of Equations Hung Phan, UMass Lowell March, 018 Consider the system 4x y + z = 7 4x 8y + z = 1 x + y + 5z = 15. We then obtain x = 1 4 (7 + y z)
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 informationMoore Penrose inverses and commuting elements of C -algebras
Moore Penrose inverses and commuting elements of C -algebras Julio Benítez Abstract Let a be an element of a C -algebra A satisfying aa = a a, where a is the Moore Penrose inverse of a and let b A. We
More informationWe first repeat some well known facts about condition numbers for normwise and componentwise perturbations. Consider the matrix
BIT 39(1), pp. 143 151, 1999 ILL-CONDITIONEDNESS NEEDS NOT BE COMPONENTWISE NEAR TO ILL-POSEDNESS FOR LEAST SQUARES PROBLEMS SIEGFRIED M. RUMP Abstract. The condition number of a problem measures the sensitivity
More informationMonomial subdigraphs of reachable and controllable positive discrete-time systems
Monomial subdigraphs of reachable and controllable positive discrete-time systems Rafael Bru a, Louis Caccetta b and Ventsi G. Rumchev b a Dept. de Matemàtica Aplicada, Univ. Politècnica de València, Camí
More information6. Iterative Methods for Linear Systems. The stepwise approach to the solution...
6 Iterative Methods for Linear Systems The stepwise approach to the solution Miriam Mehl: 6 Iterative Methods for Linear Systems The stepwise approach to the solution, January 18, 2013 1 61 Large Sparse
More informationProblem Set (T) If A is an m n matrix, B is an n p matrix and D is a p s matrix, then show
MTH 0: Linear Algebra Department of Mathematics and Statistics Indian Institute of Technology - Kanpur Problem Set Problems marked (T) are for discussions in Tutorial sessions (T) If A is an m n matrix,
More informationMath/CS 466/666: Homework Solutions for Chapter 3
Math/CS 466/666: Homework Solutions for Chapter 3 31 Can all matrices A R n n be factored A LU? Why or why not? Consider the matrix A ] 0 1 1 0 Claim that this matrix can not be factored A LU For contradiction,
More informationThe doubly negative matrix completion problem
The doubly negative matrix completion problem C Mendes Araújo, Juan R Torregrosa and Ana M Urbano CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica
More informationDocument downloaded from:
Document downloaded from: http://hdl.handle.net/1051/56036 This paper must be cited as: Cordero Barbero, A.; Torregrosa Sánchez, JR.; Penkova Vassileva, M. (013). New family of iterative methods with high
More informationSyDe312 (Winter 2005) Unit 1 - Solutions (continued)
SyDe3 (Winter 5) Unit - Solutions (continued) March, 5 Chapter 6 - Linear Systems Problem 6.6 - b Iterative solution by the Jacobi and Gauss-Seidel iteration methods: Given: b = [ 77] T, x = [ ] T 9x +
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More information7.6 The Inverse of a Square Matrix
7.6 The Inverse of a Square Matrix Copyright Cengage Learning. All rights reserved. What You Should Learn Verify that two matrices are inverses of each other. Use Gauss-Jordan elimination to find inverses
More informationPROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS
PROOF OF TWO MATRIX THEOREMS VIA TRIANGULAR FACTORIZATIONS ROY MATHIAS Abstract. We present elementary proofs of the Cauchy-Binet Theorem on determinants and of the fact that the eigenvalues of a matrix
More informationConjugate Gradient (CG) Method
Conjugate Gradient (CG) Method by K. Ozawa 1 Introduction In the series of this lecture, I will introduce the conjugate gradient method, which solves efficiently large scale sparse linear simultaneous
More informationA note on linear differential equations with periodic coefficients.
A note on linear differential equations with periodic coefficients. Maite Grau (1) and Daniel Peralta-Salas (2) (1) Departament de Matemàtica. Universitat de Lleida. Avda. Jaume II, 69. 251 Lleida, Spain.
More informationNumerical Analysis: Solutions of System of. Linear Equation. Natasha S. Sharma, PhD
Mathematical Question we are interested in answering numerically How to solve the following linear system for x Ax = b? where A is an n n invertible matrix and b is vector of length n. Notation: x denote
More informationM.A. Botchev. September 5, 2014
Rome-Moscow school of Matrix Methods and Applied Linear Algebra 2014 A short introduction to Krylov subspaces for linear systems, matrix functions and inexact Newton methods. Plan and exercises. M.A. Botchev
More informationA generalization of the Gauss-Seidel iteration method for solving absolute value equations
A generalization of the Gauss-Seidel iteration method for solving absolute value equations Vahid Edalatpour, Davod Hezari and Davod Khojasteh Salkuyeh Faculty of Mathematical Sciences, University of Guilan,
More informationNumerical methods, midterm test I (2018/19 autumn, group A) Solutions
Numerical methods, midterm test I (2018/19 autumn, group A Solutions x Problem 1 (6p We are going to approximate the limit 3/2 x lim x 1 x 1 by substituting x = 099 into the fraction in the present form
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 informationMonte Carlo Method for Finding the Solution of Dirichlet Partial Differential Equations
Applied Mathematical Sciences, Vol. 1, 2007, no. 10, 453-462 Monte Carlo Method for Finding the Solution of Dirichlet Partial Differential Equations Behrouz Fathi Vajargah Department of Mathematics Guilan
More informationExam in TMA4215 December 7th 2012
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 9 Contact during the exam: Elena Celledoni, tlf. 7359354, cell phone 48238584 Exam in TMA425 December 7th 22 Allowed
More informationThe convergence of stationary iterations with indefinite splitting
The convergence of stationary iterations with indefinite splitting Michael C. Ferris Joint work with: Tom Rutherford and Andy Wathen University of Wisconsin, Madison 6th International Conference on Complementarity
More information10.2 ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS. The Jacobi Method
54 CHAPTER 10 NUMERICAL METHODS 10. ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS As a numerical technique, Gaussian elimination is rather unusual because it is direct. That is, a solution is obtained after
More informationSPRING OF 2008 D. DETERMINANTS
18024 SPRING OF 2008 D DETERMINANTS In many applications of linear algebra to calculus and geometry, the concept of a determinant plays an important role This chapter studies the basic properties of determinants
More informationSubset selection for matrices
Linear Algebra its Applications 422 (2007) 349 359 www.elsevier.com/locate/laa Subset selection for matrices F.R. de Hoog a, R.M.M. Mattheij b, a CSIRO Mathematical Information Sciences, P.O. ox 664, Canberra,
More informationBindel, Fall 2016 Matrix Computations (CS 6210) Notes for
1 Iteration basics Notes for 2016-11-07 An iterative solver for Ax = b is produces a sequence of approximations x (k) x. We always stop after finitely many steps, based on some convergence criterion, e.g.
More informationEcon Slides from Lecture 7
Econ 205 Sobel Econ 205 - Slides from Lecture 7 Joel Sobel August 31, 2010 Linear Algebra: Main Theory A linear combination of a collection of vectors {x 1,..., x k } is a vector of the form k λ ix i for
More informationComputational Linear Algebra
Computational Linear Algebra PD Dr. rer. nat. habil. Ralf Peter Mundani Computation in Engineering / BGU Scientific Computing in Computer Science / INF Winter Term 2017/18 Part 3: Iterative Methods PD
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 informationMAT 610: Numerical Linear Algebra. James V. Lambers
MAT 610: Numerical Linear Algebra James V Lambers January 16, 2017 2 Contents 1 Matrix Multiplication Problems 7 11 Introduction 7 111 Systems of Linear Equations 7 112 The Eigenvalue Problem 8 12 Basic
More informationAdaptive algebraic multigrid methods in lattice computations
Adaptive algebraic multigrid methods in lattice computations Karsten Kahl Bergische Universität Wuppertal January 8, 2009 Acknowledgements Matthias Bolten, University of Wuppertal Achi Brandt, Weizmann
More information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
More informationScientific Computing
Scientific Computing Direct solution methods Martin van Gijzen Delft University of Technology October 3, 2018 1 Program October 3 Matrix norms LU decomposition Basic algorithm Cost Stability Pivoting Pivoting
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 informationIntroduction. Chapter One
Chapter One Introduction The aim of this book is to describe and explain the beautiful mathematical relationships between matrices, moments, orthogonal polynomials, quadrature rules and the Lanczos and
More informationCOURSE Iterative methods for solving linear systems
COURSE 0 4.3. Iterative methods for solving linear systems Because of round-off errors, direct methods become less efficient than iterative methods for large systems (>00 000 variables). An iterative scheme
More informationThe Solution of Linear Systems AX = B
Chapter 2 The Solution of Linear Systems AX = B 21 Upper-triangular Linear Systems We will now develop the back-substitution algorithm, which is useful for solving a linear system of equations that has
More informationNumerical Linear Algebra Homework Assignment - Week 2
Numerical Linear Algebra Homework Assignment - Week 2 Đoàn Trần Nguyên Tùng Student ID: 1411352 8th October 2016 Exercise 2.1: Show that if a matrix A is both triangular and unitary, then it is diagonal.
More informationOn The Belonging Of A Perturbed Vector To A Subspace From A Numerical View Point
Applied Mathematics E-Notes, 7(007), 65-70 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ On The Belonging Of A Perturbed Vector To A Subspace From A Numerical View
More informationNumerical Programming I (for CSE)
Technische Universität München WT 1/13 Fakultät für Mathematik Prof. Dr. M. Mehl B. Gatzhammer January 1, 13 Numerical Programming I (for CSE) Tutorial 1: Iterative Methods 1) Relaxation Methods a) Let
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More informationEE 581 Power Systems. Admittance Matrix: Development, Direct and Iterative solutions
EE 581 Power Systems Admittance Matrix: Development, Direct and Iterative solutions Overview and HW # 8 Chapter 2.4 Chapter 6.4 Chapter 6.1-6.3 Homework: Special Problem 1 and 2 (see handout) Overview
More informationIterative Methods and Multigrid
Iterative Methods and Multigrid Part 3: Preconditioning 2 Eric de Sturler Preconditioning The general idea behind preconditioning is that convergence of some method for the linear system Ax = b can be
More informationSome results about the index of matrix and Drazin inverse
Mathematical Sciences Vol. 4, No. 3 (2010) 283-294 Some results about the index of matrix and Drazin inverse M. Nikuie a,1, M.K. Mirnia b, Y. Mahmoudi b a Member of Young Researchers Club, Islamic Azad
More informationLinear Algebra. Brigitte Bidégaray-Fesquet. MSIAM, September Univ. Grenoble Alpes, Laboratoire Jean Kuntzmann, Grenoble.
Brigitte Bidégaray-Fesquet Univ. Grenoble Alpes, Laboratoire Jean Kuntzmann, Grenoble MSIAM, 23 24 September 215 Overview 1 Elementary operations Gram Schmidt orthonormalization Matrix norm Conditioning
More informationSolution of System of Linear Equations & Eigen Values and Eigen Vectors
Solution of System of Linear Equations & Eigen Values and Eigen Vectors P. Sam Johnson March 30, 2015 P. Sam Johnson (NITK) Solution of System of Linear Equations & Eigen Values and Eigen Vectors March
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)
AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences) Lecture 19: Computing the SVD; Sparse Linear Systems Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 432 21 1691 172 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Drazin inverse of partitioned
More informationSTRUCTURED SPATIAL DISCRETIZATION OF DYNAMICAL SYSTEMS
ECCOMAS Congress 2016 VII European Congress on Computational Methods in Applied Sciences and Engineering M. Papadrakakis, V. Papadopoulos, G. Stefanou, V. Plevris (eds. Crete Island, Greece, 5 10 June
More information