全文获取类型
收费全文 | 317篇 |
免费 | 6篇 |
国内免费 | 14篇 |
专业分类
化学 | 1篇 |
力学 | 26篇 |
综合类 | 1篇 |
数学 | 277篇 |
物理学 | 32篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 1篇 |
2021年 | 2篇 |
2020年 | 4篇 |
2019年 | 5篇 |
2018年 | 4篇 |
2017年 | 3篇 |
2016年 | 2篇 |
2015年 | 6篇 |
2014年 | 17篇 |
2013年 | 31篇 |
2012年 | 16篇 |
2011年 | 22篇 |
2010年 | 30篇 |
2009年 | 32篇 |
2008年 | 38篇 |
2007年 | 26篇 |
2006年 | 10篇 |
2005年 | 6篇 |
2004年 | 7篇 |
2003年 | 9篇 |
2002年 | 4篇 |
2001年 | 9篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 11篇 |
1997年 | 4篇 |
1996年 | 2篇 |
1995年 | 4篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1991年 | 3篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1978年 | 1篇 |
排序方式: 共有337条查询结果,搜索用时 15 毫秒
101.
In this paper, the homotopy perturbation method is directly applied to derive approximate solutions of the fractional KdV equation. The results reveal that the proposed method is very effective and simple for solving approximate solutions of fractional differential equations. 相似文献
102.
The class
of spaces having the homotopy type of a CW complex is not closed under formation of function spaces. In 1959, Milnor proved the fundamental theorem that, given a space
and a compact Hausdorff space X, the space YX of continuous functions X→Y, endowed with the compact open topology, belongs to
. P.J. Kahn extended this in 1982, showing that
if X has finite n-skeleton and πk(Y)=0, k>n.
Using a different approach, we obtain a further generalization and give interesting examples of function spaces where is not homotopy equivalent to a finite complex, and has infinitely many nontrivial homotopy groups. We also obtain information about some topological properties that are intimately related to CW homotopy type.
As an application we solve a related problem concerning towers of fibrations between spaces of CW homotopy type. 相似文献
103.
Using functional analysis, we derive from local homotopy formulas for the tangential Cauchy-Riemann operator a global homotopy
formula for compact CR manifolds without loss of regularity.
相似文献
104.
We describe a Cat-valued nerve of bicategories, which associates to every bicategory a simplicial object in Cat, called the 2-nerve. This becomes the object part of a 2-functor N : NHom → [Δop,Cat], where NHom is a 2-category whose objects are bicategories and whose 1-cells are normal homomorphisms of bicategories. The 2-functor
N is fully faithful and has a left biadjoint, and we characterize its image. The 2-nerve of a bicategory is always a weak 2-category
in the sense of Tamsamani, and we show that NHom is biequivalent to a certain 2-category whose objects are Tamsamani weak 2-categories.
The hospitality of Macquarie University and the support of the Australian Research Council are gratefully acknowledged by
S. Lack.
The support of the Australian Research Council is gratefully acknowledged by S. Paoli. 相似文献
105.
Solving systems of ODEs by homotopy analysis method 总被引:1,自引:0,他引:1
A. Sami Bataineh M.S.M. Noorani I. Hashim 《Communications in Nonlinear Science & Numerical Simulation》2008,13(10):2060-2070
This paper applies the homotopy analysis method (HAM) to systems of ordinary differential equations (ODEs). The systems investigated include stiff systems, the chaotic Genesio system and the matrix Riccati-type differential equation. The HAM gives approximate analytical solutions which are of comparable accuracy to the seven- and eight-order Runge–Kutta method (RK78). 相似文献
106.
综合利用Leray-Schauder度理论的同伦不变性、上下解方法等,在符号型Nagumo条件下获得了一类三阶非线性常微分方程在非线性边界条件下解的存在性结果. 相似文献
107.
In this Letter, we present the homotopy perturbation method (shortly HPM) for obtaining the numerical solution of the RLW equation. We obtain the exact and numerical solutions of the Regularized Long Wave (RLW) equation for certain initial condition. The initial approximation can be freely chosen with possible unknown constants which can be determined by imposing the boundary and initial conditions. Comparison of the results with those of other methods have led us to significant consequences. The numerical solutions are compared with the known analytical solutions. 相似文献
108.
A new approximate analytical technique to address for non-linear problems, namely Optimal Homotopy Asymptotic Method (OHAM)
is proposed and has been applied to thin film flow of a fourth grade fluid down a vertical cylinder. This approach however,
does not depend upon any small/large parameters in comparison to other perturbation method. This method provides a convenient
way to control the convergence of approximation series and allows adjustment of convergence regions where necessary. The series
solution has been developed and the recurrence relations are given explicitly. The results reveal that the proposed method
is very accurate, effective and easy to use.
相似文献
109.
We present an efficient simplicial algorithm for computing a zero of a point-to-set mapping that is formed by piecing together
smooth functions. Such mappings arise in nonlinear programming and economic equilibrium problems. Our algorithm, under suitable
regularity conditions on the problem, generates a sequence converging at least Q-superlinearly to a zero of the mapping. Asymptotically,
it operates in a space of reduced dimension, analogous to an active set strategy in the optimization setting, but it switches
active sets automatically. Results of computational experiments are given.
Research of this author was supported by a Fellowship from the Rockeffeller Foundation.
Research of this author was partially supported by a fellowhip from the John Simon Guggenheim Memorial Foundation and by National
Science Foundation Grant ECS-7921279. 相似文献
110.
Sergio Cabello Yuanxin Liu Andrea Mantler Jack Snoeyink 《Discrete and Computational Geometry》2004,31(1):61-81
In this paper we present an efficient algorithm to test if two given
paths are homotopic; that is, whether they wind around obstacles in
the plane in the same way. For paths specified by n line segments
with obstacles described by n points, several standard ways
achieve quadratic running time. For simple paths, our algorithm
runs in O(n log n) time, which we show is tight. For
self-intersecting paths the problem is related to Hopcrofts
problem; our algorithm runs in O(n
3/2log n) time. 相似文献