Abstract
We introduce a boundary penalization technique to improve the spectral approximation of isogeometric analysis (IGA). The method removes the outliers appearing in the high-frequency region of the approximate spectrum when using the Cp−1,p-th (p≥3) order isogeometric elements. We focus on the classical Laplacian (Dirichlet) eigenvalue problem in 1D to illustrate the idea and then use the tensor-product structure to generate the stiffness and mass matrices for multidimensional problems. To remove the outliers, we penalize the higher-order derivatives from both the solution and test spaces at the domain boundary. Intuitively, we construct a better approximation by weakly imposing features of the exact solution. Effectively, we add terms to the variational formulation at the boundaries with minimal extra-computational cost. We then generalize the idea to remove the outliers for the isogeometric analysis of the Neumann eigenvalue problem (for p≥2). The boundary penalization does not change the test and solution spaces. In the limiting case, when the penalty goes to infinity, we perform the dispersion analysis of C2 cubic elements for the Dirichlet eigenvalue problem and C1 quadratic elements for the Neumann eigenvalue problem. We obtain the analytical eigenpairs for the resulting matrix eigenvalue problems. Numerical experiments show optimal convergence rates for the eigenvalues and eigenfunctions of the discrete operator.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Computer Methods in Applied Mechanics and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.