收费全文 |
966篇 |

国内免费 |
46篇 |

完全免费 |
11篇 |

数学 |
1023篇 |

2017年 |
3篇 |

2015年 |
23篇 |

2014年 |
53篇 |

2013年 |
54篇 |

2012年 |
55篇 |

2011年 |
57篇 |

2010年 |
78篇 |

2009年 |
101篇 |

2008年 |
102篇 |

2007年 |
51篇 |

2006年 |
78篇 |

2005年 |
53篇 |

2004年 |
57篇 |

2003年 |
52篇 |

2002年 |
57篇 |

2001年 |
48篇 |

2000年 |
26篇 |

1999年 |
24篇 |

1998年 |
11篇 |

1997年 |
9篇 |

1996年 |
12篇 |

1995年 |
8篇 |

1994年 |
5篇 |

1993年 |
2篇 |

1990年 |
1篇 |

1987年 |
2篇 |

1974年 |
1篇 |

**排序方式：**共有1023条查询结果，搜索用时 31 毫秒

**总被引：19，自引：0，他引：19**

**总被引：18，自引：0，他引：18**where the vector of functions is in and is a finitely supported sequence of matrices called the refinement mask. Associated with the mask is a linear operator defined on by . This paper is concerned with the convergence of the subdivision scheme associated with , i.e., the convergence of the sequence in the -norm.

Our main result characterizes the convergence of a subdivision scheme associated with the mask in terms of the joint spectral radius of two finite matrices derived from the mask. Along the way, properties of the joint spectral radius and its relation to the subdivision scheme are discussed. In particular, the -convergence of the subdivision scheme is characterized in terms of the spectral radius of the transition operator restricted to a certain invariant subspace. We analyze convergence of the subdivision scheme explicitly for several interesting classes of vector refinement equations.

Finally, the theory of vector subdivision schemes is used to characterize orthonormality of multiple refinable functions. This leads us to construct a class of continuous orthogonal double wavelets with symmetry.

**总被引：18，自引：0，他引：18**

**总被引：17，自引：0，他引：17**

**总被引：16，自引：0，他引：16**

**总被引：16，自引：0，他引：16**

**总被引：13，自引：0，他引：13**

**总被引：13，自引：0，他引：13**

**总被引：13，自引：0，他引：13***d*variables with arbitrary

*d*. We consider algorithms that use function evaluations as the information about the function. We are mainly interested in verifying when integration and approximation are tractable and strongly tractable. Tractability means that the minimal number of function evaluations needed to reduce the initial error by a factor of ɛ is bounded by

*C*(

*d*)ɛ

^{−p }for some exponent

*p*independent of

*d*and some function

*C*(

*d*). Strong tractability means that

*C*(

*d*) can be made independent of

*d*. The ‐exponents of tractability and strong tractability are defined as the smallest powers of ɛ{

^{-1}} in these bounds. We prove that integration is strongly tractable for some weighted Korobov and Sobolev spaces as well as for the Hilbert space whose reproducing kernel corresponds to the covariance function of the isotropic Wiener measure. We obtain bounds on the ‐exponents, and for some cases we find their exact values. For some weighted Korobov and Sobolev spaces, the strong ‐exponent is the same as the ‐exponent for

*d*=1, whereas for the third space it is 2. For approximation we also consider algorithms that use general evaluations given by arbitrary continuous linear functionals as the information about the function. Our main result is that the ‐exponents are the same for general and function evaluations. This holds under the assumption that the orthonormal eigenfunctions of the covariance operator have uniformly bounded

*L*∞ norms. This assumption holds for spaces with shift-invariant kernels. Examples of such spaces include weighted Korobov spaces. For a space with non‐shift‐invariant kernel, we construct the corresponding space with shift-invariant kernel and show that integration and approximation for the non-shift-invariant kernel are no harder than the corresponding problems with the shift-invariant kernel. If we apply this construction to a weighted Sobolev space, whose kernel is non-shift-invariant, then we obtain the corresponding Korobov space. This enables us to derive the results for weighted Sobolev spaces. This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献

**总被引：12，自引：0，他引：12**