in Java

Hi everyon,

This is CD. I am writing a project which determines the values of Xs (X1, X2, X3..., Xn) using the guassian elimination (Linear Algrebra). The equation is written in a text file. For example, Equation.txt includes the following equations:

I just made up these numbers.

2

3 -3 6

-1 4 9

3

3 4 5 6

7 8 9 10

11 12 13 14

If you take a look at Equation 1, the linear equation should be written as:

2 (the number of equations)

3 -3 6 --> 3X1 - 3X2 = 6

-1 4 9 --> -X1 + 4X2 = 9

Same thing with Equation 2, but there are 3 equations.

3 (the number of equations)

3X1 + 4X2 + 5X3 = 6

7X1 + 8X2 + 9X3 = 10

11X1 + 12X2 + 13X3 = 14

How can store these numbers, which are read from the Equation.txt, in a 2-dimensional array?

If you know the answer to this question, please help.

Thanks for your time and consideration.

CD

This is CD. I am writing a project which determines the values of Xs (X1, X2, X3..., Xn) using the guassian elimination (Linear Algrebra). The equation is written in a text file. For example, Equation.txt includes the following equations:

I just made up these numbers.

2

3 -3 6

-1 4 9

3

3 4 5 6

7 8 9 10

11 12 13 14

If you take a look at Equation 1, the linear equation should be written as:

2 (the number of equations)

3 -3 6 --> 3X1 - 3X2 = 6

-1 4 9 --> -X1 + 4X2 = 9

Same thing with Equation 2, but there are 3 equations.

3 (the number of equations)

3X1 + 4X2 + 5X3 = 6

7X1 + 8X2 + 9X3 = 10

11X1 + 12X2 + 13X3 = 14

How can store these numbers, which are read from the Equation.txt, in a 2-dimensional array?

If you know the answer to this question, please help.

Thanks for your time and consideration.

CD

It looks like you're new here. If you want to get involved, click one of these buttons!

- 140.8K All Categories
- 103.6K Programming Languages
- 6.4K Assembler Developer
- 401 Assembly Code Share
- 239 Getting started in assembly
- 4.6K x86 Assembly
- 1.9K Basic
- 97 Qbasic
- 39.9K C and C++
- 5.6K Beginner C/C++
- 330 C/C++ on Linux/Unix
- 450 C/C++ Windows API
- 522 C++ Builder
- 253 C++ Game Development
- 3.3K C++ MFC
- 103 C++.NET
- 404 Visual C++
- 2.9K C#
- 7.9K Delphi and Kylix
- 334 Advanced Delphi
- 360 Delphi beginners
- 4 Haskell
- 9.7K Java
- 56 Enterprise JavaBeans
- 1.3K Java Beginners
- 304 Java Server Pages
- 4.1K Pascal
- 1.3K Perl
- 11 Perl 6
- 2K PHP
- 546 Python
- 37 Ruby
- 4.4K VB.NET
- 258 Advanced VB.Net
- 1.6K VBA
- 20.8K Visual Basic
- 767 Access databases and VB
- 831 Advance Visual Basic
- 1.2K Beginner VB
- 2.6K Game programming
- 315 Console programming
- 90 DirectX Game dev
- 1 Minecraft
- 112 Newbie Game Programmers
- 2 Oculus Rift
- 9K Applications
- 1.8K Computer Graphics
- 279 3D Graphics
- 129 DirectX
- 125 OpenGL
- 740 Computer Hardware
- 9 Cooling & Overclocking
- 3.4K Database & SQL
- 1.1K Access
- 91 ADO Programming
- 288 MySQL
- 358 Oracle
- 440 SQL-Server
- 535 Electronics development
- 1.6K Matlab
- 628 Sound & Music
- 25 DirectSound
- 257 XML Development
- 3.3K Classifieds
- 199 Co-operative Projects
- 198 For sale
- 190 FreeLance Software City
- 1.9K Jobs Available
- 603 Jobs Wanted
- 209 Wanted
- 2.9K Microsoft .NET
- 1.8K ASP.NET
- 1.1K .NET General
- 22 .NET WEB-Services
- 129 .NET WinForms
- 14 .NET XML
- 50 ADO.NET
- 142 C# & VB.NET School Support
- 3.4K Miscellaneous
- 4 Join the Team
- 354 Comments on this site
- 69 Computer Emulators
- 2.1K General programming
- 187 New programming languages
- 621 Off topic board
- 200 Mobile & Wireless
- 72 Android
- 126 Palm Pilot
- 338 Multimedia
- 154 Demo programming
- 184 MP3 programming
- 0 Bash scripts
- 27 Cloud Computing
- 1 Witsbits Go Cloud
- 53 FreeBSD
- 1.7K LINUX programming
- 1 Awk scripting
- 332 Linux Support
- 0 Sed scripting
- 370 MS-DOS
- 0 Shell scripting
- 321 Windows CE & Pocket PC
- 4.1K Windows programming
- 177 COM/DCOM
- 61 Networking And Security
- 17 Windows 2003 Server
- 6 Windows Vista
- 176 Windows XP
- 939 Software Development
- 416 Algorithms
- 68 Object Orientation
- 24 RUP & UML
- 91 Project Management
- 95 Quality & Testing
- 268 Security
- 63 Evil Scripting
- 81 Hacking
- 7.7K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 4 Bootstrap Themes
- 55 CGI Development
- 28 ColdFusion
- 224 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 131 Mobile Internet & Messaging
- 211 Wireless development
- 2.2K JavaScript
- 37 JQuery
- 304 WEB Servers
- 153 Apache
- 79 IIS
- 150 WEB-Services / SOAP

## Comments

int[][] = new int[n][n+1];

Then when you read in the next line, you store the numbers in the appropriate slot in the array. What you have to be careful about is parsing the string correctly, but I am assuming you have a method for that. As well, if you are trying to initialize a large matrix, say, 200 equations, then it would be tedious to do that within your main method. You should have a method for initializing the provided row of the matrix (determined by the first dimension of the array) with the values found in the provided string, knowing that there are n variables (determined by the size of the second dimension of the array). Your program would then read in the file line by line, pass each line to the method in a loop, and when the end of the file is reached, then you have initialized the entire matrix.

The problem that you might later encounter is that some systems of equations don't have unique solutions, which is what happens when two of your equations are multiples of each other, or you have a row of 0's. If there are fewer equations than variables, your program should be capable of realizing that, and should initialize the last row(s) of the matrix with 0's. This will help later when it comes to solving the matrix when you can place all the rows containing 0's at the end, and when you have reduced to that point, you are finished, and have to create temporary variables for each unreduced unknown. (If you can't solve for X4, then let X4 = t, and then state the solutions for X1, X2, X3 in terms of a constant and t. If you have more than one unsolved variable, then create another temp variable for each unknown, so that a solution for X1 might look like X1 = 5 - 3t + 2s.)

If you need more help with this, just ask. I just finished a course in this subject (linear algebra) and have made segments of a program to solve (n, n+1) matrices, so I should be able to give you a few pointers that will save your program large amounts of time.

If you have enough memory, you won't have enough disk space.