Differential subordination related to conic sections

In this paper some problems of the theory of differential subordination are investigated in connection with conic domains. In particular, fundamental conditions for functions mapped the unit disk onto domains bounded by parabolas and hyperbolas are deduced.     

An algorithm for determining the approximation orders of multivariate periodic spline spaces

We give an algorithm which computes the approximation order of spaces of periodic piece-wise polynomial functions, given the degree, the smoothness and tesselation. The algorithm consists of two steps. The first gives an upper bound and the second a lower bound on the approximation order. In all known cases the two bounds coincide.     

The approximation order of polysplines

We show that the scaling spaces defined by the polysplines of order provide approximation order For that purpose we refine the results on one-dimensional approximation order by -splines obtained by de Boor, DeVore, and Ron (1994).

     

Fuzzy data approximation using smoothing cubic splines: Similarity and error analysis

In this paper, a new methodology is developed for defining error and similarity measure indexes, in order to establish a criterion adequate for comparison function approximation using fuzzy data. The proposed similarity measures and error indexes are applied for smoothing with cubic splines, showing a good performance for defining the accuracy of approximation obtained with fuzzy numbers. Examples are given to compare the behavior of the new indexes proposed for different configurations of the smooth cubic splines. A statistical analysis was carried out to verify the homogeneity of the indexes proposed as criteria to determine the correctness or accuracy of such approximation of fuzzy numbers.     

On the approximation power of bivariate splines

We show how to construct stable quasi-interpolation schemes in the bivariate spline spaces S _d ^r (Δ) with d⩾ 3r + 2 which achieve optimal approximation order. In addition to treating the usual max norm, we also give results in the L _p norms, and show that the methods also approximate derivatives to optimal order. We pay special attention to the approximation constants, and show that they depend only on the smallest angle in the underlying triangulation and the nature of the boundary of the domain. This revised version was published online in August 2006 with corrections to the Cover Date.     

A shape-preserving approximation by weighted cubic splines

This paper addresses new algorithms for constructing weighted cubic splines that are very effective in interpolation and approximation of sharply changing data. Such spline interpolations are a useful and efficient tool in computer-aided design when control of tension on intervals connecting interpolation points is needed. The error bounds for interpolating weighted splines are obtained. A method for automatic selection of the weights is presented that permits preservation of the monotonicity and convexity of the data. The weighted B-spline basis is also well suited for generation of freeform curves, in the same way as the usual B-splines. By using recurrence relations we derive weighted B-splines and give a three-point local approximation formula that is exact for first-degree polynomials. The resulting curves satisfy the convex hull property, they are piecewise cubics, and the curves can be locally controlled with interval tension in a computationally efficient manner.     

Bivariate segment approximation and splines

The problem to determine partitions of a given rectangle which are optimal for segment approximation (e.g., by bivariate piecewise polynomials) is investigated. We give criteria for optimal partitions and develop algorithms for computing optimal partitions of certain types. It is shown that there is a surprising relationship between various types of optimal partitions. In this way, we obtain good partitions for interpolation by tensor product spline spaces. Our numerical examples show that the methods work efficiently.     

Three-monotone spline approximation

For r≥3, n∈N and each 3-monotone continuous function f on [a,b] (i.e., f is such that its third divided differences [x₀,x₁,x₂,x₃]f are nonnegative for all choices of distinct points x₀,…,x₃ in [a,b]), we construct a spline s of degree r and of minimal defect (i.e., s∈C^r−1[a,b]) with n−1 equidistant knots in (a,b), which is also 3-monotone and satisfies ‖f−s‖_L∞[a,b]≤cω₄(f,n⁻¹,[a,b])_∞, where ω₄(f,t,[a,b])_∞ is the (usual) fourth modulus of smoothness of f in the uniform norm. This answers in the affirmative the question raised in [8, Remark 3], which was the only remaining unproved Jackson-type estimate for uniform 3-monotone approximation by piecewise polynomial functions (ppfs) with uniformly spaced fixed knots.Moreover, we also prove a similar estimate in terms of the Ditzian–Totik fourth modulus of smoothness for splines with Chebyshev knots, and show that these estimates are no longer valid in the case of 3-monotone spline approximation in the L_p norm with p<∞. At the same time, positive results in the L_p case with p<∞ are still valid if one allows the knots of the approximating ppf to depend on f while still being controlled.These results confirm that 3-monotone approximation is the transition case between monotone and convex approximation (where most of the results are “positive”) and k-monotone approximation with k≥4 (where just about everything is “negative”).     

An algorithm for solving new trust region subproblem with conic model

The new trust region subproblem with the conic model was proposed in 2005, and was divided into three different cases. The first two cases can be converted into a quadratic model or a convex problem with quadratic constraints, while the third one is a nonconvex problem. In this paper, first we analyze the nonconvex problem, and reduce it to two convex problems. Then we discuss some dual properties of these problems and give an algorithm for solving them. At last, we present an algorithm for solving the new trust region subproblem with the conic model and report some numerical examples to illustrate the efficiency of the algorithm.     

A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization

We study the convex hull of the intersection of a disjunctive set defined by parallel hyperplanes and the feasible set of a mixed integer second order cone optimization (MISOCO) problem. We extend our prior work on disjunctive conic cuts (DCCs), which has thus far been restricted to the case in which the intersection of the hyperplanes and the feasible set is bounded. Using a similar technique, we show that one can extend our previous results to the case in which that intersection is unbounded. We provide a complete characterization in closed form of the conic inequalities required to describe the convex hull when the hyperplanes defining the disjunction are parallel.     

Approximation order of bivariate spline interpolation for arbitrary smoothness

By using the algorithm of Nürnberger and Riessinger (1995), we construct Hermite interpolation sets for spaces of bivariate splines S_q^r(Δ¹) of arbitrary smoothness defined on the uniform type triangulations. It is shown that our Hermite interpolation method yields optimal approximation order for q 3.5r + 1. In order to prove this, we use the concept of weak interpolation and arguments of Birkhoff interpolation.     

Polynomial time approximation schemes for dense instances of minimum constraint satisfaction

It is known that large fragments of the class of dense Minimum Constraint Satisfaction (MIN‐CSP) problems do not have polynomial time approximation schemes (PTASs) contrary to their Maximum Constraint Satisfaction analogs. In this paper we prove, somewhat surprisingly, that the minimum satisfaction of dense instances of kSAT ‐formulas, and linear equations mod 2, Ek‐LIN2, do have PTASs for any k. The MIN‐Ek‐LIN2 problems are equivalent to the k‐ary versions of the Nearest Codeword problem, the problem which is known to be exceedingly hard to approximate on general instances. The method of solution of the above problems depends on the development of a new density sampling technique for k‐uniform hypergraphs which could be of independent interest. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 23: 73–91, 2003     

Perfect spline approximation

Our study of perfect spline approximation reveals: (i) it is closely related to ΣΔ modulation used in one-bit quantization of bandlimited signals. In fact, they share the same recursive formulae, although in different contexts; (ii) the best rate of approximation by perfect splines of order r with equidistant knots of mesh size h is h^r−1. This rate is optimal in the sense that a function can be approximated with a better rate if and only if it is a polynomial of degree <r.The uniqueness of best approximation is studied, too. Along the way, we also give a result on an extremal problem, that is, among all perfect splines with integer knots on , (multiples of) Euler splines have the smallest possible norms.     

Approximating conic sections by constrained Bézier curves of arbitrary degree

In this paper, an algorithm for approximating conic sections by constrained Bézier curves of arbitrary degree is proposed. First, using the eigenvalues of recurrence equations and the method of undetermined coefficients, some exact integral formulas for the product of two Bernstein basis functions and the denominator of rational quadratic form expressing conic section are given. Then, using the least squares method, a matrix-based representation of the control points of the optimal Bézier approximation curve is deduced. This algorithm yields an explicit, arbitrary-degree Bézier approximation of conic sections which has function value and derivatives at the endpoints that match the function value and the derivatives of the conic section up to second order and is optimal in the _L2$L_2$ norm. To reduce error, the method can be combined with a curve subdivision scheme. Computational examples are presented to validate the feasibility and effectiveness of the algorithm for a whole curve or its part generated by a subdivision.     

The local integro cubic splines and their approximation properties

We show the integro cubic splines proposed by Behforooz [1] can be constructed locally by using B-representation of splines. The approximation properties of the local splines are also considered.     

Compact finite difference schemes of sixth order for the Helmholtz equation

New compact finite difference schemes of sixth order are derived for the three dimensional Helmholtz equation, Δu-κ²u=-f$\mathrm{\Delta }u-{\kappa }^{2}u=-f$. Convergence characteristics and accuracy are compared and a truncation error analysis is presented for a broad range of κ$\kappa$-values.     

An algorithm for the quadratic approximation

The quadratic approximation is a three dimensional analogue of the two dimensional Padé approximation. A determinantal expression for the polynomial coefficients of the quadratic approximation is given. A recursive algorithm for the construction of these coefficients is derived. The algorithm constructs a table of quadratic approximations analogous to the Padé table of rational approximations.