نتایج جستجو برای: flow polynomial

تعداد نتایج: 576526  

2006
Ian Melbourne

We show that polynomial decay of correlations is prevalent for a class of nonuniformly hyperbolic flows. These flows are the continuous time analogue of a class of nonuniformly hyperbolic diffeomorphisms for which Young proved polynomial decay of correlations. Roughly speaking, in situations where the decay rate O(1/nβ) has previously been proved for diffeomorphisms, we establish the decay rate...

2009
T.Bella V.Olshevsky

We use the language of signal flow graph representation of digital filter structures to solve three purely mathematical problems, including fast inversion of certain polynomial–Vandermonde matrices, deriving an analogue of the Horner and Clenshaw rules for polynomial evaluation in a (H, m)–quasiseparable basis, and computation of eigenvectors of (H, m)– quasiseparable classes of matrices. While...

Journal: :transactions on combinatorics 2012
saeid alikhani mohammad hossein reyhani

let $g$ be a simple graph of order $n$‎. ‎we consider the‎ ‎independence polynomial and the domination polynomial of a graph‎ ‎$g$‎. ‎the value of a graph polynomial at a specific point can give‎ ‎sometimes a very surprising information about the structure of the‎ ‎graph‎. ‎in this paper we investigate independence and domination‎ ‎polynomial at $-1$ and $1$‎.

2008
Zixiang Zhou

Binary symmetry constraints of the N -wave interaction equations in 1 + 1 and 2 + 1 dimensions are proposed to reduce the N -wave interaction equations into finite-dimensional Liouville integrable systems. A new involutive and functionally independent system of polynomial functions is generated from an arbitrary order square matrix Lax operator and used to show the Liouville integrability of th...

H. Banikhademi H. Salehi Fathabadi

Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...

Journal: :bulletin of the iranian mathematical society 2013
c. brennan t. mansour e. mphako-banda

we find an explicit expression of the tutte polynomial of an $n$-fan. we also find a formula of the tutte polynomial of an $n$-wheel in terms of the tutte polynomial of $n$-fans. finally, we give an alternative expression of the tutte polynomial of an $n$-wheel and then prove the explicit formula for the tutte polynomial of an $n$-wheel.

Journal: :Theor. Comput. Sci. 2009
Franz-Josef Brandenburg Mao-cheng Cai

We introduce networks with additive losses and gains on the arcs. If a positive flow of x units enter an arc a, then x + g(a) units exit. Arcs may increase or consume flow, i.e., they are gainy or lossy. Such networks have various applications, e.g., in financial analysis, transportation, and data communication. Problems in such networks are generally intractable. In particular, the shortest pa...

Journal: :Philosophical transactions. Series A, Mathematical, physical, and engineering sciences 2011
Silvia Lorenzani

In the present paper, we provide an analytical expression for the first- and second-order velocity slip coefficients by means of a variational technique that applies to the integrodifferential form of the Boltzmann equation based on the true linearized collision operator and the Cercignani-Lampis scattering kernel of the gas-surface interaction. The polynomial form of the Knudsen number obtaine...

2012
Pawan Tamta B. P. Pande H. S. Dhami R. K. Ahuja T. L. Magnanti G. G. Brown M. W. Carlyle J. Salmerón C. Burch R. D. Carr M. Marathe C. A. Phillips R. L. Church M. P. Scaparra K. J. Cormican D. P. Morton T. E. Harris F. S. Ross H. D. Ratliff G. T. Sicilia

We develop an algorithm which reduces the arbitrary instance of the network flow problem to a simple path disjoint network in polynomial time. Then the flow in each path is taken as the minimum of the arc capacities of that path from where the flow in each arc can be easily determined. The polynomial time algorithm can determine any instance of the network flow problem faster than the previousl...

Abstract In this research, a radial basis function artificial neural network (RBF-ANN) model was developed to predict the hot deformation flow curves of API X65 pipeline steel. The results of the developed model was compared with the results of a new phenomenological model that has recently been developed based on a power function of Zener-Hollomon parameter and a third order polynomial functio...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید