Rules of thumb for L A TEX
|
|
- Hubert Tate
- 6 years ago
- Views:
Transcription
1 Thesis Questions and Suggestions A review for Kourosh Modaressi, February 8, 27 Rules of thumb for L A TEX A significant difficulty for readers has been that the 141 pages of L A TEX are about twice as long as necessary (because of too much white space on every page. Some general suggestions follow. 1. Specify less than 12pt font. 11pt and even 1pt are allowed by the university. 2. Use the default \parindent (a positive amount. If indentation is suppressed, it is hard to know when a new paragraph begins. 3. Use something less than double-spacing. The university allows a factor of about 1.2 (see \setstretch below. 4. Use the first page of the Preface and each chapter they shouldn t be blank. 5. Make sure there is no blank line preceding a displayed equation. Also remove blank lines after the display unless you want the tet to start a new paragraph. 6. A sentence that contains a displayed equation should be regarded as a normal (complete sentence. Imagine the display to be a single character in the middle of the sentence. 7. Ordinary words like and or reg inside math epressions look like algebraic variables. Use \tet{and} or \tetit{reg}. 8. At present, all equations are numbered whether they are referred to or not. Certainly use \label{} and \ref{} where relevant, but remove unreferenced equation numbers. 9. Refer to a previous equation if it eists, rather than repeating the same epression multiple times. 1. Norms should not be typeset with. Make use of macros like \norm{...} defined below. 11. Replace horizontal, diagonal, vertical dots (... by \ldots, \ddots, \vdots. 12. Abbreviations like e.g. and i.e. look like the end of sentences if they are followed by a space. They should be typeset as e.g.\ or e.g., to generate an ordinary space. 13. Use bibte for the bibliography. 1
2 Thesis format The following eample contains some useful commands. %\documentclass[twoside,1pt,final]{report} \documentclass[twoside,1pt,draft]{report} \includeonly{chapter, Chapter1, Chapter2, Chapter3, Chapter4} %\includeonly{chapter, Chapter2} \usepackage{amsfonts,amsmath,amssymb,graphic} \usepackage{vmargin} \setpapersize{usletter} \setmarginsrb{1.6in}{.7in}{1.1in}{.6in} % left, top, right, bottom {.2in}{.2in}{.2in}{.5in} % head height, head sep, % foot height, foot skip \usepackage{setspace} \setstretch{1.213} \newcommand{\clearemptydoublepage} {\newpage{\thispagestyle{plain}\cleardoublepage}} \newcommand{\bmat}[1]{\begin{bmatri}#1\end{bmatri}} % Needs {amsmath} \newcommand{\pmat}[1]{\begin{pmatri}#1\end{pmatri}} \newcommand{\matlab}{{\sc Matlab}} \newcommand{\norm}[1]{\ #1\ } % for ordinary vectors \newcommand{\normm}[1]{\left\ #1\right\ } % for larger things \begin{document} \pagenumbering{roman} \pagestyle{plain} \include{chapter} \include{chapter1} \include{chapter2} \include{chapter3} \include{chapter4} \clearemptydoublepage \bibliographystyle{abbrv} \bibliography{refs} \end{document} 2
3 The mathematical problems being studied The aim of the thesis is to solve two structured least-squares problems of the form Nonoverlapping Local Tikhonov Regularization: K 1... K q d λ 1 L 1 1 i...., NLTR. λ q L q q where the matrices K i and L i are given (they have n i columns and i is an n i -vector, and Overlapping Local Tikhonov Regularization: K d λ 1 L 1., OLTR. λ q L q where K and each L i are given. The problems are nontrivial even if the λ i are known. The full aim is to find good values for each λ i by computing many solutions i or and optimizing some function. The strategy has been to work with least-squares subproblems of the form ( ( ( ( Ki di i λ i L i and K d i λ i L i respectively, because effective methods are allegedly known for such subproblems (although in reality only the case L i = I seems to allow significant economy. Technical comments and questions 1. Chapter 1 is 3 pages of tetbook background material, only some of which is used later. Thought could be given to which parts are really necessary. 2. At a lower level, p19 repeats most of p18, and half of p2 repeats part of p On p22, ( and ( are the same comple equation. 4. What is p in ( ? 5. Chapter 1 could be the place to summarize classical methods for solving regularized least-squares (RLS problems; that is, the above subproblems with subscript i s deleted: ( K λl ( d. RLS Alternatively there could be a new chapter devoted to the classical methods. 6. Chapter 2 is 6 pages. This is too many for a reader to discern the structure. 3
4 7. On p31 and elsewhere, the word priori is used without definition. Probably some other term is needed. 8. Section 2.2 starts with general L in (2.2.2 (2.2.3 but then sets L = I. For later reference, this section needs to continue with methods for a general L. 9. On p35, K is said to be a nonsingular matri, but elsewhere it is assumed to be rectangular. Do you mean that it has full column rank? 1. Again on p35, if L does not have full row rank, applying an orthogonal transformation cannot alter its rank. 11. On p37, what is the optimal value of eact reg? Ideally it should be zero. 12. In (2.3.16, is S ( intentional (is it a derivative?, or should it be just S(? 13. Choose one of ( and ( On the same page (bottom, what are s i and s j? 15. ( sits in mid-air. It should be part of some sentence. 16. On p42, i is said to be a block matri when it is simply a vector. 17. Choose one of ( and ( The NLTR problem on p41 seems reasonable, but p43 gives essentially no motivation for the OLTR formulation. Why would it be useful? 19. Section 2.4 reintroduces the structured NLTR problem, but then section 2.5 (pp describes several standard methods that ignore the structure, and gives incorrect operation counts. As mentioned, these methods belong earlier in the Introduction or in a new Chapter 2. Note that for Cholesky on the normal equations, there is no need to spell out the steps in such detail; they are a basic part of numerical linear algebra. (The same steps are listed again on pp The beginning of section 2.6 (pp describes Elden s method for transforg a problem RLS involving L to one in which L = I. Again, since structure is ignored, this should be given in an earlier chapter. At the end, give a concise method for recovering the original (without repeating the epression R T. 21. On p55, V is a confusing name for a triangular matri, given that it usually refers to an orthogonal matri from an SVD. 22. The remainder of section 2.6 (pp tries to reduce the NLTR problem to one in which all L i = I. It does so by applying Elden s method to each subproblem (unnecessarily repeating the algebra with lots of subscript i s, ecept λ i is kept separate from L i. This section is long and confused for the following reasons. 4
5 23. Starting at step (2-4 there is a single sentence that continues to the end of p6. A key transformed subproblem involving K i, i, di appears in the middle. Unfortunately it is not a coherent sentence, and the subproblem simply appears without eplanation. This is where errors enter unnoticed. 24. Step (2 loops for i = 1,..., q, yet step (3 says to repeat step (2 for i + 1. Step (3 is really part of step (2 and just needs to define d i The definition d i+1 = d i cannot be correct because d i has reduced length. The right-hand side for the K i+1 subproblem would have to have length m. There is no obvious correction for this error. 26. Similarly the full transformed NLTR problem is stated without a coherent derivation, using a matri K = ( K1... Kq in which the submatrices Ki have differing numbers of rows. The transformed NLTR problem is therefore not well defined. Again, there is no obvious correction. 27. Section 2.7 assumes that the subproblems are well defined and essentially the only items of interest. It begins (pp with a description of four direct methods for solving problem RLS with L = I (and λ = 1 for some reason. More rotations are needed to eliate I in each case, so the operation counts are more than those stated. 28. Section 2.7 continues (pp with a description of Elden s method for RLS problems in which K is bidiagonal and L = I. All the subscripts i are redundant. It would be simpler to describe the method for the generic RLS problem, not for a subproblem. 29. The SVD part of section 2.7 (pp deals with problem NLTR in socalled standard form with each L i = I. The derivation uses an SVD of all of K = ( K 1... K q, so it is really dealing with an RLS problem in which λl has become a diagonal matri Λ. These pages are the most confused of all, and it is not clear why they are present. Equation (2.7.1 defines z = (K T K +Λ 2 1 v i (where v i is a singular vector of K and subsequently overlooks the fact that z depends on i. Then come the following remarkable equations: Kv i = σ i u i, ( K T u i = σ i v i, ( K T = σ i v i u 1 i, ( K T Kv i = (σ i v i u 1 i (σ i u i = σi 2 v i, ( where u i and v i are vectors. This astoundingly faulty algebra helps eplain why there has been such difficulty in writing a thesis. 3. The preceding error has no impact because ( is true without the help of ( Nevertheless, the final line of section 2.7 is highly suspect: n n Kv i = σ i (u T i d (σi 2 + λ 2 j 1 v i. ( j=1 5
6 31. Sections (pp move on to generalized cross-validation (GCV. Since optimization of the λ i values is intended to be an important part of the thesis, these sections could well be in a chapter of their own. (However, as yet there is no original work on optimizing λ. 32. Section 2.8 should start by clarifying which problem is being discussed. Where is Λ defined? How is its initial value chosen? How is the net value chosen? How can one plot a graph of CV versus a vector Λ? 33. Section 2.9 (pp 8 86 tries to eplain how GCV works. There are algebraic errors and the section is too hard to check. In the end it avoids the issue by referring to Golub and von Matt. It would be more helpful to state clearly which problem the Golub/von Matt method solves. 34. Section 2.1 (pp deals with problem OLTR (another topic that could be in its own chapter. Most of the section (pp repeats earlier material without respecting the OLTR structure. The remaining original material (pp tries to work with the second type of subproblem above (involving a single K and λ i L i with solution λi. The OLTR solution is assumed to be of the form q Λ = a i λi, ( with q a i = 1. (A plausible idea, but some justification is certainly desirable. The subsequent method for computing a i is quite baffling; e.g, in { } q q Λ Λ = a i F 1 (λ 2 i I λ 2 i I λi ( the sums can t both be over i. The matri F 1 is later ignored for convenience. There is no proof of convergence, and no eperimental results. It is hard to conclude that the OLTR algorithm is a useful original contribution. However, simplified eperiments might help (see last page. 35. Chapter 3 (pp gives details of two applications requiring regularization, and numerical results comparing classical Tikhonov with NLTR. Some questions arise: In ( and (3.3.32, L is written as [ L 1 L 1 ] [ L 2 and L1 L 2 ] L 1. Isn t L supposed to be block-diagonal? How was q = 3 chosen to be best? How were λ i and L i selected? (There is no mention of GCV. For the second eample, what are the dimensions of K, L 1 and L 2? Figures 3.5 and 3.6 suggest n = 5. The figures are said to be for noise level std =.5, but the tables don t include this level. Is.5 intentional? Since L 1 and L 2 have different row sizes, how could NLTR be implemented? What can be said about the software written or used? (Presumably Matlab? 6
7 36. Section 3.4 (pp gives some Contributions and Conclusions. Again these would logically be another chapter, but at present they are too brief and vague. It is strange to mention GCV in the Conclusions but not in the eperimental results. 37. In choosing between GCV and the L-curve, there s a big difference between There were few reasons for preferring GCV and There were a few reasons for preferring GCV (!. 38. Evidently GCV must be used multiple times to choose each λ i. The numerical results should give an impression of how many cycles are required. Essential theory and eperiments To detere if problem NLTR can be treated in the desired manner, it will be essential to study the case q = 2. A simplified form of the proposed approach is to solve the partitioned problem,y using local subproblems of the form ( ( A B y b k A k c k, y k By k d k, k = 1, 2,... NLTR If such an algorithm can be devised, it would be in the spirit of the thesis. Convergence must be proved, and Matlab scripts will be needed for numerical verification. There will then be some hope that the proposed NLTR algorithm can be corrected and tested. Note that a sequence of subproblems is likely to be needed (k 2 because it looks like block-gauss-seidel on the normal equations for NLTR. Similarly for problem OLTR, it is necessary to study the case A b B C OLTR using local subproblems of the form ( ( A ck y k y B k, z k ( A C z k ( dk, k = 1, 2,.... Would α k y k + β k z k for suitable α k, β k? This is what the current OLTR algorithm assumes. 7
Geometric Modeling Summer Semester 2010 Mathematical Tools (1)
Geometric Modeling Summer Semester 2010 Mathematical Tools (1) Recap: Linear Algebra Today... Topics: Mathematical Background Linear algebra Analysis & differential geometry Numerical techniques Geometric
More informationL1-5. Reducing Rows 11 Aug 2014
L1-5. Reducing Rows 11 Aug 2014 Never send a human to do a machine's job. Agent Smith Primary concepts: Row-echelon form, reduced row-echelon form, Gauss-Jordan elimination method Online tetbook (Hefferon)
More informationMatrix inversion and linear equations
Learning objectives. Matri inversion and linear equations Know Cramer s rule Understand how linear equations can be represented in matri form Know how to solve linear equations using matrices and Cramer
More information[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.]
Math 43 Review Notes [Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty Dot Product If v (v, v, v 3 and w (w, w, w 3, then the
More informationk is a product of elementary matrices.
Mathematics, Spring Lecture (Wilson) Final Eam May, ANSWERS Problem (5 points) (a) There are three kinds of elementary row operations and associated elementary matrices. Describe what each kind of operation
More informationLinear Equations and Vectors
Chapter Linear Equations and Vectors Linear Algebra, Fall 6 Matrices and Systems of Linear Equations Figure. Linear Algebra, Fall 6 Figure. Linear Algebra, Fall 6 Figure. Linear Algebra, Fall 6 Unique
More informationCHAPTER 8: MATRICES and DETERMINANTS
(Section 8.1: Matrices and Determinants) 8.01 CHAPTER 8: MATRICES and DETERMINANTS The material in this chapter will be covered in your Linear Algebra class (Math 254 at Mesa). SECTION 8.1: MATRICES and
More informationMath 308 Midterm Answers and Comments July 18, Part A. Short answer questions
Math 308 Midterm Answers and Comments July 18, 2011 Part A. Short answer questions (1) Compute the determinant of the matrix a 3 3 1 1 2. 1 a 3 The determinant is 2a 2 12. Comments: Everyone seemed to
More informationEC5555 Economics Masters Refresher Course in Mathematics September 2014
EC5555 Economics Masters Refresher Course in Mathematics September 4 Lecture Matri Inversion and Linear Equations Ramakanta Patra Learning objectives. Matri inversion Matri inversion and linear equations
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 informationFinal Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2
Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch
More informationUNCONSTRAINED OPTIMIZATION PAUL SCHRIMPF OCTOBER 24, 2013
PAUL SCHRIMPF OCTOBER 24, 213 UNIVERSITY OF BRITISH COLUMBIA ECONOMICS 26 Today s lecture is about unconstrained optimization. If you re following along in the syllabus, you ll notice that we ve skipped
More informationA primer on matrices
A primer on matrices Stephen Boyd August 4, 2007 These notes describe the notation of matrices, the mechanics of matrix manipulation, and how to use matrices to formulate and solve sets of simultaneous
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.1 SYSTEMS OF LINEAR EQUATIONS LINEAR EQUATION,, 1 n A linear equation in the variables equation that can be written in the form a a a b 1 1 2 2 n n a a is an where
More informationNotes for CS542G (Iterative Solvers for Linear Systems)
Notes for CS542G (Iterative Solvers for Linear Systems) Robert Bridson November 20, 2007 1 The Basics We re now looking at efficient ways to solve the linear system of equations Ax = b where in this course,
More informationSpecial types of matrices
Roberto s Notes on Linear Algebra Chapter 4: Matrix Algebra Section 2 Special types of matrices What you need to know already: What a matrix is. The basic terminology and notation used for matrices. What
More informationthat relative errors are dimensionless. When reporting relative errors it is usual to multiply the fractional error by 100 and report it as a percenta
Error Analysis and Significant Figures Errors using inadequate data are much less than those using no data at all. C. Babbage No measurement of a physical quantity can be entirely accurate. It is important
More informationElimination Method Streamlined
Elimination Method Streamlined There is a more streamlined version of elimination method where we do not have to write all of the steps in such an elaborate way. We use matrices. The system of n equations
More informationMath 308 Spring Midterm Answers May 6, 2013
Math 38 Spring Midterm Answers May 6, 23 Instructions. Part A consists of questions that require a short answer. There is no partial credit and no need to show your work. In Part A you get 2 points per
More informationChapter 12: Iterative Methods
ES 40: Scientific and Engineering Computation. Uchechukwu Ofoegbu Temple University Chapter : Iterative Methods ES 40: Scientific and Engineering Computation. Gauss-Seidel Method The Gauss-Seidel method
More informationTypos/errors in Numerical Methods Using Matlab, 4th edition by Mathews and Fink
MAT487 Fall 2004 David Hiebeler University of Maine http://www.math.umaine.edu/faculty/hiebeler Typos/errors in Numerical Methods Using Matlab, 4th edition by Mathews and Fink Please let me know if you
More informationWhat is A + B? What is A B? What is AB? What is BA? What is A 2? and B = QUESTION 2. What is the reduced row echelon matrix of A =
STUDENT S COMPANIONS IN BASIC MATH: THE ELEVENTH Matrix Reloaded by Block Buster Presumably you know the first part of matrix story, including its basic operations (addition and multiplication) and row
More informationLESSON 35: EIGENVALUES AND EIGENVECTORS APRIL 21, (1) We might also write v as v. Both notations refer to a vector.
LESSON 5: EIGENVALUES AND EIGENVECTORS APRIL 2, 27 In this contet, a vector is a column matri E Note 2 v 2, v 4 5 6 () We might also write v as v Both notations refer to a vector (2) A vector can be man
More informationADDITIONAL MATHEMATICS
ADDITIONAL MATHEMATICS Paper 0606/ Paper Key messages Candidates should be reminded of the importance of reading the rubric on the eamination paper. Accuracy is of vital importance with final answers to
More informationEpsilon Delta proofs
Epsilon Delta proofs Before reading this guide, please go over inequalities (if needed). Eample Prove lim(4 3) = 5 2 First we have to know what the definition of a limit is: i.e rigorous way of saying
More informationStatistical Geometry Processing Winter Semester 2011/2012
Statistical Geometry Processing Winter Semester 2011/2012 Linear Algebra, Function Spaces & Inverse Problems Vector and Function Spaces 3 Vectors vectors are arrows in space classically: 2 or 3 dim. Euclidian
More informationHoly Family Catholic High School. By Mr. Gary Kannel, Mathematics Teacher. Version 0.3 Last Modified 4/04/2008
Holy Family Catholic High School Algebra Review By Mr. Gary Kannel, Mathematics Teacher Version 0. Last Modified /0/008 Restrictions: Although you may print a copy for your personal use in reviewing for
More informationFundamentals of Algebra, Geometry, and Trigonometry. (Self-Study Course)
Fundamentals of Algebra, Geometry, and Trigonometry (Self-Study Course) This training is offered eclusively through the Pennsylvania Department of Transportation, Business Leadership Office, Technical
More informationIntroduction. So, why did I even bother to write this?
Introduction This review was originally written for my Calculus I class, but it should be accessible to anyone needing a review in some basic algebra and trig topics. The review contains the occasional
More informationGetting Started with Communications Engineering
1 Linear algebra is the algebra of linear equations: the term linear being used in the same sense as in linear functions, such as: which is the equation of a straight line. y ax c (0.1) Of course, if we
More informationRecall, we solved the system below in a previous section. Here, we learn another method. x + 4y = 14 5x + 3y = 2
We will learn how to use a matrix to solve a system of equations. College algebra Class notes Matrices and Systems of Equations (section 6.) Recall, we solved the system below in a previous section. Here,
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 informationLECTURE 7. Least Squares and Variants. Optimization Models EE 127 / EE 227AT. Outline. Least Squares. Notes. Notes. Notes. Notes.
Optimization Models EE 127 / EE 227AT Laurent El Ghaoui EECS department UC Berkeley Spring 2015 Sp 15 1 / 23 LECTURE 7 Least Squares and Variants If others would but reflect on mathematical truths as deeply
More informationLinear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University
Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009 Preface The title of the book sounds a bit mysterious. Why should anyone read this
More informationExact and Approximate Numbers:
Eact and Approimate Numbers: The numbers that arise in technical applications are better described as eact numbers because there is not the sort of uncertainty in their values that was described above.
More informationIncompatibility Paradoxes
Chapter 22 Incompatibility Paradoxes 22.1 Simultaneous Values There is never any difficulty in supposing that a classical mechanical system possesses, at a particular instant of time, precise values of
More informationCS 143 Linear Algebra Review
CS 143 Linear Algebra Review Stefan Roth September 29, 2003 Introductory Remarks This review does not aim at mathematical rigor very much, but instead at ease of understanding and conciseness. Please see
More informationCS264: Beyond Worst-Case Analysis Lecture #15: Topic Modeling and Nonnegative Matrix Factorization
CS264: Beyond Worst-Case Analysis Lecture #15: Topic Modeling and Nonnegative Matrix Factorization Tim Roughgarden February 28, 2017 1 Preamble This lecture fulfills a promise made back in Lecture #1,
More informationRemarks on Definitions
Remarks on Definitions 1. Bad Definitions Definitions are the foundation of mathematics. Linear algebra bulges with definitions and one of the biggest challenge for students is to master them. It is difficult.
More informationImage Registration Lecture 2: Vectors and Matrices
Image Registration Lecture 2: Vectors and Matrices Prof. Charlene Tsai Lecture Overview Vectors Matrices Basics Orthogonal matrices Singular Value Decomposition (SVD) 2 1 Preliminary Comments Some of this
More informationv = ( 2)
Chapter : Introduction to Vectors.. Vectors and linear combinations Let s begin by saying what vectors are: They are lists of numbers. If there are numbers in the list, there is a natural correspondence
More informationExample: 2x y + 3z = 1 5y 6z = 0 x + 4z = 7. Definition: Elementary Row Operations. Example: Type I swap rows 1 and 3
Linear Algebra Row Reduced Echelon Form Techniques for solving systems of linear equations lie at the heart of linear algebra. In high school we learn to solve systems with or variables using elimination
More informationBasic Linear Inverse Method Theory - DRAFT NOTES
Basic Linear Inverse Method Theory - DRAFT NOTES Peter P. Jones 1 1 Centre for Compleity Science, University of Warwick, Coventry CV4 7AL, UK (Dated: 21st June 2012) BASIC LINEAR INVERSE METHOD THEORY
More informationMathematical Notation
Mathematical Notation All material 1996, 1997, 1999, 2000, 2105 David Maier Todd Leen 2001, 2006 1 Mathematics Core rules apply here, too Organize to help the reader Be simple Use a consistent lexical
More informationAn Introduction To Linear Algebra. Kuttler
An Introduction To Linear Algebra Kuttler April, 7 Contents Introduction 7 F n 9 Outcomes 9 Algebra in F n Systems Of Equations Outcomes Systems Of Equations, Geometric Interpretations Systems Of Equations,
More informationMATH 320, WEEK 7: Matrices, Matrix Operations
MATH 320, WEEK 7: Matrices, Matrix Operations 1 Matrices We have introduced ourselves to the notion of the grid-like coefficient matrix as a short-hand coefficient place-keeper for performing Gaussian
More informationComprehensive Introduction to Linear Algebra
Comprehensive Introduction to Linear Algebra WEB VERSION Joel G Broida S Gill Williamson N = a 11 a 12 a 1n a 21 a 22 a 2n C = a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn a m1 a m2 a mn Comprehensive
More information1 Least Squares Estimation - multiple regression.
Introduction to multiple regression. Fall 2010 1 Least Squares Estimation - multiple regression. Let y = {y 1,, y n } be a n 1 vector of dependent variable observations. Let β = {β 0, β 1 } be the 2 1
More informationMath101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2:
Math101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2: 03 17 08 3 All about lines 3.1 The Rectangular Coordinate System Know how to plot points in the rectangular coordinate system. Know the
More informationLinear Algebra Methods for Data Mining
Linear Algebra Methods for Data Mining Saara Hyvönen, Saara.Hyvonen@cs.helsinki.fi Spring 2007 Linear Discriminant Analysis Linear Algebra Methods for Data Mining, Spring 2007, University of Helsinki Principal
More informationA primer on matrices
A primer on matrices Stephen Boyd August 4, 2007 These notes describe the notation of matrices, the mechanics of matrix manipulation, and how to use matrices to formulate and solve sets of simultaneous
More informationand Rational Functions
chapter This detail from The School of Athens (painted by Raphael around 1510) depicts Euclid eplaining geometry. Linear, Quadratic, Polynomial, and Rational Functions In this chapter we focus on four
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationA Re-look at the Methods for Decomposing the Difference Between Two Life Expectancies at Birth
Sankhyā : The Indian Journal of Statistics 008, Volume 70-B, Part, pp. 83-309 c 008, Indian Statistical Institute A Re-look at the Methods for Decomposing the Difference Between Two Life Epectancies at
More informationGeotechnical Engineering Laboratory (CE 4348) Laboratory Report #1. Soil Classification. Group #1. Group member #1 Group member #2 Group member #3
Geotechnical Engineering Laboratory (CE 4348) Laboratory Report #1 Soil Classification Group #1 Group member #1 Group member #2 Group member #3 February 4, 2013 I have neither given nor received unauthorized
More informationpset3-sol September 7, 2017
pset3-sol September 7, 2017 1 18.06 pset 3 Solutions 1.1 Problem 1 Suppose that you solve AX = B with and find that X is 1 1 1 1 B = 0 2 2 2 1 1 0 1 1 1 0 1 X = 1 0 1 3 1 0 2 1 1.1.1 (a) What is A 1? (You
More informationLinear Programing and Inversions
Linear Programing and Inversions Linear programming (LP, also called linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements
More information2.1 Definition. Let n be a positive integer. An n-dimensional vector is an ordered list of n real numbers.
2 VECTORS, POINTS, and LINEAR ALGEBRA. At first glance, vectors seem to be very simple. It is easy enough to draw vector arrows, and the operations (vector addition, dot product, etc.) are also easy to
More informationA.P. Calculus Summer Packet
A.P. Calculus Summer Packet Going into AP calculus, there are certain skills that have been taught to you over the previous years that we assume you have. If you do not have these skills, you will find
More informationBARUCH COLLEGE MATH 2207 FALL 2007 MANUAL FOR THE UNIFORM FINAL EXAMINATION. No calculator will be allowed on this part.
BARUCH COLLEGE MATH 07 FALL 007 MANUAL FOR THE UNIFORM FINAL EXAMINATION The final eamination for Math 07 will consist of two parts. Part I: Part II: This part will consist of 5 questions. No calculator
More informationLecture 9: SVD, Low Rank Approximation
CSE 521: Design and Analysis of Algorithms I Spring 2016 Lecture 9: SVD, Low Rank Approimation Lecturer: Shayan Oveis Gharan April 25th Scribe: Koosha Khalvati Disclaimer: hese notes have not been subjected
More informationSYMBOLIC AND EXACT STRUCTURE PREDICTION FOR SPARSE GAUSSIAN ELIMINATION WITH PARTIAL PIVOTING
SYMBOLIC AND EXACT STRUCTURE PREDICTION FOR SPARSE GAUSSIAN ELIMINATION WITH PARTIAL PIVOTING LAURA GRIGORI, JOHN R. GILBERT, AND MICHEL COSNARD Abstract. In this paper we consider two structure prediction
More information33A Linear Algebra and Applications: Practice Final Exam - Solutions
33A Linear Algebra and Applications: Practice Final Eam - Solutions Question Consider a plane V in R 3 with a basis given by v = and v =. Suppose, y are both in V. (a) [3 points] If [ ] B =, find. (b)
More informationSystems of Linear Equations
Systems of Linear Equations Linear Equation Definition Any equation that is equivalent to the following format a a ann b (.) where,,, n are unknown variables and a, a,, an, b are known numbers (the so
More informationName Solutions Linear Algebra; Test 3. Throughout the test simplify all answers except where stated otherwise.
Name Solutions Linear Algebra; Test 3 Throughout the test simplify all answers except where stated otherwise. 1) Find the following: (10 points) ( ) Or note that so the rows are linearly independent, so
More informationLinear Least-Squares Data Fitting
CHAPTER 6 Linear Least-Squares Data Fitting 61 Introduction Recall that in chapter 3 we were discussing linear systems of equations, written in shorthand in the form Ax = b In chapter 3, we just considered
More informationFall 2016 MATH*1160 Final Exam
Fall 2016 MATH*1160 Final Exam Last name: (PRINT) First name: Student #: Instructor: M. R. Garvie Dec 16, 2016 INSTRUCTIONS: 1. The exam is 2 hours long. Do NOT start until instructed. You may use blank
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 informationMathematical Methods in Engineering and Science Prof. Bhaskar Dasgupta Department of Mechanical Engineering Indian Institute of Technology, Kanpur
Mathematical Methods in Engineering and Science Prof. Bhaskar Dasgupta Department of Mechanical Engineering Indian Institute of Technology, Kanpur Module - I Solution of Linear Systems Lecture - 05 Ill-Conditioned
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 information22. RADICALS. x add 5. multiply by 7
22. RADICALS doing something, then undoing it The concept of doing something and then undoing it is very important in mathematics. Here are some eamples: Take a number. Add 5 to it. How can you get back
More informationLinear Algebra, part 3. Going back to least squares. Mathematical Models, Analysis and Simulation = 0. a T 1 e. a T n e. Anna-Karin Tornberg
Linear Algebra, part 3 Anna-Karin Tornberg Mathematical Models, Analysis and Simulation Fall semester, 2010 Going back to least squares (Sections 1.7 and 2.3 from Strang). We know from before: The vector
More informationWriting Mathematics. 1 LaTeX. 2 The Problem
Writing Mathematics Since Math 171 is a WIM course we will be talking not only about our subject matter, but about how to write about it. This note discusses how to write mathematics well in at least one
More informationPROBLEMS In each of Problems 1 through 12:
6.5 Impulse Functions 33 which is the formal solution of the given problem. It is also possible to write y in the form 0, t < 5, y = 5 e (t 5/ sin 5 (t 5, t 5. ( The graph of Eq. ( is shown in Figure 6.5.3.
More information3.6 Determinants. 3.6 Determinants 1
3.6 Determinants 1 3.6 Determinants We said in Section 3.3 that a 2 2 matri a b c d is invertible if and only if its erminant, ad - bc, is nonzero, and we saw the erminant used in the formula for the inverse
More informationPRACTICAL SUGGESTIONS FOR MATHEMATICAL WRITING
PRACTICAL SUGGESTIONS FOR MATHEMATICAL WRITING BJORN POONEN In the examples below, red is bad and green is good. 1. Important things (1) If a claim does not follow immediately from the previous sentence
More informationMath 1314 Lesson 4 Limits
Math 1314 Lesson 4 Limits What is calculus? Calculus is the study of change, particularly, how things change over time. It gives us a framework for measuring change using some fairly simple models. In
More informationVector Spaces, Orthogonality, and Linear Least Squares
Week Vector Spaces, Orthogonality, and Linear Least Squares. Opening Remarks.. Visualizing Planes, Lines, and Solutions Consider the following system of linear equations from the opener for Week 9: χ χ
More informationLinear Algebra Review
Chapter 1 Linear Algebra Review It is assumed that you have had a course in linear algebra, and are familiar with matrix multiplication, eigenvectors, etc. I will review some of these terms here, but quite
More informationThe Integers. Peter J. Kahn
Math 3040: Spring 2009 The Integers Peter J. Kahn Contents 1. The Basic Construction 1 2. Adding integers 6 3. Ordering integers 16 4. Multiplying integers 18 Before we begin the mathematics of this section,
More informationA.P. Calculus Summer Packet
A.P. Calculus Summer Packet Going into AP calculus, there are certain skills that have been taught to you over the previous years that we assume you have. If you do not have these skills, you will find
More informationExploratory Factor Analysis and Principal Component Analysis
Exploratory Factor Analysis and Principal Component Analysis Today s Topics: What are EFA and PCA for? Planning a factor analytic study Analysis steps: Extraction methods How many factors Rotation and
More informationDemonstrate solution methods for systems of linear equations. Show that a system of equations can be represented in matrix-vector form.
Chapter Linear lgebra Objective Demonstrate solution methods for sstems of linear equations. Show that a sstem of equations can be represented in matri-vector form. 4 Flowrates in kmol/hr Figure.: Two
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 1982 NOTES ON MATRIX METHODS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 198 NOTES ON MATRIX METHODS 1. Matrix Algebra Margenau and Murphy, The Mathematics of Physics and Chemistry, Chapter 10, give almost
More informationMatrix Basic Concepts
Matrix Basic Concepts Topics: What is a matrix? Matrix terminology Elements or entries Diagonal entries Address/location of entries Rows and columns Size of a matrix A column matrix; vectors Special types
More informationADVICE ON MATHEMATICAL WRITING
ADVICE ON MATHEMATICAL WRITING KEITH CONRAD This handout lists some writing tips when you are preparing a mathematical text. The idea of using examples labeled Bad and then Good was inspired by this format
More informationSolutions to Math 41 First Exam October 12, 2010
Solutions to Math 41 First Eam October 12, 2010 1. 13 points) Find each of the following its, with justification. If the it does not eist, eplain why. If there is an infinite it, then eplain whether it
More informationTopic 15 Notes Jeremy Orloff
Topic 5 Notes Jeremy Orloff 5 Transpose, Inverse, Determinant 5. Goals. Know the definition and be able to compute the inverse of any square matrix using row operations. 2. Know the properties of inverses.
More informationThe Right Theta. 148 c THE MATHEMATICAL ASSOCIATION OF AMERICA. References. The Cartesian plane. P(x, y) θ x
Theorem can be proved much like Theorem. For Theorem 4, we ask the reader to verif the first few cases for k =,,.... It would be interesting to get a closed form for g. Finding other pairs of functions
More informationchapter 12 MORE MATRIX ALGEBRA 12.1 Systems of Linear Equations GOALS
chapter MORE MATRIX ALGEBRA GOALS In Chapter we studied matrix operations and the algebra of sets and logic. We also made note of the strong resemblance of matrix algebra to elementary algebra. The reader
More informationThe Integers. Math 3040: Spring Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers Multiplying integers 12
Math 3040: Spring 2011 The Integers Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers 11 4. Multiplying integers 12 Before we begin the mathematics of this section, it is worth
More informationTHE INVERSE PROBLEM FOR DIRECTED CURRENT ELECTRICAL NETWORKS
THE INVERSE PROBLEM FOR DIRECTED CURRENT ELECTRICAL NETWORKS JOEL NISHIMURA Abstract. This paper investigates the inverse problem for the directed current networks defined by Orion Bawdon [1]. Using a
More informationNotes 3.2: Properties of Limits
Calculus Maimus Notes 3.: Properties of Limits 3. Properties of Limits When working with its, you should become adroit and adept at using its of generic functions to find new its of new functions created
More informationThe Role of Topology in the Study of Evolution
The Role of Topology in the Study of Evolution Avery Broome August 31, 2015 Abstract In this paper, we will attempt to understand the role topology plays in analyzing RNA secondary structures by providing
More informationSuggested Problems for Math 122
Suggested Problems for Math 22 Note: This file will grow as the semester evolves and more sections are added. CCA = Contemporary College Algebra, SIA = Shaum s Intermediate Algebra SIA(.) Rational Epressions
More informationPreface. Figures Figures appearing in the text were prepared using MATLAB R. For product information, please contact:
Linear algebra forms the basis for much of modern mathematics theoretical, applied, and computational. The purpose of this book is to provide a broad and solid foundation for the study of advanced mathematics.
More information18.06 Professor Johnson Quiz 1 October 3, 2007
18.6 Professor Johnson Quiz 1 October 3, 7 SOLUTIONS 1 3 pts.) A given circuit network directed graph) which has an m n incidence matrix A rows = edges, columns = nodes) and a conductance matrix C [diagonal
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationM. Matrices and Linear Algebra
M. Matrices and Linear Algebra. Matrix algebra. In section D we calculated the determinants of square arrays of numbers. Such arrays are important in mathematics and its applications; they are called matrices.
More informationReview of Optimization Basics
Review of Optimization Basics. Introduction Electricity markets throughout the US are said to have a two-settlement structure. The reason for this is that the structure includes two different markets:
More information