code that command #2

Re: code that command #2

Tue, 27 Apr 2010 01:51:59 +0000

The algorithm is Gaussian elimination with partial pivoting as shown here, appropriately adapted to TI-BASIC. If you search within the book you will also be able to see what a determinant is for.

thornahawk

Re: code that command #2

Sun, 25 Apr 2010 16:15:50 +0000

I'd like to know where you learned that and what a determinant is.

Re: code that command #2

Sun, 25 Apr 2010 10:44:53 +0000

I guess knowing the exact algorithm the calculator uses could be construed as cheating, but here you go anyway:

dim([A]→A ∟A(1→N If N≠∟A(2:Stop DelVar ∟A 1→P For(K,1,N-1 K→Q:DelVar V For(J,K,N abs([A](J,K If V

 References will be supplied upon request.
 thornahawk



Re: code that command #2
Sat, 24 Apr 2010 21:39:50 +0000

						 Isn't that just as simple as downs minus ups or the minor method? Or does that only hold true up until a point? 
				 	


Re: code that command #2
Sat, 24 Apr 2010 20:53:04 +0000

						 Oh man, I won't be able to even being tackling this: I know only how to do it with 2*2 and 3*3 matrices… 
				 	


code that command #2
Sat, 24 Apr 2010 20:05:47 +0000

						 try this one: det(
 given a square matrix of any size in Ans (under 99x99 of course), find the determinant without the det( command.