Triangular Decomposition Methods for Solving Reducible Nonlinear Systems of Equations

@article{Dennis1994TriangularDM,
  title={Triangular Decomposition Methods for Solving Reducible Nonlinear Systems of Equations},
  author={John E. Dennis and Jos{\'e} Mario Mart{\'i}nez and Xiaodong Zhang},
  journal={SIAM Journal on Optimization},
  year={1994},
  volume={4},
  pages={358-382}
}
Abstract. This paper generalizes to the nonlinear case a standard way to solve general sparse systems of linear equations. In particular, Duff [J. Inst. Math. Appl., 19 (1977), pp. 339-342] has suggested that row and column interchanges be applied to permute the coefficient matrix of a linear system into block lower triangular form., The linear system then can be solved by using the associated block Gauss-Seidel or forward block substitution scheme. This is the approach taken in the Harwell… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-5 of 5 references

MORi, Estimation of sparse Jacobian matrices and graph coloring problems

J.J.T.F. COLEMAN
SIAM J. Numer. Anal., • 1983
View 13 Excerpts
Highly Influenced

And J

I. S. DUFF, A. M. ERISMAN
K. REID, Direct Methods for Sparse Matrices, Oxford Scientific Publications • 1989

Jr

J. E. DENNIS
AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ • 1983
View 3 Excerpts

Sparse matrices and graph theory

F. HARARY
Large Sparse Sets of Linear Equations, J. K. Reid, ed., Academic Press, New York • 1971
View 3 Excerpts

Similar Papers

Loading similar papers…