Recently, we have proposed a technique for the computation of periodic orbits in molecular systems, based on the characteristic bisection method [Vrahatis et al., Comput. Phys. Commun. 138 (2001) 53]. The main advantage of the characteristic bisection method is that it converges with certainty within a given starting rectangular region. In this paper we further improve this technique by applyin...

Let K be a subset of a real normed linear space E and let T be a self-mapping on K . T is said to be nonexpansive provided ‖Tx−Ty‖ ‖x− y‖ for all x, y ∈ K . Fixed-point iteration process for nonexpansive mappings in Banach spaces including Mann and Ishikawa iteration processes has been studied extensively by many authors to solve the nonlinear operator equations in Hilbert spaces and Banach spa...

We consider optimal transport-based distributionally robust optimization (DRO) problems with locally strongly convex transport cost functions and affine decision rules. Under conventional convexity assumptions on the underlying loss function, we obtain structural results about value policy, worst-case adversarial model. These expose a rich structure embedded in DRO problem (e.g., strong even if...

This paper is concerned with the existence of monotone positive solutions for an elastic beam equation with nonlinear boundary conditions. By applying monotone iteration method, we not only obtain the existence of monotone positive solutions but also establish iterative schemes for approximating the solutions. It is worth mentioning that these iterative schemes start offwith zero function or qu...

We demonstrate that some recently proposed iterative identiication and control design schemes do not necessarily converge to a local minimum of the design objective in the case of a restricted complexity model. There is, however, a link between these approaches and a recently proposed iterative optimization based control design procedure based on experimental data. We show that if the achieved ...

The construction of some without memory efficient sixth-order iterative schemes for solving univariate nonlinear equations is presented. Per iteration, the novel methods comprise four evaluations of the function, while they are free from derivative calculations. The application of such iterative methods is appeared, when the cost of derivative evaluation is expensive. We analytically show the s...

Predicate encryption is a new paradigm of public key encryption that enables searches on encrypted data. Using the predicate encryption, we can search keywords or attributes on encrypted data without decrypting the ciphertexts. In predicate encryption, a ciphertext is associated with attributes and a token corresponds to a predicate. The token that corresponds to a predicate f can decrypt the c...

Blind-detection is a desirable characteristic of watermarking schemes so that embedded payloads can be readily extracted without referencing original cover works. However, most blind-detection watermarking methods, like the famous spread-spectrum approach, suffer from inherent performance loss caused by host-interference. In this manuscript, an iterative informed-embedding spreadspectrum approa...

The aim of this article is to introduce a new iterative scheme namely CR iterative scheme with errors and prove a general convergence theorem to approximate the unique common fixed point of three operators satisfying a certain contractive condition in an arbitrary Banach space using this newly introduced iterative scheme. An example showing the validity of our results is provided. Comparative a...