Binary Tree Banded Linear Equation System Solver
Abstract
Although linear equation system solvers have been extensively treated, the state of the art for large equation systems -the blocking algorithm- does not have to be the end of the line. The author proposes the use of binary trees for very large systems, obtaining a far superior, timeeffective result. A computer test-program shows the advantages of the method. The paper concludes that the proposed tool could open new horizons to research in the fields of artificial intelligence and neural analysis.
Full Text: PDF DOI: 10.15640/jcsit.v2n3-4a1
Abstract
Although linear equation system solvers have been extensively treated, the state of the art for large equation systems -the blocking algorithm- does not have to be the end of the line. The author proposes the use of binary trees for very large systems, obtaining a far superior, timeeffective result. A computer test-program shows the advantages of the method. The paper concludes that the proposed tool could open new horizons to research in the fields of artificial intelligence and neural analysis.
Full Text: PDF DOI: 10.15640/jcsit.v2n3-4a1
Browse Journals
Journal Policies
Information
Useful Links
- Call for Papers
- Submit Your Paper
- Publish in Your Native Language
- Subscribe the Journal
- Frequently Asked Questions
- Contact the Executive Editor
- Recommend this Journal to Librarian
- View the Current Issue
- View the Previous Issues
- Recommend this Journal to Friends
- Recommend a Special Issue
- Comment on the Journal
- Publish the Conference Proceedings
Latest Activities
Resources
Visiting Status
 Today |
72 |
| Yesterday |
250 |
| This Month |
5543 |
| Last Month |
5657 |
 All Days |
1458142 |
 Online |
27 |
