Re: ILL CONDITION MATRICES

When posting code, please use the highlight tags. Also, code should be in the form of an SSCCE- you've got a bunch of extra stuff we don't need to see. Your problem can be boiled down to this code:

This prints out 1.2345679. What would you like it to print out instead?

Re: ILL CONDITION MATRICES

I actually want to print the output of the sample i have , i.e the solution to the matrix where A=[2 1;3 2] and b=[18;30] and and A^-1*b=[6;6] but i want the answer to 7 decimal places.Thanks

Re: ILL CONDITION MATRICES

What number are you trying to print? Plug it into my example program without any of your extra code, and we'll go from there.

Re: ILL CONDITION MATRICES

This is the the question we are ask to do

The following systems of equations is easy to solve

2x+ y = 18

3x + 2y = 30

by graphing, by substitution, or elimination.The solution (6,6) is easily arrived at using a graphing calculator using matrix algebra to solve the matrix equation.

Ax=b

A= 2 1

3 2

b= 18

30

Ax=b so x=A^-1*b= 6,6

The literature contains numerous algorithms for solving ill conditioned systems.In order to illustrate the shortfalls of floating point arithmetic for this projects you will limited to algorithms implementing the gauss- jordan method.

A.) Write a java program that uses an algorithm implementing the Gauss- jordan method to solve the system of linear equations given in the introduction.Your output must show the output of every calculation to no more than 7 decimal places.You must create and use a function that cuts off the result of each calculation at exactly seven decimal places and uses this cutoff value in any susbsequesnt calculation.

B.) Use the following ten step procedure to solve the problem:

1)Problem

2)Input

3)Output

4)Discussion

5)Assumptions

6)Top Down Design

7)Variables

8)Pseudocode

9)Flowchart

10)a Java source code

b) program output