A Framework For Studying The RKEM Representation of Discrete Point Sets

DOI10.1007/978-3-540-79994-8_17zbMath1158.65312OpenAlexW97349020WikidataQ58878407 ScholiaQ58878407MaRDI QIDQ3601911

Nathan Collier, Mario J. Juha, Daniel Craig jun. Simkins

Publication date: 12 February 2009

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79994-8_17

zbMATH Keywords

inverse problemfinite element analysisreproducing kernelgraphical examples

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Reproducing kernel element method. I: Theoretical formulation
• Reproducing kernel element method. II: Globally conforming \(I^m/C^n\) hierarchies
• Reproducing kernel element method. III: Generalized enrichment and applications
• Reproducing kernel element method. IV: Globally compatible \(C^n\) (\(n\geqslant 1\)) triangular hierarchy
• Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
• Geometry representation, modification and iterative design using RKEM
• Unnamed Item
• Unnamed Item