全文获取类型
收费全文 | 382篇 |
免费 | 18篇 |
国内免费 | 25篇 |
专业分类
化学 | 16篇 |
力学 | 17篇 |
综合类 | 4篇 |
数学 | 367篇 |
物理学 | 21篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2018年 | 10篇 |
2017年 | 7篇 |
2016年 | 8篇 |
2015年 | 4篇 |
2014年 | 8篇 |
2013年 | 37篇 |
2012年 | 13篇 |
2011年 | 21篇 |
2010年 | 16篇 |
2009年 | 32篇 |
2008年 | 21篇 |
2007年 | 28篇 |
2006年 | 23篇 |
2005年 | 28篇 |
2004年 | 13篇 |
2003年 | 16篇 |
2002年 | 14篇 |
2001年 | 18篇 |
2000年 | 11篇 |
1999年 | 10篇 |
1998年 | 14篇 |
1997年 | 9篇 |
1996年 | 9篇 |
1995年 | 11篇 |
1994年 | 5篇 |
1993年 | 9篇 |
1990年 | 5篇 |
1989年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1979年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有425条查询结果,搜索用时 15 毫秒
1.
Greg Orosi 《商业与工业应用随机模型》2015,31(4):515-527
In this work, we suggest a novel quadratic programming‐based algorithm to generate an arbitrage‐free call option surface. The empirical performance of the proposed method is evaluated using S&P 500 Index call options. Our results indicate that the proposed method provides a more precise fit to observed option prices than other alternative methodologies. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
2.
In this paper, we use parametric quintic splines to derive some consistency relations which are then used to develop a numerical method for computing the solution of a system of fourth-order boundary-value problems associated with obstacle, unilateral, and contact problems. It is known that a class of variational inequalities related to contact problems in elastostatics can be characterized by a sequence of variational inequations, which are solved using some numerical method. Numerical evidence is presented to show the applicability and superiority of the new method over other collocation, finite difference, and spline methods. 相似文献
3.
Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation 总被引:2,自引:0,他引:2
Scattered data collected at sample points may be used to determine simple functions to best fit the data. An ideal choice for these simple functions is bivariate splines. Triangulation of the sample points creates partitions over which the bivariate splines may be defined. But the optimality of the approximation is dependent on the choice of triangulation. An algorithm, referred to as an Edge Swapping Algorithm, has been developed to transform an arbitrary triangulation of the sample points into an optimal triangulation for representation of the scattered data. A Matlab package has been completed that implements this algorithm for any triangulation on a given set of sample points. 相似文献
4.
Marie-Laurence Mazure 《Advances in Computational Mathematics》2007,26(1-3):305-322
In order to ensure existence of a de Boor algorithm (hence of a B-spline basis) in a given spline space with (n+1)-dimensional sections, it is important to be able to generate each spline by restriction to the diagonal of a symmetric function of n variables supposed to be pseudoaffine w.r. to each variable. We proved that a way to obtain these three properties (symmetry, n-pseudoaffinity, diagonal property) is to suppose the existence of blossoms on the set of admissible n-tuples, given that blossoms are defined in a geometric way by means of intersections of osculating flats. In the present paper, we examine the converse: do symmetry, n-pseudoaffinity, and diagonal property imply existence of blossoms? 相似文献
5.
We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature. 相似文献
6.
The paper addresses bivariate surface fitting problems, where data points lie on the vertices of a rectangular grid. Efficient
and stable algorithms can be found in the literature to solve such problems. If data values are missing at some grid points,
there exists a computational method for finding a least squares spline by fixing appropriate values for the missing data.
We extended this technique to arbitrary least squares problems as well as to linear least squares problems with linear equality
constraints. Numerical examples are given to show the effectiveness of the technique presented.
AMS subject classification (2000) 65D05, 65D07, 65D10, 65F05, 65F20 相似文献
7.
Polyharmonic splines are used to interpolate data in a stationary multilevel iterative refinement scheme. By using such functions the necessary tools are provided to obtain simple pointwise error bounds on the approximation. Linear convergence between levels is shown for regular data on a scaled multiinteger grid, and a multilevel domain decomposition method. 相似文献
8.
The solvability of a class of forward-backward stochastic differential equations (SDEs for short) over an arbitrarily prescribed time duration is studied. The authors design a stochastic relaxed control problem, with both drift and difftusion all being controlled, so that the solvability problem is converted to a problem of finding the nodal set of the viscosity solution to a certain Hamilton-Jacobi-Bellman equation. This method overcomes the fatal difficulty encountered in the traditional contraction mapping approach to the existence theorem of such SDEs. 相似文献
9.
A numerical method based on cubic splines with nonuniform grid is given for singularly-perturbed nonlinear two-point boundary-value problems. The original nonlinear equation is linearized using quasilinearization. Difference schemes are derived for the linear case using a variable-mesh cubic spline and are used to solve each linear equation obtained via quasilinearization. Second-order uniform convergence is achieved. Numerical examples are given in support of the theoretical results. 相似文献
10.
The computation ofL
1 smoothing splines on large data sets is often desirable, but computationally infeasible. A locally weighted, LAD smoothing spline based smoother is suggested, and preliminary results will be discussed. Specifically, one can seek smoothing splines in the spacesW
m
(D), with [0, 1]
n
D. We assume data of the formy
i
=f(t
i
)+
i
,i=1,..., N with {t
i
}
i=1
N
D, the
i
are errors withE(
i
)=0, andf is assumed to be inW
m
. An LAD smoothing spline is the solution,s
, of the following optimization problem
相似文献 |