Matlab normal equations without polyfit

See attached file for full problem description. Does anyone know how to do this without using Matlab functions such as polyfit and etc? The regression and error analysis needs to be performed by solving the normal equations. I also attached an example of how it is supposed to be modeled. --- %Tossing a lead weight: example of linear regression error from BME221 lecture %matrix of modeling functions: first column of ones, second column = t, %third column = -0.5*t^2 (data is modeled by h = h0 +V0*t +0.5g*t^2). %We shall denote our model by the vector equation A*x=b A=[ones(1,5);0:4;-0.5*(0:4).^2]' %height measurements in meters h=[0.3 14.8 20.7 15.9 2]' K=inv(A'*A)*A' % our m... click for more

Java Programming

Access the Extends Java program. Compile and run the program. There are five lines of code marked (1)..(5) that you must explain after analyzing the code, running the program, and examining the output. Submit your work with an explanation of each of the lines of code (1..5), that is, what the code does syntactically and what it does in the program (I am looking for an explanation of how each line of code correlates to solving the over-all problem). See attached file…

Write value returning and void Java methods

You have already written the code for the four loop problems which you will now combine into one program with four distinct methods. For this assignment you will write methods, two value returning methods and two void methods. You may choose which of the four problems are coded into which method. Each method must represent one of the 4 distinct loop problems. The methods must include: one value-returning method and one void method which will receive a formal parameter and one (each) that will not. Your program must compile and run.

Chinese Remainder Theorem Visual C++.NET 2003 (3)

I need help to writing a program "VC++.net"with the specified input and output. Please, Implement the Chinese Remainder Theorem. Allowing at least 3 pairwise relatively prime positive integers. Example: Problem #1 Solve p1: x = 2 (mod 3) p2: x = 3 (mod 5) p3: x = 2 (mod 7) From p1, x = 3t + 2, for some integer t. Substituting this into p2 gives 3t = 1 (mod 5). Looking up 1/3 in the division table modulo 5, this reduces to a simpler equation p4: t = 2 (mod 5) which, in turn, is equivalent to t = 5s + 2 for an integer s. Substitution into x = 3t + 2 yields x = 15s + 8. This now goes into p3: 15s + 8 = 2 (mod 7). Casting out 7 gives s = 1 (mod 7). From here, s = ... click for more

Fibonacci Number using Visual C++

I need help to writing a program "VC++.net" with the specified input and output. Use a computational program or programs you have written to do the following exercises. Given any non-negative integer n, a.Find the nth Fibonacci number using iteration. b.Find the nth Fibonacci number using recursion. c.Compare the number of operations and the CPU time needed to compute Fibonacci numbers recursively vs. that needed to compute them iteratively. Maybe these pseudocodes been helpful; A Recursive Algorithm for Fibonacci Numbers. Procedure fubonacci(n: nonnegative integer) If n = 0 then Fibonacci(0) := 1 else if n = 1 then fiponacci(1) :=1 else fibonacci(n) := Fibonacci (... click for more