This paper deals with the approximate solution of the Fredholm equation Lu= f of the second kind with f ∈H’(Γ). First, we give the order of the n-the optimal radius in the worst case setting. Then, we show that the...This paper deals with the approximate solution of the Fredholm equation Lu= f of the second kind with f ∈H’(Γ). First, we give the order of the n-the optimal radius in the worst case setting. Then, we show that the Galerkin method using 2n+1 inner products of f has minimal error. Finally, we give the estimate of the ε-complexity of the Fredholm problem of the second kind and Galerkin method in the worst case setting.展开更多
The order of computational complexity of all bounded linear functional ap proximation problem is determined for the generalized Sobolev class Wp?（Id）, Nikolskii class H|∞k（Id） in the worst （deterministic）, stoc...The order of computational complexity of all bounded linear functional ap proximation problem is determined for the generalized Sobolev class Wp?（Id）, Nikolskii class H|∞k（Id） in the worst （deterministic）, stochastic and average case setting, from which it is concluded that the bounded linear functional approximation problem for the classes Wp?（Id） and H∞k（Id） is intractable in worst case setting, but is tractable with respect to stochastic and average case setting.展开更多
Search-based software engineering has mainly dealt with automated test data generation by metaheuristic search techniques. Similarly, we try to generate the test data (i.e., problem instances) which show the worst cas...Search-based software engineering has mainly dealt with automated test data generation by metaheuristic search techniques. Similarly, we try to generate the test data (i.e., problem instances) which show the worst case of algorithms by such a technique. In this paper, in terms of non-functional testing, we re-define the worst case of some algorithms, respectively. By using genetic algorithms (GAs), we illustrate the strategies corresponding to each type of instances. We here adopt three problems for examples;the sorting problem, the 0/1 knapsack problem (0/1KP), and the travelling salesperson problem (TSP). In some algorithms solving these problems, we could find the worst-case instances successfully;the successfulness of the result is based on a statistical approach and comparison to the results by using the random testing. Our tried examples introduce informative guidelines to the use of genetic algorithms in generating the worst-case instance, which is defined in the aspect of algorithm performance.展开更多
This paper investigates the optimal Birkhoff interpolation and Birkhoff numbers of some function spaces in space L∞[-1,1]and weighted spaces Lp,ω[-1,1],1≤p<∞,with w being a continuous integrable weight function...This paper investigates the optimal Birkhoff interpolation and Birkhoff numbers of some function spaces in space L∞[-1,1]and weighted spaces Lp,ω[-1,1],1≤p<∞,with w being a continuous integrable weight function in(-1,1).We proved that the Lagrange interpolation algorithms based on the zeros of some polynomials are optimal.We also show that the Lagrange interpolation algorithms based on the zeros of some polynomials are optimal when the function values of the two endpoints are included in the interpolation systems.展开更多
基金This work was partially supported by the Chinese National Science Fundation,the Chinese National High Technology Program(863).and the UNSW Vice-Chancellor's Post Doctoral Fellowship in Australia.
文摘This paper deals with the approximate solution of the Fredholm equation Lu= f of the second kind with f ∈H’(Γ). First, we give the order of the n-the optimal radius in the worst case setting. Then, we show that the Galerkin method using 2n+1 inner products of f has minimal error. Finally, we give the estimate of the ε-complexity of the Fredholm problem of the second kind and Galerkin method in the worst case setting.
基金Project supported by the Natural Science Foundation of China(10371009) and Research Fund for the Doctoral Program Higher Education.
文摘The order of computational complexity of all bounded linear functional ap proximation problem is determined for the generalized Sobolev class Wp?（Id）, Nikolskii class H|∞k（Id） in the worst （deterministic）, stochastic and average case setting, from which it is concluded that the bounded linear functional approximation problem for the classes Wp?（Id） and H∞k（Id） is intractable in worst case setting, but is tractable with respect to stochastic and average case setting.
文摘Search-based software engineering has mainly dealt with automated test data generation by metaheuristic search techniques. Similarly, we try to generate the test data (i.e., problem instances) which show the worst case of algorithms by such a technique. In this paper, in terms of non-functional testing, we re-define the worst case of some algorithms, respectively. By using genetic algorithms (GAs), we illustrate the strategies corresponding to each type of instances. We here adopt three problems for examples;the sorting problem, the 0/1 knapsack problem (0/1KP), and the travelling salesperson problem (TSP). In some algorithms solving these problems, we could find the worst-case instances successfully;the successfulness of the result is based on a statistical approach and comparison to the results by using the random testing. Our tried examples introduce informative guidelines to the use of genetic algorithms in generating the worst-case instance, which is defined in the aspect of algorithm performance.
基金supported by National Natural Science Foundation of China(11871006,11671271)。
文摘This paper investigates the optimal Birkhoff interpolation and Birkhoff numbers of some function spaces in space L∞[-1,1]and weighted spaces Lp,ω[-1,1],1≤p<∞,with w being a continuous integrable weight function in(-1,1).We proved that the Lagrange interpolation algorithms based on the zeros of some polynomials are optimal.We also show that the Lagrange interpolation algorithms based on the zeros of some polynomials are optimal when the function values of the two endpoints are included in the interpolation systems.
