CHEBYSHEV APPROXIMATION BY FUNCTIONS HAVING RESTRICTED RANGES WITH EQUALITIES

In this paper, we establish a new type of alternation theory for more general restricted ranges Chebyshev approximation with equalities. The uniqueness and strong uniqueness theorems are given. Applying the results, we obtain the alternation theorem and uniqueness theorem for best coposilive approximation.     

On approximation by sums of Chebyshev norms

A theory of sums of Chebyshev approximations is useful for the problem of simultaneous minimization of the absolute and relative errors of an approximation. In this paper some of the important properties of the Chebyshev alternation theory are studied from the point of view of extending them to sums of Chebyshev norms. Both positive and negative results are obtained. Specifically, it is shown that the sum of Chebyshev approximations with different weight functions is not a Chebyshev approximation.     

Nonlinear Chebyshev fitting from the solution of ordinary differential equations

The nonlinear Chebyshev approximation of real-valued data is considered where the approximating functions are generated from the solution of parameter dependent initial value problems in ordinary differential equations. A theory for this process applied to the approximation of continuous functions on a continuum is developed by the authors in [17]. This is briefly described and extended to approximation on a discrete set. A much simplified proof of the local Haar condition is given. Some algorithmic details are described along with numerical examples of best approximations computed by the Exchange algorithm and a Gauss-Newton type method.     

Computer program for the discrete linear restricted Chebyshev approximation

This paper constitutes a computer program for the discrete linear restricted Chebyshev approximation problem. The program is written in ANSI basic FORTRAN language. The ordinary Chebyshev solution, the one-sided Chebyshev solutions and the Chebyshev approximation by non-negative functions may be calculated as special cases by this program.     

Computational aspects of general minimax optimization

With an optimization problem of minimax type, we associate another problem which is, in turn, of maxmin type. We show that both the problems are equivalent in a sense and they have the same optimal value. The results obtained here are intimately related to Chebyshev (or uniform) approximation theory.     

Collocation-approximation methods for nonlinear singular integrodifferential equations in Banach spaces

A new approximation method is proposed for the numerical evaluation of the nonlinear singular integrodifferential equations defined in Banach spaces. The collocation approximation method is therefore applied to the numerical solution of such type of nonlinear equations, by using a system of Chebyshev functions.Through the application of the collocation method is investigated the existence of solutions of the system of non-linear equations used for the approximation of the nonlinear singular integrodifferential equations, which are defined in a complete normed space, i.e., a Banach space.     

变阶可解族的带权逼近与插值逼近

本文讨论了变阶可解逼近族的插值逼近和带权逼近(权在插值点集Z上趋于无穷而在Z外为1)的关系.指出对变阶可解族而言,当逼近解为非亏损时,稠密性假设是自然满足的,且此时的最佳插值逼近等于该带权最佳逼近的极限.     

Nonlinear Chebyshev approximation to set-valued functions

In this paper, we give a characterization of best Chebyshev approximation to set-valued functions from a family of continuous functions with the weak betweeness property. As a consequence, we obtain a characterization of Kolmogorov type for best simultaneous approximation to an infinity set of functions. We introduce the concept of a set-sun and give a characterization of it. In addition, we prove a property of Amir–Ziegler type for a family of real functions and we get a characterization of best simultaneous approximation to two functions     

CHEBYSHEV APPROXIMATION BY LINEAR ALTERNATING FAMILIES WITH FIXED VALUES AT NODES

In this paper the author discusses a problem of Chebyshev approximation by linear alternating families with fixed values at nodes and gives the analogues of all results for the classical Chebyshev approximation, which include the theorems on existence, alternation, uniqueness, strong uniqueness and the continuty of the best approximation operator, etc.     

Convergence Analysis for Pseudospectral Multidomain Approximations of Linear Advection Equations

Legendre and Chebyshev collocation schemes are proposed forthe numerical approximation of first order linear hyperbolicequations, by a domain decomposition procedure. Spectral convergenceestimates are provided both for Legendre and Chebyshev Gauss-Lobattonodes.     

多维广义SRLW方程的Chebyshev拟谱方法分析

考虑了一类多维的广义对称正则长波(SRLW)方程的齐次初边值问题Chebyshev拟谱逼近,构造了全离散的Chebyshev拟谱格式,给出了这种格式近似解的收敛性和最优误差估计。     

GENERALIZED SIMULTANEOUS CHEBYSHEV APPROXIMATION

In this note,we develop,without assuming the Haar condition,a generalized simultaneousChebyshev approximation theory which is similar to the classical Chebyshev theory and con-rains it as a special case.Our results also contain those in[1]and[3]as a special case,and thetwo conjectures proposed by C.B.Dunham in[2]are proved to be true in the case of simulta-neous approximation.     

The discrete linear restricted Chebyshev approximation

A numerically stable simplex algorithm for calculating the restricted Chebyshev solution of overdetermined systems of linear equations is described. In this algorithm minimum computer storage is required and no conditions are imposed on the coefficient matrix or on the right hand side of the system of equations. Also a new way of implementing a triangular decomposition method to the basis matrix is used. The ordinary Chebyshev solution, the one-sided Chebyshev solutions and the Chebyshev approximation by non-negative functions are obtained as special cases in this algorithm. Numerical results are given.     

A generalized Chebyshev theory

In this paper we develop, without assuming the Haar condition, a generalized Chebyshev theory for Chebyshev approximation which is similar to the classical Chebyshev theory and contains it as a special case. The Project Supported by National Natural Science Foundation of China     

A Chebyshev interval method for nonlinear dynamic systems under uncertainty

This paper proposes a new interval analysis method for the dynamic response of nonlinear systems with uncertain-but-bounded parameters using Chebyshev polynomial series. Interval model can be used to describe nonlinear dynamic systems under uncertainty with low-order Taylor series expansions. However, the Taylor series-based interval method can only suit problems with small uncertain levels. To account for larger uncertain levels, this study introduces Chebyshev series expansions into interval model to develop a new uncertain method for dynamic nonlinear systems. In contrast to the Taylor series, the Chebyshev series can offer a higher numerical accuracy in the approximation of solutions. The Chebyshev inclusion function is developed to control the overestimation in interval computations, based on the truncated Chevbyshev series expansion. The Mehler integral is used to calculate the coefficients of Chebyshev polynomials. With the proposed Chebyshev approximation, the set of ordinary differential equations (ODEs) with interval parameters can be transformed to a new set of ODEs with deterministic parameters, to which many numerical solvers for ODEs can be directly applied. Two numerical examples are applied to demonstrate the effectiveness of the proposed method, in particular its ability to effectively control the overestimation as a non-intrusive method.     

A Modification of Lagrange Interpolation

A modification of Lagrange interpolation based on the zeros of the Chebyshev polynomial of the second kind is constructed, which interpolates at many ofgiven data. Thus, for this node-system the main result gives an affimative answer to a problem suggested by Bernstein in 1930. Moreover, our modification has a Timan-Gopengauz type approximation rate.     

Chebyshev polynomial approximation for high‐order partial differential equations with complicated conditions

In this article, a new method is presented for the solution of high‐order linear partial differential equations (PDEs) with variable coefficients under the most general conditions. The method is based on the approximation by the truncated double Chebyshev series. PDE and conditions are transformed into the matrix equations, which corresponds to a system of linear algebraic equations with the unknown Chebyshev coefficients, via Chebyshev collocation points. Combining these matrix equations and then solving the system yields the Chebyshev coefficients of the solution function. Some numerical results are included to demonstrate the validity and applicability of the method. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Numerical integration of functions with poles near the interval of integration

An automatic quadrature scheme is presented for approximating integrals of functions that are analytic in the interval of integration but contain pole (or poles) of order 2, i.e., a double pole on the real axis or a complex conjugate pair of double poles, near the interval of integration. The present scheme is based on product integration rules of interpolatory type, using function values of the abscissae only in the interval of integration. The integral is approximated and evaluated by using recurrence relations and some extrapolation method after the smooth part of the integrand is expanded in terms of the Chebyshev polynomials. The fast Fourier transform (FFT) technique is used to generate efficiently the sequence of the finite Chebyshev series expansions until an approximation of the integral satisfying the required tolerance is obtained with an adequate estimate of the error. Numerical examples are included to illustrate the performance of the method.     

On the question of construction of an attraction set under constraints of asymptotic nature

In a problem on the approximation of a vector function continuous on an interval by linear functions in the Chebyshev metric, necessary and sufficient conditions on the best approximation function are established.     

On orthogonal polynomial approximation with the dimensional expanding technique for precise time integration in transient analysis

We use four orthogonal polynomial series, Legendre, Chebyshev, Hermite and Laguerre series, to approximate the non-homogeneous term for the precise time integration and incorporate them with the dimensional expanding technique. They are applied to various structures subjected to transient dynamic loading together with Fourier and Taylor approximation proposed in previous works. Numerical examples show that all six methods are efficient and have reasonable precision. In particular, Legendre approximation has much higher precision and better convergence; Chebyshev approximation is also good, but only slightly inferior to Legendre approximation. The other four approximation methods usually produce results with errors hundreds of thousands of times larger. Hermite and Laguerre approximation may be useful for some special non-homogeneous terms, but do not work sufficiently well in our numerical examples. Other contributions of this paper include, a Dynamic Programming scheme for computing series coefficients, a general formula to find the assistant matrix for any polynomial series.