
Login Form
Visitors Counter
![]() | Today | 30 |
![]() | Yesterday | 73 |
![]() | This week | 525 |
![]() | This month | 1638 |
![]() | All | 159438 |
Who's Online
We have 23 guests online- Error
A greedy approach to transversal selection for nonlinear systems of equations |
![]() |
![]() |
![]() |
D.G. Sotiropoulos and I.E. Livieris A Greedy Approach to Transversal Selection for Nonlinear Systems of Equations, In Proceedings of Conference in Numerical Analysis (NumAn07), pp 134-136, Kalamata, September, 2007.
Abstract -Ā Interval methods have been established for rigorously bounding all solutions of a nonlinear system of equations within a given region. In this paper, we introduce a new method for determining a good pivoting sequence for Gauss-Seidel method, based on a greedy algorithm, called 4M, solving assignment problems with worst case complexity O(n^2). |
Search Engines
