全文获取类型
收费全文 | 346篇 |
免费 | 30篇 |
国内免费 | 19篇 |
专业分类
化学 | 49篇 |
力学 | 31篇 |
综合类 | 4篇 |
数学 | 251篇 |
物理学 | 60篇 |
出版年
2023年 | 2篇 |
2022年 | 1篇 |
2021年 | 5篇 |
2020年 | 7篇 |
2019年 | 10篇 |
2018年 | 9篇 |
2017年 | 11篇 |
2016年 | 12篇 |
2015年 | 8篇 |
2014年 | 18篇 |
2013年 | 31篇 |
2012年 | 11篇 |
2011年 | 18篇 |
2010年 | 11篇 |
2009年 | 17篇 |
2008年 | 13篇 |
2007年 | 24篇 |
2006年 | 18篇 |
2005年 | 15篇 |
2004年 | 12篇 |
2003年 | 13篇 |
2002年 | 15篇 |
2001年 | 13篇 |
2000年 | 8篇 |
1999年 | 11篇 |
1998年 | 9篇 |
1997年 | 4篇 |
1996年 | 10篇 |
1995年 | 10篇 |
1994年 | 9篇 |
1993年 | 3篇 |
1992年 | 6篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1979年 | 3篇 |
1977年 | 3篇 |
1974年 | 1篇 |
排序方式: 共有395条查询结果,搜索用时 31 毫秒
1.
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. 相似文献
2.
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 相似文献
3.
Jenn‐Long Liu 《国际流体数值方法杂志》2004,44(12):1299-1315
This paper presents a relaxation algorithm, which is based on the overset grid technology, an unsteady three‐dimensional Navier–Stokes flow solver, and an inner‐ and outer‐relaxation method, for simulation of the unsteady flows of moving high‐speed trains. The flow solutions on the overlapped grids can be accurately updated by introducing a grid tracking technique and the inner‐ and outer‐relaxation method. To evaluate the capability and solution accuracy of the present algorithm, the computational static pressure distribution of a single stationary TGV high‐speed train inside a long tunnel is investigated numerically, and is compared with the experimental data from low‐speed wind tunnel test. Further, the unsteady flows of two TGV high‐speed trains passing by each other inside a long tunnel and at the tunnel entrance are simulated. A series of time histories of pressure distributions and aerodynamic loads acting on the train and tunnel surfaces are depicted for detailed discussions. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
4.
单调优化是指目标函数与约束函数均为单调函数的全局优化问题.本文提出一种新的凸化变换方法把单调函数化为凸函数,进而把单调优化问题化为等价的凸极大或凹极小问题,然后采用Hoffman的外逼近方法来求得问题的全局最优解.我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较,通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法. 相似文献
5.
关于体上分块矩阵的群逆 总被引:1,自引:0,他引:1
本文利用分块矩阵方法.研究了体上两个矩阵乘积的群逆的存在性及表示形式,给出了体上两个矩阵乘积群逆存在的充分必要条件和表示形式.并且在一定条件下.给出了体上分块矩阵的群逆存在性及表示形式. 相似文献
6.
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. 相似文献
7.
We find the existence of a quantum thermal effect, “Hawking absorption.” near the inner horizon of the Kerr–Newman black hole. Redefining the entropy, temperature, angular velocity, and electric potential of the black hole, we give a new formulation of the Bekenstein–Smarr formula. The redefined entropy vanishes for absolute zero temperature of the black hole and hence it is interpreted as the Planck absolute entropy of the KN black hole. 相似文献
8.
环上矩阵的广义Moore-Penrose逆 总被引:14,自引:0,他引:14
本文给出带有对合的有1的结合环上一类矩阵的广义Moore-Penrose逆存在的充要条件,而这类矩阵概括了左右主理想整环,单Artin环上所有矩阵。 相似文献
9.
在本文中,我们提出了双凹规划问题和更一般的广义凹规划问题。我们给出了双凹规划问题的整体最优性条件,并构造了一个有限终止外逼近算法。 相似文献
10.
Convex programs with an additional reverse convex constraint 总被引:2,自引:0,他引:2
H. Tuy 《Journal of Optimization Theory and Applications》1987,52(3):463-486
A method is presented for solving a class of global optimization problems of the form (P): minimizef(x), subject toxD,g(x)0, whereD is a closed convex subset ofR
n
andf,g are convex finite functionsR
n
. Under suitable stability hypotheses, it is shown that a feasible point
is optimal if and only if 0=max{g(x):xD,f(x)f(
)}. On the basis of this optimality criterion, the problem is reduced to a sequence of subproblemsQ
k
,k=1, 2, ..., each of which consists in maximizing the convex functiong(x) over some polyhedronS
k
. The method is similar to the outer approximation method for maximizing a convex function over a compact convex set. 相似文献