Skip to main content

On the solution of large, sparse sets of nonlinear equations

Lectures

Part of the Lecture Notes in Mathematics book series (LNM,volume 461)

Keywords

  • Finite Element Approximation
  • Convergence Domain
  • Generalize Linear Method
  • Discrete Variable Method
  • Nonlinear Simultaneous Equation

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Ortega and W. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, Inc., New York, 1970.

    MATH  Google Scholar 

  2. D. Young, Interative Solution of Large Linear Systems, Academic Press, Inc., New York, 1971.

    Google Scholar 

  3. G. P. Astrahancev, Convergence of an over relaxation method for solving variational-difference equations for elliptic equations over arbitrary regions (Russian), Ž. Vyvîsl. Mat. i Mat. Fiz. 13, 1973, 483–488.

    MathSciNet  MATH  Google Scholar 

  4. G. P. Astrahancev and L. A. Ruhovec, The rate of convergence of the block SOR method of solution of variational-difference schemes for elliptic equations of order 2m in an arbitrary two-dimensional domain (Russian), Ž. Vycîsl. Mat. i Mat. Fiz. 13, 1973, 1425–1440.

    MathSciNet  Google Scholar 

  5. G. Fix and K. Larsen, On the convergence of SOR iterations for finite element approximations to elliptic boundary value problems, SIAM J. Num. Anal. 8, 1971, 536–547.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. J. Ortega and W. Rheinboldt, Local and global convergence of generalized linear iterations, in Numerical Solution of Nonlinear Problems (J. Ortega, W. Rheinboldt, eds.), 122–143, Soc. f. Industrial & Appl. Math., Philadelphia, 1970.

    Google Scholar 

  7. P. R. Garabedian, Estimation of the relaxation factor for small mesh size, Math. Tables and Other Aids to Comp. (now Math. Comp.) 10, 1956, 183–185.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. L. Hageman and T. Porsching, Aspects of nonlinear block successive overrelaxation, SIAM J. Num. Anal., 1974, in press.

    Google Scholar 

  9. E. Schultchen and C. Kostem, Solution of linear equations by iterative methods in finite element analysis, Lehigh Univ., Fritz Eng Lab. Rep. 400. 10, February 1973.

    Google Scholar 

  10. W. Davidon, Variable metric methods for minimization, Argonne National Laboratories, AEC Res. and Devel. Rept. ANL-5990, 1959.

    Google Scholar 

  11. R. Fletcher and M. Powell, A rapidly convergent descent method for minimization, Computer J. 6, 1963, 163–168.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. C. Broyden, A class of methods for solving nonlinear simultaneous equations, Math. Comp. 19, 1965, 577–593.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. M. Powell, On the convergence of the variable-metric algorithm, J. Inst. Math. Appl. 7, 1971, 21–36.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. C. Broyden, J. Dennis, and J. Moré, On the local and superlinear convergence of quasi-Newton methods, J. Inst. Math. Appl. 12, 1973, 223–246.

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. W. Rheinboldt and J. Vandergraft, On the local convergence of update methods, SIAM J. Num. Anal., 1974, 11, 1974, 1069–1085.

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. J. Stoer, On the Convergence Behavior of Some Minimization Algorithms, Univ. Würzburg/Germany, Inst. f. Ang. Math., Manuscript, 1974.

    Google Scholar 

  17. L. Schubert, Modification of a quasi-Newton method for nonlinear equations with a sparse Jacobian, Math. Comp. 24, 1970, 27–30.

    CrossRef  MathSciNet  MATH  Google Scholar 

  18. C. Broyden, The convergence of an algorithm for solving sparse nonlinear systems, Math. Comp. 25, 1971, 285–294.

    CrossRef  MathSciNet  MATH  Google Scholar 

  19. V. Šamanskii, On a modification of the Newton method (Russian), Ukrain. Mat. Ž. 19, 1967, 133–138.

    MathSciNet  Google Scholar 

  20. W. Rheinboldt and C. Mesztenyi, Arc graphs and their possible application to sparse matrix problems, BIT 14, 1974, 227–239.

    CrossRef  MathSciNet  MATH  Google Scholar 

  21. W. Rheiboldt and C. Mesztenyi, Programs for the solution of large, sparse matrix problems based on the arc graph structure, Univ. of Maryland, Computer Science Center, Tech. Rep. TR-262, 1973.

    Google Scholar 

  22. F. Gustafson, W. Liniger, and R. Willoughby, Symbolic generations of an optimal Crout algorithm for sparse systems of linear equations, J. ACM 17, 1970, 87–104.

    CrossRef  MATH  Google Scholar 

  23. G. Hachtel, Vector and matrix variability type in sparse matrix algorithms, in Sparse Matrices and Their Applications (D. Rose, R. Willoughby, eds.), 53–64, Plenum Press, New York, 1972.

    CrossRef  Google Scholar 

  24. J. Traub, Computational complexity of iterative processes, SIAM. J. Comp. 1, 1972, 167–179.

    CrossRef  MathSciNet  MATH  Google Scholar 

  25. R. P. Brent, Some efficient algorithms for solving systems of nonlinear equations, SIAM J. Num. Anal. 10, 1973, 327–344.

    CrossRef  MathSciNet  MATH  Google Scholar 

  26. W. Rheinboldt, On measures of ill-conditioning for nonlinear equations, Univ. of Maryland, Computer Science Center, Tech. Rep. TR-330, 1974.

    Google Scholar 

  27. P. Purdom, Jr., A transitive closure algorithm, BIT 10, 1970, 76–94.

    CrossRef  MATH  Google Scholar 

  28. R. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comp. 1, 1972, 146–160.

    CrossRef  MathSciNet  MATH  Google Scholar 

  29. A. Dulmage and N. Mendelsohn, Two algorithms for bipartite graphs, SIAM J. Appl. Math. 11, 1963, 183–194.

    CrossRef  MathSciNet  MATH  Google Scholar 

  30. A. Kevorkian and J. Snoek, Decomposition in large scale systems theory and applications of structural analysis in partitioning, disjointing and constructing hierarchical systems, in Decomposition of Large Scale Problems (D. Himmelblau, ed.), 467–490, North Holland Publ. Co., Amsterdam/New York, 1973.

    Google Scholar 

  31. R. Bass, Structure, dimension reduction, and partial triangularization in sparse systems of equations, Office of Emergency Preparedness (OEP), Washington, D.C., Tech. Rept. 1972.

    Google Scholar 

  32. D. Steward, Partitioning and tearing systems of equations, SIAM J. Num. Anal. 2, 1965, 345–365.

    MathSciNet  MATH  Google Scholar 

  33. W. Ledet and D. Himmelblau, Decomposition procedures for the solving of large scale systems, Adv. Chem. Eng. 8, 1970, 185.

    CrossRef  Google Scholar 

  34. A. Westerberg and F. Edie, Computer-aided design, Part I, Chem. Eng. J. 2, 1971, 9; Part II, Chem. Eng. J. 2, 1971, 17.

    CrossRef  Google Scholar 

  35. A. Kevorkian and J. Snoek, Decomposition in large scale systems theory and applications in solving large sets of nonlinear simultaneous equations, in Decompositions of Large Scale Problems (D. Himmelblau, ed.), 491–516, North-Holland Publ. Co., Amsterdam/New York, 1973.

    Google Scholar 

  36. N. Nilsson, Problem Solving Methods in Artificial Intelligence, McGraw-Hill, New York, 1971.

    Google Scholar 

  37. K. M. Brown, Computer-oriented algorithms for solving systems of simultaneous nonlinear algebraic equations, in Numerical Solution of Systems of Nonlinear Algebraic Equations (G. Byrne, C. Hall, eds.), 281–348, Academic Press, New York, 1973.

    CrossRef  Google Scholar 

  38. K. Brown and J. Dennis, Derivative-free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximation, Num. Math., 18, 1972, 289–297.

    CrossRef  MathSciNet  MATH  Google Scholar 

  39. S. Schechter, On the choice of the relaxation parameter for nonlinear problems in Numerical Solution of Systems of Nonlinear Algebraic Equations (G. Byrne, C. Hall, eds.), 349–372, Academic Press, Inc., New York, 1973.

    CrossRef  Google Scholar 

  40. R. Fedorenko, A relaxation method for the solution of elliptic difference equations, Z. Vycîsl. Mat. i Mat. Fiz. 1, 1961, 922–127.

    MathSciNet  Google Scholar 

  41. N. S. Bakhavalov, On the convergence of a relaxation method with natural constraints on the elliptic operator, Ž. Vycîsl. Mat. i Mat. Fiz. 6, 1966, 861–885.

    MathSciNet  Google Scholar 

  42. A. Brandt, Multilevel adaptive technique (MLAT) for fast numerical solution of boundary value problems. Weizman Institute, Rehovoth, Israel, Appl. Math. Dept., Undated Technical Note.

    Google Scholar 

  43. L. Rall, Davidenko’s method for the solution of nonlinear operator equations, The Univ. of Wisconsin, MRC Tech. Rep. 948, October 1968.

    Google Scholar 

  44. E. Wasserstrom, Numerical solutions by the continuation method, SIAM Rev. 15, 1973, 89–119.

    CrossRef  MathSciNet  Google Scholar 

  45. P. Boggs, The solution of nonlinear systems of equations of A-stable integration techniques, SIAM J. Num. Anal. 8, 1971, 767–785.

    CrossRef  MathSciNet  MATH  Google Scholar 

  46. L. Bittner, Einigen kontinuierliche Analogien von Iterationsverfahren, in “Funktionalanalysis, Approximationstheorie, Numerische Mathematik”, ISM 7, 114–135, Birkhäuser Verlag, Basel, 1967.

    CrossRef  Google Scholar 

  47. W. Kizner, A numerical method for finding solutions of nonlinear equations, SIAM J. Appl. Math. 12, 1964, 424–428.

    CrossRef  MathSciNet  MATH  Google Scholar 

  48. R. Burlirsch and J. Stoer, Numerical treatment of ordinary differential equations by extrapolation methods, Num. Math. 8, 1966, 1–13.

    CrossRef  MathSciNet  MATH  Google Scholar 

  49. C. Gear, Numerical Initial Value Problems in Ordinary Differential Equations, Prentice-Hall, Englewood Cliffs, N. J., 1971.

    MATH  Google Scholar 

  50. T. Hull, W. Enright, B. Fellers, and A. Sedgwick, Comparing numerical methods for ordinary differential equations, SIAM J. Num. Anal. 9, 1972, 603–637.

    CrossRef  MathSciNet  MATH  Google Scholar 

  51. F. Krogh, Algorithms for changing the step size, SIAM J. Num. Anal. 10, 1973, 949–965.

    CrossRef  MathSciNet  MATH  Google Scholar 

  52. J. McHugh and V. Basili, SIMPL-R and its application to large, sparse matrix problems, University of Maryland, Computer Science Center, Tech. Rep. TR-310, 1974.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1975 Springer-Verlag

About this paper

Cite this paper

Rheinboldt, W.C. (1975). On the solution of large, sparse sets of nonlinear equations. In: Oden, J.T. (eds) Computational Mechanics. Lecture Notes in Mathematics, vol 461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0074154

Download citation

  • DOI: https://doi.org/10.1007/BFb0074154

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07169-3

  • Online ISBN: 978-3-540-37503-6

  • eBook Packages: Springer Book Archive