Refined isogeometric analysis for generalized Hermitian eigenproblems

DOI10.1016/J.CMA.2021.113823MaRDI QIDQ2236976zbMATH OpenOpenAlexFDO

Authors Ali Hashemian, David Pardo, Victor M. Calo

Publication date 26 October 2021

Published in Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2009.08167, http://hdl.handle.net/20.500.11824/1277

generalized Hermitian eigenproblem Lanczos eigensolver refined isogeometric analysis shift-and-invert approach spectral transformation

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation using splines (65D07) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)

Abstract: We use the refined isogeometric analysis (rIGA) to solve generalized Hermitian eigenproblems

(K u = l a m b d a M u)

. The rIGA framework conserves the desirable properties of maximum-continuity isogeometric analysis (IGA) discretizations while reducing the computation cost of the solution through partitioning the computational domain by adding zero-continuity basis functions. As a result, rIGA enriches the approximation space and decreases the interconnection between degrees of freedom. We compare computational costs of rIGA versus those of IGA when employing a Lanczos eigensolver with a shift-and-invert spectral transformation. When all eigenpairs within a given interval

[l a m b d a_{s}, l a m b d a_{e}]

are of interest, we select several shifts

s i g m a_{k} i n [l a m b d a_{s}, l a m b d a_{e}]

using a spectrum slicing technique. For each shift

s i g m a_{k}

, the cost of factorization of the spectral transformation matrix

K - s i g m a_{k} M

drives the total computational cost of the eigensolution. Several multiplications of the operator matrices

(K - s i g m a_{k} M)^{- 1} M

by vectors follow this factorization. Let

p

be the polynomial degree of basis functions and assume that IGA has maximum continuity of

p - 1

, while rIGA introduces

C^{0}

separators to minimize the factorization cost. For this setup, our theoretical estimates predict computational savings to compute a fixed number of eigenpairs of up to

O (p^{2})

in the asymptotic regime, that is, large problem sizes. Yet, our numerical tests show that for moderately-sized eigenproblems, the total computational cost reduction is

O (p)

. Nevertheless, rIGA improves the accuracy of every eigenpair of the first

N_{0}

eigenvalues and eigenfunctions. Here, we allow

N_{0}

to be as large as the total number of eigenmodes of the original maximum-continuity IGA discretization.

Recommendations

Cites work

Cited in

(6)

Describes a project that uses

Uses Software

This page was built for publication: Refined isogeometric analysis for generalized Hermitian eigenproblems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2236976)