共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
3.
4.
5.
《国际计算机数学杂志》2012,89(9):1603-1611
In this paper, we present some new families of Newton-type iterative methods, in which f′(x)=0 is permitted at some points. The presented approach of deriving these iterative methods is different. They have well-known geometric interpretation and admit their geometric derivation from an exponential fitted osculating parabola. Cubically convergent methods require the use of the first and second derivatives of the function as Euler's, Halley's, Chebyshev's and other classical methods do. Furthermore, new classes of third-order multipoint iterative methods free from second derivative are derived by semi-discrete modifications of cubically convergent iterative methods. Further, the approach has been extended to solve a system of non-linear equations. 相似文献
6.
7.
8.
《Optimization methods & software》2012,27(2):275-294
In this paper, we introduce data structures for storing the third derivative (tensor) of a multivariate scalar function when the second and third derivatives of the function are sparse. We consider solving unconstrained optimization problems using methods of the Halley class. The gradient, Hessian matrix and the tensor of the objective function are required for the methods and they have a third-order rate of convergence. However, these methods require the solution of two linear systems of equations at each iteration. Solving the linear systems using a factorization will cause fill-ins. The impact of these fill-ins will be discussed and we give the number of arithmetic operations of the methods of the Halley class compared to Newton's method. Finally, we will give some preliminary numerical results showing that including the time to compute the derivatives, the ratios of elapsed time of methods in the Halley class and Newton's method are close to the ratios of arithmetic operations. 相似文献
9.
PETER TURNEY 《国际通用系统杂志》2013,42(4):307-318
G. Spencer Brown's book Laws of Form informally presents three distinct logical systems. The third system is interpreted here through Alonzo Church's restricted recursive arithmetic. Restricted recursive arithmetic was introduced by Church in 1955 as the first formal system capturing finite automata. It is suggested that this interpretation is closer to Spencer Brown's original ideas than the interpretation with three-valued logic given by Francisco Varela. 相似文献
10.
The most complete proteome of human lenses has been compiled using 2-D LC-MS/MS analysis of foetal, aged normal and advanced nuclear cataract lenses. A total of 231 proteins were identified across all lens groups, including 112 proteins that have not been reported previously. Proteins were grouped according to their PANTHER molecular function classification in order to facilitate comparisons. Previously unreported N-terminal acetylation was detected in a number of proteins, with the majority being associated with the prior removal of a methionine residue. This pattern of proteolysis may indicate that methionine aminopeptidase activity is present in human lenses. Acetylation is likely to aid in the stability of proteins that are present in the lens for many decades. Protein sequences were also used to interrogate the three human lens cDNA libraries publicly available. Surprisingly, 84 proteins we identified were not present in the cDNA libraries. 相似文献
11.
介绍一种计算机辅助评估儿童急性淋巴细胞白血病预后的新方法,并对该方法的原理及主要步骤进行了详细阐述和分析.通过检验,所得结果与医务人员的结论一致,证明了该方法的可行性. 相似文献
12.
13.
14.
15.
16.
Damien Stehlé 《Cryptologia》2013,37(4):341-357
In 1953, the celebrated mathematician John Edensor Littlewood described a stream cipher based on logarithm tables. Fifty years later, we propose the first analysis of his scheme. Littlewood suggests the idea of using real functions as tools to build cryptographic primitives. Even when considering modern security parameters, the original scheme can be broken by a simple attack based on differentiation. We generalize the scheme such that it resists this attack, but describe another attack which is derived from both polynomial approximation and Coppersmith's technique to find the small roots of modular multivariate polynomials. In contrast with these negative results we describe a candidate for a very efficient one-way function and present an open problem based on this work. 相似文献
17.
G. Spencer Brown's book Laws of Form has been enjoying a vogue among social and biological scientists. Proponents claim that the book introduces a new logic ideally suited to their fields of study, and that the new logic solves the problems of self-reference. These claims are false. We show that Brown's system is Boolean algebra in an obscure notation, and that his “solutions” to the problems of self-reference are based on a misunderstanding of Russell's paradox. 相似文献
18.
19.
《国际计算机数学杂志》2012,89(2):253-267
We consider the interior Dirichlet problem for Laplace's equation on a non-simply connected two-dimensional regions with smooth boundaries.The solution is sought as the real part of a holomorphic function on the region, given as Cauchy-type integral.The approximate double layer density function is found by solving a system of Fredholm integral equations of second kind.Because of the non-uniqueness of the solution of the system we solve it using a technique based on the solution of the “Modified Dirichlet problem”.The Nystrom's method coupled with the trapezoidal rule is used as numerical integration scheme.The linear system derived from the integral equation is solved using the conjugate gradient applied to the normal equation.Theoretical and computational details of the method are presented. 相似文献
20.
《国际计算机数学杂志》2012,89(2):408-422
In this paper, we present many new fourth-order optimal families of Jarratt's method and Ostrowski's method for computing simple roots of nonlinear equations numerically. The proposed families of Jarratt's method having the same scaling factor of functions as that of Jarratt's method (i.e. quadratic scaling factor of functions in the numerator and denominator of the correction factor) are the main finding of this paper. It is observed that the body structures of our proposed families of Jarratt's method are simpler than those of the original families of Jarratt's method. The efficiency of these methods is tested on a number of relevant numerical problems. Furthermore, numerical examples suggest that each member of the proposed families can be competitive to other similar robust methods available in the literature. 相似文献