On the computation of nonhyperbolic fixed points.
Graça, Mário M. (2002)
Experimental Mathematics
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Graça, Mário M. (2002)
Experimental Mathematics
Similarity:
László, Lajos (2005)
Mathematica Pannonica
Similarity:
Kyurkchiev, Nikolay, Iliev, Anton (2009)
Serdica Journal of Computing
Similarity:
This paper is partially supported by project ISM-4 of Department for Scientific Research, “Paisii Hilendarski” University of Plovdiv. In this paper we give methodological survey of “contemporary methods” for solving the nonlinear equation f(x) = 0. The reason for this review is that many authors in present days rediscovered such classical methods. Here we develop one methodological schema for constructing nonstationary methods with a preliminary chosen speed of convergence. ...
Bartoň, Stanislav
Similarity:
Linearized Gauss-Newton iteration method is used to determine main axes of the three-dimensional ellipsoid approximating a peach. Three independent photos displaying the peach as ground, side, and front view are used as data sources. System MAPLE 11 was used as a computer environment. A practical example is presented in order to demonstrate the usage of all required commands. The quality of approximation is evaluated as a final part of the paper.
Ioannis K. Argyros (1988)
Mathematica Slovaca
Similarity:
S. L. Singh, J. H. M. Whitfield (1988)
Colloquium Mathematicae
Similarity:
Laureano F. Escudero (1982)
Qüestiió
Similarity:
We present an algorithm for supra-scale linearly constrained nonlinear programming (LNCP) based on the Limited-Storage Quasi-Newton's method. In large-scale programming solving the reduced Newton equation at each iteration can be expensive and may not be justified when far from a local solution; besides, the amount of storage required by the reduced Hessian matrix, and even the computing time for its Quasi-Newton approximation, may be prohibitive. An alternative based on the reduced...