Modified Roe Flux Function for Perfectly Preconditioned Systems
|
|
- Loraine Andrews
- 5 years ago
- Views:
Transcription
1 Modified oe Flux Function for Perfectly Preconditioned Systems Hiroaki Nishikawa January General Form Consider a D linearized symmetrizable conservation law in the conservative form, U t + AU x + BU y = 0. (1) This is transformed into a symmetric form for which a symmetric preconditioning matrix can be constructed, by a matrix T, T(U t + A U x + B U y ) = 0 () U s t + A s U s x + B s U s y = 0 (3) the matrix T = QM is the product of a rotation and a variable transformation matrices, and A s = TAT 1 B s = TBT 1. (4) The symmetric form may be written in the streamline coordinates (s, n), U s t + A s Us s + A s U s n = 0 (5) A s = As cos θ + B s sin θ A s = B s cos θ A s sin θ (6) and θ is the flow angle. Note that if P denotes a symmetric preconditioner to be applied in the form U s t + P(A s U s x + B s U s y) = 0, (7) then the corresponding preconditioner for the conservative form to be used in the form U t + P c (AU x + BU y ) = 0 (8) is given by P c = T 1 PT. (9) 1
2 n finite-volume methods, the oe scheme is formulated using the Jacobian normal to a cell face, n = (n x, n y ) = (cos ϕ, sin ϕ), and defines the numerical flux A n = A cos ϕ + B sin ϕ, (10) F n = 1 (F + F L ) 1 A n U. (11) The dissipation term must be formulated based on the preconditioned system, and the flux is modified as follows. F n = 1 (F + F L ) 1 P 1 c P c A n U (1) P c is a preconditioning matrix in the conservative variable. t is convenient to write the modified version using the matrices associated with the symmetric form. For this purpose, we manipulate the matrix P c A n as follows. P c A n = T 1 PTA n (13) = T 1 PTA n (T) 1 T (14) = T 1 PT(A cos ϕ + B sin ϕ)t 1 T (15) = T 1 P(A s cos ϕ + B s sin ϕ)t (16) = T 1 P(A s cos ϕ + B s sin ϕ) T (17) = T 1 P(A s cos(ϕ θ) + As sin(ϕ θ)) T. (18) n the case of D ideal MHD, this matrix is extremely complicated to write down analytically. We may therefore compute this, using some software that returns eigenvalues and eigenvectors numerically. However, we can avoid calling such a routine. Still numerically, but we can evaluate this in a simple way. This is possible if the preconditioner is exact: as it is derived from the theory based on the steady decomposition (no approximation is allowed). Simplification.1 Hyperbolic Case f the subproblem of the steady system is all hyperbolic, the preconditioner is given by P = a k r k r T C k, a k = r T k Ar k 1 + λ k (19) Therefore, we have, from euation (18), P c A n = T 1 ak r k r T k (A s cos(ϕ θ) + As sin(ϕ θ)) T. (0) c 003 by Hiroaki Nishikawa
3 By definition, P c A n = T 1 ak r k r T k A {cos(ϕ θ) + λ k sin(ϕ θ)} T. (1) We write this as P c A n = T 1 λ r k r T k A k r T k Ar k T () λ k = C {cos(ϕ θ) + λ k sin(ϕ θ)} 1 + λ k (3) which is exactly the wave speed normal to the cell face of the k-th component of the preconditioned system. Finally, because the matrix r k r T k A r T k Ar k (4) is the k-th orthonormal projection matrix, it has only one nonzero eigenvalue that is unity, and moreover it shares eigenvectors with A 1 B. Therefore, we finally obtain P c A n U = λ k α r k (5) α = l k U = rt k A r T k Ar T U (6) k r k = T 1 r k. (7) This is an obvious result. The expression above is just straightforward wave decomposition of the preconditioned system we designed. The flux function can now be written as F n = 1 (F + F L ) 1 P 1 c λ k α r k (8) which does not reuire any numerical routines to compute eigenvalues and eigenvectors (although it may still be complicated to write down).. Elliptic Case f there is an elliptic component, the preconditioner is given by P = a e SS T = a e (r r T + r r T ) (9) S = r, r ] and a e = k 1 ec (1 + λ + λ ) (30) λ = (1 λ λ ) + 4λ (31) c 003 by Hiroaki Nishikawa 3
4 k e = 1 (r T Ar ) + (r T Ar ). (3) Therefore, we have, from euation (18), P c A n = T 1 ae SS T (A s cos(ϕ θ) + As sin(ϕ θ)) T. (33) By definition (real and imaginary parts of r T (A s λas ) = 0), we have ] S T A s λ λ = S T A s λ λ, (34) and so we may write { ] } P c A n = T 1 λ λ a e S cos(ϕ θ) + sin(ϕ θ) S T A s λ λ T (35) which can be written also as ] } P c A n = T 1 a e S(S T A s S) 1 (S T A s {cos(ϕ S) λ λ θ) + sin(ϕ θ) (S T A s λ λ ) T = T 1 a e S(S T A s r T S) 1 Ar r T Ar ] { ] } λ λ r T Ar r T Ar cos(ϕ θ) + sin(ϕ θ) (S T A s λ λ ) T ] { ] } = T 1 a e S(S T A s k1 k λ λ S) 1 cos(ϕ θ) + sin(ϕ θ) (S T A s k k 1 λ λ ) T = T 1 ae S(S T A s S) 1 A en (S T A s ) T (36) = T 1 S(S T A s S) 1 a e A en S T A s T (37) A en is a x matrix whose eigenvalues are ] λ ± en = ±a e (k1 + k {cos(ϕ ) θ) + λ sin(ϕ θ)} + λ sin (ϕ θ) (38) (See euation (9) in the draft of the AAA 003 paper) and the associated eigenvector is given by ] r ± sin(ϕ θ)k en = 1 λ {cos(ϕ θ) + λ sin(ϕ θ)} k. (39) sin(ϕ θ)k λ + {cos(ϕ θ) + λ sin(ϕ θ)} k 1 λ en Finally, we obtain P c A n U = λ + en α + e r + e + λ en α e r e (40) α e ± = l ± U = (r ± en) T S T A s T U (41) r ± e = T 1 S(S T A s S) 1 r ± en. (4) c 003 by Hiroaki Nishikawa 4
5 Hence, if there are hyperbolic and elliptic components, the flux is given by F n = 1 (F + F L ) 1 P 1 c λ k α r k + ( λ + en α e + r + e + λ en αe r e hyperbolic elliptic (43) Note that by orthogonality of the subspaces, we have been able to consider elliptic parts independently. 3 Euler Euations 3.1 Supersonic Case n the supersonic case, we obtain ). F n = 1 (F + F L ) 1 P 1 c 4 λ k α r k (44) k=1 λ 1 = cos(ϕ θ)m (45) λ = cos(ϕ θ)m (46) λ 3 = cos(ϕ θ) M 1 + sin(ϕ θ) (47) λ 4 = cos(ϕ θ) M 1 sin(ϕ θ) (48) α1 = p c (49) α + p = (50) α 3 = 1 θ + M 1 p] (51) α 4 = 1 θ M 1 p] (5) r 1 = 1, u, v, / ] T r = 0, cos θ, sin θ, ] T (54) r 1 3 = c M 1, sin θ + M 1 cos θ, cos θ + ( M 1 sin θ 1 M, M 1 + γ ) ] T (55) γ 1 r 1 4 = c M 1, sin θ M 1 cos θ, cos θ ( M 1 sin θ 1 M, M 1 + γ ) ] T (56) γ 1 Note that not to mention the case M = 1 some expressions are singular at = 0. (53) c 003 by Hiroaki Nishikawa 5
6 3. Subsonic Case F n = 1 (F + F L ) 1 P 1 c { λ k α r k + ( λ + en α e + r + e + λ en αe r ) } e (57) k=1 the hyperbolic part is the same as in the supersonic case, and z = (1 M ) cos (ϕ θ) + sin (ϕ θ) (58) λ + en = Mz (59) λ en = Mz (60) α + e = M 1 M αe = M 1 M r + en = r en = sin(ϕ θ)(1 M ) p { z + (1 M ) cos(ϕ θ) } θ ] (61) sin(ϕ θ)(1 M ) p + { z (1 M ) cos(ϕ θ) } θ ] (6) M sin(ϕ θ) 1 M { M 1 M (1 M )(v cos(ϕ θ) u sin(ϕ θ)) + vz } { M 1 M (1 M )(u cos(ϕ θ) + v sin(ϕ θ)) + uz } ( ) c M sin(ϕ θ) 1 M M sin(ϕ θ) 1 M M γ γ 1 { M 1 M (1 M )(v cos(ϕ θ) u sin(ϕ θ)) vz } { M 1 M (1 M )(u cos(ϕ θ) + v sin(ϕ θ)) uz } ( ) c M sin(ϕ θ) 1 M Again the eigenvectors are singular at M = 0. 4 emarks M γ γ 1 For the Euler euations, the modified oe scheme is relatively simple. t is desired that the singularity at M = 0 be removed. Although the step from (36) to (37) has not been proved mathematically, it is found to be true for the Euler euations. As mentioned before, this modification is valid only for exact preconditoners which may be constructed numerically. For approximate preconditioners, we need to compute eigenvalues and eigenvectors numerically at every face which is very expensive. For this reason, it may turn out that numerically constructed exact preconditioners are more economical than approximate ones. (63) (64) c 003 by Hiroaki Nishikawa 6
Homework 2. Solutions T =
Homework. s Let {e x, e y, e z } be an orthonormal basis in E. Consider the following ordered triples: a) {e x, e x + e y, 5e z }, b) {e y, e x, 5e z }, c) {e y, e x, e z }, d) {e y, e x, 5e z }, e) {
More informationProblem # Max points possible Actual score Total 120
FINAL EXAMINATION - MATH 2121, FALL 2017. Name: ID#: Email: Lecture & Tutorial: Problem # Max points possible Actual score 1 15 2 15 3 10 4 15 5 15 6 15 7 10 8 10 9 15 Total 120 You have 180 minutes to
More informationKinematics. Basilio Bona. Semester 1, DAUIN Politecnico di Torino. B. Bona (DAUIN) Kinematics Semester 1, / 15
Kinematics Basilio Bona DAUIN Politecnico di Torino Semester 1, 2014-15 B. Bona (DAUIN) Kinematics Semester 1, 2014-15 1 / 15 Introduction The kinematic quantities used are: position r, linear velocity
More informationEC Control Engineering Quiz II IIT Madras
EC34 - Control Engineering Quiz II IIT Madras Linear algebra Find the eigenvalues and eigenvectors of A, A, A and A + 4I Find the eigenvalues and eigenvectors of the following matrices: (a) cos θ sin θ
More informationMaster Thesis Literature Study Presentation
Master Thesis Literature Study Presentation Delft University of Technology The Faculty of Electrical Engineering, Mathematics and Computer Science January 29, 2010 Plaxis Introduction Plaxis Finite Element
More informationKinematics. Basilio Bona. October DAUIN - Politecnico di Torino. Basilio Bona (DAUIN - Politecnico di Torino) Kinematics October / 15
Kinematics Basilio Bona DAUIN - Politecnico di Torino October 2013 Basilio Bona (DAUIN - Politecnico di Torino) Kinematics October 2013 1 / 15 Introduction The kinematic quantities used are: position r,
More informationExample Linear Algebra Competency Test
Example Linear Algebra Competency Test The 4 questions below are a combination of True or False, multiple choice, fill in the blank, and computations involving matrices and vectors. In the latter case,
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationLast Time. Social Network Graphs Betweenness. Graph Laplacian. Girvan-Newman Algorithm. Spectral Bisection
Eigenvalue Problems Last Time Social Network Graphs Betweenness Girvan-Newman Algorithm Graph Laplacian Spectral Bisection λ 2, w 2 Today Small deviation into eigenvalue problems Formulation Standard eigenvalue
More information1 Planar rotations. Math Abstract Linear Algebra Fall 2011, section E1 Orthogonal matrices and rotations
Math 46 - Abstract Linear Algebra Fall, section E Orthogonal matrices and rotations Planar rotations Definition: A planar rotation in R n is a linear map R: R n R n such that there is a plane P R n (through
More informationSOLUTION KEY TO THE LINEAR ALGEBRA FINAL EXAM 1 2 ( 2) ( 1) c a = 1 0
SOLUTION KEY TO THE LINEAR ALGEBRA FINAL EXAM () We find a least squares solution to ( ) ( ) A x = y or 0 0 a b = c 4 0 0. 0 The normal equation is A T A x = A T y = y or 5 0 0 0 0 0 a b = 5 9. 0 0 4 7
More informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More information(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =
. (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)
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 informationEfficient solution of stationary Euler flows with critical points and shocks
Efficient solution of stationary Euler flows with critical points and shocks Hans De Sterck Department of Applied Mathematics University of Waterloo 1. Introduction consider stationary solutions of hyperbolic
More informationISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationLecture 5.7 Compressible Euler Equations
Lecture 5.7 Compressible Euler Equations Nomenclature Density u, v, w Velocity components p E t H u, v, w e S=c v ln p - c M Pressure Total energy/unit volume Total enthalpy Conserved variables Internal
More informationEigenvalues and Eigenvectors
/88 Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-sen University Linear Algebra Eigenvalue Problem /88 Eigenvalue Equation By definition, the eigenvalue equation for matrix
More informationDomain decomposition on different levels of the Jacobi-Davidson method
hapter 5 Domain decomposition on different levels of the Jacobi-Davidson method Abstract Most computational work of Jacobi-Davidson [46], an iterative method suitable for computing solutions of large dimensional
More informationMATH 235. Final ANSWERS May 5, 2015
MATH 235 Final ANSWERS May 5, 25. ( points) Fix positive integers m, n and consider the vector space V of all m n matrices with entries in the real numbers R. (a) Find the dimension of V and prove your
More informationMATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors.
MATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors. Orthogonal sets Let V be a vector space with an inner product. Definition. Nonzero vectors v 1,v
More informationMechanics Physics 151
Mechanics Phsics 151 Lecture 8 Rigid Bod Motion (Chapter 4) What We Did Last Time! Discussed scattering problem! Foundation for all experimental phsics! Defined and calculated cross sections! Differential
More informationPreliminary Examination, Numerical Analysis, August 2016
Preliminary Examination, Numerical Analysis, August 2016 Instructions: This exam is closed books and notes. The time allowed is three hours and you need to work on any three out of questions 1-4 and any
More informationFinal Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson
Final Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson Name: TA Name and section: NO CALCULATORS, SHOW ALL WORK, NO OTHER PAPERS ON DESK. There is very little actual work to be done on this exam if
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra)
AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 16: Eigenvalue Problems; Similarity Transformations Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical Analysis I 1 / 18 Eigenvalue
More informationECS130 Scientific Computing Handout E February 13, 2017
ECS130 Scientific Computing Handout E February 13, 2017 1. The Power Method (a) Pseudocode: Power Iteration Given an initial vector u 0, t i+1 = Au i u i+1 = t i+1 / t i+1 2 (approximate eigenvector) θ
More information1 Geometry of R Conic Sections Parametric Equations More Parametric Equations Polar Coordinates...
Contents 1 Geometry of R 2 2 1.1 Conic Sections............................................ 2 1.2 Parametric Equations........................................ 3 1.3 More Parametric Equations.....................................
More informationLinear Algebra Review. Vectors
Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors
More informationLecture 10 - Eigenvalues problem
Lecture 10 - Eigenvalues problem Department of Computer Science University of Houston February 28, 2008 1 Lecture 10 - Eigenvalues problem Introduction Eigenvalue problems form an important class of problems
More informationCapSel Roe Roe solver.
CapSel Roe - 01 Roe solver keppens@rijnh.nl modern high resolution, shock-capturing schemes for Euler capitalize on known solution of the Riemann problem originally developed by Godunov always use conservative
More informationCHAPTER 6. Projection Methods. Let A R n n. Solve Ax = f. Find an approximate solution ˆx K such that r = f Aˆx L.
Projection Methods CHAPTER 6 Let A R n n. Solve Ax = f. Find an approximate solution ˆx K such that r = f Aˆx L. V (n m) = [v, v 2,..., v m ] basis of K W (n m) = [w, w 2,..., w m ] basis of L Let x 0
More informationMATHEMATICS 217 NOTES
MATHEMATICS 27 NOTES PART I THE JORDAN CANONICAL FORM The characteristic polynomial of an n n matrix A is the polynomial χ A (λ) = det(λi A), a monic polynomial of degree n; a monic polynomial in the variable
More informationLecture 11: CMSC 878R/AMSC698R. Iterative Methods An introduction. Outline. Inverse, LU decomposition, Cholesky, SVD, etc.
Lecture 11: CMSC 878R/AMSC698R Iterative Methods An introduction Outline Direct Solution of Linear Systems Inverse, LU decomposition, Cholesky, SVD, etc. Iterative methods for linear systems Why? Matrix
More informationMATRICES ARE SIMILAR TO TRIANGULAR MATRICES
MATRICES ARE SIMILAR TO TRIANGULAR MATRICES 1 Complex matrices Recall that the complex numbers are given by a + ib where a and b are real and i is the imaginary unity, ie, i 2 = 1 In what we describe below,
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 informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More informationDifferential Kinematics
Differential Kinematics Relations between motion (velocity) in joint space and motion (linear/angular velocity) in task space (e.g., Cartesian space) Instantaneous velocity mappings can be obtained through
More informationDiagonalizing Matrices
Diagonalizing Matrices Massoud Malek A A Let A = A k be an n n non-singular matrix and let B = A = [B, B,, B k,, B n ] Then A n A B = A A 0 0 A k [B, B,, B k,, B n ] = 0 0 = I n 0 A n Notice that A i B
More informationVectors in Three Dimensions and Transformations
Vectors in Three Dimensions and Transformations University of Pennsylvania 1 Scalar and Vector Functions φ(q 1, q 2,...,q n ) is a scalar function of n variables φ(q 1, q 2,...,q n ) is independent of
More informationAlgebra I Fall 2007
MIT OpenCourseWare http://ocw.mit.edu 18.701 Algebra I Fall 007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.701 007 Geometry of the Special Unitary
More informationWinter 2017 Ma 1b Analytical Problem Set 2 Solutions
1. (5 pts) From Ch. 1.10 in Apostol: Problems 1,3,5,7,9. Also, when appropriate exhibit a basis for S. Solution. (1.10.1) Yes, S is a subspace of V 3 with basis {(0, 0, 1), (0, 1, 0)} and dimension 2.
More information1. Select the unique answer (choice) for each problem. Write only the answer.
MATH 5 Practice Problem Set Spring 7. Select the unique answer (choice) for each problem. Write only the answer. () Determine all the values of a for which the system has infinitely many solutions: x +
More informationj=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.
Lecture Notes: Orthogonal and Symmetric Matrices Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Orthogonal Matrix Definition. Let u = [u
More informationEigenmode Analysis of Boundary Conditions for the One-dimensional Preconditioned Euler Equations
NASA/CR-1998-208741 ICASE Report No. 98-51 Eigenmode Analysis of Boundary Conditions for the One-dimensional Preconditioned Euler Equations David L. Darmofal Massachusetts Institute of Technology, Cambridge,
More information9.1 Mean and Gaussian Curvatures of Surfaces
Chapter 9 Gauss Map II 9.1 Mean and Gaussian Curvatures of Surfaces in R 3 We ll assume that the curves are in R 3 unless otherwise noted. We start off by quoting the following useful theorem about self
More informationFinal Exam - Take Home Portion Math 211, Summer 2017
Final Exam - Take Home Portion Math 2, Summer 207 Name: Directions: Complete a total of 5 problems. Problem must be completed. The remaining problems are categorized in four groups. Select one problem
More informationOptimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms
Optimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms Marcus Sarkis Worcester Polytechnic Inst., Mass. and IMPA, Rio de Janeiro and Daniel
More informationInstitute of Structural Engineering Page 1. Method of Finite Elements I. Chapter 2. The Direct Stiffness Method. Method of Finite Elements I
Institute of Structural Engineering Page 1 Chapter 2 The Direct Stiffness Method Institute of Structural Engineering Page 2 Direct Stiffness Method (DSM) Computational method for structural analysis Matrix
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 informationSection 3: Complex numbers
Essentially: Section 3: Complex numbers C (set of complex numbers) up to different notation: the same as R 2 (euclidean plane), (i) Write the real 1 instead of the first elementary unit vector e 1 = (1,
More informationMultiple Degree of Freedom Systems. The Millennium bridge required many degrees of freedom to model and design with.
Multiple Degree of Freedom Systems The Millennium bridge required many degrees of freedom to model and design with. The first step in analyzing multiple degrees of freedom (DOF) is to look at DOF DOF:
More informationLinear Algebra & Geometry why is linear algebra useful in computer vision?
Linear Algebra & Geometry why is linear algebra useful in computer vision? References: -Any book on linear algebra! -[HZ] chapters 2, 4 Some of the slides in this lecture are courtesy to Prof. Octavia
More informationA Fast Fourier transform based direct solver for the Helmholtz problem. AANMPDE 2017 Palaiochora, Crete, Oct 2, 2017
A Fast Fourier transform based direct solver for the Helmholtz problem Jari Toivanen Monika Wolfmayr AANMPDE 2017 Palaiochora, Crete, Oct 2, 2017 Content 1 Model problem 2 Discretization 3 Fast solver
More informationMath Homework 8 (selected problems)
Math 102 - Homework 8 (selected problems) David Lipshutz Problem 1. (Strang, 5.5: #14) In the list below, which classes of matrices contain A and which contain B? 1 1 1 1 A 0 0 1 0 0 0 0 1 and B 1 1 1
More informationMATHEMATICS 23a/E-23a, Fall 2015 Linear Algebra and Real Analysis I Module #1, Week 4 (Eigenvectors and Eigenvalues)
MATHEMATICS 23a/E-23a, Fall 205 Linear Algebra and Real Analysis I Module #, Week 4 (Eigenvectors and Eigenvalues) Author: Paul Bamberg R scripts by Paul Bamberg Last modified: June 8, 205 by Paul Bamberg
More informationMultigrid absolute value preconditioning
Multigrid absolute value preconditioning Eugene Vecharynski 1 Andrew Knyazev 2 (speaker) 1 Department of Computer Science and Engineering University of Minnesota 2 Department of Mathematical and Statistical
More informationSolutions and Notes to Selected Problems In: Numerical Optimzation by Jorge Nocedal and Stephen J. Wright.
Solutions and Notes to Selected Problems In: Numerical Optimzation by Jorge Nocedal and Stephen J. Wright. John L. Weatherwax July 7, 2010 wax@alum.mit.edu 1 Chapter 5 (Conjugate Gradient Methods) Notes
More informationLu u. µ (, ) the equation. has the non-zero solution
MODULE 18 Topics: Eigenvalues and eigenvectors for differential operators In analogy to the matrix eigenvalue problem Ax = λx we shall consider the eigenvalue problem Lu = µu where µ is a real or complex
More informationOperators with numerical range in a closed halfplane
Operators with numerical range in a closed halfplane Wai-Shun Cheung 1 Department of Mathematics, University of Hong Kong, Hong Kong, P. R. China. wshun@graduate.hku.hk Chi-Kwong Li 2 Department of Mathematics,
More informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
More informationIntroduction to PDEs and Numerical Methods: Exam 1
Prof Dr Thomas Sonar, Institute of Analysis Winter Semester 2003/4 17122003 Introduction to PDEs and Numerical Methods: Exam 1 To obtain full points explain your solutions thoroughly and self-consistently
More informationThe antitriangular factorisation of saddle point matrices
The antitriangular factorisation of saddle point matrices J. Pestana and A. J. Wathen August 29, 2013 Abstract Mastronardi and Van Dooren [this journal, 34 (2013) pp. 173 196] recently introduced the block
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More information18.06 Problem Set 8 - Solutions Due Wednesday, 14 November 2007 at 4 pm in
806 Problem Set 8 - Solutions Due Wednesday, 4 November 2007 at 4 pm in 2-06 08 03 Problem : 205+5+5+5 Consider the matrix A 02 07 a Check that A is a positive Markov matrix, and find its steady state
More information1.6: 16, 20, 24, 27, 28
.6: 6, 2, 24, 27, 28 6) If A is positive definite, then A is positive definite. The proof of the above statement can easily be shown for the following 2 2 matrix, a b A = b c If that matrix is positive
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
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 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 informationMath 315: Linear Algebra Solutions to Assignment 7
Math 5: Linear Algebra s to Assignment 7 # Find the eigenvalues of the following matrices. (a.) 4 0 0 0 (b.) 0 0 9 5 4. (a.) The characteristic polynomial det(λi A) = (λ )(λ )(λ ), so the eigenvalues are
More informationNotes on singular value decomposition for Math 54. Recall that if A is a symmetric n n matrix, then A has real eigenvalues A = P DP 1 A = P DP T.
Notes on singular value decomposition for Math 54 Recall that if A is a symmetric n n matrix, then A has real eigenvalues λ 1,, λ n (possibly repeated), and R n has an orthonormal basis v 1,, v n, where
More informationA Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation
A Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation Tao Zhao 1, Feng-Nan Hwang 2 and Xiao-Chuan Cai 3 Abstract In this paper, we develop an overlapping domain decomposition
More informationLinear Algebra & Geometry why is linear algebra useful in computer vision?
Linear Algebra & Geometry why is linear algebra useful in computer vision? References: -Any book on linear algebra! -[HZ] chapters 2, 4 Some of the slides in this lecture are courtesy to Prof. Octavia
More informationQR-decomposition. The QR-decomposition of an n k matrix A, k n, is an n n unitary matrix Q and an n k upper triangular matrix R for which A = QR
QR-decomposition The QR-decomposition of an n k matrix A, k n, is an n n unitary matrix Q and an n k upper triangular matrix R for which In Matlab A = QR [Q,R]=qr(A); Note. The QR-decomposition is unique
More informationMath53: Ordinary Differential Equations Autumn 2004
Math53: Ordinary Differential Equations Autumn 2004 Unit 2 Summary Second- and Higher-Order Ordinary Differential Equations Extremely Important: Euler s formula Very Important: finding solutions to linear
More informationSPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS
SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS TSOGTGEREL GANTUMUR Abstract. After establishing discrete spectra for a large class of elliptic operators, we present some fundamental spectral properties
More informationLinear Algebra. Paul Yiu. 6D: 2-planes in R 4. Department of Mathematics Florida Atlantic University. Fall 2011
Linear Algebra Paul Yiu Department of Mathematics Florida Atlantic University Fall 2011 6D: 2-planes in R 4 The angle between a vector and a plane The angle between a vector v R n and a subspace V is the
More informationECE 275A Homework #3 Solutions
ECE 75A Homework #3 Solutions. Proof of (a). Obviously Ax = 0 y, Ax = 0 for all y. To show sufficiency, note that if y, Ax = 0 for all y, then it must certainly be true for the particular value of y =
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationSummary of Week 9 B = then A A =
Summary of Week 9 Finding the square root of a positive operator Last time we saw that positive operators have a unique positive square root We now briefly look at how one would go about calculating the
More informationMotion in Three Dimensions
Motion in Three Dimensions We ve learned about the relationship between position, velocity and acceleration in one dimension Now we need to extend those ideas to the three-dimensional world In the 1-D
More informationEXERCISES ON DETERMINANTS, EIGENVALUES AND EIGENVECTORS. 1. Determinants
EXERCISES ON DETERMINANTS, EIGENVALUES AND EIGENVECTORS. Determinants Ex... Let A = 0 4 4 2 0 and B = 0 3 0. (a) Compute 0 0 0 0 A. (b) Compute det(2a 2 B), det(4a + B), det(2(a 3 B 2 )). 0 t Ex..2. For
More informationThe Cartan Dieudonné Theorem
Chapter 7 The Cartan Dieudonné Theorem 7.1 Orthogonal Reflections Orthogonal symmetries are a very important example of isometries. First let us review the definition of a (linear) projection. Given a
More informationDistance Between Ellipses in 2D
Distance Between Ellipses in 2D David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To
More informationLecture 10: Eigenvectors and eigenvalues (Numerical Recipes, Chapter 11)
Lecture 1: Eigenvectors and eigenvalues (Numerical Recipes, Chapter 11) The eigenvalue problem, Ax= λ x, occurs in many, many contexts: classical mechanics, quantum mechanics, optics 22 Eigenvectors and
More informationOrthogonal iteration to QR
Notes for 2016-03-09 Orthogonal iteration to QR The QR iteration is the workhorse for solving the nonsymmetric eigenvalue problem. Unfortunately, while the iteration itself is simple to write, the derivation
More informationMATH 304 Linear Algebra Lecture 34: Review for Test 2.
MATH 304 Linear Algebra Lecture 34: Review for Test 2. Topics for Test 2 Linear transformations (Leon 4.1 4.3) Matrix transformations Matrix of a linear mapping Similar matrices Orthogonality (Leon 5.1
More information1.1 A Scattering Experiment
1 Transfer Matrix In this chapter we introduce and discuss a mathematical method for the analysis of the wave propagation in one-dimensional systems. The method uses the transfer matrix and is commonly
More informationUNIT 6: The singular value decomposition.
UNIT 6: The singular value decomposition. María Barbero Liñán Universidad Carlos III de Madrid Bachelor in Statistics and Business Mathematical methods II 2011-2012 A square matrix is symmetric if A T
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 informationLINEAR ALGEBRA (PMTH213) Tutorial Questions
Tutorial Questions The tutorial exercises range from revision and routine practice, through lling in details in the notes, to applications of the theory. While the tutorial problems are not compulsory,
More informationSolutions to Final Exam
Solutions to Final Exam. Let A be a 3 5 matrix. Let b be a nonzero 5-vector. Assume that the nullity of A is. (a) What is the rank of A? 3 (b) Are the rows of A linearly independent? (c) Are the columns
More informationDefinition (T -invariant subspace) Example. Example
Eigenvalues, Eigenvectors, Similarity, and Diagonalization We now turn our attention to linear transformations of the form T : V V. To better understand the effect of T on the vector space V, we begin
More informationMATH PROBLEM SET 6
MATH 431-2018 PROBLEM SET 6 DECEMBER 2, 2018 DUE TUESDAY 11 DECEMBER 2018 1. Rotations and quaternions Consider the line l through p 0 := (1, 0, 0) and parallel to the vector v := 1 1, 1 that is, defined
More informationCS205B / CME306 Homework 3. R n+1 = R n + tω R n. (b) Show that the updated rotation matrix computed from this update is not orthogonal.
CS205B / CME306 Homework 3 Rotation Matrices 1. The ODE that describes rigid body evolution is given by R = ω R. (a) Write down the forward Euler update for this equation. R n+1 = R n + tω R n (b) Show
More informationEXAM. Exam 1. Math 5316, Fall December 2, 2012
EXAM Exam Math 536, Fall 22 December 2, 22 Write all of your answers on separate sheets of paper. You can keep the exam questions. This is a takehome exam, to be worked individually. You can use your notes.
More informationKinematics. Basilio Bona. Semester 1, DAUIN Politecnico di Torino. B. Bona (DAUIN) Kinematics Semester 1, / 15
Kinematics Basilio Bona DAUIN Politecnico di Torino Semester 1, 2016-17 B. Bona (DAUIN) Kinematics Semester 1, 2016-17 1 / 15 Introduction The kinematic quantities used to represent a body frame are: position
More informationExercises * on Linear Algebra
Exercises * on Linear Algebra Laurenz Wiskott Institut für Neuroinformatik Ruhr-Universität Bochum, Germany, EU 4 February 7 Contents Vector spaces 4. Definition...............................................
More informationFunctional Analysis Review
Outline 9.520: Statistical Learning Theory and Applications February 8, 2010 Outline 1 2 3 4 Vector Space Outline A vector space is a set V with binary operations +: V V V and : R V V such that for all
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 information