Search results for "difference"
showing 10 items of 1534 documents
On Coloring Unit Disk Graphs
1998
In this paper the coloring problem for unit disk (UD) graphs is considered. UD graphs are the intersection graphs of equal-sized disks in the plane. Colorings of UD graphs arise in the study of channel assignment problems in broadcast networks. Improving on a result of Clark et al. [2] it is shown that the coloring problem for UD graphs remains NP-complete for any fixed number of colors k≥ 3 . Furthermore, a new 3-approximation algorithm for the problem is presented which is based on network flow and matching techniques.
On the hardness of optimization in power-law graphs
2008
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks appear to exhibit a power-law distribution: the number of nodes y"i of a given degree i is proportional to i^-^@b where @b>0 is a constant that depends on the application domain. There is practical evidence that combinatorial optimization in power-law graphs is easier than in general graphs, prompting the basic theoretical question: Is combinatorial optimization in power-law graphs easy? Does the answer depend on the power-law exponent @b? Our main result is the proof that many classical NP-hard graph-theoretic optimizati…
Factorization of absolutely continuous polynomials
2013
In this paper we study the ideal of dominated (p,s)-continuous polynomials, that extend the nowadays well known ideal of p-dominated polynomials to the more general setting of the interpolated ideals of polynomials. We give the polynomial version of Pietsch s factorization Theorem for this new ideal. Our factorization theorem requires new techniques inspired in the theory of Banach lattices.
Factorization of (q,p)-summing polynomials through Lorentz spaces
2017
[EN] We present a vector valued duality between factorable (q,p)-summing polynomials and (q,p)-summing linear operators on symmetric tensor products of Banach spaces. Several applications are provided. First, we prove a polynomial characterization of cotype of Banach spaces. We also give a variant of Pisier's factorization through Lorentz spaces of factorable (q,p)-summing polynomials from C(K)-spaces. Finally, we show a coincidence result for (q,p)-concave polynomials.(c) 2016 Elsevier Inc. All rights reserved.
On the Zero-Set of Real Polynomials in Non-Separable Banach Spaces
2007
We show constructively that every homogeneous polynomial that is weakly continuous on the bounded subsets of a real Banach space whose dual is not weak ∗ separable admits a closed linear subspace whose dual is not weak ∗ -separable either where the polynomial vanishes. We also prove that the same can be said for vectorvalued polynomials. Finally, we study the validity of this result for continuous 2homogeneous polynomials.
High Order in Space and Time Schemes Through an Approximate Lax-Wendroff Procedure
2017
This paper deals with the scheme proposed by the authors in Zorio, Baeza and Mulet (J Sci Comput 71(1):246–273, 2017). This scheme is an alternative to the techniques proposed in Qiu and Shu (SIAM J Sci Comput 24(6):2185–2198, 2003) to obtain high-order accurate schemes using Weighted Essentially Non Oscillatory finite differences and approximating the flux derivatives required by the Cauchy-Kovalevskaya procedure by simple centered finite differences. We analyse how errors in first-order terms near discontinuities propagate through both versions of the Cauchy-Kovalevskaya procedure. We propose a fluctuation control, for which the approximation of the first-order derivative to be used in th…
Trend Analysis Using Discrete Wavelet Transform (DWT) for Non-stationary NDVI Time Series in Tunisia
2021
In this paper, the trends in non-stationary Normalized Difference Vegetation Index (NDVI) Time Series (TS) over different areas in Tunisia are analyzed by applying wavelet transform and statistical tests. In the first step, the Discrete Wavelet Transform (DWT) was applied on three different time series in order to detect changes. Therefore, the different parameters of DWT were tested. In fact, the level of decomposition was calculated. The Maximum Energy to Shannon Entropy Ratio Criterion (MEER) was then investigated to choose the more suitable mother wavelet. Finally, the Mann-Kendall test (MK) was calculated for the last approximation of components to identify the variation in trend. In f…
A Mesh-free Particle Method for Transient Full-wave Simulation
2007
A mesh-free particle method is presented for electromagnetic (EM) transient simulation. The basic idea is to obtain numerical solutions for the partial differential equations describing the EM problem in time domain, by using a set of particles, considered as spatial interpolation points of the field variables, arbitrarily placed in the problem domain and by avoiding the use of a regular mesh. Irregular problems geometry with diffused non-homogeneous media can be modeled only with an initial set of arbitrarily distributed particles. The time dependence is accounted for with an explicit finite difference scheme. Moreover the particle discretization can be improved during the process time ste…
Controllability method for acoustic scattering with spectral elements
2007
We formulate the Helmholtz equation as an exact controllability problem for the time-dependent wave equation. The problem is then discretized in time domain with central finite difference scheme and in space domain with spectral elements. This approach leads to high accuracy in spatial discretization. Moreover, the spectral element method results in diagonal mass matrices, which makes the time integration of the wave equation highly efficient. After discretization, the exact controllability problem is reformulated as a least-squares problem, which is solved by the conjugate gradient method. We illustrate the method with some numerical experiments, which demonstrate the significant improveme…
High Order Compact Finite Difference Schemes for A Nonlinear Black-Scholes Equation
2001
A nonlinear Black-Scholes equation which models transaction costs arising in the hedging of portfolios is discretized semi-implicitly using high order compact finite difference schemes. A new compact scheme, generalizing the compact schemes of Rigal [29], is derived and proved to be unconditionally stable and non-oscillatory. The numerical results are compared to standard finite difference schemes. It turns out that the compact schemes have very satisfying stability and non-oscillatory properties and are generally more efficient than the considered classical schemes.