skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Krylov subspace recycling for evolving structures

Journal Article · · Computer Methods in Applied Mechanics and Engineering

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

Research Organization:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA); Federal Ministry of Research and Education of Germany; National Science Foundation (NSF)
Grant/Contract Number:
NA0003525; 05M18PXA; 1720305
OSTI ID:
1882856
Report Number(s):
SAND2021-13502J; 701783
Journal Information:
Computer Methods in Applied Mechanics and Engineering, Vol. 391; ISSN 0045-7825
Publisher:
ElsevierCopyright Statement
Country of Publication:
United States
Language:
English

References (28)

Composite finite elements for problems containing small geometric details journal July 1997
A Deflated Version of the Conjugate Gradient Algorithm journal January 2000
Solution of Sparse Indefinite Systems of Linear Equations journal September 1975
Adaptive mesh refinement for hyperbolic partial differential equations journal March 1984
Recycling Krylov Subspaces for Sequences of Linear Systems journal January 2006
An arbitrary Lagrangian-Eulerian computing method for all flow speeds journal March 1974
A survey of subspace recycling iterative methods journal September 2020
Deflation of Conjugate Gradients with Applications to Boundary Value Problems journal April 1987
Krylov-Subspace Recycling via the POD-Augmented Conjugate-Gradient Method journal January 2016
A Flexible Generalized Conjugate Residual Method with Inner Orthogonalization and Deflated Restarting journal October 2011
Minimal Failure Probability for Ceramic Design Via Shape Control journal July 2014
Computing and Deflating Eigenvalues While Solving Multiple Right-Hand Side Linear Systems with an Application to Quantum Chromodynamics journal January 2010
Total and selective reuse of Krylov subspaces for the resolution of sequences of nonlinear structural problems journal December 2012
Efficient PDE Constrained Shape Optimization Based on Steklov--Poincaré-Type Metrics journal January 2016
Conjugate gradient method with preconditioning by projector journal January 1988
Deflated GMRES for systems with multiple shifts and multiple right-hand sides journal November 2008
Recycling Subspace Information for Diffuse Optical Tomography journal January 2006
Subspace recycling accelerates the parametric macro-modeling of MEMS journal March 2013
Large-scale topology optimization using preconditioned Krylov subspace methods with recycling
  • Wang, Shun; Sturler, Eric de; Paulino, Glaucio H.
  • International Journal for Numerical Methods in Engineering, Vol. 69, Issue 12 https://doi.org/10.1002/nme.1798
journal January 2007
Numerical shape optimization to decrease failure probability of ceramic structures journal July 2019
Accelerating the solution of linear systems appearing in two-phase reservoir simulation by the use of POD-based deflation methods journal June 2021
Block Krylov Recycling Algorithms for FETI-2LM Applied to 3-D Electromagnetic Wave Scattering and Radiation journal April 2017
Recycling BiCGSTAB with an Application to Parametric Model Order Reduction journal January 2015
Recycling Krylov subspaces for CFD applications and a new hybrid recycling solver journal December 2015
Approximate solutions and eigenvalue bounds from Krylov subspaces journal March 1995
Composite finite elements for the approximation of PDEs on domains with complicated micro-structures journal February 1997
Methods of conjugate gradients for solving linear systems journal December 1952
Recycling Krylov subspaces for efficient large-scale electrical impedance tomography journal December 2010