Show simple item record

dc.contributor.authorMönkölä, Sanna
dc.contributor.authorHeikkola, Erkki
dc.contributor.authorPennanen, Anssi
dc.contributor.authorRossi, Tuomo
dc.date.accessioned2012-10-11T11:02:30Z
dc.date.available2012-10-11T11:02:30Z
dc.date.issued2008
dc.identifier.citationMönkölä, S., Heikkola, E., Pennanen, A., & Rossi, T. (2008). Time-harmonic elasticity with controllability and higher-order discretization methods. <i>Journal of Computational Physics</i>, <i>227</i>(11), 5513-5534. <a href="https://doi.org/10.1016/j.jcp.2008.01.054" target="_blank">https://doi.org/10.1016/j.jcp.2008.01.054</a>
dc.identifier.otherCONVID_17661265
dc.identifier.urihttps://jyx.jyu.fi/handle/123456789/39960
dc.description.abstractThe time-harmonic solution of the linear elastic wave equation is needed for a variety of applications. The typical procedure for solving the time-harmonic elastic wave equation leads to difficulties solving large-scale indefinite linear systems. To avoid these difficulties, we consider the original time dependent equation with a method based on an exact controllability formulation. The main idea of this approach is to find initial conditions such that after one time-period, the solution and its time derivative coincide with the initial conditions.The wave equation is discretized in the space domain with spectral elements. The degrees of freedom associated with the basis functions are situated at the Gauss–Lobatto quadrature points of the elements, and the Gauss–Lobatto quadrature rule is used so that the mass matrix becomes diagonal. This method is combined with the second-order central finite difference or the fourth-order Runge–Kutta time discretization. As a consequence of these choices, only matrix–vector products are needed in time dependent simulation. This makes the controllability method computationally efficient.fi
dc.language.isoeng
dc.publisherElsevier
dc.relation.ispartofseriesJournal of Computational Physics
dc.titleTime-harmonic elasticity with controllability and higher-order discretization methods
dc.typeresearch article
dc.identifier.urnURN:NBN:fi:jyu-201210102636
dc.contributor.laitosTietotekniikan laitosfi
dc.contributor.laitosDepartment of Mathematical Information Technologyen
dc.type.urihttp://purl.org/eprint/type/JournalArticle
dc.date.updated2012-10-10T03:30:07Z
dc.type.coarhttp://purl.org/coar/resource_type/c_2df8fbb1
dc.description.reviewstatuspeerReviewed
dc.format.pagerange5513-5534
dc.relation.issn0021-9991
dc.relation.numberinseries11
dc.relation.volume227
dc.type.versionacceptedVersion
dc.rights.copyright© Elsevier. This is an author's final draft version of an article whose final and definitive form has been published by Elsevier.
dc.rights.accesslevelopenAccessfi
dc.type.publicationarticle
dc.relation.doi10.1016/j.jcp.2008.01.054
dc.type.okmA1


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record