Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userComputation and modeling in piecewise Chebyshevian spline spaces
106
0
0.0
(
0
)
Added by
Carolina Beccari
Publication date
2016
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
A piecewise Chebyshevian spline space is good for design when it possesses a B-spline basis and this property is preserved under arbitrary knot insertion. The interest in piecewise Chebyshevian spline spaces that are good for design is justified by the fact that, similarly as for polynomial splines, the related parametric curves exhibit the desired properties of convex hull inclusion, variation diminution and intuitive relation between the curve shape and the location of the control points. For all good-for-design spaces, in this paper we construct a set of functions, called transition functions, which allow for efficient computation of the B-spline basis, even in the case of nonuniform and multiple knots. Moreover, we show how the spline coefficients of the representations associated with a refined knot partition and with a raised order can conveniently be expressed by means of transition functions. This result allows us to provide effective procedures that generalize the classical knot insertion and degree raising algorithms for polynomial splines. To illustrate the benefits of the proposed computational approaches, we provide several examples dealing with different types of piecewise Chebyshevian spline spaces that are good for design.
rate research
Read More
A standard construction in approximation theory is mesh refinement. For a simplicial or polyhedral mesh D in R^k, we study the subdivision D obtained by subdividing a maximal cell of D. We give sufficient conditions for the module of splines on D to split as the direct sum of splines on D and splines on the subdivided cell. As a consequence, we obtain dimension formulas and explicit bases for several commonly used subdivisions and their multivariate generalizations.
For a planar simplicial complex Delta contained in R^2, Schumaker proved that a lower bound on the dimension of the space C^r_k(Delta) of planar splines of smoothness r and polynomial degree at most k on Delta is given by a polynomial P_Delta(r,k), and Alfeld-Schumaker showed this polynomial gives the correct dimension when k >= 4r+1. Examples due to Morgan-Scott, Tohaneanu, and Yuan show that the equality dim C^r_k(Delta) = P_Delta(r,k) can fail when k = 2r or 2r+1. We prove that the equality dim C^r_k(Delta)= P_Delta(r,k) cannot hold in general for k <= (22r+7)/10.
The purpose of the present paper is to compare two semi-Lagrangian methods in the context of the four-dimensional Vlasov--Poisson equation. More specifically, our goal is to compare the performance of the more recently developed semi-Lagrangian discontinuous Galerkin scheme with the de facto standard in Eulerian Vlasov simulation (i.e. using cubic spline interpolation). To that end, we perform simulations for nonlinear Landau damping and a two-stream instability and provide benchmarks for the SeLaLib and sldg codes (both on a workstation and using MPI on a cluster). We find that the semi-Lagrangian discontinuous Galerkin scheme shows a moderate improvement in run time for nonlinear Landau damping and a substantial improvement for the two-stream instability. It should be emphasized that these results are markedly different from results obtained in the asymptotic regime (which favor spline interpolation). Thus, we conclude that the traditional approach of evaluating numerical methods is misleading, even for short time simulations. In addition, the absence of any All-to-All communication in the semi-Lagrangian discontinuous Galerkin method gives it a decisive advantage for scaling to more than 256 cores.
Let $A$ be a real $ntimes n$ matrix and $z,bin mathbb R^n$. The piecewise linear equation system $z-Avert zvert = b$ is called an textit{absolute value equation}. We consider two solvers for this problem, one direct, one semi-iterative, and extend their previously known ranges of convergence.
We introduce conservative integrators for long term integration of piecewise smooth systems with transversal dynamics and piecewise smooth conserved quantities. In essence, for a piecewise dynamical system with piecewise defined conserved quantities such that its trajectories cross transversally to its interface, we combine Mannshardts transition scheme and the Discrete Multiplier Method to obtain conservative integrators capable of preserving conserved quantities up to machine precision and accuracy order. We prove that the order of accuracy of the integrators is preserved after crossing the discontinuity in the case of codimension one number of conserved quantities. Numerical examples illustrate the preservation of accuracy order.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
