全文获取类型
收费全文 | 606篇 |
免费 | 20篇 |
国内免费 | 19篇 |
专业分类
化学 | 11篇 |
力学 | 32篇 |
综合类 | 1篇 |
数学 | 558篇 |
物理学 | 43篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 7篇 |
2021年 | 9篇 |
2020年 | 6篇 |
2019年 | 20篇 |
2018年 | 13篇 |
2017年 | 7篇 |
2016年 | 15篇 |
2015年 | 8篇 |
2014年 | 26篇 |
2013年 | 72篇 |
2012年 | 31篇 |
2011年 | 39篇 |
2010年 | 34篇 |
2009年 | 45篇 |
2008年 | 43篇 |
2007年 | 42篇 |
2006年 | 24篇 |
2005年 | 21篇 |
2004年 | 21篇 |
2003年 | 23篇 |
2002年 | 18篇 |
2001年 | 10篇 |
2000年 | 11篇 |
1999年 | 13篇 |
1998年 | 19篇 |
1997年 | 5篇 |
1996年 | 6篇 |
1995年 | 12篇 |
1994年 | 6篇 |
1993年 | 3篇 |
1992年 | 6篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 4篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1974年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有645条查询结果,搜索用时 31 毫秒
1.
Sameerah Jamal 《Journal of Differential Equations》2019,266(7):4018-4026
A manifold that contains small perturbations will induce a perturbed partial differential equation. The partial differential equation that we select is the Poisson equation – in order to explore the interplay between the geometry of the manifold and the perturbations. Specifically, we show how the problem of symmetry determination, for higher-order perturbations, can be elegantly expressed via geometric conditions. 相似文献
2.
G. Montero L. Gonzlez E. Flrez M. D. García A. Surez 《Numerical Linear Algebra with Applications》2002,9(3):239-247
Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, minM∈??∥AM?I∥ F and matrix M0∈?? corresponding to this minimum (?? being any vectorial subspace of ??n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
3.
Johan Helsing 《BIT Numerical Mathematics》2006,46(2):307-323
A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come
from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating
distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar
to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that
of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with
up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners
of otherwise similar construction, and especially so when the preconditioners are very sparse.
AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30 相似文献
4.
Heikki Hyyr 《Journal of Discrete Algorithms》2005,3(2-4):215-229
Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms. 相似文献
5.
关于体上分块矩阵的群逆 总被引:1,自引:0,他引:1
本文利用分块矩阵方法.研究了体上两个矩阵乘积的群逆的存在性及表示形式,给出了体上两个矩阵乘积群逆存在的充分必要条件和表示形式.并且在一定条件下.给出了体上分块矩阵的群逆存在性及表示形式. 相似文献
6.
L. Bergamaschi G. Gambolati G. Pini 《Journal of Computational and Applied Mathematics》2007,210(1-2):64-70
Integration of the subsurface flow equation by finite elements (FE) in space and finite differences (FD) in time requires the repeated solution to sparse symmetric positive definite systems of linear equations. Iterative techniques based on preconditioned conjugate gradients (PCG) are one of the most attractive tool to solve the problem on sequential computers. A present challenge is to make PCG attractive in a parallel computing environment as well. To this aim a key factor is the development of an efficient parallel preconditioner. FSAI (factorized sparse approximate inverse) and enlarged FSAI relying on the approximate inverse of the coefficient matrix appears to be a most promising parallel preconditioner. In the present paper PCG using FSAI, diagonal and pARMS (parallel algebraic recursive multilevel solvers) preconditioners is implemented on the IBM SP4/512 and CLX/768 supercomputers with up to 32 processors to solve underground flow problems of a large size. The results show that FSAI may allow for a parallel relative efficiency larger than 50% on the largest problems with p=32 processors. Moreover, FSAI turns out to be significantly less expensive and more robust than pARMS. Finally, it is shown that for p in the upper range may be much improved if PCG–FSAI is implemented on CLX. 相似文献
7.
This paper proposes a model for the parametric representation of linguistic hedges in Zadeh’s fuzzy logic. In this model each linguistic truth-value, which is generated from a primary term of the linguistic truth variable, is identified by a real number r depending on the primary term. It is shown that the model yields a method of efficiently computing linguistic truth expressions accompanied with a rich algebraic structure of the linguistic truth domain, namely De Morgan algebra. Also, a fuzzy logic based on the parametric representation of linguistic truth-values is introduced. 相似文献
8.
Nail H Ibragimov Gazanfer Ünal 《Journal of Mathematical Analysis and Applications》2004,297(1):152-168
A new definition for the approximate symmetries of Itô dynamical system is given. Determining systems of approximate symmetries for Itô and Stratonovich dynamical systems have been obtained. It has been shown that approximate conservation laws can be found from the approximate symmetries of stochastic dynamical systems which do not arise from a Hamiltonian. The results have been applied to an example. 相似文献
9.
This paper considers a new approach to a priori sparsification of the sparsity pattern of the factorized approximate inverses (FSAI) preconditioner using the so‐called vector aggregation technique. The suggested approach consists in construction of the FSAI preconditioner to the aggregated matrix with a prescribed sparsity pattern. Then small entries of the computed ‘aggregated’ FSAI preconditioning matrix are dropped, and the resulting pointwise sparsity pattern is used to construct the low‐density block sparsity pattern of the FSAI preconditioning matrix to the original matrix. This approach allows to minimize (sometimes significantly) the construction costs of low‐density high‐quality FSAI preconditioners. Numerical results with sample matrices from structural mechanics and thin shell problems are presented. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
10.
In this paper, we discuss the controllability of a nonlinear degenerate parabolic system with bilinear control. Based on the shrinking property of the solutions, we prove that the system is not globally approximately controllable. Furthermore, we give an approximate null controllability result. We also prove that the system is not globally exactly null controllable by a comparison principle. 相似文献