Imposing boundary conditions in Sinc method using highest derivative approximation

Sinc approximate methods are often used to solve complex boundary value problems such as problems on unbounded domains or problems with endpoint singularities. A recent implementation of the Sinc method [Li, C. and Wu, X., Numerical solution of differential equations using Sinc method based on the interpolation of the highest derivatives, Applied Mathematical Modeling 31 (1) 2007 1–9] in which Sinc basis functions are used to approximate the highest derivative in the governing equation of the boundary value problem is evaluated for structural mechanics applications in which interlaminar stresses are desired. We suggest an alternative approach for specifying the boundary conditions, and we compare the numerical results for analysis of a laminated composite Timoshenko beam, implementing both Li and Wu’s approach and our alternative approach for applying the boundary conditions. For the Timoshenko beam problem, we obtain accurate results using both approaches, including transverse shear stress by integration of the 3D equilibrium equations of elasticity. The beam results indicate our approach is less dependent on the selection of the Sinc mesh size than Li and Wu’s SIHD. We also apply SIHD to analyze a classical laminated composite plate. For the plate example, we experience difficulty in obtaining a complete system of equations using Li and Wu’s approach. For our approach, we suggest that additional necessary information may be obtained by applying the derivatives of the boundary conditions on each edge. Using this technique, we obtain accurate results for deflection and stresses, including interlaminar stresses by integration of the 3D equilibrium equations of elasticity. Our results for both the beam and the plate problems indicate that this approach is easily implemented, has a high level of accuracy, and good convergence properties.     

Fourier series for zeta function via Sinc

In this paper we derive some Fourier series and Fourier polynomial approximations to a function F which has the same zeros as the zeta function, ζ(z) on the strip {z∈C:0<Rz<1}. These approximations depend on an arbritrary positive parameter h, and which for arbitrary ε∈(0,1/2), converge uniformly to ζ(z) on the rectangle {z∈C:ε<Rz<1-ε,-π/h<Iz<π/h}.     

Numerical solution of differential equations using Sinc method based on the interpolation of the highest derivatives

In general, we will use the numerical differentiation when dealing with the differential equations. Thus the differential equations can be transformed into algebraic equations and then we can get the numerical solutions. But as we all have known, the numerical differentiation process is very sensitive to even a small level of errors. In contrast it is expected that on average the numerical integration process is much less sensitive to errors. In this paper, based on the Sinc method we provide a new method using Sinc method incorporated with the double exponential transformation based on the interpolation of the highest derivatives (SIHD) for the differential equations. The error in the approximation of the solution is shown to converge at an exponential rate. The numerical results show that compared with the exiting results, our method is of high accuracy, of good convergence with little computational efforts. It is easy to treat nonhomogeneous mixed boundary condition for our method, which is unlike the traditional Sinc method.     

Polynomial approximation on the sphere using scattered data

We consider the problem of approximately reconstructing a function f defined on the surface of the unit sphere in the Euclidean space ℝ^{q +1} by using samples of f at scattered sites. A central role is played by the construction of a new operator for polynomial approximation, which is a uniformly bounded quasi‐projection in the de la Vallée Poussin style, i.e. it reproduces spherical polynomials up to a certain degree and has uniformly bounded L^p operator norm for 1 ≤ p ≤ ∞. Using certain positive quadrature rules for scattered sites due to Mhaskar, Narcowich and Ward, we discretize this operator obtaining a polynomial approximation of the target function which can be computed from scattered data and provides the same approximation degree of the best polynomial approximation. To establish the error estimates we use Marcinkiewicz–Zygmund inequalities, which we derive from our continuous approximating operator. We give concrete bounds for all constants in the Marcinkiewicz–Zygmund inequalities as well as in the error estimates. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Numerical treatment of solving singular integral equations by using Sinc approximations

In this paper we propose numerical treatment for singular integral equations. The methods are developed by means of the Sinc approximation with smoothing transformations. Such approximation is an effective technique against the singularities of the equations, and achieves exponential convergence. Therefore the methods improve conventional results where only polynomial convergence have been reported. The resulting algebraic system is solved by least squares approximation and leap frog algorithm. Estimation of errors of the approximate solution is presented. Some experimental tests are presented to show the efficient of the proposed methods.     

Near optimality of the sinc approximation

Near optimality of the sinc approximation is established in a variety of spaces of functions analytic in a strip region about the real axis, each space being characterized by the decay rate of their elements (functions) in the neighborhood of the infinity.

     

Detection of discontinuities in scattered data approximation

A Detection Algorithm for the localisation of unknown fault lines of a surface from scattered data is given. The method is based on a local approximation scheme using thin plate splines, and we show that this yields approximation of second order accuracy instead of first order as in the global case. Furthermore, the Detection Algorithm works with triangulation methods, and we show their utility for the approximation of the fault lines. The output of our method provides polygonal curves which can be used for the purpose of constrained surface approximation. This revised version was published online in June 2006 with corrections to the Cover Date.     

ODE-IVP-PACK via Sinc indefinite integration and Newton's method

This paper describes a package of computer programs for the unified treatment of initial-value problems for systems of ordinary differential equations. The programs implement a numerical method which is efficient for a general class of differential equations. The user may determine the solutions over finite or infinite intervals. The solutions may have singularities at the end-points of the interval for which the solution is sought. Besides giving the initial values and the analytical expression for the differential equations to be solved the user needs to specify the nature of the singularities and give some other analytical information as described in the paper in order to take advantage of the speed and accuracy of the package described here. This revised version was published online in June 2006 with corrections to the Cover Date.     

Multilevel scattered data approximation by adaptive domain decomposition

A new multilevel approximation scheme for scattered data is proposed. The scheme relies on an adaptive domain decomposition strategy using quadtree techniques (and their higher-dimensional generalizations). It is shown in the numerical examples that the new method achieves an improvement on the approximation quality of previous well-established multilevel interpolation schemes. AMS subject classification 65D15, 65D05, 65D07, 65D17     

Polynomial time approximation schemes and parameterized complexity

In this paper, we study the relationship between the approximability and the parameterized complexity of NP optimization problems. We introduce a notion of polynomial fixed-parameter tractability and prove that, under a very general constraint, an NP optimization problem has a fully polynomial time approximation scheme if and only if the problem is polynomial fixed-parameter tractable. By enforcing a constraint of planarity on the W-hierarchy studied in parameterized complexity theory, we obtain a class of NP optimization problems, the planar W-hierarchy, and prove that all problems in this class have efficient polynomial time approximation schemes (EPTAS). The planar W-hierarchy seems to contain most of the known EPTAS problems, and is significantly different from the class introduced by Khanna and Motwani in their efforts in characterizing optimization problems with polynomial time approximation schemes.     

Polynomial functions and the Riesz Interpolation Property

Building on a proof by D. Handelman of a generalisation of an example due to L. Fuchs, we show that the space of real-valued polynomials on a non-empty set X$X$ of reals has the Riesz Interpolation Property if and only if X$X$ is bounded.     

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     

Polynomial approximation, local polynomial convexity, and degenerate CR singularities

We begin with the following question: given a closed disc and a complex-valued function , is the uniform algebra on generated by z and F equal to ? When F∈C¹(D), this question is complicated by the presence of points in the surface that have complex tangents. Such points are called CR singularities. Let p∈S be a CR singularity at which the order of contact of the tangent plane with S is greater than 2; i.e. a degenerate CR singularity. We provide sufficient conditions for S to be locally polynomially convex at the degenerate singularity p. This is useful because it is essential to know whether S is locally polynomially convex at a CR singularity in order to answer the initial question. To this end, we also present a general theorem on the uniform algebra generated by z and F, which we use in our investigations. This result may be of independent interest because it is applicable even to non-smooth, complex-valued F.     

Polynomial approximation of functions with given order of thekth generalized modulus of smoothness

The problem of approximation by algebraic polynomials is considered on function classes characterized by the value of thekth generalized modulus of smoothness defined by the Jacobi generalized shift operator. Translated fromMatematicheskie Zametki, Vol. 63, No. 3, pp. 425–436, March, 1998.     

Polynomial time approximation of dense weighted instances of MAX‐CUT

We give the first polynomial time approximability characterization of denseweighted instances of MAX‐CUT, and some other dense weighted 𝒩𝒫‐hard problems in terms of their empirical weight distributions. This also gives the first almost sharp characterization of inapproximability of unweighted 0, 1 MAX‐BISECTION instances in terms of their density parameter. © 2000 John Wiley & Sons, Inc. Random Struct. Alg., 16: 314–332, 2000     

Polynomial approximation of functions by means of boundary values and applications: A survey

We collect classical and more recent results on polynomial approximation of sufficiently regular real functions defined in bounded closed intervals by means of boundary values only. The problem is considered from the point of view of the existence of explicit formulas, interpolation to boundary data, bounds for the remainder and convergence of the polynomial series. Applications to some problems of numerical analysis are pointed out, such as nonlinear equations, numerical differentiation and integration formulas, special associated differential boundary value problems. Some polynomial expansions for smooth enough functions defined in rectangles or in triangles of as well as in cuboids or in tetrahedrons in and their applications are also discussed.     

On tractability of approximation in special function spaces

We consider approximation problems for a special space of d$d$ variate functions. We show that the problems have small number of active variables, as it has been postulated in the past using concentration of measure arguments. We also show that, depending on the norm for measuring the error, the problems are strongly polynomially or quasi-polynomially tractable even in the model of computation where functional evaluations have the cost exponential in the number of active variables.     

Convergence of Polynomial Level Sets

In this paper we give a characterization of pointwise and uniform convergence of sequences of homogeneous polynomials on a Banach space by means of the convergence of their level sets. Results are obtained both in the real and the complex cases, as well as some generalizations to the nonhomogeneous case and to holomorphic functions in the complex case. Kuratowski convergence of closed sets is used in order to characterize pointwise convergence. We require uniform convergence of the distance function to get uniform convergence of the sequence of polynomials.

     

Sinc Approximation of the Heat Flux on the Boundary of a Two-Dimensional Finite Slab

We consider the two-dimensional problem of recovering globally in time the heat flux on the surface of a layer inside of a heat-conducting body from two interior temperature measurements. The problem is ill-posed. The approximation function is represented by a two-dimensional Sinc series and the error estimate is given.