Math 410: Intro to Numerical Methods - Revision history

Ls5 at 17:36, 14 March 2024

2024-03-14T17:36:54Z

2016-02-05T20:44:16Z

‎Offered

2013-04-03T22:13:30Z

2013-04-03T22:09:41Z

2010-07-19T14:44:41Z

2010-07-15T18:32:00Z

2010-07-15T18:31:14Z

‎Description

2010-02-18T15:29:27Z

‎Minimal learning outcomes

2010-02-18T15:29:04Z

‎Minimal learning outcomes

2010-02-18T15:26:17Z

‎Minimal learning outcomes

@@ Line 11: / Line 11: @@
 === Prerequisite ===
-[[Math 314]].
+[[Math 314]]. CS 111
 === Description ===

@@ Line 8: / Line 8: @@
 === Offered ===
+F (even years)
 === Prerequisite ===

← Older revision		Revision as of 14:44, 19 July 2010
Line 67:		Line 67:

	</div>		</div>
		+
		+	=== Textbooks ===
		+	Possible textbooks for this course include (but are not limited to):
		+
		+	* Richard L. Burde and J. Douglas Faires, ''Numerical Analysis (9th Edition)'', Brooks Cole, 2010.

	=== Additional topics ===		=== Additional topics ===

@@ Line 14: / Line 14: @@
 === Description ===
-Root finding, interpolation, curve fitting, numerical differentiation and integration, multiple integrals, direct solvers for linear systems, least squares, rational approximations, Fourier and other orthogonal methods.  [This official course description appears to differ with current standard practice, in that iterative solvers of linear systems are taught in this course, while "Fourier and other orthogonal methods" are postponed until Math 411.)
+Root finding, interpolation, curve fitting, numerical differentiation and integration, multiple integrals, direct solvers for linear systems, least squares, rational approximations, Fourier and other orthogonal methods.  [This official course description appears to differ with current standard practice, in that iterative solvers of linear systems are taught in this course, while "Fourier and other orthogonal methods" are postponed until [[Math 411]].]
 == Desired Learning Outcomes ==

@@ Line 14: / Line 14: @@
 === Description ===
-Root finding, interpolation, curve fitting, numerical differentiation and integration, multiple integrals, direct solvers for linear systems, least squares, rational approximations, Fourier and other orthogonal methods.
+Root finding, interpolation, curve fitting, numerical differentiation and integration, multiple integrals, direct solvers for linear systems, least squares, rational approximations, Fourier and other orthogonal methods.  [This official course description appears to differ with current standard practice, in that iterative solvers of linear systems are taught in this course, while "Fourier and other orthogonal methods" are postponed until Math 411.)
 == Desired Learning Outcomes ==

← Older revision	Revision as of 22:13, 3 April 2013
(No difference)

← Older revision	Revision as of 22:09, 3 April 2013
(No difference)

@@ Line 23: / Line 23: @@
 === Minimal learning outcomes ===
 Students should be able to describe, derive, and implement the numerical methods listed below.  They should be able to explain the advantages and disadvantages of each method.  They should understand error analysis and be able to make practical decisions based on the outcomes of that analysis.
 # Numerical solution of equations of one variable
 #* Bisection method

← Older revision		Revision as of 15:29, 18 February 2010
Line 25:		Line 25:

	<div style="-moz-column-count:2; column-count:2;">		<div style="-moz-column-count:2; column-count:2;">
		+
		+	Students should be able to describe, derive, and implement the numerical methods listed below. They should be able to explain the advantages and disadvantages of each method. They should understand error analysis and be able to make practical decisions based on the outcomes of that analysis.

	# Numerical solution of equations of one variable		# Numerical solution of equations of one variable

@@ Line 61: / Line 61: @@
 #** Gauss-Seidel iteration
 #** Relaxation methods
 </div>