-
Institution:
-
University of Pennsylvania
-
Subject:
-
-
Description:
-
Staff. Prerequisite(s): Math 508 or with the permission of the instructor. Linear algebra is also helpful. Continuation of Math 508. The Arzela-Ascoli theorem. Introduction to the topology of metric spaces with an emphasis on higher dimensional Euclidean spaces. The contraction mapping principle. Inverse and implicit function theorems. Rigorous treatment of higher dimensional differential calculus. Introduction to Fourier analysis and asymptotic methods. Advanced Linear Algebra. Staff. Prerequisite(s): Math 114 or 115. Math 512 covers Linear Algebra at the advanced level with a theoretical approach. Students can receive credit for at most one of Math 312 and Math 512. Topics will include: Vector spaces, Basis and dimension, quotients; Linear maps and matrices; Determinants, Dual spaces and maps; Invariant subspaces, Cononical forms; Scalar products: Euclidean, unitary and symplectic spaces; Orthogonal and unitary operators; Tensor products and polylinear maps; Symmetric and skew-symmetric tensors and exterior algebra. (CIS 313, MATH313) Computational Linear Algebra. Staff. A number of important and interesting problems in a wide range of disciplines within computer science are solved by recourse to techniques from linear algebra. The goal of this course will be to introduce students to some of the most important and widely used algorithms in matrix computation and to illustrate how they are actually used in various settings. Motivating applications will include: the solution of systems of linear equations, applications matrix computations to modeling geometric transformations in graphics, applications of the Discrete Fourier Transform and related techniques in digital signal processing, the solution of linear least squares optimization problems and the analysis of systems of linear differential equations. The course will cover the theoretical underpinnings of these problems and the numerical algorithms that are used to perform important matrixcomputations such as Gaussian Elimination, LU Decomposition and Singular Value Decomposition.
-
Credits:
-
3.00
-
Credit Hours:
-
-
Prerequisites:
-
-
Corequisites:
-
-
Exclusions:
-
-
Level:
-
-
Instructional Type:
-
Lecture
-
Notes:
-
-
Additional Information:
-
-
Historical Version(s):
-
-
Institution Website:
-
-
Phone Number:
-
(215) 898-5000
-
Regional Accreditation:
-
Middle States Association of Colleges and Schools
-
Calendar System:
-
Semester
Detail Course Description Information on CollegeTransfer.Net
Copyright 2006 - 2025 AcademyOne, Inc.