Simulation study of random sequential adsorption of mixtures on a triangular lattice

Random sequential adsorption of binary mixtures of extended objects on a two-dimensional triangular lattice is studied numerically by means of Monte Carlo simulations. The depositing objects are formed by self-avoiding random walks on the lattice. We concentrate here on the influence of the symmetry properties of the shapes on the kinetics of the deposition processes in two-component mixtures. Approach to the jamming limit in the case of mixtures is found to be exponential, of the form: $\theta(t) \sim \theta_{jam}-\Delta\theta \exp (-t/\sigma),$ and the values of the parameter $\sigma$ are determined by the order of symmetry of the less symmetric object in the mixture. Depending on the local geometry of the objects making the mixture, jamming coverage of a mixture can be either greater than both single-component jamming coverages or it can be in between these values. Results of the simulations for various fractional concentrations of the objects in the mixture are also presented.Comment: 11 figures, 2 table

Effective partitioning method for computing weighted Moore-Penrose inverse

We introduce a method and an algorithm for computing the weighted Moore-Penrose inverse of multiple-variable polynomial matrix and the related algorithm which is appropriated for sparse polynomial matrices. These methods and algorithms are generalizations of algorithms developed in [M.B. Tasic, P.S. Stanimirovic, M.D. Petkovic, Symbolic computation of weighted Moore-Penrose inverse using partitioning method, Appl. Math. Comput. 189 (2007) 615-640] to multiple-variable rational and polynomial matrices and improvements of these algorithms on sparse matrices. Also, these methods are generalizations of the partitioning method for computing the Moore-Penrose inverse of rational and polynomial matrices introduced in [P.S. Stanimirovic, M.B. Tasic, Partitioning method for rational and polynomial matrices, Appl. Math. Comput. 155 (2004) 137-163; M.D. Petkovic, P.S. Stanimirovic, Symbolic computation of the Moore-Penrose inverse using partitioning method, Internat. J. Comput. Math. 82 (2005) 355-367] to the case of weighted Moore-Penrose inverse. Algorithms are implemented in the symbolic computational package MATHEMATICA

Ferromagnetic resonance with a magnetic Josephson junction

We show experimentally and theoretically that there is a coupling via the Aharonov-Bohm phase between the order parameter of a ferromagnet and a singlet, s-wave, Josephson supercurrent. We have investigated the possibility of measuring the dispersion of such spin waves by varying the magnetic field applied in the plane of the junction and demonstrated the electromagnetic nature of the coupling by the observation of magnetic resonance side-bands to microwave induced Shapiro steps.Comment: 6 pages, 5 figure

A family of simultaneous zero-finding methods

AbstractApplying Hansen-Patrick's formula for solving the single equation f(z) = 0 to a suitable function appearing in the classical Weierstrass' method, two one-parameter families of interation functions for the simultaneous approximation of all simple and multiple zeros of a polynomial are derived. It is shown that all the methods of these families have fourth-order of convergence. Some computational aspects of the proposed methods and numerical examples are given

An inequality for the Lebesgue measure and its further applications

In [Univ. Beograd Publ. Elektrotehn. Fak. Ser. Math. 15 (2004), 85-86], the first author of this paper proved a new inequality for the Lebesgue measure and gave some applications. Here, we present a new application of this inequality.

An inequality for the Lebesgue measure and its further applications

In [Univ. Beograd Publ. Elektrotehn. Fak. Ser. Math. 15 (2004), 85-86], the first author of this paper proved a new inequality for the Lebesgue measure and gave some applications. Here, we present a new application of this inequality.

Some improved inclusion methods for polynomial roots with Weierstrass' corrections

AbstractOne decade ago, the third order method without derivatives for the simultaneous inclusion of simple zeros of a polynomial was proposed in [1]. Following Nourein's idea [2], some modifications of this method with the increased convergence are proposed. The acceleration of convergence is attained by using Weierstrass' corrections without additional calculations, which provides a high computational efficiency of the modified methods. It is proved that their R-orders of convergence are asymptotically greater than 3.5. The presented interval methods are realized in circular complex arithmetic