Improved quasi-Newton methods for large nonlinear problems

δείτε την πρωτότυπη σελίδα τεκμηρίου
στον ιστότοπο του αποθετηρίου του φορέα για περισσότερες πληροφορίες και για να δείτε όλα τα ψηφιακά αρχεία του τεκμηρίου*
κοινοποιήστε το τεκμήριο

Improved quasi-Newton methods for large nonlinear problems (EN)

Balopoulos, Victor (EN)
Papadrakakis, Manolis (EN)

N/A (EN)

In this work, schemes based on limited-memory quasi-Newton methods are investigated, as applied to solving large systems of nonlinear equations with sparse symmetric Jacobian matrices. Problems in mechanis typically give rise to such systems when the method of finite elements is employed to solve them. An attempt is made to develop algorithms that take advantage of sparsity and can effectively use a variable amount of storage according to the availability. The use of preconditioning matrices as initial approximations to the tangent stiffness matrix is suggested in order to accelerate convergence when the available high-speed storage exceeds the needs of purely vectorial methods but is not sufficient to house a full factorization of the tangent stiffness. The limited-memory quasi-Newton methods are also combined with the concept of truncation, based on a preconditioned conjugate gradient iterative solver of the linearized equations, to produce quite efficient algorithms. (EN)


quasi-newton method (EN)
Computer Programming--Algorithms (EN)
Preconditioning Matrices (EN)
Structural Analysis (EN)
Mathematical Techniques--Nonlinear Equations (EN)
Mechanics--Computer Aided Analysis (EN)
Structural Mechanics (EN)
Nonlinear Problem (EN)
Truncation (EN)
Mathematical Programming, Nonlinear (EN)
Sparse Symmetric Jacobean Matrices (EN)
Limited Memory Quasi Newton Methods (EN)
Tangent Stiffness Matrices (EN)

Εθνικό Μετσόβιο Πολυτεχνείο (EL)
National Technical University of Athens (EN)

Journal of Engineering Mechanics (EN)



*Η εύρυθμη και αδιάλειπτη λειτουργία των διαδικτυακών διευθύνσεων των συλλογών (ψηφιακό αρχείο, καρτέλα τεκμηρίου στο αποθετήριο) είναι αποκλειστική ευθύνη των αντίστοιχων Φορέων περιεχομένου.