全文获取类型
收费全文 | 1051篇 |
免费 | 12篇 |
国内免费 | 208篇 |
专业分类
化学 | 641篇 |
晶体学 | 1篇 |
力学 | 38篇 |
综合类 | 1篇 |
数学 | 282篇 |
物理学 | 90篇 |
综合类 | 218篇 |
出版年
2024年 | 3篇 |
2023年 | 44篇 |
2022年 | 14篇 |
2021年 | 14篇 |
2020年 | 20篇 |
2019年 | 16篇 |
2018年 | 13篇 |
2017年 | 34篇 |
2016年 | 33篇 |
2015年 | 21篇 |
2014年 | 41篇 |
2013年 | 81篇 |
2012年 | 48篇 |
2011年 | 70篇 |
2010年 | 70篇 |
2009年 | 83篇 |
2008年 | 86篇 |
2007年 | 67篇 |
2006年 | 57篇 |
2005年 | 52篇 |
2004年 | 43篇 |
2003年 | 40篇 |
2002年 | 31篇 |
2001年 | 32篇 |
2000年 | 19篇 |
1999年 | 28篇 |
1998年 | 29篇 |
1997年 | 30篇 |
1996年 | 18篇 |
1995年 | 12篇 |
1994年 | 21篇 |
1993年 | 19篇 |
1992年 | 19篇 |
1991年 | 14篇 |
1990年 | 12篇 |
1989年 | 9篇 |
1988年 | 9篇 |
1987年 | 8篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1978年 | 2篇 |
排序方式: 共有1271条查询结果,搜索用时 15 毫秒
91.
Gerhard König Michael Moldaschl Wilfried N. Gansterer 《Journal of Computational and Applied Mathematics》2012
New methods for computing eigenvectors of symmetric block tridiagonal matrices based on twisted block factorizations are explored. The relation of the block where two twisted factorizations meet to an eigenvector of the block tridiagonal matrix is reviewed. Based on this, several new algorithmic strategies for computing the eigenvector efficiently are motivated and designed. The underlying idea is to determine a good starting vector for an inverse iteration process from the twisted block factorizations such that a good eigenvector approximation can be computed with a single step of inverse iteration. 相似文献
92.
93.
Henryk Brzeskwiniewicz 《Annals of the Institute of Statistical Mathematics》1989,41(1):199-204
The necessary and sufficient conditions for m-associate partially balanced block (PBB) designs to be connected are given. This generalizes the criterion for m-associate partially balanced incomplete block (PBIB) designs, which has originally been established by Ogawa, Ikeda and Kageyama (1984, Proceedings of the Seminar on Combinatorics and Applications, 248–255, Statistical Publishing Society, Calcutta).This work was partially supported by the Polish Academy of Sciences Grant No. MR I.1-2/2. 相似文献
94.
It is known that the diagonal-Schur complements of strictly diagonally dominant matrices are strictly diagonally dominant matrices [J.Z. Liu, Y.Q. Huang, Some properties on Schur complements of H-matrices and diagonally dominant matrices, Linear Algebra Appl. 389 (2004) 365-380], and the same is true for nonsingular H-matrices [J.Z. Liu, J.C. Li, Z.T. Huang, X. Kong, Some properties of Schur complements and diagonal-Schur complements of diagonally dominant matrices, Linear Algebra Appl. 428 (2008) 1009-1030]. In this paper, we research the properties on diagonal-Schur complements of block diagonally dominant matrices and prove that the diagonal-Schur complements of block strictly diagonally dominant matrices are block strictly diagonally dominant matrices, and the same holds for generalized block strictly diagonally dominant matrices. 相似文献
95.
In order to solve the large sparse systems of linear equations arising from numerical solutions of two-dimensional steady incompressible viscous flow problems in primitive variable formulation, we present block SSOR and modified block SSOR iteration methods based on the special structures of the coefficient matrices. In each step of the block SSOR iteration, we employ the block LU factorization to solve the sub-systems of linear equations. We show that the block LU factorization is existent and stable when the coefficient matrices are block diagonally dominant of type-II by columns. Under suitable conditions, we establish convergence theorems for both block SSOR and modified block SSOR iteration methods. In addition, the block SSOR iteration and AF-ADI method are considered as preconditioners for the nonsymmetric systems of linear equations. Numerical experiments show that both block SSOR and modified block SSOR iterations are feasible iterative solvers and they are also effective for preconditioning Krylov subspace methods such as GMRES and BiCGSTAB when used to solve this class of systems of linear equations. 相似文献
96.
S.N. Jator 《Applied mathematics and computation》2010,217(8):4036-4046
A three-step seventh order hybrid linear multistep method (HLMM) with three non-step points is proposed for the direct solution of the special second order initial value problems (IVPs) of the form y″ = f(x, y) with an extension to y″ = f(x, y, y′). The main method and additional methods are obtained from the same continuous scheme derived via interpolation and collocation procedures.The stability properties of the methods are discussed by expressing them as a one-step method in higher dimension. The methods are then applied in block form as simultaneous numerical integrators over non-overlapping intervals. Numerical results obtained using the proposed block form reveal that it is highly competitive with existing methods in the literature. 相似文献
97.
The problem of recognizing cover-incomparability graphs (i.e. the graphs obtained from posets as the edge-union of their covering and incomparability graph) was shown to be NP-complete in general [J. Maxová, P. Pavlíkova, A. Turzík, On the complexity of cover-incomparability graphs of posets, Order 26 (2009) 229-236], while it is for instance clearly polynomial within trees. In this paper we concentrate on (classes of) chordal graphs, and show that any cover-incomparability graph that is a chordal graph is an interval graph. We characterize the posets whose cover-incomparability graph is a block graph, and a split graph, respectively, and also characterize the cover-incomparability graphs among block and split graphs, respectively. The latter characterizations yield linear time algorithms for the recognition of block and split graphs, respectively, that are cover-incomparability graphs. 相似文献
98.
Nikolaos L.Tsitsas 《计算数学(英文版)》2010,(6):864-878
Block matrices associated with discrete Trigonometric transforms (DTT's) arise in the mathematical modelling of several applications of wave propagation theory including discretizations of scatterers and radiators with the Method of Moments, the Boundary Element Method, and the Method of Auxiliary Sources. The DTT's are represented by the Fourier, Hartley, Cosine, and Sine matrices, which are unitary and offer simultaneous diagonalizations of specific matrix algebras. The main tool for the investigation of the aforementioned wave applications is the efficient inversion of such types of block matrices. To this direction, in this paper we develop an efficient algorithm for the inversion of matrices with U-diagonalizable blocks (U a fixed unitary matrix) by utilizing the U- diagonalization of each block and subsequently a similarity transformation procedure. We determine the developed method's computational complexity and point out its high efficiency compared to standard inversion techniques. An implementation of the algorithm in Matlab is given. Several numerical results are presented demonstrating the CPU-time efficiency and accuracy for ill-conditioned matrices of the method. The investigated matrices stem from real-world wave propagation applications. 相似文献
99.
Ganesh Dutta 《Discrete Mathematics》2010,310(5):1037-1049
The choice of covariates values for a given block design attaining minimum variance for estimation of each of the regression parameters of the model has attracted attention in recent times. In this article, we consider the problem of finding the optimum covariate design (OCD) for the estimation of covariate parameters in a binary proper equi-replicate block (BPEB) design model with covariates, which cover a large class of designs in common use. The construction of optimum designs is based mainly on Hadamard matrices. 相似文献
100.
为了提高块压缩感知的测量效率和重构性能,根据离散余弦变换和离散正弦变换具有汇聚信号能量的特性,提出了基于重复块对角结构的部分离散余弦变换partial discrete cosine transform in repeated block diagonal structure,简称PDCT-RBDS和部分离散正弦变换partial discrete sine transform in repeated block diagonal structure简称PDST-RBDS的两种压缩感知测量方法.所采用的测量矩阵是一种低复杂度的结构化确定性矩阵, 满足受限等距性质.并得到一个与采样能量有关的受限等距常数和精确重构的测量数下限.通过与采用重复块对角结构的部分随机高斯矩阵和部分贝努利矩阵的图像压缩感知对比,结果表明PDCT-RBDS和PDST-RBDS重构的PSNR大约提高1---5dBSSIM提高约0.05, 所需的重构时间和测量矩阵的存储空间大大减少.该方法特别适合大规模图像压缩及实时视频数据处理场合. 相似文献