全文获取类型
收费全文 | 139篇 |
免费 | 1篇 |
国内免费 | 14篇 |
专业分类
力学 | 5篇 |
数学 | 147篇 |
物理学 | 2篇 |
出版年
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 2篇 |
2020年 | 4篇 |
2019年 | 1篇 |
2018年 | 1篇 |
2017年 | 1篇 |
2016年 | 3篇 |
2014年 | 9篇 |
2013年 | 20篇 |
2012年 | 10篇 |
2011年 | 6篇 |
2010年 | 4篇 |
2009年 | 14篇 |
2008年 | 6篇 |
2007年 | 10篇 |
2006年 | 7篇 |
2005年 | 6篇 |
2004年 | 2篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 2篇 |
1994年 | 1篇 |
1992年 | 2篇 |
1990年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有154条查询结果,搜索用时 15 毫秒
1.
2.
Alessandro Conflitti 《Finite Fields and Their Applications》2003,9(4):423-431
We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field. 相似文献
3.
A generalization of strong regularity around a vertex subset C of a graph Γ, which makes sense even if Γis non-regular, is studied. Such a structure appears, together with a kind of distance-regularity around C , when an spectral bound concerning the so-called predistance polynomial of C is attained. As a main consequence of these results, it is shown that a regular (connected) graph Γwith d + 1 distinct eigenvalues is distance-regular, and its distance- d graph Γ d is strongly regular with parameters a = c , if and only if the number of vertices at distance d from each vertex satisfies an expression which depends only on the order of Γand the different eigenvalues of Γ. 相似文献
4.
利用Ditzian-Totik光滑模对于[0,1]上定义的非角连续函数f(x),且f(x)≠0,文中证明存在正系数多项式Pn(x)及常数C,使得|f9x)-1/Pn(x)|≤Cωψ^λ(f,n^-1/2(ψ(x) 1/√n)^1-λ)。当λ=1时,上述结果导出已有的整体估计,而当0≤λ<1时,得到倒数逼近一个新的点态局部估计。 相似文献
5.
James Renegar 《Mathematical Programming》1985,32(3):319-336
This work examines the computational complexity of a homotopy algorithm in approximating all roots of a complex polynomialf. It is shown that, probabilistically, monotonic convergence to each of the roots occurs after a determined number of steps. Moreover, in all subsequent steps, each rootz is approximated by a complex numberx, where ifx
0 =x, x
j
=x
j–1 –f(x
j–1)/f(x
j–1),j = 1, 2,, then |x
j
–z| < (1/|x
0 –z|)|x
j–1–z|2. 相似文献
6.
A new algorithm for computing all roots of polynomials with real coefficients is introduced. The principle behind the new algorithm is a fitting of the convolution of two subsequences onto a given polynomial coefficient sequence. This concept is used in the initial stage of the algorithm for a recursive slicing of a given polynomial into degree-2 subpolynomials from which initial root estimates are computed in closed form. This concept is further used in a post-fitting stage where the initial root estimates are refined to high numerical accuracy. A reduction of absolute root errors by a factor of 100 compared to the famous Companion matrix eigenvalue method based on the unsymmetric QR algorithm is not uncommon. Detailed computer experiments validate our claims. 相似文献
7.
《复变函数与椭圆型方程》2012,57(11):1003-1014
This paper studies the effectiveness of another kind of transposed sets of polynomials of one complex variable in closed regions, open discs, at the origin and for all entire functions. In addition, an upper bound for the order of these sets in this case is obtained. 相似文献
8.
9.
Let be an algebraic number field. Let be a root of a polynomial which is solvable by radicals. Let be the splitting field of over . Let be a natural number divisible by the discriminant of the maximal abelian subextension of , as well as the exponent of , the Galois group of over . We show that an optimal nested radical with roots of unity for can be effectively constructed from the derived series of the solvable Galois group of over .
10.
D. P. Dryanov M. A. Qazi Q. I. Rahman 《Proceedings of the American Mathematical Society》2003,131(9):2741-2751
Extensions of two classical results about polynomials, one due to W. Markov and the other due to Duffin and Schaeffer, are obtained in this paper. An interesting result of S. Bernstein, which went unnoticed until it was rediscovered by P. Erdos, years later, is also generalized. Our results are especially amenable to numerical calculations, and may, therefore, be of some practical importance.