## CME 103: Introduction to Matrix Methods (EE 103)

Introduction to applied linear algebra with emphasis on applications. Vectors, norm, and angle; linear independence and orthonormal sets; applications to document analysis. Clustering and the k-means algorithm. Matrices, left and right inverses, QR factorization. Least-squares and model fitting, regularization and cross-validation. Constrained and nonlinear least-squares. Applications include time-series prediction, tomography, optimal control, and portfolio optimization. Undergraduate students should enroll for 5 units, and graduate students should enroll for 3 units. Prerequisites:
MATH 51 or
CME 100, and basic knowledge of computing (
CS 106A is more than enough, and can be taken concurrently).
EE103/CME103 and
Math 104 cover complementary topics in applied linear algebra. The focus of EE103 is on a few linear algebra concepts, and many applications; the focus of
Math 104 is on algorithms and concepts.

Terms: Aut, Win, Sum
| Units: 5
| UG Reqs: GER:DB-Math, WAY-AQR, WAY-FR

Instructors:
Nasiri Mahalati, R. (PI)
;
Osgood, B. (PI)
;
Tse, D. (PI)
...
more instructors for CME 103 »

Instructors:
Nasiri Mahalati, R. (PI)
;
Osgood, B. (PI)
;
Tse, D. (PI)
;
Chang, S. (TA)
;
Degleris, A. (TA)
;
Gable, N. (TA)
;
Jani, T. (TA)
;
Lambert, S. (TA)
;
Ramesh, R. (TA)
;
Spear, L. (TA)
;
Toh, E. (TA)
;
Varanasi, V. (TA)
;
Yen, J. (TA)

## CME 251: Geometric and Topological Data Analysis (CS 233)

Mathematical computational tools for the analysis of data with geometric content, such images, videos, 3D scans, GPS traces -- as well as for other data embedded into geometric spaces. Global and local geometry descriptors allowing for various kinds of invariances. The rudiments of computational topology and persistent homology on sampled spaces. Clustering and other unsupervised techniques. Spectral methods for geometric data analysis. Non-linear dimensionality reduction. Alignment, matching, and map computation between geometric data sets. Function spaces and functional maps.Networks of data sets and joint analysis for segmentation and labeling. The emergence of abstractions or concepts from data. Prerequisites: discrete algorithms at the level of 161; linear algebra at the level of
CME103.

Terms: Spr
| Units: 3

## CS 233: Geometric and Topological Data Analysis (CME 251)

Mathematical computational tools for the analysis of data with geometric content, such images, videos, 3D scans, GPS traces -- as well as for other data embedded into geometric spaces. Global and local geometry descriptors allowing for various kinds of invariances. The rudiments of computational topology and persistent homology on sampled spaces. Clustering and other unsupervised techniques. Spectral methods for geometric data analysis. Non-linear dimensionality reduction. Alignment, matching, and map computation between geometric data sets. Function spaces and functional maps.Networks of data sets and joint analysis for segmentation and labeling. The emergence of abstractions or concepts from data. Prerequisites: discrete algorithms at the level of 161; linear algebra at the level of
CME103.

Terms: Spr
| Units: 3

## CS 348A: Computer Graphics: Geometric Modeling & Processing

The mathematical tools needed for the geometrical aspects of computer graphics and especially for modeling smooth shapes. Fundamentals: homogeneous coordinates, transformations, and perspective. Theory of parametric and implicit curve and surface models: polar forms, Bézier arcs and de Casteljau subdivision, continuity constraints, B-splines, tensor product, and triangular patch surfaces. Subdivision surfaces and multi-resolution representations of geometry. Representations of solids and conversions among them. Surface reconstruction from scattered data points. Geometry processing on meshes, including simplification and parameterization. Prerequisite: linear algebra at the level of
CME103. Recommended: 248.

Terms: Win
| Units: 3-4

Instructors:
Guibas, L. (PI)
;
Huang, J. (TA)

## EE 103: Introduction to Matrix Methods (CME 103)

Introduction to applied linear algebra with emphasis on applications. Vectors, norm, and angle; linear independence and orthonormal sets; applications to document analysis. Clustering and the k-means algorithm. Matrices, left and right inverses, QR factorization. Least-squares and model fitting, regularization and cross-validation. Constrained and nonlinear least-squares. Applications include time-series prediction, tomography, optimal control, and portfolio optimization. Undergraduate students should enroll for 5 units, and graduate students should enroll for 3 units. Prerequisites:
MATH 51 or
CME 100, and basic knowledge of computing (
CS 106A is more than enough, and can be taken concurrently).
EE103/CME103 and
Math 104 cover complementary topics in applied linear algebra. The focus of EE103 is on a few linear algebra concepts, and many applications; the focus of
Math 104 is on algorithms and concepts.

Terms: Aut, Win, Sum
| Units: 5
| UG Reqs: GER:DB-Math, WAY-AQR, WAY-FR

Instructors:
Nasiri Mahalati, R. (PI)
;
Osgood, B. (PI)
;
Tse, D. (PI)
...
more instructors for EE 103 »

Instructors:
Nasiri Mahalati, R. (PI)
;
Osgood, B. (PI)
;
Tse, D. (PI)
;
Chang, S. (TA)
;
Degleris, A. (TA)
;
Gable, N. (TA)
;
Jani, T. (TA)
;
Lambert, S. (TA)
;
Ramesh, R. (TA)
;
Spear, L. (TA)
;
Toh, E. (TA)
;
Varanasi, V. (TA)
;
Yen, J. (TA)

Filter Results: