Media Summary: Introduction of linear systems of equations using a fictional electronics manufacturing example. Computational methods for matrices; understanding matrix singularity and rank. Reducing the computations needed through the use of linked lists. We will also learn to calculate the cost of algorithms by ...

Oit Math 451 Session 2 - Detailed Analysis & Overview

Introduction of linear systems of equations using a fictional electronics manufacturing example. Computational methods for matrices; understanding matrix singularity and rank. Reducing the computations needed through the use of linked lists. We will also learn to calculate the cost of algorithms by ... Improving the first order method by making use of multiple stages and locations for calculating the derivative. Making our "Naive" Gaussian elimination algorithm less vulnerable to data anomalies such as very small or zero values in the ... Warm up to Gaussian reduction using a simple

Expressing a Function as a Polynomial Part Applying Richardson's method to the trapezoidal rule to obtain Romberg Integration. Analysis of the Newton-Raphson Algorithm with respect to multiple roots and issues when the function is flat near the root of ... Computational problems that develop when gaussian reduction is turned directly into an algorithm without careful processing of ... Creating P-code needed to triangularize a matrix. This is a two part series, taking you through the 1st column only. Replacing the trapezoidal sections in the integration with the area under a quadratic curve.

Introducing the Taylor Series as a consequence of the Mean Value Theorem. Part two of the recursively constructed trapezoidal rule. Further improvements to partial pivoting through scaling each column entry under evaluation with the corresponding row ... Applying the classic definition of a definite integral to a numerical method which we will call the rectangular rule. This section provides a quick reminder about matrix inversion as well as a computational example for a

Photo Gallery

OIT Math 451 session 2.0a: Example of  a System of Linear Equations
OIT Math 451 session 0.2: Algorithms as Solutions
OIT Math 451 session 2.0c: Terminology & Notation
OIT Math 451 session 2.0d: Matrix Computation, Singularity & Rank
OIT Math 451 session 2.2d: Linked Lists and Measuring Algorithm "Cost"
OIT Math 451 session 7.2:  Runge-Kutta Methods for 1st order Differential Equations
OIT Math 451 session 2.2b: Simple Partial Pivoting
OIT Math 451 session 2.0b: 2 x 2 Example of Gaussian Reduction
OIT Math 451 session 1.2b: Expressing a Function as a Polynomial Part II
OIT Math 451 session 5.2: Romberg Integration
OIT Math 451 session 3.2c: Problems with Multiple Roots and other convergence issues
OIT Math 451 session 2.2a: Problems with "Naïve" Gaussian reduction
View Detailed Profile
OIT Math 451 session 2.0a: Example of  a System of Linear Equations

OIT Math 451 session 2.0a: Example of a System of Linear Equations

Introduction of linear systems of equations using a fictional electronics manufacturing example.

OIT Math 451 session 0.2: Algorithms as Solutions

OIT Math 451 session 0.2: Algorithms as Solutions

Well welcome back to

OIT Math 451 session 2.0c: Terminology & Notation

OIT Math 451 session 2.0c: Terminology & Notation

The basic language of Linear Algebra.

OIT Math 451 session 2.0d: Matrix Computation, Singularity & Rank

OIT Math 451 session 2.0d: Matrix Computation, Singularity & Rank

Computational methods for matrices; understanding matrix singularity and rank.

OIT Math 451 session 2.2d: Linked Lists and Measuring Algorithm "Cost"

OIT Math 451 session 2.2d: Linked Lists and Measuring Algorithm "Cost"

Reducing the computations needed through the use of linked lists. We will also learn to calculate the cost of algorithms by ...

OIT Math 451 session 7.2:  Runge-Kutta Methods for 1st order Differential Equations

OIT Math 451 session 7.2: Runge-Kutta Methods for 1st order Differential Equations

Improving the first order method by making use of multiple stages and locations for calculating the derivative.

OIT Math 451 session 2.2b: Simple Partial Pivoting

OIT Math 451 session 2.2b: Simple Partial Pivoting

Making our "Naive" Gaussian elimination algorithm less vulnerable to data anomalies such as very small or zero values in the ...

OIT Math 451 session 2.0b: 2 x 2 Example of Gaussian Reduction

OIT Math 451 session 2.0b: 2 x 2 Example of Gaussian Reduction

Warm up to Gaussian reduction using a simple

OIT Math 451 session 1.2b: Expressing a Function as a Polynomial Part II

OIT Math 451 session 1.2b: Expressing a Function as a Polynomial Part II

Expressing a Function as a Polynomial Part

OIT Math 451 session 5.2: Romberg Integration

OIT Math 451 session 5.2: Romberg Integration

Applying Richardson's method to the trapezoidal rule to obtain Romberg Integration.

OIT Math 451 session 3.2c: Problems with Multiple Roots and other convergence issues

OIT Math 451 session 3.2c: Problems with Multiple Roots and other convergence issues

Analysis of the Newton-Raphson Algorithm with respect to multiple roots and issues when the function is flat near the root of ...

OIT Math 451 session 2.2a: Problems with "Naïve" Gaussian reduction

OIT Math 451 session 2.2a: Problems with "Naïve" Gaussian reduction

Computational problems that develop when gaussian reduction is turned directly into an algorithm without careful processing of ...

OIT Math 451 session 2.1a: Triangularization through column 1

OIT Math 451 session 2.1a: Triangularization through column 1

Creating P-code needed to triangularize a matrix. This is a two part series, taking you through the 1st column only.

OIT Math 451 session 5.3: Simpson's Rule

OIT Math 451 session 5.3: Simpson's Rule

Replacing the trapezoidal sections in the integration with the area under a quadratic curve.

OIT Math 451 1.2a: Expressing a Function as a Polynomial Part I

OIT Math 451 1.2a: Expressing a Function as a Polynomial Part I

Introducing the Taylor Series as a consequence of the Mean Value Theorem.

OIT Math 451 session 5.1b: The Recursive Trapezoidal Algorithm - part 2

OIT Math 451 session 5.1b: The Recursive Trapezoidal Algorithm - part 2

Part two of the recursively constructed trapezoidal rule.

OIT Math 451 session 2.2c: Scaled Partial Pivoting

OIT Math 451 session 2.2c: Scaled Partial Pivoting

Further improvements to partial pivoting through scaling each column entry under evaluation with the corresponding row ...

OIT Math 451 session 5.0: The Rectangle Rule

OIT Math 451 session 5.0: The Rectangle Rule

Applying the classic definition of a definite integral to a numerical method which we will call the rectangular rule.

OIT Math 451 session 2.0e: Matrix Inversion

OIT Math 451 session 2.0e: Matrix Inversion

This section provides a quick reminder about matrix inversion as well as a computational example for a