Quasi-Newton algorithms for large scale nonlinear systems
| dc.contributor.author | VandenBrink, Dennis Jay | en |
| dc.contributor.department | Engineering Mechanics | en |
| dc.date.accessioned | 2020-12-14T17:36:04Z | en |
| dc.date.available | 2020-12-14T17:36:04Z | en |
| dc.date.issued | 1983 | en |
| dc.description.abstract | In this work, an evaluation of a number of quasi-Newton algorithms and strategies for sparse, symmetric Hessian matrices was performed. It was shown how these quasi-Newton algorithms could be applied to the unconstrained minimization of a nonlinear function as well as a nonlinear least squares approach to solving a system of nonlinear equations. The best of these algorithms were evaluated for a problem with a fairly large number of degrees of freedom with a large load increment. From this study it is concluded that the proposed quasi-Newton method with the double dogleg strategy and an automatic control on Hessian evaluations is the best algorithm for all of the problems considered in this investigation. The algorithm had no difficulty converging to solutions regardless of the size of the model and regardless of the size of the load or time step. The advantage of being able to take large load or time steps may lie in those problems which involve the location of critical points (limit or bifurcation points) of structures with minimal computational effort. All the algorithms which utilized the double dogleg strategy were consistently better able to converge to the solution - a clear validation of the globally convergent property of the double dogleg strategy. Finally, the usefulness of the double dogleg strategy in solving a system of nonlinear equations via the nonlinear least squares approach and in locating multiple equilibrium configurations using deflation speaks for the versatility of the proposed algorithm. In conclusion, the quasi-Newton algorithm proposed in this dissertation is both robust and efficient for small as well as large scale problems of matrices are exploited. Because sparsity and symmetry the algorithm does not place unreasonable demands on core storage requirements. Furthermore, using the deflation technique with tunneling the algorithm can be extremely useful for post-buckling response studies of structures involving many stable and unstable branches. | en |
| dc.description.degree | Ph. D. | en |
| dc.format.extent | x, 162 leaves | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.uri | http://hdl.handle.net/10919/101299 | en |
| dc.language.iso | en | en |
| dc.publisher | Virginia Polytechnic Institute and State University | en |
| dc.relation.isformatof | OCLC# 11035297 | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject.lcc | LD5655.V856 1983.V352 | en |
| dc.subject.lcsh | Algorithms | en |
| dc.subject.lcsh | Nonlinear programming | en |
| dc.title | Quasi-Newton algorithms for large scale nonlinear systems | en |
| dc.type | Dissertation | en |
| dc.type.dcmitype | Text | en |
| thesis.degree.discipline | Engineering Mechanics | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | doctoral | en |
| thesis.degree.name | Ph. D. | en |
Files
Original bundle
1 - 1 of 1