Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Some estimates for h-p-k-refinement in isogeometric analysis
 
research article

Some estimates for h-p-k-refinement in isogeometric analysis

Beirão da Veiga, Lourenço
•
Buffa, Annalisa  
•
Rivas, J.
Show more
2011
Numerische Mathematik

In this paper, we propose a theoretical study of the approximation properties of NURBS spaces, which are used in Isogeometric Analysis. We obtain error estimates that are explicit in terms of the mesh-size h, the degree p and the global regularity, measured by the parameter k. Our approach covers the approximation with global regularity from C0 up to Ck-1, with 2k - 1 ≤ p. Notice that the interesting case of higher regularity, up to k = p, is still open. However, our results give an indication of the role of the smoothness k in the approximation properties, and offer a first mathematical justification of the potential of Isogeometric Analysis based on globally smooth NURBS. © 2010 Springer-Verlag.

  • Details
  • Metrics
Type
research article
DOI
10.1007/s00211-010-0338-z
Author(s)
Beirão da Veiga, Lourenço
Buffa, Annalisa  
Rivas, J.
Sangalli, G.
Date Issued

2011

Publisher

Springer

Published in
Numerische Mathematik
Volume

118

Issue

2

Start page

271

End page

305

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
MNS  
Available on Infoscience
April 3, 2017
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/136252
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés