Square root of a symmetric matrix
|
|
- Hilary Antony Simpson
- 6 years ago
- Views:
Transcription
1 Square root of a symmetric matrix Mario Berljafa Stefan Güttel June 2015 Contents 1 Introduction 1 2 Running rkfit 1 3 Evaluating the rational approximant 2 4 Some different choices for the initial poles 3 5 Comparison with vector fitting 4 6 References 8 1 Introduction This is an example of RKFIT [1, 2, 3] being used for approximating Ab, the action of the matrix square root onto a vector b. RKFIT is described in [2, 3] and implemented in the RK Toolobox [1]. This code reproduces the example from [2, Section 5.2]. We also compare RKFIT to the vector fitting code VFIT3. Vector fitting is described in [4, 5]. We first define the matrix A, the vector b, and the matrix F corresponding to A. Our aim is then to find a rational function r(z) of type (m, m) such that F b r(a)b 2 / F b 2 min. N = 500; A = gallery ( ' tridiag ',N); b = eye (N,1) ; f sqrt (x); fm sqrtm ( full (X)); F = fm(a); exact = F*b; [U, D] = eig ( full (A)); ee = diag (D). '; 2 Running rkfit In order to run RKFIT we only need to specify the initial poles of r. In this example we pretend to not know that a reasonable choice of initial poles is on the negative real axis 1
2 (the branch cut of z) and choose 16 infinite poles ξ. As all quantities F, A, and b, as well as the initial poles are real, it is advised running RKFIT with the real option. This will attempt to produce a rational approximant with perfectly complex conjugate (or even real) poles. We perform 10 RKFIT s. m = 16; [xi, ratfun, misfit ] = rkfit (F, A, b, inf (1, m), 10, 'real '); It turns out that all computed poles are real negative: disp ( reshape (xi, 4, 4)) e e e e e e e e e e e e e e e e -05 Here is a convergence plot of RKFIT, showing the relative misfit F b r(a)b 2 / F b 2 at each. figure (1) semilogy ( misfit, 'ro -- ') xlabel ( ' '), title ( ' relative 2- norm misfit ') legend ( ' RKFIT ') relative 2-norm misfit RKFIT Evaluating the rational approximant The second output ratfun is an object that can be used to evaluate the computed rational approximant. This evaluation is implemented in two ways. The first option is to evaluate a matrix function r(a)b by calling ratfun(a,b) with two input arguments. For example, here we are calculating the absolute misfit or r: disp ( norm (F*b - ratfun (A, b))) 2
3 e -13 Alternatively, we can evaluate r(z) pointwise by giving only one input argument. Let us plot the modulus of the scalar error function err(x) = f(x) r(x) over the spectral interval of A, which is approximately [0, 4]. figure (2) xx = sort ([ logspace (-6, log10 (15.728), 5000), ee ]); errf = f(xx) - ratfun (xx); loglog (xx, abs ( errf ), 'm-') hold on errf = f(ee) - ratfun (ee); loglog (ee, abs ( errf ), 'g+ ') xlabel ( 'x '), title ( 'abs ( sqrt (x) - r(x)) ') legend ( ' RKFIT error ','error at evs ') 10-2 abs(sqrt(x) - r(x)) 10-4 RKFIT error error at evs How often does this error function change sign on [0, 4] (or rather on the discretisation set xx, which was chosen very fine with 5000 points)? Equivalently, how many interpolation points are there? sc = length ( find ( diff ( sign ( errf )))); disp ([ ' The error function has ' num2str ( sc) ' sign changes on [0,4]. ']) The error function has 33 sign changes on [0,4]. x 4 Some different choices for the initial poles Choosing all initial poles equal to infinity seemed to work fine. Of course we can achieve convergence in fewer s by choosing negative initial poles, e.g., logarithmically spaced on the negative real axis. Let us rerun RKFIT with the new initial poles and compare the convergence. 3
4 tmp = - logspace (-8, 8, m); [xi, ratfun, misfit ] = rkfit (F, A, b, tmp, 10, 'real '); figure (1), hold on semilogy ( misfit, 'rs -- ') legend ( ' RKFIT ( infinite init poles ) ',... ' RKFIT ( negative init poles ) ') relative 2-norm misfit 10-7 RKFIT (infinite init poles) RKFIT (negative init poles) Now let us try a very bad choice for the initial poles, which is to place them right into the spectral interval [0, 4] of A: tmp = linspace (0, 4, m); [xi, ratfun, misfit ] = rkfit (F, A, b, tmp, 10, 'real '); semilogy ( misfit, 'r*-- ') legend ( ' RKFIT ( infinite init poles ) ',... ' RKFIT ( negative init poles ) ',... ' RKFIT ( bad init poles ) ') 10-4 relative 2-norm misfit RKFIT (infinite init poles) RKFIT (negative init poles) RKFIT (bad init poles) 4
5 In this example, RKFIT is not very affected by the choice of the initial poles and converges robustly. 5 Comparison with vector fitting We now compare RKFIT with the vector fitting code described in [4, 5]. The following code makes sure the vectfit3 implementation of VFIT is on MATLAB s search path, and if it is, defines some options. if exist ( ' vectfit3 ') ~= 2 warning ( ' Vector fitting VFIT3 not found in the Matlab path. '); warning ( ' VFIT can be downloaded from : ') warning ( 'http :// www. sintef.no/ Projectweb / VECTFIT / Downloads / VFUT3 / ') warning ( ' Skipping comparison with VFIT3. '); return end xi = - logspace (-8, 8, m); opts. relax = 1; % Relaxed non - triviality constraint. opts. stable = 0; % Do not enforce stable poles. opts. asymp = 2; % Options are 1, 2, or 3. opts. skip_pole = 0; opts. skip_res = 0; opts. spy1 = 0; opts. spy2 = 0; opts. logx = 0; opts. logy = 0; opts. errplot = 0; opts. phaseplot = 0; For VFIT3 we need interpolation nodes and weights, and in this example these need to be chosen as the eigenvalues of A and the components of b in the eigenvector basis of A, respectively. Note: The below warnings outputted by VFIT are due to ill-conditioned linear algebra problems being solved, a problem that is circumvented with RKFIT by the use of discreteorthogonal rational basis functions. nodes = diag (D); nodes = nodes (:). '; fvals = f( nodes ); weights = U '* b; weights = weights (:). '; for iter = 1: 10 [SER, xi, rmserr, fit ] =... vectfit3 ( fvals, nodes, xi, weights, opts ); err_vfit ( iter ) = norm (( fvals - fit ).* weights )/ norm ( exact ); end figure (1) semilogy ( err_vfit, 'bs:') legend ( ' RKFIT ( infinite init poles ) ',' RKFIT ( negative init poles ) ',... 5
6 ' RKFIT ( bad init poles ) ','VFIT ( negative init poles ) ') axis ([1, 10, 1e -14, 1e -5]) ffit arrayfun (@(z)... sum (( SER.C). './(z- diag ( SER.A))) +... SER.D + z* SER.E,zz); figure (2) loglog (xx, abs (f(xx) - ffit (xx)), 'b: ') axis ([1e -5, 15.7, 1e -15, 5e -4]) set (gca, ' XTick ', 10.^( -5:1) ) legend ( ' RKFIT error ', ' error at evs ', 'VFIT error ') Warning : Matrix is close to singular or badly scaled. Results may be inaccurate. RCOND = e Warning : Rank deficient, rank = 14, tol = e Warning : Rank deficient, rank = 15, tol = e Warning : Rank deficient, rank = 16, tol = e Warning : Matrix is close to singular or badly scaled. Results may be inaccurate. RCOND = e Warning : Rank deficient, rank = 16, tol = e Warning : Rank deficient, rank = 16, tol = e Warning : Matrix is close to singular or badly scaled. Results may be inaccurate. RCOND = e relative 2-norm misfit RKFIT (infinite init poles) RKFIT (negative init poles) RKFIT (bad init poles) VFIT (negative init poles) 6
7 abs(sqrt(x) - r(x)) 10-4 RKFIT error error at evs VFIT error And the same with the bad initial poles xi = linspace (0, 4, m); for iter = 1: 10 [SER, xi, rmserr, fit ] =... vectfit3 ( fvals, nodes, xi, weights, opts ); err_vfit ( iter ) = norm (( fvals - fit ).* weights )/ norm ( exact ); end figure (1) semilogy ( err_vfit, 'b*: ') legend ( ' RKFIT ( infinite init poles ) ',... ' RKFIT ( negative init poles ) ',... ' RKFIT ( bad init poles ) ',... 'VFIT ( negative init poles ) ',... 'VFIT ( bad init poles ) ') x relative 2-norm misfit RKFIT (infinite init poles) RKFIT (negative init poles) RKFIT (bad init poles) VFIT (negative init poles) VFIT (bad init poles) This is the end of this example. The following creates a thumbnail. 7
8 figure (2), plot ( NaN ) abs(sqrt(x) - r(x)) 10-4 RKFIT error error at evs VFIT error x 6 References [1] M. Berljafa and S. Güttel. A Rational Krylov Toolbox for MATLAB, MIMS EPrint ( Manchester Institute for Mathematical Sciences, The University of Manchester, UK, [2] M. Berljafa and S. Güttel. Generalized rational Krylov decompositions with an application to rational approximation, SIAM J. Matrix Anal. Appl., 36(2): , [3] M. Berljafa and S. Güttel. The RKFIT algorithm for nonlinear rational approximation, SIAM J. Sci. Comput., 39(5):A2049 A2071, [4] B. Gustavsen. Improving the pole relocating properties of vector fitting, IEEE Trans. Power Del., 21(3): , [5] B. Gustavsen and A. Semlyen. Rational approximation of frequency domain responses by vector fitting, IEEE Trans. Power Del., 14(3): ,
Fitting an artificial frequency response
Fitting an artificial frequency response Mario Berljafa Stefan Güttel February 215 Contents 1 Introduction 1 2 Problem setup 1 3 Testing RKFIT 2 4 The rkfun class 3 5 Some other choices for the initial
More informationExponential of a nonnormal matrix
Exponential of a nonnormal matrix Mario Berljafa Stefan Güttel February 2015 Contents 1 Introduction 1 2 Running RKFIT with real data 1 3 Evaluating the rational approximant 3 4 Some other choices for
More informationInternational Space Station model
International Space Station model Mario Berljafa Stefan Güttel June 2015 Contents 1 Introduction 1 2 RKFIT and degree reduction 2 3 Comparison with VFIT 4 4 References 7 1 Introduction In this example
More informationCompressing exterior Helmholtz problems
Compressing exterior Helmholtz problems Stefan Güttel October 2016 Contents 1 Introduction 1 2 A two-layer waveguide example 2 3 Other examples 6 4 References 6 1 Introduction Finite difference (FD) methods
More informationBarycentric interpolation via the AAA algorithm
Barycentric interpolation via the AAA algorithm Steven Elsworth Stefan Güttel November 217 Contents 1 Introduction 1 2 A simple scalar example 1 3 Solving a nonlinear eigenproblem 2 4 References 6 1 Introduction
More informationSolving large sparse eigenvalue problems
Solving large sparse eigenvalue problems Mario Berljafa Stefan Güttel June 2015 Contents 1 Introduction 1 2 Extracting approximate eigenpairs 2 3 Accuracy of the approximate eigenpairs 3 4 Expanding the
More informationElectronic filter design using RKFUN arithmetic
Electronic filter design using RKFUN arithmetic Mario Berljafa Stefan Güttel September 25 Contents Introduction 2 The RKFUN gallery 3 The symbolic constructor 2 4 Arithmetic operations with rational functions
More informationThe parallel rational Arnoldi algorithm
The parallel rational Arnoldi algorithm Mario Berljafa Stefan Güttel May 016 Contents 1 Introduction 1 Parallelization strategies 1 3 Basic usage 1 Near-optimal continuation strategy 3 5 Links to numerical
More informationGeneralized rational Krylov decompositions with an application to rational approximation. Berljafa, Mario and Güttel, Stefan. MIMS EPrint: 2014.
Generalized rational Krylov decompositions with an application to rational approximation Berljafa, Mario and Güttel, Stefan 2014 MIMS EPrint: 2014.59 Manchester Institute for Mathematical Sciences School
More informationext
Matlab p. 1/?? Matlab Linear Algebra etc. Nick Maclaren Computing Service nmm1@cam.ac.uk, ext. 34761 October 2008 Matlab p. 2/?? Please Interrupt This course assumes a fair amount of background 1: that
More informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationResearch Matters. February 25, The Nonlinear Eigenvalue Problem. Nick Higham. Part III. Director of Research School of Mathematics
Research Matters February 25, 2009 The Nonlinear Eigenvalue Problem Nick Higham Part III Director of Research School of Mathematics Françoise Tisseur School of Mathematics The University of Manchester
More informationRational Krylov Decompositions: Theory and Applications. Berljafa, Mario. MIMS EPrint:
Rational Krylov Decompositions: Theory and Applications Berljafa, Mario 2017 MIMS EPrint: 2017.6 Manchester Institute for Mathematical Sciences School of Mathematics The University of Manchester Reports
More informationPhonon dispersion relation and density of states of a simple cubic lattice
Phonon dispersion relation and density of states of a simple cubic lattice Student project for the course Molecular and Solid State Physics by Eva Meisterhofer Contents 1 The linear spring model 3 1.1
More informationMath 307 Learning Goals. March 23, 2010
Math 307 Learning Goals March 23, 2010 Course Description The course presents core concepts of linear algebra by focusing on applications in Science and Engineering. Examples of applications from recent
More informationFast Angular Synchronization for Phase Retrieval via Incomplete Information
Fast Angular Synchronization for Phase Retrieval via Incomplete Information Aditya Viswanathan a and Mark Iwen b a Department of Mathematics, Michigan State University; b Department of Mathematics & Department
More informationMATH2071: LAB #5: Norms, Errors and Condition Numbers
MATH2071: LAB #5: Norms, Errors and Condition Numbers 1 Introduction Introduction Exercise 1 Vector Norms Exercise 2 Matrix Norms Exercise 3 Compatible Matrix Norms Exercise 4 More on the Spectral Radius
More informationResearch Matters. February 25, The Nonlinear Eigenvalue. Director of Research School of Mathematics
Research Matters February 25, 2009 The Nonlinear Eigenvalue Nick Problem: HighamPart II Director of Research School of Mathematics Françoise Tisseur School of Mathematics The University of Manchester Woudschoten
More informationNumerical Methods I Eigenvalue Problems
Numerical Methods I Eigenvalue Problems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 2nd, 2014 A. Donev (Courant Institute) Lecture
More information[k,g,gfin] = hinfsyn(p,nmeas,ncon,gmin,gmax,tol)
8 H Controller Synthesis: hinfsyn The command syntax is k,g,gfin = hinfsyn(p,nmeas,ncon,gmin,gmax,tol) associated with the general feedback diagram below. e y P d u e G = F L (P, K) d K hinfsyn calculates
More informationCOMP 558 lecture 18 Nov. 15, 2010
Least squares We have seen several least squares problems thus far, and we will see more in the upcoming lectures. For this reason it is good to have a more general picture of these problems and how to
More informationMath 307 Learning Goals
Math 307 Learning Goals May 14, 2018 Chapter 1 Linear Equations 1.1 Solving Linear Equations Write a system of linear equations using matrix notation. Use Gaussian elimination to bring a system of linear
More informationMATH 3795 Lecture 13. Numerical Solution of Nonlinear Equations in R N.
MATH 3795 Lecture 13. Numerical Solution of Nonlinear Equations in R N. Dmitriy Leykekhman Fall 2008 Goals Learn about different methods for the solution of F (x) = 0, their advantages and disadvantages.
More informationResearch CharlieMatters
Research CharlieMatters Van Loan and the Matrix Exponential February 25, 2009 Nick Nick Higham Director Schoolof ofresearch Mathematics The School University of Mathematics of Manchester http://www.maths.manchester.ac.uk/~higham
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationComputing the Action of the Matrix Exponential
Computing the Action of the Matrix Exponential Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ Joint work with Awad H. Al-Mohy 16th ILAS
More information(Linear equations) Applied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB (Linear equations) Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots
More informationPreliminary Examination in Numerical Analysis
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August 7, 06, 0 am pm. Submit solutions to four (and no more) of the following six problems. Show all your work, and justify
More informationTwo hours. To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER. 29 May :45 11:45
Two hours MATH20602 To be provided by Examinations Office: Mathematical Formula Tables. THE UNIVERSITY OF MANCHESTER NUMERICAL ANALYSIS 1 29 May 2015 9:45 11:45 Answer THREE of the FOUR questions. If more
More informationFundamentals of Matrices
Maschinelles Lernen II Fundamentals of Matrices Christoph Sawade/Niels Landwehr/Blaine Nelson Tobias Scheffer Matrix Examples Recap: Data Linear Model: f i x = w i T x Let X = x x n be the data matrix
More informationTable 1 Principle Matlab operators and functions Name Description Page reference
Matlab Index Table 1 summarises the Matlab supplied operators and functions to which we have referred. In most cases only a few of the options available to the individual functions have been fully utilised.
More informationElements of Floating-point Arithmetic
Elements of Floating-point Arithmetic Sanzheng Qiao Department of Computing and Software McMaster University July, 2012 Outline 1 Floating-point Numbers Representations IEEE Floating-point Standards Underflow
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 informationSchur decomposition in the scaled boundary finite element method in elastostatics
IOP Conference Series: Materials Science and Engineering Schur decomposition in the scaled boundary finite element method in elastostatics o cite this article: M Li et al 010 IOP Conf. Ser.: Mater. Sci.
More informationElements of Floating-point Arithmetic
Elements of Floating-point Arithmetic Sanzheng Qiao Department of Computing and Software McMaster University July, 2012 Outline 1 Floating-point Numbers Representations IEEE Floating-point Standards Underflow
More informationN. J. Higham. Numerical Analysis Report No January Manchester Centre for Computational Mathematics Numerical Analysis Reports
UMIST ISSN 1360-1725 A New sqrtm for Matlab N. J. Higham Numerical Analysis Report No. 336 January 1999 Manchester Centre for Computational Mathematics Numerical Analysis Reports DEPARTMENTS OF MATHEMATICS
More informationGeneral Notation. Exercises and Problems
Exercises and Problems The text contains both Exercises and Problems. The exercises are incorporated into the development of the theory in each section. Additional Problems appear at the end of most sections.
More informationS.F. Xu (Department of Mathematics, Peking University, Beijing)
Journal of Computational Mathematics, Vol.14, No.1, 1996, 23 31. A SMALLEST SINGULAR VALUE METHOD FOR SOLVING INVERSE EIGENVALUE PROBLEMS 1) S.F. Xu (Department of Mathematics, Peking University, Beijing)
More informationShan Feng
Shan Feng fengs2@mcmaster.caca Shan Feng: 2pm~5pm, Monday, ITB A302; fengs2@univmail.cis.mcmaster.ca Yong Zhao: 1pm~4pm, Wednesday, ITB A103; zhaoy49@grads.ece.mcmaster.ca Heng Wang:2pm~5pm, Thursday,
More informationSIGNALS AND LINEAR SYSTEMS LABORATORY EELE Experiment (2) Introduction to MATLAB - Part (2) Prepared by:
The Islamic University of Gaza Faculty of Engineering Electrical Engineering Department SIGNALS AND LINEAR SYSTEMS LABORATORY EELE 110 Experiment () Introduction to MATLAB - Part () Prepared by: Eng. Mohammed
More informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationParallelization of the rational Arnoldi algorithm. Berljafa, Mario and Güttel, Stefan. MIMS EPrint:
Parallelization of the rational Arnoldi algorithm Berljafa, Mario and Güttel, Stefan 2016 MIMS EPrint: 2016.32 Manchester Institute for Mathematical Sciences School of Mathematics The University of Manchester
More informationnonlinear simultaneous equations of type (1)
Module 5 : Solving Nonlinear Algebraic Equations Section 1 : Introduction 1 Introduction Consider set of nonlinear simultaneous equations of type -------(1) -------(2) where and represents a function vector.
More informationECE 451 Macromodeling
ECE 451 Macromodeling Jose E. Schutt-Aine Electrical & Computer Engineering University of Illinois jesa@illinois.edu ECE 451 Jose Schutt Aine 1 Blackbox Macromodeling Nonlinear Network 1 Nonlinear Network
More informationScaling, Sensitivity and Stability in Numerical Solution of the Quadratic Eigenvalue Problem
Scaling, Sensitivity and Stability in Numerical Solution of the Quadratic Eigenvalue Problem Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/
More informationExperiment 2: Introduction to MATLAB II
Experiment : Introduction to MATLAB II.Vector, Matrix and Array Commands Some of MATLAB functions operate essentially on a vector (row or column), and others on an m-by-n matrix (m >= ). Array find length
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 informationContents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2
Contents Preface for the Instructor xi Preface for the Student xv Acknowledgments xvii 1 Vector Spaces 1 1.A R n and C n 2 Complex Numbers 2 Lists 5 F n 6 Digression on Fields 10 Exercises 1.A 11 1.B Definition
More informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationPart 3: Trust-region methods for unconstrained optimization. Nick Gould (RAL)
Part 3: Trust-region methods for unconstrained optimization Nick Gould (RAL) minimize x IR n f(x) MSc course on nonlinear optimization UNCONSTRAINED MINIMIZATION minimize x IR n f(x) where the objective
More informationRehabilitating Research Correlations, Matters Avoiding Inversion, and Extracting Roots
Rehabilitating Research Correlations, Matters Avoiding Inversion, and Extracting Roots February 25, 2009 Nick Nick Higham Higham Director School of of Research Mathematics The University of Manchester
More informationENGR Spring Exam 2
ENGR 1300 Spring 013 Exam INSTRUCTIONS: Duration: 60 minutes Keep your eyes on your own work! Keep your work covered at all times! 1. Each student is responsible for following directions. Read carefully..
More informationSolving Ill-Posed Cauchy Problems in Three Space Dimensions using Krylov Methods
Solving Ill-Posed Cauchy Problems in Three Space Dimensions using Krylov Methods Lars Eldén Department of Mathematics Linköping University, Sweden Joint work with Valeria Simoncini February 21 Lars Eldén
More informationLinear Algebra and Matrices
Linear Algebra and Matrices 4 Overview In this chapter we studying true matrix operations, not element operations as was done in earlier chapters. Working with MAT- LAB functions should now be fairly routine.
More informationyou expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form
Qualifying exam for numerical analysis (Spring 2017) Show your work for full credit. If you are unable to solve some part, attempt the subsequent parts. 1. Consider the following finite difference: f (0)
More informationA Newton-Galerkin-ADI Method for Large-Scale Algebraic Riccati Equations
A Newton-Galerkin-ADI Method for Large-Scale Algebraic Riccati Equations Peter Benner Max-Planck-Institute for Dynamics of Complex Technical Systems Computational Methods in Systems and Control Theory
More informationNumerical Methods I Solving Nonlinear Equations
Numerical Methods I Solving Nonlinear Equations Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 16th, 2014 A. Donev (Courant Institute)
More informationNonlinear Eigenvalue Problems and Contour Integrals
Nonlinear Eigenvalue Problems and Contour Integrals Marc Van Barel a,,, Peter Kravanja a a KU Leuven, Department of Computer Science, Celestijnenlaan 200A, B-300 Leuven (Heverlee), Belgium Abstract In
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 informationApplied Mathematics 205. Unit 0: Overview of Scientific Computing. Lecturer: Dr. David Knezevic
Applied Mathematics 205 Unit 0: Overview of Scientific Computing Lecturer: Dr. David Knezevic Scientific Computing Computation is now recognized as the third pillar of science (along with theory and experiment)
More informationChapter #4 EEE8086-EEE8115. Robust and Adaptive Control Systems
Chapter #4 Robust and Adaptive Control Systems Nonlinear Dynamics.... Linear Combination.... Equilibrium points... 3 3. Linearisation... 5 4. Limit cycles... 3 5. Bifurcations... 4 6. Stability... 6 7.
More informationAn Algorithm for. Nick Higham. Françoise Tisseur. Director of Research School of Mathematics.
An Algorithm for the Research Complete Matters Solution of Quadratic February Eigenvalue 25, 2009 Problems Nick Higham Françoise Tisseur Director of Research School of Mathematics The School University
More informationUsing MATLAB. Linear Algebra
Using MATLAB in Linear Algebra Edward Neuman Department of Mathematics Southern Illinois University at Carbondale One of the nice features of MATLAB is its ease of computations with vectors and matrices.
More informationThe Complex Step Approximation to the Fréchet Derivative of a Matrix Function. Al-Mohy, Awad H. and Higham, Nicholas J. MIMS EPrint: 2009.
The Complex Step Approximation to the Fréchet Derivative of a Matrix Function Al-Mohy, Awad H. and Higham, Nicholas J. 2009 MIMS EPrint: 2009.31 Manchester Institute for Mathematical Sciences School of
More informationarxiv: v1 [math.na] 1 Sep 2018
On the perturbation of an L -orthogonal projection Xuefeng Xu arxiv:18090000v1 [mathna] 1 Sep 018 September 5 018 Abstract The L -orthogonal projection is an important mathematical tool in scientific computing
More informationThe Milne error estimator for stiff problems
13 R. Tshelametse / SAJPAM. Volume 4 (2009) 13-28 The Milne error estimator for stiff problems Ronald Tshelametse Department of Mathematics University of Botswana Private Bag 0022 Gaborone, Botswana. E-mail
More informationHow to Find Matrix Modifications Keeping Essentially Unaltered a Selected Set of Eigenvalues
How to Find Matrix Modifications Keeping Essentially Unaltered a Selected Set of Eigenvalues S. Noschese and L. Pasquini 1 Introduction In this paper we consider a matrix A C n n and we show how to construct
More informationComputational Foundations of Cognitive Science
Computational Foundations of Cognitive Science Lecture 14: Inverses and Eigenvectors in Matlab; Plotting and Graphics Frank Keller School of Informatics University of Edinburgh keller@inf.ed.ac.uk February
More informationBackground Mathematics (2/2) 1. David Barber
Background Mathematics (2/2) 1 David Barber University College London Modified by Samson Cheung (sccheung@ieee.org) 1 These slides accompany the book Bayesian Reasoning and Machine Learning. The book and
More informationSome Notes on Least Squares, QR-factorization, SVD and Fitting
Department of Engineering Sciences and Mathematics January 3, 013 Ove Edlund C000M - Numerical Analysis Some Notes on Least Squares, QR-factorization, SVD and Fitting Contents 1 Introduction 1 The Least
More informationAffine iterations on nonnegative vectors
Affine iterations on nonnegative vectors V. Blondel L. Ninove P. Van Dooren CESAME Université catholique de Louvain Av. G. Lemaître 4 B-348 Louvain-la-Neuve Belgium Introduction In this paper we consider
More informationChapter 8 Linear Algebraic Equations
PowerPoint to accompany Introduction to MATLAB for Engineers, Third Edition William J. Palm III Chapter 8 Linear Algebraic Equations Copyright 2010. The McGraw-Hill Companies, Inc. This work is only for
More informationA Review of Preconditioning Techniques for Steady Incompressible Flow
Zeist 2009 p. 1/43 A Review of Preconditioning Techniques for Steady Incompressible Flow David Silvester School of Mathematics University of Manchester Zeist 2009 p. 2/43 PDEs Review : 1984 2005 Update
More informationMATLAB crash course 1 / 27. MATLAB crash course. Cesar E. Tamayo Economics - Rutgers. September 27th, /27
1/27 MATLAB crash course 1 / 27 MATLAB crash course Cesar E. Tamayo Economics - Rutgers September 27th, 2013 2/27 MATLAB crash course 2 / 27 Program Program I Interface: layout, menus, help, etc.. I Vectors
More informationUniversity of Warwick institutional repository:
University of Warwick institutional repository: http://go.warwick.ac.uk/wrap This paper is made available online in accordance with publisher policies. Please scroll down to view the document itself. Please
More informationApplied Computational Economics Workshop. Part 3: Nonlinear Equations
Applied Computational Economics Workshop Part 3: Nonlinear Equations 1 Overview Introduction Function iteration Newton s method Quasi-Newton methods Practical example Practical issues 2 Introduction Nonlinear
More informationBinary floating point
Binary floating point Notes for 2017-02-03 Why do we study conditioning of problems? One reason is that we may have input data contaminated by noise, resulting in a bad solution even if the intermediate
More informationChap 3. Linear Algebra
Chap 3. Linear Algebra Outlines 1. Introduction 2. Basis, Representation, and Orthonormalization 3. Linear Algebraic Equations 4. Similarity Transformation 5. Diagonal Form and Jordan Form 6. Functions
More information1 Linearity and Linear Systems
Mathematical Tools for Neuroscience (NEU 34) Princeton University, Spring 26 Jonathan Pillow Lecture 7-8 notes: Linear systems & SVD Linearity and Linear Systems Linear system is a kind of mapping f( x)
More informationR x n. 2 R We simplify this algebraically, obtaining 2x n x n 1 x n x n
Math 42 Homework 4. page 3, #9 This is a modification of the bisection method. Write a MATLAB function similar to bisect.m. Here, given the points P a a,f a and P b b,f b with f a f b,we compute the point
More informationRealization-independent H 2 -approximation
Realization-independent H -approximation Christopher Beattie and Serkan Gugercin Abstract Iterative Rational Krylov Algorithm () of [] is an effective tool for tackling the H -optimal model reduction problem.
More informationA Robust Preconditioner for the Hessian System in Elliptic Optimal Control Problems
A Robust Preconditioner for the Hessian System in Elliptic Optimal Control Problems Etereldes Gonçalves 1, Tarek P. Mathew 1, Markus Sarkis 1,2, and Christian E. Schaerer 1 1 Instituto de Matemática Pura
More informationA Review of Linear Algebra
A Review of Linear Algebra Gerald Recktenwald Portland State University Mechanical Engineering Department gerry@me.pdx.edu These slides are a supplement to the book Numerical Methods with Matlab: Implementations
More informationRational Chebyshev pseudospectral method for long-short wave equations
Journal of Physics: Conference Series PAPER OPE ACCESS Rational Chebyshev pseudospectral method for long-short wave equations To cite this article: Zeting Liu and Shujuan Lv 07 J. Phys.: Conf. Ser. 84
More informationEnforcing Passivity for Admittance Matrices Approximated by Rational Functions
IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 16, NO. 1, FEBRUARY 2001 97 Enforcing Passivity for Admittance Matrices Approximated by Rational Functions Bjørn Gustavsen, Member, IEEE and Adam Semlyen, Life
More information(Mathematical Operations with Arrays) Applied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB (Mathematical Operations with Arrays) Contents Getting Started Matrices Creating Arrays Linear equations Mathematical Operations with Arrays Using Script
More informationComputing the pth Roots of a Matrix. with Repeated Eigenvalues
Applied Mathematical Sciences, Vol. 5, 2011, no. 53, 2645-2661 Computing the pth Roots of a Matrix with Repeated Eigenvalues Amir Sadeghi 1, Ahmad Izani Md. Ismail and Azhana Ahmad School of Mathematical
More informationTesting matrix function algorithms using identities. Deadman, Edvin and Higham, Nicholas J. MIMS EPrint:
Testing matrix function algorithms using identities Deadman, Edvin and Higham, Nicholas J. 2014 MIMS EPrint: 2014.13 Manchester Institute for Mathematical Sciences School of Mathematics The University
More informationMagnitude Vector Fitting to interval data
Available online at wwwsciencedirectcom Mathematics and Computers in Simulation 80 (2009) 572 580 Magnitude Vector Fitting to interval data Wouter Hendrickx a,, Dirk Deschrijver b, Luc Knockaert b, Tom
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT 10-12 Large-Scale Eigenvalue Problems in Trust-Region Calculations Marielba Rojas, Bjørn H. Fotland, and Trond Steihaug ISSN 1389-6520 Reports of the Department of
More informationShifted QR algorithm
Lecture 5 The QR algorithm. - Practical QR algorithm. - Functions of Matrices. - Google Page Rank. Systems of Non-Linear Equations. - Newtons Method in one dimension: Existance. Convergence Speed. Error
More informationAPPLIED NUMERICAL LINEAR ALGEBRA
APPLIED NUMERICAL LINEAR ALGEBRA James W. Demmel University of California Berkeley, California Society for Industrial and Applied Mathematics Philadelphia Contents Preface 1 Introduction 1 1.1 Basic Notation
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 4. Monotonicity of the Lanczos Method Michael Eiermann Institut für Numerische Mathematik und Optimierung Technische
More informationEXAMPLES OF PROOFS BY INDUCTION
EXAMPLES OF PROOFS BY INDUCTION KEITH CONRAD 1. Introduction In this handout we illustrate proofs by induction from several areas of mathematics: linear algebra, polynomial algebra, and calculus. Becoming
More informationProblem Set 5 Solutions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Problem Set 5 Solutions The problem set deals with Hankel
More informationMath 515 Fall, 2008 Homework 2, due Friday, September 26.
Math 515 Fall, 2008 Homework 2, due Friday, September 26 In this assignment you will write efficient MATLAB codes to solve least squares problems involving block structured matrices known as Kronecker
More informationReview of Some Concepts from Linear Algebra: Part 2
Review of Some Concepts from Linear Algebra: Part 2 Department of Mathematics Boise State University January 16, 2019 Math 566 Linear Algebra Review: Part 2 January 16, 2019 1 / 22 Vector spaces A set
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 informationFunctions of a Matrix: Theory and Computation
Functions of a Matrix: Theory and Computation Nick Higham School of Mathematics The University of Manchester higham@ma.man.ac.uk http://www.ma.man.ac.uk/~higham/ Landscapes in Mathematical Science, University
More informationMath 504 (Fall 2011) 1. (*) Consider the matrices
Math 504 (Fall 2011) Instructor: Emre Mengi Study Guide for Weeks 11-14 This homework concerns the following topics. Basic definitions and facts about eigenvalues and eigenvectors (Trefethen&Bau, Lecture
More information