Michael Overton Scientific Computing Group Broad Interests

Slides:



Advertisements
Similar presentations
Chapter 24 Numerics Bjarne Stroustrup
Advertisements

Notes 6.6 Fundamental Theorem of Algebra
The Complex Number System
C&O 355 Mathematical Programming Fall 2010 Lecture 9
Chapter 28 – Part II Matrix Operations. Gaussian elimination Gaussian elimination LU factorization LU factorization Gaussian elimination with partial.
R Lecture 4 Naomi Altman Department of Statistics Department of Statistics (Based on notes by J. Lee)
+ Convex Functions, Convex Sets and Quadratic Programs Sivaraman Balakrishnan.
Lecture 17 Introduction to Eigenvalue Problems
OCE301 Part II: Linear Algebra lecture 4. Eigenvalue Problem Ax = y Ax = x occur frequently in engineering analysis (eigenvalue problem) Ax =  x [ A.
DEF: Characteristic Polynomial (of degree n) QR - Algorithm Note: 1) QR – Algorithm is different from QR-Decomposition 2) a procedure to calculate the.
Numerical Optimization
Chapter 4. Numerical Interpretation of Eigenvalues In terms of matrix arithmetic eigenvalues turn matrix multiplication into scalar multiplication. Numerically.
Computing the Rational Univariate Reduction by Sparse Resultants Koji Ouchi, John Keyser, J. Maurice Rojas Department of Computer Science, Mathematics.
Classification Problem 2-Category Linearly Separable Case A- A+ Malignant Benign.
1 Three-view geometry 3-view constraint along F Minimal algebraic sol The content described in these slides is not required in the final exam!
Matrices CS485/685 Computer Vision Dr. George Bebis.
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
Introduction The central problems of Linear Algebra are to study the properties of matrices and to investigate the solutions of systems of linear equations.
Linear Algebra Review 1 CS479/679 Pattern Recognition Dr. George Bebis.
Fundamentals from Linear Algebra Ghan S. Bhatt and Ali Sekmen Mathematical Sciences and Computer Science College of Engineering Tennessee State University.
8.1 Vector spaces A set of vector is said to form a linear vector space V Chapter 8 Matrices and vector spaces.
Little Linear Algebra Contents: Linear vector spaces Matrices Special Matrices Matrix & vector Norms.
Notation OR Backgrounds OR Convex sets Nonconvex set.
Linear Algebra (Aljabar Linier) Week 10 Universitas Multimedia Nusantara Serpong, Tangerang Dr. Ananda Kusuma
Complex Zeros; Fundamental Theorem of Algebra
Linear algebra: matrix Eigen-value Problems
Learning a Kernel Matrix for Nonlinear Dimensionality Reduction By K. Weinberger, F. Sha, and L. Saul Presented by Michael Barnathan.
On the computation of the defining polynomial of the algebraic Riccati equation Yamaguchi Univ. Takuya Kitamoto Cybernet Systems, Co. LTD Tetsu Yamaguchi.
Computing Eigen Information for Small Matrices The eigen equation can be rearranged as follows: Ax = x  Ax = I n x  Ax - I n x = 0  (A - I n )x = 0.
Trace and Norm Pertemuan 8 Matakuliah: MATRIX ALGEBRA FOR STATISTICS Tahun: 2009.
Measuring and Optimizing Stability of Matrices Michael L. Overton Courant Institute of Mathematical Sciences New York University ---- Joint work with Jim.
§ Linear Operators Christopher Crawford PHY
Chapter 7 Multivariate techniques with text Parallel embedded system design lab 이청용.
Optimization formulation Optimization methods help us find solutions to problem where we seek to find the best of something. This lecture is about how.
Introduction to Semidefinite Programs Masakazu Kojima Semidefinite Programming and Its Applications Institute for Mathematical Sciences National University.
Multi-area Nonlinear State Estimation using Distributed Semidefinite Programming Hao Zhu October 15, 2012 Acknowledgements: Prof. G.
Linear Algebra Course Activity 2: Finding Similarities and Dissimilarities in DNA Sequences of HIV Patients Objective: Classify the types of Distances.
Lecture 1: Math Review EEE2108: Optimization 서강대학교 전자공학과 2012 학년도 1 학기.
Essential Questions How do we identify the multiplicity of roots?
Large-Scale Matrix Factorization with Missing Data under Additional Constraints Kaushik Mitra University of Maryland, College Park, MD Sameer Sheoreyy.
geometric representations of graphs
Linear Algebra Chapter 6 Linear Algebra with Applications -Gareth Williams Br. Joel Baumeyer, F.S.C.
MAT 4725 Numerical Analysis Section 7.1 Part I Norms of Vectors and Matrices
Notation OR Backgrounds OR Convex sets Nonconvex set.
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
13.3 Product of a Scalar and a Matrix.  In matrix algebra, a real number is often called a.  To multiply a matrix by a scalar, you multiply each entry.
COMPUTER GRAPHICS AND LINEAR ALGEBRA AN INTRODUCTION.
The Landscape of Sparse Ax=b Solvers Direct A = LU Iterative y’ = Ay Non- symmetric Symmetric positive definite More RobustLess Storage More Robust More.
Tutorial 6. Eigenvalues & Eigenvectors Reminder: Eigenvectors A vector x invariant up to a scaling by λ to a multiplication by matrix A is called.
CS479/679 Pattern Recognition Dr. George Bebis
Matrices and vector spaces
Eigenvalues and Eigenvectors
Georgian Technical University
Finding Real Roots of Polynomial Equations
Metric Learning for Clustering
An Introduction to Maple
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization Presenter: Xia Li.
Solving Linear Systems Using Inverse Matrices
CS485/685 Computer Vision Dr. George Bebis
geometric representations of graphs
Numerical Algorithms Quiz questions
1.3 Vector Equations.
Eigenvalues and Eigenvectors
Linear Algebra Lecture 32.
MAT 2401 Linear Algebra 7.2 Diagonalization
All we need in Game Programming Course Reference
Linear Algebra Lecture 29.
Matrix Multiplication
Eigenvalues and Eigenvectors
Subject :- Applied Mathematics
Presentation transcript:

Michael Overton Scientific Computing Group Broad Interests Optimization: convex and nonconvex problems from many applications Numerical linear algebra, especially involving eigenvalues Floating point arithmetic and the IEEE floating point standard

Current Projects Preconditioning techniques for semidefinite programming (convex optimization in the space of real symmetric matrices) Matrix distance problems, such as the distance from a given matrix to the nearest matrix with multiple eigenvalues, or the distance from a controllable matrix pair to the nearest uncontrollable matrix pair Quasi-Newton methods for nonsmooth, nonconvex optimization Software for H fixed-order controller design via nonsmooth, nonconvex optimization Optimization of functions of the spectrum (eigenvalues) or pseudospectrum (a more robust alternative) of nonsymmetric matrices Optimization of functions of the roots of polynomials