New algorithms and techniques for computing with geometrically continuous spline curves of arbitrary degree
Non-monotoneous parallel iteration for solving convex feasibility problems
The method of projections onto convex sets to find a point in the intersection of a finite number of closed convex sets in an Euclidean space, sometimes leads to slow convergence of the constructed sequence. Such slow convergence depends both on the choice of the starting point and on the monotoneous behaviour of the usual algorithms. As there is normally no indication of how to choose the starting point in order to avoid slow convergence, we present in this paper a non-monotoneous parallel algorithm...
Note on symmetric alteration of knots of B-spline curves.
Numerical solution of inverse spectral problems for Sturm-Liouville operators with discontinuous potentials
We consider Sturm-Liouville differential operators on a finite interval with discontinuous potentials having one jump. As the main result we obtain a procedure of recovering the location of the discontinuity and the height of the jump. Using our result, we apply a generalized Rundell-Sacks algorithm of Rafler and Böckmann for a more effective reconstruction of the potential and present some numerical examples.