نتایج جستجو برای: chebyshev spectral collocation method

تعداد نتایج: 1764786  

2001
Ben-yu Guo Jie Shen Zhong-qing Wang

A weighted orthogonal system on the half-line based on the Chebyshev rational functions is introduced. Basic results on Chebyshev rational approximations of several orthogonal projections and interpolations are established. To illustrate the potential of the Chebyshev rational spectral method, a model problem is considered both theoretically and numerically: error estimates for the Chebyshev ra...

Journal: :Journal of new theory 2023

In this study, Chebyshev polynomials have been applied to construct an approximation method attain the solutions of linear fractional Fredholm integro-differential equations (IDEs). By method, IDE has transformed into a algebraic system with aid collocation points. conformable derivatives calculated in terms polynomials. Using results these calculations, matrix relation for was attained first t...

Journal: :Applied Mathematics and Computation 2007
A. Golbabai M. Javidi

A numerical method based on Chebyshev polynomials and local interpolating functions is proposed for solving the onedimensional parabolic partial differential equation subject to non-classical conditions. To assess its validity and accuracy, the method is applied to solve several test problem. 2007 Elsevier Inc. All rights reserved.

H. Kheiri H. Pourbashash J. Akbarfam

Spectral approximations for ODEs in unbounded domains have only received limited attention. In many applicable problems, singular initial value problems arise. In solving these problems, most of numerical methods have difficulties and often could not pass the singular point successfully. In this paper, we apply the sinc-collocation method for solving singular initial value problems. The ability...

Journal: :SIAM J. Scientific Computing 2007
Shravan K. Veerapaneni George Biros

We describe a fast high-order accurate method for the solution of the heat equation in domains with moving Dirichlet or Neumann boundaries and distributed forces. We assume that the motion of the boundary is prescribed. Our method extends the work of Greengard and Strain [Comm. Pure Appl. Math., XLIII (1990), pp. 949–963]. Our scheme is based on a time-space Chebyshev pseudo-spectral collocatio...

2008
L. N. TREFETHEN

In Matlab, it would be good to be able to solve a linear differential equation by typing u = L\f, where f, u, and L are representations of the right-hand side, the solution, and the differential operator with boundary conditions. Similarly it would be good to be able to exponentiate an operator with expm(L) or determine eigenvalues and eigenfunctions with eigs(L). A system is described in which...

1997
Peter Junghanns Uwe Weber

We consider a collocation method for Cauchy singular integral equations on the interval based on weighted Chebyshev polynomials, where the coe cients of the operator are piecewise continuous. Stability conditions are derived using Banach algebra methods, and numerical results are given.

Journal: :Discrete and Continuous Models and Applied Computational Science 2022

The classical pseudospectral collocation method based on the expansion of solution in a basis Chebyshev polynomials is considered. A new approach to constructing systems linear algebraic equations for solving ordinary differential with variable coefficients and initial (and/or boundary) conditions makes possible significant simplification structure matrices, reducing it diagonal form. system re...

This paper establishes a direct method for solving variational problems via a set of Radial basis functions (RBFs) with Gauss-Chebyshev collocation centers. The method consist of reducing a variational problem into a mathematical programming problem. The authors use some optimization techniques to solve the reduced problem. Accuracy and stability of the multiquadric, Gaussian and inverse multiq...

Journal: :SIAM J. Scientific Computing 2017
Ling Guo Akil Narayan Tao Zhou Yuhang Chen

In this work, we discuss the problem of approximating a multivariate function by polynomials via `1 minimization method, using a random chosen sub-grid of the corresponding tensor grid of Gaussian points. The independent variables of the function are assumed to be random variables, and thus, the framework provides a non-intrusive way to construct the generalized polynomial chaos expansions, ste...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید