CS 474Numerical Approximation
- Faculty
- Mathematics
- Offered
- Spring
- Credit
- 0.5
- Last listed
- 1988–89
No longer offered. It’s in Waterloo’s scanned calendars from 1976–77 to 1988–89; the 1995–96 to 2023–24 calendars are on ucalendar.
Existence, uniqueness, and convergence of polynomial approximations obtained by interpolation and by least-squares criteria. Minimax and near minimax approximation by polynomials and rational functions. Efficient algorithms for obtaining approximations, including the Fast Fourier Transform. The design of built-in functions.
As printed in the 1977–78 to 1988–89 calendars, read by OCR; the scanned page is the original.
Requirements, as last listed
Prereq: CS 374 or 375, or CS 337 and MATH 3328 and consent of instructor. CS 372 is recommended
Check it elsewhere
In the scanned calendars
How it read in each calendar from 1976–77 to 1988–89, newest first. The text is OCR of the scanned pages; years whose wording matches are shown once, from the clearest scan. Each year links to its page on uwloo and to that page of the scanned PDF.
1977–78 to 1988–89 12 calendars
Existence, uniqueness, and convergence of polynomial approximations obtained by interpolation and by least-squares criteria. Minimax and near minimax approximation by polynomials and rational functions. Efficient algorithms for obtaining approximations, including the Fast Fourier Transform. The design of built-in functions.
Prereq: CS 374 or 375, or CS 337 and MATH 3328 and consent of instructor. CS 372 is recommended
Offered Spring · 3 class hours a week · 0.5 credit
1976–77 1 calendar
Interpolatory, least squares, and Minimax approximation of functions by polynomials, trigonometric series, rational functions, splines and exponentials. Numerical approximation of derivatives. Quadrature.
Prerequisites: CS 371. 3 hours lectures, 2 hours tutorial, Winter term.