全文获取类型
收费全文 | 888篇 |
免费 | 75篇 |
国内免费 | 94篇 |
专业分类
化学 | 49篇 |
力学 | 78篇 |
综合类 | 9篇 |
数学 | 738篇 |
物理学 | 183篇 |
出版年
2024年 | 1篇 |
2023年 | 10篇 |
2022年 | 13篇 |
2021年 | 17篇 |
2020年 | 17篇 |
2019年 | 22篇 |
2018年 | 24篇 |
2017年 | 19篇 |
2016年 | 29篇 |
2015年 | 29篇 |
2014年 | 56篇 |
2013年 | 63篇 |
2012年 | 36篇 |
2011年 | 62篇 |
2010年 | 38篇 |
2009年 | 73篇 |
2008年 | 55篇 |
2007年 | 68篇 |
2006年 | 51篇 |
2005年 | 44篇 |
2004年 | 48篇 |
2003年 | 47篇 |
2002年 | 52篇 |
2001年 | 36篇 |
2000年 | 19篇 |
1999年 | 21篇 |
1998年 | 28篇 |
1997年 | 21篇 |
1996年 | 26篇 |
1995年 | 6篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 5篇 |
1989年 | 1篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1976年 | 2篇 |
排序方式: 共有1057条查询结果,搜索用时 15 毫秒
101.
Zhongying Chen 《Journal of Mathematical Analysis and Applications》2011,383(2):522-1258
In this paper, we generalize the complex shifted Laplacian preconditioner to the complex shifted Laplacian-PML preconditioner for the Helmholtz equation with perfectly matched layer (Helmholtz-PML equation). The Helmholtz-PML equation is discretized by an optimal 9-point difference scheme, and the preconditioned linear system is solved by the Krylov subspace method, especially by the biconjugate gradient stabilized method (Bi-CGSTAB). The spectral analysis of the linear system is given, and a new matrix-based interpolation operator is proposed for the multigrid method, which is used to approximately invert the preconditioner. The numerical experiments are presented to illustrate the efficiency of the preconditioned Bi-CGSTAB method with the multigrid based on the new interpolation operator, also, numerical results are given for comparing the performance of the new interpolation operator with that of classic bilinear interpolation operator and the one suggested in Erlangga et al. (2006) [10]. 相似文献
102.
The evaluation of matrix functions of the form f(A)v, where A is a large sparse or structured symmetric matrix, f is a nonlinear function, and v is a vector, is frequently subdivided into two steps: first an orthonormal basis of an extended Krylov subspace of fairly small dimension is determined, and then a projection onto this subspace is evaluated by a method designed for small problems. This paper derives short recursion relations for orthonormal bases of extended Krylov subspaces of the type Km,mi+1(A)=span{A-m+1v,…,A-1v,v,Av,…,Amiv}, m=1,2,3,…, with i a positive integer, and describes applications to the evaluation of matrix functions and the computation of rational Gauss quadrature rules. 相似文献
103.
Jae Heon Yun 《Applied mathematics and computation》2011,218(7):3399-3413
In this paper, we first provide comparison results of several types of the preconditioned AOR (PAOR) methods for solving a linear system whose coefficient matrix is an L-matrix satisfying some weaker conditions than those used in the recent literature. Next, we propose an application of PAOR method to a preconditioner of Krylov subspace method. Lastly, numerical results are provided to show that Krylov subspace method with the PAOR preconditioner performs quite well as compared with the ILU (0) preconditioner. 相似文献
104.
J. Javier Ibáñez 《Journal of Computational and Applied Mathematics》2011,235(7):1798-1804
Numerical methods for solving Ordinary Differential Equations (ODEs) have received considerable attention in recent years. In this paper a piecewise-linearized algorithm based on Krylov subspaces for solving Initial Value Problems (IVPs) is proposed. MATLAB versions for autonomous and non-autonomous ODEs of this algorithm have been implemented. These implementations have been compared with other piecewise-linearized algorithms based on Padé approximants, recently developed by the authors of this paper, comparing both precisions and computational costs in equal conditions. Four case studies have been used in the tests that come from stiff biology and chemical kinetics problems. Experimental results show the advantages of the proposed algorithms, especially when the dimension is increased in stiff problems. 相似文献
105.
Jianhua Zhang Hua DaiJing Zhao 《Journal of Computational and Applied Mathematics》2011,236(6):1562-1575
The global bi-conjugate gradient (Gl-BCG) method is an attractive matrix Krylov subspace method for solving nonsymmetric linear systems with multiple right-hand sides, but it often show irregular convergence behavior in many applications. In this paper, we present a new family of global A-biorthogonal methods by using short two-term recurrences and formal orthogonal polynomials, which contain the global bi-conjugate residual (Gl-BCR) algorithm and its improved version. Finally, numerical experiments illustrate that the proposed methods are highly competitive and often superior to originals. 相似文献
106.
杨闻起 《数学的实践与认识》2011,41(23)
设A为数域F上的n级矩阵,记F[A]={f(A)|f(x)∈F[x]},它显然是F~(n×n)的子空间.讨论了F[A]的基和维数,引入了f(A)的坐标和F[A]的因式子空间的概念,给出了用因式子空间表示F[A]的几个定理,刻画了F[A]的结构. 相似文献
107.
This paper addresses the aliasing error in the setting of a class of bidimensional multiresolution analysis associated with a 2 × 2 dilation matrix of determinant ±2. The explicit expression of the Fourier transform of the aliasing error is established, from which we obtain an optimal L 2 (R 2 )-norm estimation of the aliasing error. 相似文献
108.
The Lanczos method with shift‐invert technique is exploited to approximate the symmetric positive semidefinite Toeplitz matrix exponential. The complexity is lowered by the Gohberg–Semencul formula and the fast Fourier transform. Application to the numerical solution of an integral equation is studied. Numerical experiments are carried out to demonstrate the effectiveness of the proposed method. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
109.
Jiansong Zhang Danping Yang Hongfei Fu Hui Guo 《Numerical Linear Algebra with Applications》2011,18(4):695-705
Based on the overlapping‐domain decomposition and parallel subspace correction method, a new parallel algorithm is established for solving time‐dependent convection–diffusion problem with characteristic finite element scheme. The algorithm is fully parallel. We analyze the convergence of this algorithm, and study the dependence of the convergent rate on the spacial mesh size, time increment, iteration times and sub‐domains overlapping degree. Both theoretical analysis and numerical results suggest that only one or two iterations are needed to reach to optimal accuracy at each time step. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
110.
In the present paper, we investigate the dual Lie coalgebras of the centerless W(2, 2) algebra by studying the maximal good subspaces. Based on this, we construct the dual Lie bialgebra structures of the centerless W(2, 2) Lie bialgebra. As by-products, four new infinite dimensional Lie algebras are obtained. 相似文献