Vectorized algorithms for quadtree construction and descent

This paper presents vectorized methods of construction and descent of quadtrees that can be easily adapted to message passing parallel computing. A time complexity analysis for the present approach is also discussed. The proposed method of tree construction requires a hash table to index nodes of a linear quadtree in the breadth-first order. The hash is performed in two steps: an internal hash to index child nodes and an external hash to index nodes in the same level (depth). The quadtree descent is performed by considering each level as a vector segment of a linear quadtree, so that nodes of the same level can be processed concurrently. © 2012 Springer-Verlag.

Gaussian quadrature rules with simple node-weight relations

In this paper, we consider the symmetric Gaussian and L-Gaussian quadrature rules associated with twin periodic recurrence relations with possible variations in the initial coefficient. We show that the weights of the associated Gaussian quadrature rules can be given as rational functions in terms of the corresponding nodes where the numerators and denominators are polynomials of degree at most 4. We also show that the weights of the associated L-Gaussian quadrature rules can be given as rational functions in terms of the corresponding nodes where the numerators and denominators are polynomials of degree at most 5. Special cases of these quadrature rules are given. Finally, an easy to implement procedure for the evaluation of the nodes is described.

Fortran programs for the time-dependent Gross-Pitaevskii equation in a fully anisotropic trap

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Modified Chebyshev algorithm: some applications

Two applications of the modified Chebyshev algorithm are considered. The first application deals with the generation of orthogonal polynomials associated with a weight function having singularities on or near the end points of the interval of orthogonality. The other application involves the generation of real Szego polynomials.

Conjectures and theorems in the theory of entire functions

Motivated by the recent solution of Karlin's conjecture, properties of functions in the Laguerre-Polya class are investigated. The main result of this paper establishes new moment inequalities fur a class of entire functions represented by Fourier transforms. The paper concludes with several conjectures and open problems involving the Laguerre-Polya class and the Riemann xi -function.

Orthogonal polynomials associated with related measures and Sobolev orthogonal polynomials

Connection between two sequences of orthogonal polynomials, where the associated measures are related to each other by a first degree polynomial multiplication (or division), are looked at. The results are applied to obtain information regarding Sobolev orthogonal polynomials associated with certain pairs of measures.

Using GPU to exploit parallelism on cryptography

In this article we explore the NVIDIA graphical processing units (GPU) computational power in cryptography using CUDA (Compute Unified Device Architecture) technology. CUDA makes the general purpose computing easy using the parallel processing presents in GPUs. To do this, the NVIDIA GPUs architectures and CUDA are presented, besides cryptography concepts. Furthermore, we do the comparison between the versions executed in CPU with the parallel version of the cryptography algorithms Advanced Encryption Standard (AES) and Message-digest Algorithm 5 (MD5) wrote in CUDA. © 2011 AISTI.

Nebular gas drag and planetary accretion with eccentric high-mass planets

Aims.We investigate the dynamics of pebbles immersed in a gas disk interacting with a planet on an eccentric orbit. The model has a prescribed gap in the disk around the location of the planetary orbit, as is expected for a giant planet with a mass in the range of 0.1-1 Jupiter masses. The pebbles with sizes in the range of 1 cm to 3 m are placed in a ring outside of the giant planet orbit at distances between 10 and 30 planetary Hill radii. The process of the accumulation of pebbles closer to the gap edge, its possible implication for the planetary accretion, and the importance of the mass and the eccentricity of the planet in this process are the motivations behind the present contribution. Methods. We used the Bulirsch-Stoer numerical algorithm, which is computationally consistent for close approaches, to integrate the Newtonian equations of the planar (2D), elliptical restricted three-body problem. The angular velocity of the gas disk was determined by the appropriate balance between the gravity, centrifugal, and pressure forces, such that it is sub-Keplerian in regions with a negative radial pressure gradient and super-Keplerian where the radial pressure gradient is positive. Results. The results show that there are no trappings in the 1:1 resonance around the L 4 and L5 Lagrangian points for very low planetary eccentricities (e2 < 0.07). The trappings in exterior resonances, in the majority of cases, are because the angular velocity of the disk is super-Keplerian in the gap disk outside of the planetary orbit and because the inward drift is stopped. Furthermore, the semi-major axis location of such trappings depends on the gas pressure profile of the gap (depth) and is a = 1.2 for a planet of 1 MJ. A planet on an eccentric orbit interacts with the pebble layer formed by these resonances. Collisions occur and become important for planetary eccentricity near the present value of Jupiter (e 2 = 0.05). The maximum rate of the collisions onto a planet of 0.1 MJ occurs when the pebble size is 37.5 cm ≤ s < 75 cm; for a planet with the mass of Jupiter, it is15 cm ≤ s < 30 cm. The accretion stops when the pebble size is less than 2 cm and the gas drag dominates the motion. © 2013 ESO.

ISW effect through dark energy quintessence and ΛCDM models

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Inequalities for zeros of Jacobi polynomials via Sturm's theorem: Gautschi's conjectures

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Predição de sítios de ligação para a cisplatina e transplatina baseada em ligações de hidrogênio

Pós-graduação em Biofísica Molecular - IBILCE

Bounds for the zeros of symmetric kravchuk polynomials

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Influence of nonlinear stiffness on the dynamics of a slender elastic beam under torsional oscillations

This study focuses on analysing the effects of nonlinear torsional stiffness on the dynam-ics of a slender elastic beam under torsional oscillations, which can be subject to helical buckling.The helical buckling of an elastic beam confined in a cylinder is relevant to many applications. Someexamples include oil drilling, medical cateters and even the conformation and functioning of DNAmolecules. A recent study showed that the formation of the helical configuration is a result of onlythe torsional load, confirming that there is a different path to helical buckling which is not related tothe sinusoidal buckling, stressing the importance of the geometrical behaviour of the beam. A lowdimensional model of an elastic beam under torsional oscillations is used to analyse its dynamical be-haviour with different stiffness characteristics, which are present before and after the helical buckling.Hardening and softening characteristics are present, as the effects of torsion and bending are coupled.With the use of numerical algorithms applied to nonlinear dynamics, such as bifurcation diagramsand basins of attraction, it is shown that the nonlinear stiffness can shift the bifurcations and inducechanges in the stability of the desirable and undesirable solutions. Therefore, the proper modellingof these stiffness nonlinearities seems to be important for a better understanding of the dynamicalbehaviour of such beams.

Discovering promising regions to help global numerical optimization algorithms

We have developed an algorithm using a Design of Experiments technique for reduction of search-space in global optimization problems. Our approach is called Domain Optimization Algorithm. This approach can efficiently eliminate search-space regions with low probability of containing a global optimum. The Domain Optimization Algorithm approach is based on eliminating non-promising search-space regions, which are identifyed using simple models (linear) fitted to the data. Then, we run a global optimization algorithm starting its population inside the promising region. The proposed approach with this heuristic criterion of population initialization has shown relevant results for tests using hard benchmark functions.

Using Threads to Overcome Synchronization Delays in Parallel Multiple Progressive Alignment Algorithms

Sao Paulo State Research Foundation-FAPESP