MATH 226 - 9.17.2007

MATH 226 - 9.17.2007 - x = c1 y = c2 store RegeQ y1(x y =...

This preview shows pages 1–2. Sign up to view the full content.

MATH 226 – September 17, 2007 Least Squared Line – given n sets of paired (x, y) data points We want to find: y-hat = β 0 + β 1 x we minimize L = Σ(y i – y i -hat) 2 = Σ(y i – β 0 + β 1 x i ) 2 δL/δβ 0 = -2Σ(y i – β 0 + β 1 x i )(y i – 1 – β 1 x i ) δL/δβ 1 = -2Σ(y i – β 0 + β 1 x i )(y i – β 0 – β 1 x i ) SEE BEST FIT SHEET FOR SOLUTIONS FOR β 0 AND β 1 On calculator (COMMANDS) Data/Matrix App Fill in blanks Column 1 = x data points Column 2 = y data points F5 Linreg Linear Regression

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: x = c1 y = c2 store RegeQ y1(x) y = ax + b a = .736788 b = .071723 F2 Highlight plot1 F1 Scatter – plot type (boxes) Window F2: 9 Data/Matrix Curser to c3 F4 c3 = y1(c1) F4 y1 – y1 hat = residual the residual is e i = y i- y i hat c4 = c2 – c3 c5 1, 2, 3, 4, 5, 6 F2 Plot 2 F1 Scatter c5 for x c4 for y y=0 Plot 2 and y2 = 0 checked Window F2 9 residuals...
View Full Document

{[ snackBarMessage ]}

Page1 / 2

MATH 226 - 9.17.2007 - x = c1 y = c2 store RegeQ y1(x y =...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online