A New Strategy for Choosing the Chebyshev-Gegenbauer Parameters in a Reconstruction Based on Asymptotic Analysis
Journal Title: Mathematical Modelling and Analysis - Year 2010, Vol 15, Issue 2
Abstract
The Gegenbauer reconstruction method, first proposed by Gottlieb et. al. in 1992, has been considered a useful technique for re-expanding finite series polynomial approximations while simultaneously avoiding Gibbs artifacts. Since its introduction many studies have analyzed the method's strengths and weaknesses as well as suggesting several applications. However, until recently no attempts were made to optimize the reconstruction parameters, whose careful selection can make the difference between spectral accuracies and divergent error bounds. In this paper we propose asymptotic analysis as a method for locating the optimal Gegenbauer reconstruction parameters. Such parameters are useful to applications of this reconstruction method that either seek to bound the number of Gegenbauer expansion coefficients or to control compression ratios. We then illustrate the effectiveness of our approach with the results from some numerical experiments.
Authors and Affiliations
Z. Jackiewicz, R. Park
Relaxation of a Weakly Discontinuous Functional Depending on One Control Function
The paper considers an optimal control problem of the type J=int_{Omega} < B(x) nabla u, nabla u > + < g,nabla u>dx → min div A(x) nabla u-h(x)=0 in Omega u ϵ H[sub]0[/sub][sup]1[/sup](Omega;R[sup]m[/sup]), h...
A New Strategy for Choosing the Chebyshev-Gegenbauer Parameters in a Reconstruction Based on Asymptotic Analysis
The Gegenbauer reconstruction method, first proposed by Gottlieb et. al. in 1992, has been considered a useful technique for re-expanding finite series polynomial approximations while simultaneously avoiding Gibbs artifa...
Numerical Simulation of the Conductivity Relaxation in the High Resistivity Semiconductor
A theoretical model describing the relaxation of charge carriers in semiconductors of high resistance under the influence of the laser pulses is presented. It is demonstrated that parameters of the trapping states releva...
An Implementation of a Parallel Generalized Branch and Bound Template
Branch and bound (BnB) is a general algorithm to solve optimization problems. We present a template implementation of the BnB paradigm. A BnB template is implemented using C++ object oriented paradigm. MPI is used for un...
Approximate Solution of Nonlinear Multi-Point Boundary Value Problem on the Half-Line
In this work, we construct a novel weighted reproducing kernel space and give the expression of reproducing kernel function skillfully. Based on the orthogonal basis established in the reproducing kernel space, an effici...