Recent developments in spectral stochastic methods for the numerical solution of stochastic partial differential equations
A Nouy - Archives of Computational Methods in Engineering, 2009 - Springer
Uncertainty quantification appears today as a crucial point in numerous branches of science
and engineering. In the last two decades, a growing interest has been devoted to a new …
and engineering. In the last two decades, a growing interest has been devoted to a new …
A priori hyperreduction method: an adaptive approach
D Ryckelynck - Journal of computational physics, 2005 - Elsevier
Model reduction methods are usually based on preliminary computations to build the shape
function of the reduced order model (ROM) before the computation of the reduced state …
function of the reduced order model (ROM) before the computation of the reduced state …
Recycling Krylov subspaces for sequences of linear systems
Many problems in science and engineering require the solution of a long sequence of slowly
changing linear systems. We propose and analyze two methods that significantly reduce the …
changing linear systems. We propose and analyze two methods that significantly reduce the …
Non-overlapping domain decomposition methods in structural mechanics
P Gosselet, C Rey - Archives of computational methods in engineering, 2006 - Springer
The modern design of industrial structures leads to very complex simulations characterized
by nonlinearities, high heterogeneities, tortuous geometries... Whatever the modelization …
by nonlinearities, high heterogeneities, tortuous geometries... Whatever the modelization …
Bridging proper orthogonal decomposition methods and augmented Newton–Krylov algorithms: an adaptive model order reduction for highly nonlinear mechanical …
This article describes a bridge between POD-based model order reduction techniques and
the classical Newton/Krylov solvers. This bridge is used to derive an efficient algorithm to …
the classical Newton/Krylov solvers. This bridge is used to derive an efficient algorithm to …
A survey of subspace recycling iterative methods
This survey concerns subspace recycling methods, a popular class of iterative methods that
enable effective reuse of subspace information in order to speed up convergence and find …
enable effective reuse of subspace information in order to speed up convergence and find …
Local/global model order reduction strategy for the simulation of quasi‐brittle fracture
P Kerfriden, JC Passieux… - International Journal for …, 2012 - Wiley Online Library
This paper proposes a novel technique to reduce the computational burden associated with
the simulation of localized failure. The proposed methodology affords the simulation of …
the simulation of localized failure. The proposed methodology affords the simulation of …
Recycling subspace information for diffuse optical tomography
ME Kilmer, E De Sturler - SIAM Journal on Scientific Computing, 2006 - SIAM
We discuss the efficient solution of a long sequence of slowly varying linear systems arising
in computations for diffuse optical tomographic imaging. The reconstruction of three …
in computations for diffuse optical tomographic imaging. The reconstruction of three …
Accelerating design optimization using reduced order models
Although design optimization has shown its great power of automatizing the whole design
process and providing an optimal design, using sophisticated computational models, its …
process and providing an optimal design, using sophisticated computational models, its …
Nonlinear localization strategies for domain decomposition methods: Application to post-buckling analyses
In this paper, we explore the capabilities of some nonlinear strategies based on domain
decomposition for nonlinear analyses, and more particularly for post-buckling analyses of …
decomposition for nonlinear analyses, and more particularly for post-buckling analyses of …