Searcharxiv⌕ Search

arXiv subjects

Ada Šadl Praprotnik

Publications and source records attributed to Ada Šadl Praprotnik.

3 recordsLinked to original sources

A representation and comparison of three cubic macro-elements

The paper is concerned with three types of cubic splines over a triangulation that are characterized by three degrees of freedom associated with each vertex of the triangulation. The splines differ in computational complexity, polynomial reproduction properties, and smoothness. With the aim to make them a versatile tool for numerical analysis, a unified representation in terms of locally supported basis functions is established. The construction of these functions is based on geometric concepts and is expressed in the Bernstein--Bézier form. They are readily applicable in a range of standard approximation methods, which is demonstrated by a number of numerical experiments.

math.NA↗

Isogeometric analysis with $C^1$ cubic Powell-Sabin splines

In this paper, we consider $C^1$ cubic Powell-Sabin splines for the numerical solution of boundary value problems on planar and spatial surface domains. We first review the construction and basic properties of polynomial and rational $C^1$ cubic Powell-Sabin spline representations on unstructured triangulations. Then, we discuss how these flexible representations can be exploited to create geometry mappings suited for a precise description of (classes of) surface domains. This is illustrated with several examples. Finally, the obtained domain descriptions are utilized in the isogeometric analysis framework for solving various Poisson and biharmonic problems. It is demonstrated that $C^1$ cubic Powell-Sabin splines form a powerful alternative to $C^0$ cubic Lagrange elements and bicubic NURBS.

math.NA↗

Optimal one-sided approximants of circular arc

The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants interpolating boundary points is assumed. However, the study of approximants, which additionally interpolate corresponding tangent directions and curvatures at the boundary of an arc, is also considered. Several low-degree polynomial approximants are studied in detail. When several solutions fulfilling the interpolation conditions exist, the optimal one is characterized, and a numerical algorithm for its construction is suggested. Theoretical results are demonstrated with several numerical examples and a comparison with general (i.e. non-one-sided) approximants are provided.

math.NA↗