Abstract
This article presents a space-time adaptive strategy for transient elastodynamics. The method aims at computing an optimal space-time discretization such that the computed solution has an error in the quantity of interest below a user-defined tolerance. The methodology is based on a goal-oriented error estimate that requires accounting for an auxiliary adjoint problem. The major novelty of this paper is using modal analysis to obtain a proper approximation of the adjoint solution. The idea of using a modal-based description was introduced in a previous work for error estimation purposes. Here this approach is used for the first time in the context of adaptivity. With respect to the standard direct time-integration methods, the modal solution of the adjoint problem is highly competitive in terms of computational effort and memory requirements. The performance of the proposed strategy is tested in two numerical examples. The two examples are selected to be representative of different wave propagation phenomena, one being a 2D bulky continuum and the second a 2D domain representing a structural frame.
Similar content being viewed by others
References
Babuska I, Rheinboldt WC (1978) Error estimates for adaptive finite element computations. SIAM J Numer Anal 18:736–754
Bangerth W, Geiger M, Rannacher R (2010) Adaptive Galerkin finite element methods for the wave equation. Comput Methods Appl Math 1:3–48
Bangerth W, Rannacher R (1999) Finite element approximation of the acoustic wave equation: error control and mesh adaptation. East-West J Numer Math 7:263–282
Bangerth W, Rannacher R (2001) Adaptive finite element techniques for the acoustic wave equation. J Comput Acoust 9:575–591
Carey V, Estep D, Johansson A, Larson M, Tavener S (2010) Blockwise adaptivity for time dependent problems based on coarse scale adjoint solutions. SIAM J Sci Comput 32:2121–2145
Casadei F, Díez P, Verdugo F (2013) An algorithm for mesh refinement and un-refinement in fast transient dynamics. Int J Comput Methods 10:1–31
Cirak F, Ramm E (1998) A posteriori error estimation and adaptivity for linear elasticity using the reciprocal theorem. Comput Methods Appl Mech Eng 156:351–362
Demkowicz L, Oden JT, Rachowicz W, Hardy O (1989) Toward a universal h–p adaptive finite element strategy, part 1. Constrained approximation and data structure. Comput Methods Appl Mech Eng 77:79–112
Díez P, Calderón G (2007) Remeshing criteria and proper error representations for goal oriented h-adaptivity. Comput Methods Appl Mech Eng 196:719–733
Eriksson K, Estep D, Hansbo P, Johnson C (1996) Computational differential equations. Studentlitteratur, Lund
Fuentes D, Littlefield D, Oden JT, Prudhomme S (2006) Extensions of goal-oriented error estimation methods to simulation of highly-nonlinear response of shock-loaded elastomer-reinforcedstructures. Comput Methods Appl Mech Eng 195:4659–4680
Hughes TJR, Hulbert GM (1988) Space–time finite element methods for elastodynamics: formulations and error estimates. Comput Methods Appl Mech Eng 66:339–363
Hulbert GM, Hughes TJR (1990) Space–time finite element methods for second-order hypeerbolic equations. Comput Methods Appl Mech Eng 84:327–348
Johnson C (1993) Discontinuous galerkin finite element methods for second order hyperbolic problems. Comput Methods Appl Mech Eng 107:117–129
Ladevèze P, Leguillon D (1983) Error estimate procedure in the finite element method. SIAM J Numer Anal 20:485–509
Larsson F, Hansbo P, Runesson K (2002) Strategies for computing goal-oriented a posteriori error measures in non-linear elasticity. Int J Numer Meth Eng 55:879–894
Meyer A (2009) Error estimators and the adaptive finite element method on large strain deformation problems. Math Methods Appl Sci 32:2148–2159
Nithiarasu P, Zienkiewicz OC (2000) Adaptive mesh generation for fluid mechanics problems. Int J Numer Meth Eng 47:629–662
Oden JT, Prudhomme S (2001) Goal-oriented error estimation and adaptivity for the finite element method. Comput Math Appl 41:735–765
Paraschivoiu M, Peraire J, Patera AT (1997) A posteriori finite element bounds for linear-functional outputs of elliptic partial differential equations. Comput Methods Appl Mech Eng 150:289–321
Parés N, Bonet J, Huerta A, Peraire J (2006) The computation of bounds for linear-functional outputs of weak solutions to the two-dimensional elasicity equations. Comput Methods Appl Mech Eng 195:406–429
Parés N, Díez P, Huerta A (2006) A subdomain-based flux-free a posteriori error estimators. Comput Methods Appl Mech Eng 195:297–323
Parés N, Díez P, Huerta A (2008) Bounds of functional outputs for parabolic problems. Part I: exact bounds of the discontinuous galerkin time discretization. Comput Methods Appl Mech Eng 197:1641–1660
Parés N, Díez P, Huerta A (2008) Bounds of functional outputs for parabolic problems. Part II: bounds of the exact solution. Comput Methods Appl Mech Eng 197:1661–1679
Parés N, Díez P, Huerta A (2009) Exact bounds of the advection-diffusion-reaction equation using flux-free error estimates. SIAM J Sci Comput 31:3064–3089
Parés N, Díez P, Huerta A (2013) Computable exact bounds for linear outputs from stabilized solutions of the advection-diffusion-reaction equation. Int J Numer Methods Eng 93:483–509
Peraire J, Vahdati M, Morgan K, Zienkiewicz OC (1987) Adaptive remeshing for flow computations. J Comp Phys 72:449–466
Prudhomme S, Oden JT (1999) On goal-oriented error estimation for elliptic problems: application to the control of pointwise errors. Comput Methods Appl Mech Eng 176:313–331
Rannacher R, Stuttmeier FT (1997) A feed-back approach to error control in finite element methods: application to linear elasticity. Comput Mech 19:434–446
Verdugo F, Parés N, Díez P (2013) Modal based goal-oriented error assessment for timeline-dependent quantities in transient dynamics. Int J Numer Method Eng 95:685–720
Yerry MA, Shephard MS (1983) A modified quadtree approach to finite element mesh generation. IEEE Comput Graph Appl 3:34–46
Zienkiewicz OC, Zhu JZ (1987) A simple error estimator and adaptative procedure for practical engineering analysis. Int J Numer Method Eng 24:337–357
Acknowledgments
Partially supported by Ministerio de Educación y Ciencia, Grant DPI2011-27778-C02-02 and Universitat Poli-tècnica de Catalunya (UPC-BarcelonaTech), Grant UPC-FPU.
Author information
Authors and Affiliations
Corresponding author
Linear system to be solved at each time step
Linear system to be solved at each time step
This appendix details how the time-continuous Galerkin approximation is computed when the space mesh changes between times slabs.
Recall that the numerical approximation \(\tilde{\mathbf{U}}\) solution of the discrete problem (5) is computed sequentially starting from the first time slab \(I_1\) until the last one \(I_N\). Specifically, assuming that the solution at the time-slab \(I_{n-1}\) is known, the approximation \(\tilde{\mathbf{U}}\) restricted to the slab \(I_n\) is found solving the problem: find \(\tilde{\mathbf{U}}|_{I_n}\in \varvec{\mathcal {W}}^{H,\Delta t}_u|_{I_n}\times \varvec{\mathcal {W}}^{H,\Delta t}_v|_{I_n}\) such that
where, for \(n>1\), \(\tilde{\mathbf{U}}(t_{n-1})\) is the solution at the end of the previous interval \(I_{n-1}\) and, for \(n=1\), \(\tilde{\mathbf{U}}(t_{n-1}=t_0)\) is defined using the initial conditions, \(\tilde{\mathbf{U}}(t_0)=[\mathbf{u}_0,\mathbf{v}_0]\).
From the definition of the discrete spaces \(\varvec{\mathcal {W}}^{H,\Delta t}_u\) and \(\varvec{\mathcal {W}}^{H,\Delta t}_v\), the numerical displacements and velocities \(\tilde{\mathbf{u}}_u\) and \(\tilde{\mathbf{u}}_v\) inside the interval \(I_n\) are expressed as a combination of the values at times \(t_{n-1}\) and \(t_n\), namely
Thus, using the initial conditions for the interval (33c), the values \(\tilde{\mathbf{u}}_u(t_{n-1})\) and \(\tilde{\mathbf{u}}_v(t_{n-1}) \in \varvec{\mathcal {V}}_0^{H}(\mathcal {P}_{n-1})mu\) are known and the only unknowns to be determined are \(\tilde{\mathbf{u}}_u(t_{n})\) and \(\tilde{\mathbf{u}}_v(t_{n}) \in \varvec{\mathcal {V}}_0^{H}(\mathcal {P}_n)\). These unknowns are found inserting the representation(34) in equation (33) and noting that the following properties of the time-shape functions hold,
Specifically, \([\tilde{\mathbf{u}}_u(t_n),\tilde{\mathbf{u}}_v(t_n)]\in \varvec{\mathcal {V}}_0^{H}(\mathcal {P}_n)\times \varvec{\mathcal {V}}_0^{H}(\mathcal {P}_n)\) is such that
and
where
Note that since the values \(\tilde{\mathbf{u}}_u(t_{n-1})\) and \(\tilde{\mathbf{u}}_v(t_{n-1})\) are known, the terms associated with this values are placed in the right hand side of the equations.
The computation of the terms appearing in the left hand side of (35) entails no difficulty since all the spatial functions belong to \(\varvec{\mathcal {V}}_0^{H}(\mathcal {P}_n)\). On the contrary, if different spatial computational meshes are used at times \(t_{n-1}\) and \(t_n\), the computation of the nodal force vectors associated with \(l_{u,n}(\cdot )\) and \(l_{v,n}(\cdot )\) involves computing mass and energy products of functions defined in the mesh at time \(t_{n-1}\) and functions defined in the mesh at time \(t_{n}\), e.g. \(m(\tilde{\mathbf{u}}_v(t_{n-1}),\mathbf{w}_v)\).
The use of different spatial meshes is efficiently handled by solving the discrete problem (35) using the auxiliary union mesh \(\mathcal {P}_{n-1,n}\) containing in each zone of the domain the finer elements either in \(\mathcal {P}_{n-1}\) or \(\mathcal {P}_{n}\), see Fig. 18, namely
Note that, any function belonging either to \(\varvec{\mathcal {V}}_0^{H}(\mathcal {P}_{n-1})\) or \(\varvec{\mathcal {V}}_0^{H}(\mathcal {P}_n)\) can be represented in the finite element space associated to \(\mathcal {P}_{n-1,n}\), namely \(\varvec{\mathcal {V}}^H_0(\mathcal {P}_{n-1,n})\), without lose of information. Thus, the products involving functions in different meshes are efficiently computed after projecting the functions in the space \(\varvec{\mathcal {V}}^H_0(\mathcal {P}_{n-1,n})\). However, discretizing problem (35) using the mesh \(\mathcal {P}_{n-1,n}\) requires introducing additional constrains to enforce that the computed fields \(\tilde{\mathbf{u}}_u(t_n)\) and \(\tilde{\mathbf{u}}_v(t_n)\) belong to \(\varvec{\mathcal {V}}_0^{H}(\mathcal {P}_n)\) and not to \(\varvec{\mathcal {V}}^H_0(\mathcal {P}_{n-1,n})\). That is, problem (35) leads to the following system of equations when discretized in the auxiliary finite element mesh \(\mathcal {P}_{n-1,n}\):
where
and \(\mathbf{C}_n := a_1 \mathbf{M}_n + a_2\mathbf{K}_n\). The matrices \(\mathbf{M}_n\) and \(\mathbf{K}_n\) and the vector \(\mathbf{F}(t)\) are the discrete counterparts of the bilinear forms \(m(\cdot ,\cdot )\) and \(a(\cdot ,\cdot )\) and the linear form \(l(t;\cdot )\) in the space \(\varvec{\mathcal {V}}^H_0(\mathcal {P}_{n-1,n})\) and the vectors \(\mathbf{U}_{u,n}\), \(\mathbf{U}_{v,n}\), \(\mathbf{U}_{u,n-1}\) and \(\mathbf{U}_{v,n-1}\) contain the degrees of freedom of functions \(\tilde{\mathbf{u}}_u(t_n)\), \(\tilde{\mathbf{u}}_v(t_n)\), \(\tilde{\mathbf{u}}_u(t_{n-1})\) and \(\tilde{\mathbf{u}}_v(t_{n-1})\) expressed in the discrete space \(\varvec{\mathcal {V}}^H_0(\mathcal {P}_{n-1,n})\). Note that the linear constrains \(\mathbf{A}_n\mathbf{U}_{u,n}=\mathbf {0}\) and \(\mathbf{A}_n\mathbf{U}_{v,n}=\mathbf {0}\) are introduced in order to ensure that the computed fields \(\tilde{\mathbf{u}}_u(t_n)\) and \(\tilde{\mathbf{u}}_u(t_n)\) belong to \(\varvec{\mathcal {V}}_0^{H}(\mathcal {P}_n)\) and also to impose continuity of the solution at the hanging nodes, see Fig. 19. The vectors \(\varvec{\lambda }_{u,n}\) and \(\varvec{\lambda }_{v,n}\) are the associated Lagrange multipliers.
Note that system (36) is at the first sight of double size than the one associated with the Newmark method. However, system (36) can be rewritten in a more convenient way by subtracting to the second row of the matrix in (36) the first row multiplied by \(\frac{\Delta t_n}{2}\). That is,
This reformulation allows to compute the velocities separately from the displacements solving a system of the same size as the usual system arising in the Newmark method, namely,
with \(\varvec{\lambda }^*_n :=\varvec{\lambda }_{v,n} - \frac{\Delta t_n}{2}\varvec{\lambda }_{u,n}\). Once the velocities \( \mathbf{U}_{v,n}\) are known, the displacements are obtained solving the system
Rights and permissions
About this article
Cite this article
Verdugo, F., Parés, N. & Díez, P. Goal-oriented space-time adaptivity for transient dynamics using a modal description of the adjoint solution. Comput Mech 54, 331–352 (2014). https://doi.org/10.1007/s00466-014-0988-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00466-014-0988-2