Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

An efficient algorithm for bifurcation problems of variational inequalities
HTML articles powered by AMS MathViewer

by H. D. Mittelmann PDF
Math. Comp. 41 (1983), 473-485 Request permission

Abstract:

For a class of variational inequalities on a Hilbert space H bifurcating solutions exist and may be characterized as critical points of a functional with respect to the intersection of the level surfaces of another functional and a closed convex subset K of H. In a recent paper [13] we have used a gradient-projection type algorithm to obtain the solutions for discretizations of the variational inequalities. A related but Newton-based method is given here. Global and asymptotically quadratic convergence is proved. Numerical results show that it may be used very efficiently in following the bifurcating branches and that it compares favorably with several other algorithms. The method is also attractive for a class of nonlinear eigenvalue problems $(K = H)$ for which it reduces to a generalized Rayleigh-quotient iteration. So some results are included for the path following in turning-point problems.
References
Similar Articles
Additional Information
  • © Copyright 1983 American Mathematical Society
  • Journal: Math. Comp. 41 (1983), 473-485
  • MSC: Primary 65J15; Secondary 49A29, 49D37
  • DOI: https://doi.org/10.1090/S0025-5718-1983-0717697-7
  • MathSciNet review: 717697