全文获取类型
收费全文 | 6083篇 |
免费 | 422篇 |
国内免费 | 489篇 |
专业分类
化学 | 106篇 |
力学 | 241篇 |
综合类 | 151篇 |
数学 | 6324篇 |
物理学 | 172篇 |
出版年
2023年 | 56篇 |
2022年 | 54篇 |
2021年 | 94篇 |
2020年 | 135篇 |
2019年 | 154篇 |
2018年 | 149篇 |
2017年 | 172篇 |
2016年 | 175篇 |
2015年 | 112篇 |
2014年 | 244篇 |
2013年 | 481篇 |
2012年 | 281篇 |
2011年 | 320篇 |
2010年 | 263篇 |
2009年 | 379篇 |
2008年 | 345篇 |
2007年 | 384篇 |
2006年 | 327篇 |
2005年 | 289篇 |
2004年 | 245篇 |
2003年 | 232篇 |
2002年 | 254篇 |
2001年 | 244篇 |
2000年 | 233篇 |
1999年 | 195篇 |
1998年 | 183篇 |
1997年 | 175篇 |
1996年 | 125篇 |
1995年 | 105篇 |
1994年 | 86篇 |
1993年 | 68篇 |
1992年 | 47篇 |
1991年 | 46篇 |
1990年 | 49篇 |
1989年 | 24篇 |
1988年 | 17篇 |
1987年 | 23篇 |
1986年 | 21篇 |
1985年 | 27篇 |
1984年 | 27篇 |
1983年 | 13篇 |
1982年 | 28篇 |
1981年 | 19篇 |
1980年 | 15篇 |
1979年 | 18篇 |
1978年 | 20篇 |
1977年 | 14篇 |
1976年 | 11篇 |
1975年 | 3篇 |
1974年 | 3篇 |
排序方式: 共有6994条查询结果,搜索用时 15 毫秒
1.
The row iterative method is popular in solving the large‐scale ill‐posed problems due to its simplicity and efficiency. In this work we consider the randomized row iterative (RRI) method to tackle this issue. First, we present the semiconvergence analysis of RRI method for the overdetermined and inconsistent system, and derive upper bounds for the noise error propagation in the iteration vectors. To achieve a least squares solution, we then propose an extended version of the RRI (ERRI) method, which in fact can converge in expectation to the solution of the overdetermined or underdetermined, consistent or inconsistent systems. Finally, some numerical examples are given to demonstrate the convergence behaviors of the RRI and ERRI methods for these types of linear system. 相似文献
2.
Given a graph sequence denote by T3(Gn) the number of monochromatic triangles in a uniformly random coloring of the vertices of Gn with colors. In this paper we prove a central limit theorem (CLT) for T3(Gn) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T3(Gn), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7]. 相似文献
3.
This work is concerned with the extension of the Jacobi spectral Galerkin method to a class of nonlinear fractional pantograph differential equations. First, the fractional differential equation is converted to a nonlinear Volterra integral equation with weakly singular kernel. Second, we analyze the existence and uniqueness of solutions for the obtained integral equation. Then, the Galerkin method is used for solving the equivalent integral equation. The error estimates for the proposed method are also investigated. Finally, illustrative examples are presented to confirm our theoretical analysis. 相似文献
4.
The purpose of this article is to investigate high‐order numerical approximations of scalar conservation laws with nonlocal viscous term. The viscous term is given in the form of convolution in space variable. With the help of the characteristic of viscous term, we design a semidiscrete local discontinuous Galerkin (LDG) method to solve the nonlocal model. We prove stability and convergence of semidiscrete LDG method in L2 norm. The theoretical analysis reveals that the present numerical scheme is stable with optimal convergence order for the linear case, and it is stable with sub‐optimal convergence order for nonlinear case. To demonstrate the validity and accuracy of our scheme, we test the Burgers equation with two typical nonlocal fractional viscous terms. The numerical results show the convergence order accuracy in space for both linear and nonlinear cases. Some numerical simulations are provided to show the robustness and effectiveness of the present numerical scheme. 相似文献
5.
《Stochastic Processes and their Applications》2020,130(6):3753-3801
We analyse convergence of a micro–macro acceleration method for the simulation of stochastic differential equations with time-scale separation. The method alternates short bursts of path simulations with the extrapolation of macroscopic state variables forward in time. After extrapolation, a new microscopic state is constructed, consistent with the extrapolated macroscopic state, that minimises the perturbation caused by the extrapolation in a relative entropy sense. We study local errors and numerical stability of the method to prove its convergence to the full microscopic dynamics when the extrapolation time step tends to zero and the number of macroscopic state variables tends to infinity. 相似文献
6.
7.
In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice. 相似文献
8.
计算流体力学(computational fluid dynamics,CFD)数值模拟在航空航天等领域发挥越来越重要的作用,然而CFD数值模拟结果的可信度仍然需要通过不断地验证与确认来提高.本文给出了从制造解精度测试、简单到复杂外形湍流模拟网格收敛性研究等三个方面开展CFD软件验证与确认的方法,并对自主研发的CFD软件平台HyperFLOW在非结构网格上模拟亚跨声速湍流问题的能力进行了验证与确认.首先通过基于Euler方程和标量扩散方程的制造解精度测试,分别验证了HyperFLOW在非结构网格上对Euler方程和黏性项的求解精度,结果表明其能够在任意非结构网格上达到设计的二阶精度. 其次,通过NASATurbulence Modeling Resource中的湍流平板、二维翼型近尾迹流动、二维Bump等几个典型的亚声速湍流算例的网格收敛性研究,量化考察了数值结果的观测精度阶和网格收敛性指数,并与国外知名CFD解算器CFL3D,FUN3D的计算结果进行了对比,验证了HyperFLOW对简单湍流问题的模拟能力,且具有良好的网格收敛性和计算精度(阶). 最后,通过NASA CommonResearchModel标模定升力系数的网格收敛性研究和升阻极曲线预测,验证了软件在复杂外形亚跨声速湍流流动数值模拟中也具有良好的可信度. 相似文献
9.
Dahui Luo JinRong Wang Dong Shen 《Mathematical Methods in the Applied Sciences》2019,42(13):4543-4553
This paper considers the consensus tacking problem for nonlinear fractional‐order multiagent systems by presenting a PDα‐type iterative learning control update law with initial learning mechanisms. The asymptotical convergence of the proposed distributed learning algorithm is strictly proved by using the properties of fractional calculus. A sufficient condition is derived to guarantee the whole multiagent system achieving an asymptotic output consensus. An illustrative example is given to verify the theoretical results. 相似文献
10.
ABSTRACTIn this paper, we investigate the problem of finding a common solution to a fixed point problem involving demi-contractive operator and a variational inequality with monotone and Lipschitz continuous mapping in real Hilbert spaces. Inspired by the projection and contraction method and the hybrid descent approximation method, a new and efficient iterative method for solving the problem is introduced. Strong convergence theorem of the proposed method is established under standard and mild conditions. Our scheme generalizes and extends some of the existing results in the literature, and moreover, its computational effort is less per each iteration compared with related works. 相似文献