257 resultados para Polynomials.
Resumo:
We carry out a numerical and analytic analysis of the Yang-Lee zeros of the ID Blume-Capel model with periodic boundary conditions and its generalization on Feynman diagrams for which we include sums over all connected and nonconnected rings for a given number of spins. In both cases, for a specific range of the parameters, the zeros originally on the unit circle are shown to depart from it as we increase the temperature beyond some limit. The curve of zeros can bifurcate- and become two disjoint arcs as in the 2D case. We also show that in the thermodynamic limit the zeros of both Blume-Capel models on the static (connected ring) and on the dynamical (Feynman diagrams) lattice tend to overlap. In the special case of the 1D Ising model on Feynman diagrams we can prove for arbitrary number of spins that the Yang-Lee zeros must be on the unit circle. The proof is based on a property of the zeros of Legendre polynomials.
Resumo:
In the present work, we expanded the study done by Solorzanol(1) including the eccentricity of the perturbing body. The assumptions used to develop the single-averaged analytical model are the same ones of the restricted elliptic three-body problem. The disturbing function was expanded in Legendre polynomials up to fourth-order. After that, the equations of motion are obtained from the planetary equations and we performed a set of numerical simulations. Different initial eccentricities for the perturbing and perturbed body are considered. The results obtained perform an analysis of the stability of a near-circular orbits and investigate under which conditions this orbit remain near-circular.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
We prove a relation between two different types of symmetric quadrature rules, where one of the types is the classical symmetric interpolatory quadrature rules. Some applications of a new quadrature rule which was obtained through this relation are also considered.
Resumo:
Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.
Resumo:
A simple procedure to obtain complete, closed expressions for Lie algebra invariants is presented. The invariants are ultimately polynomials in the group parameters. The construction of finite group elements requires the use of projectors, whose coefficients are invariant polynomials. The detailed general forms of these projectors are given. Closed expressions for finite Lorentz transformations, both homogeneous and inhomogeneous, as well as for Galilei transformations, are found as examples.
Resumo:
The main purpose of this paper is to investigate theoretically and experimentally the use of family of Polynomial Powers of the Sigmoid (PPS) Function Networks applied in speech signal representation and function approximation. This paper carries out practical investigations in terms of approximation fitness (LSE), time consuming (CPU Time), computational complexity (FLOP) and representation power (Number of Activation Function) for different PPS activation functions. We expected that different activation functions can provide performance variations and further investigations will guide us towards a class of mappings associating the best activation function to solve a class of problems under certain criteria.
Resumo:
The polynomials occurring in the wave functions of hydrogenic excited states are found to present difficulties for a straightforward analytical approach to the study of associated information entropies. A method is suggested to deal with them. It is then applied to calculate the information entropy for the Jacobi polynomial. A model calculation is presented to examine the effect of screening on the entropy sum. It is seen that the sum does not depend on the choice of screening.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
The celebrated Turân inequalities P 2 n(x)-P n-x(x)P n+1(x) ≥ 0, x ε[-1,1], n ≥ 1, where P n(x) denotes the Legendre polynomial of degree n, are extended to inequalities for sums of products of four classical orthogonal polynomials. The proof is based on an extension of the inequalities γ 2 n - γ n-1γ n+1 ≥ 0, n ≥ 1, which hold for the Maclaurin coefficients of the real entire function ψ in the Laguerre-Pölya class, ψ(x) = ∑ ∞ n=0 γ nx n / n!. ©1998 American Mathematical Society.
Efeitos Ambientais sobre Ganho de Peso no Período do Nascimento ao Desmame em Bovinos da Raça Nelore
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.
Resumo:
We consider interpolatory quadrature rules with nodes and weights satisfying symmetric properties in terms of the division operator. Information concerning these quadrature rules is obtained using a transformation that exists between these rules and classical symmetric interpolatory quadrature rules. In particular, we study those interpolatory quadrature rules with two fixed nodes. We obtain specific examples of such quadrature rules.