一些特殊三角剖分上分片线性样条的最佳逼近问题

The critical point set plays a central role in the theory of Tchebyshev approximation.Generally,in multivariate Tchebyshev approximation,it is not a trivial task to determine whether a set is critical or not.In this paper,we study the characterization of the critical point set of S 0 1(△) in geometry,where is restricted to some special triangulations(bitriangular,single road and star triangulations).Such geometrical characterization is convenient to use in the determination of a critical point set.     

Tchebyshev Approximation by S~0_1(△) over Some Special Triangulations

The critical point set plays a central role in the theory of Tchebyshev approximation.Generally,in multivariate Tchebyshev approximation,it is not a trivial task to determine whether a set is critical or not.In this paper,we study the characterization of the critical point set of S 0 1(△) in geometry,where is restricted to some special triangulations(bitriangular,single road and star triangulations).Such geometrical characterization is convenient to use in the determination of a critical point set.     

Tchebyshev Approximation by S01（△） over Some Special Triangulations

The critical point set plays a central role in the theory of Tchebyshev approximation.Generally,in multivariate Tchebyshev approximation,it is not a trivial task to determine whether a set is critical or not.In this paper,we study the characterization of the critical point set of S 0 1(△) in geometry,where is restricted to some special triangulations(bitriangular,single road and star triangulations).Such geometrical characterization is convenient to use in the determination of a critical point set.     

APPROXIMATION OF BOCHNER-RIESZ MEANS 0F CONJUGATE FOURIER INTEGRALS BEL0W THE CRITICAL INDEX

In this paper we study the approximation on set of full measure for functions in Sobolev spacesL_m~1 (R~n) (m∈N) by Bochner-Riesz means of conjugale Fourier integrals below the critical index. Atheorem concerning the precise approximation orders with relation to the number m of space L_m~1 (R~n) andthe index of Bochner-Riesz means is obtained.     

3阶不可约符号模式的精细惯量极小临界集

Let S be a nonempty, proper subset of all possible refined inertias of real matrices of order n. The set S is a critical set of refined inertias for irreducible sign patterns of order n,if for each n × n irreducible sign pattern A, the condition S ? ri(A) is sufficient for A to be refined inertially arbitrary. If no proper subset of S is a critical set of refined inertias, then S is a minimal critical set of refined inertias for irreducible sign patterns of order n.All minimal critical sets of refined inertias for full sign patterns of order 3 have been identified in [Wei GAO, Zhongshan LI, Lihua ZHANG, The minimal critical sets of refined inertias for 3×3 full sign patterns, Linear Algebra Appl. 458(2014), 183–196]. In this paper, the minimal critical sets of refined inertias for irreducible sign patterns of order 3 are identified.     

A conjecture on k-factor-critical and 3-γ-critical graphs

For a graph G =(V,E),a subset VS is a dominating set if every vertex in V is either in S or is adjacent to a vertex in S.The domination number γ(G) of G is the minimum order of a dominating set in G.A graph G is said to be domination vertex critical,if γ(G-v) γ(G) for any vertex v in G.A graph G is domination edge critical,if γ(G ∪ e) γ(G) for any edge e ∈/E(G).We call a graph G k-γ-vertex-critical(resp.k-γ-edge-critical) if it is domination vertex critical(resp.domination edge critical) and γ(G) = k.Ananchuen and Plummer posed the conjecture:Let G be a k-connected graph with the minimum degree at least k+1,where k 2 and k≡|V|(mod 2).If G is 3-γ-edge-critical and claw-free,then G is k-factor-critical.In this paper we present a proof to this conjecture,and we also discuss the properties such as connectivity and bicriticality in 3-γ-vertex-critical claw-free graph.     

AN EFFICIENT SEQUENTIAL DESIGN FOR SENSITIVITY EXPERIMENTS

In sensitivity experiments, the response is binary and each experimental unit has a critical stimulus level that cannot be observed directly. It is often of interest to estimate extreme quantiles of the distribution of these critical stimulus levels over the tested products. For this purpose a new sequential scheme is proposed with some commonly used models. By using the bootstrap repeated-sampling principle, reasonable prior distributions based on a historic data set are specified. Then, a Bayesian strategy for the sequential procedure is provided and the estimator is given. Further, a high order approximation for such an estimator is explored and its consistency is proven. A simulation study shows that the proposed method gives superior performances over the existing methods.     

The Approximation Theorem of Convolution Operator in △~p Set-valued Function Space

The paper is a contribution to the problem of approximating random set with values in a separable Banach space. This class of set-valued function is widely used in many areas.We investigate the properties of p-bounded integrable random set. Based on this we endow it with △p metric which can be viewed as a integral type hausdorff metric and present some approximation theorem of a class of convolution operators with respect to △p metric. Moreover we also can establish analogous theorem for other integral type operator in △p space.     

THE STRUCTURE AND APPROXIMATION OF A.S. SELF-SIMILAR SET

The structure of any a.s. self-similar set K(w) generated by a class of random elements {gn,wσ} taking values in the space of contractive operators is given and the approximation of K(w) by the fixed points {Pn,wσ} of {gn,ow} is obtained. It is useful to generate the fractal in computer.     

APPROXIMATE COMMON DIVISORS OF POLYNOMIALS AND DEGREE REDUCTION FOR RATIONAL CURVES

This paper deals with how to perturb a given set of polynomials so as to include a common linear factor. An algorithm is derived for determining such a set of perturbation polyrlomials which are subject to certain constrains at the endpoints of a prescribed parametric interval and minimized in a certain sense. This result can be combined with subdivision technique to obtain a continuous piecewise approximation to a rational curve.     

Hilbert空间中涉及一类新的具误差迭代程序的平衡问题的黏性逼近法

In this paper, we introduce an iterative scheme with error by the viscosity approximation method for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of a nonexpansive mapping in a Hilbert space. A strong convergence theorem is given, which generalizes all the results obtained by S.Takahashi and W.Takahashi in 2007. In addition, some of the methods applied in this paper improve those of S.Takahashi and W.Takahashi.     

NOTES ON POLYNOMIAL LEVELABILITY

We consider the polynomial levelability with respect to approximation algorithms (PLAA).A set A is PLAA if given any approximation algorithm a for A and a polynomial p,there are another approximation algorithm β for A and a polynomial q such that for infinitely many inputs x,a accepts x but has ruuning time greater than p(|x|) and β accepts x within time q(|x|).In this paper,an algorithm a is called an approximation algorithm for A if the symmetric difference A△L(a) is sparse,where L(a) is the set of strings recegnized by a.We prove that all natural NP-complete sets are PLAA unless P=NP and all EXP-complete sets are PLAA.     

τ-CHEBYSHEV AND τ-COCHEBYSHEV SUBPSACES OF BANACH SPACES

The concepts of quasi-Chebyshev and weakly-Chebyshev and σ-Chebyshev were defined [3 - 7], andas a counterpart to best approximation in normed linear spaces, best coapprozimation was introduced by Franchetti and Furi^[1]. In this research, we shall define τ-Chebyshev subspaces and τ-cochebyshev subspaces of a Banach space, in which the property τ is compact or weakly-compact, respectively. A set of necessary and sufficient theorems under which a subspace is τ-Chebyshev is defined.     

ON THE ORDER OF APPROXIMATION FOR THE RATIONAL INTERPOLATION TO |x|

The order of approximation for Newman-type rational interpolation to |x| is studied in this paper. For general set of nodes, the extremum of approximation error and the order of the best uniform approximation are estimated. The result illustrates the general quality of approximation in a different way. For thespecial case where the interpolation nodes are xi= (i/n)(i= 1,2,…,n;r>0) , it is proved that the exact order of approximation is O(1/n),O(1/nlogn) and O(1/n), respectively, corresponding to O1.     

On the order of approximation for the rational interpolation to |x|

The order of approximation for Newman-type rational interpolation to |x| is studied in this paper.For general set of nodes, the extremum of approximation error and the order of the best uniform approximation are estimated. The result illustrates the general quality of approximation in a different way. For the special case where the interpolation nodes are xi=(i/n)r(i=1,2, … ,n;r＞0), it is proved that the exact order of approximation is O(1/n), O(1/nlogn) and O(1/nr), respectively, corresponding to 0＜r＜1, r=1 and r＞1.     

A generalized version of Branner-Hubbard conjecture for rational functions

In 1992, Branner and Hubbard raised a conjecture that the Julia set of a polynomial is a Cantor set if and only if each critical component of its filled-in Julia set is not periodic. This conjecture was solved recently. In this paper, we generalize this result to a class of rational functions.     

Quasisymmetric geometry of the Julia sets of McMullen maps Dedicated to the Memory of Professor Lei Tan

We study the quasisymmetric geometry of the Julia sets of McMullen maps f_λ(z) = z~m+ λ/z~?,where λ∈ C \ {0} and ? and m are positive integers satisfying 1/? + 1/m 1. If the free critical points of f_λ are escaped to the infinity, we prove that the Julia set J_λ of f_λ is quasisymmetrically equivalent to either a standard Cantor set, a standard Cantor set of circles or a round Sierpiński carpet(which is also standard in some sense).If the free critical points are not escaped, we give a sufficient condition on λ such that J_λ is a Sierpiński carpet and prove that most of them are quasisymmetrically equivalent to some round carpets. In particular, there exist infinitely renormalizable rational maps whose Julia sets are quasisymmetrically equivalent to the round carpets.     

A NEW TRUST-REGION ALGORITHM FOR NONLINEAR CONSTRAINED OPTIMIZATION

We propose a new trust region algorithm for nonlinear constrained optimization problems. In each iteration of our algorithm, the trial step is computed by minimizing a quadratic approximation to the augmented Lagrange function in the trust region. The augmented Lagrange function is also used as a merit function to decide whether the trial step should be accepted. Our method extends the traditional trust region approach by combining a filter technique into the rules for accepting trial steps so that a trial step could still be accepted even when it is rejected by the traditional rule based on merit function reduction. An estimate of the Lagrange multiplier is updated at each iteration, and the penalty parameter is updated to force sufficient reduction in the norm of the constraint violations. Active set technique is used to handle the inequality constraints. Numerical results for a set of constrained problems from the CUTEr collection are also reported.     

SOLUTIONS TO ELLIPTIC SYSTEMS INVOLVING DOUBLY CRITICAL NONLINEARITIES AND HARDY-TYPE POTENTIALS

In this article,an elliptic system is investigated,which involves Hardy-type potentials,critical Sobolev-type nonlinearities,and critical Hardy-Sobolev-type nonlinearities.By a variational global-compactness argument,the Palais-Smale sequences of related approximation problems is analyzed and the existence of infinitely many solutions to the system is established.     

多背包问题的半定松驰算法

The multiple knapsack problem denoted by MKP (B,S,rn,n) can be defined as follows. A set B of n items and a set S of rn knapsacks are given such that each item j has a profit pi and weight wj,and each knapsack i has a capacity Ci. The goal is to find a subset of items of maximum profit such that they have a feasible packing in the knapsacks. MKP (B,S,m,n) is strongly NP-Complete and no polynomial time approximation algorithm can have an approximation ratio better than 0.5. In the last ten years,semi-definite programming has been empolyed to solve some combinatorial problems successfully. This paper firstly presents a semi-definite relaxation algorithm (MKPS) for MKP (B,S,rn,n). It is proved that MKPS have a approximation ratio better than 0. 5 for a subclass of MKP (B,S,m,n) with n≤100, m≤5 and max^nj=1{wj}/min^mi=1={Ci}≤2/3.