An explicit-implicit projection approach for solving saddle-point systems arising from parameter identification problems. (1st July 2018)

• Record Type: Journal Article
• Authors: Nifa, Naoufal; Aubry, Denis; Corus, Mathieu
• Is Part Of: Computers & structures. Volume 203(2018)
• Page Start: 1
• Page End: 17
• Publication Date: 2018-07-01
• Subjects: Constrained optimization -- Saddle point systems -- Block preconditioners -- Inverse problems; Structural engineering -- Data processing -- Periodicals; Electronic data processing -- Structures, Theory of -- Periodicals; 624.171
• DOI: 10.1016/j.compstruc.2018.05.004
• Languages: English
• ISSNs: 0045-7949

Abstract

Highlights: Iterative method to solve symmetric saddle-point systems in identification problems. Class of efficient constraint preconditioners on large-scale industrial applications. Proposing a new physical based approximation of the Schur complement block. Abstract: This paper proposes a new approach to solve sparse linear saddle-point systems arising in large scale parameter estimation approach using energy functionals. The constraints of those systems involve kinematic constraints and sensors ones. The approach is based on a double projection of the generated saddle point system onto the nullspace of the constraints. The first projection onto the kinematic constraints is proposed as an explicit process through the computation of a sparse null basis. Then, we detail the application of a constraint preconditioner within a Krylov subspace solver, as an implicit second projection of the system onto the nullspace of the sensors constraints. We further present and compare approximations of the constraint preconditioner. The approach is implemented in a parallel distributed environment. Significant gains in computational cost and memory are illustrated on several industrial applications in comparison to direct solvers.