Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 231

Search results for: chebyshev polynomial

231 Chebyshev Polynomials Relad with Fibonacci and Lucas Polynomials

Authors: Vandana N. Purav


Fibonacci and Lucas polynomials are special cases of Chebyshev polynomial. There are two types of Chebyshev polynomials, a Chebyshev polynomial of first kind and a Chebyshev polynomial of second kind. Chebyshev polynomial of second kind can be derived from the Chebyshev polynomial of first kind. Chebyshev polynomial is a polynomial of degree n and satisfies a second order homogenous differential equation. We consider the difference equations which are related with Chebyshev, Fibonacci and Lucas polynomias. Thus Chebyshev polynomial of second kind play an important role in finding the recurrence relations with Fibonacci and Lucas polynomials.


Procedia PDF Downloads 300
230 Edge Detection in Low Contrast Images

Authors: Koushlendra Kumar Singh, Manish Kumar Bajpai, Rajesh K. Pandey


The edges of low contrast images are not clearly distinguishable to the human eye. It is difficult to find the edges and boundaries in it. The present work encompasses a new approach for low contrast images. The Chebyshev polynomial based fractional order filter has been used for filtering operation on an image. The preprocessing has been performed by this filter on the input image. Laplacian of Gaussian method has been applied on preprocessed image for edge detection. The algorithm has been tested on two test images.

Keywords: low contrast image, fractional order differentiator, Laplacian of Gaussian (LoG) method, chebyshev polynomial

Procedia PDF Downloads 470
229 An Efficient Algorithm of Time Step Control for Error Correction Method

Authors: Youngji Lee, Yonghyeon Jeon, Sunyoung Bu, Philsu Kim


The aim of this paper is to construct an algorithm of time step control for the error correction method most recently developed by one of the authors for solving stiff initial value problems. It is achieved with the generalized Chebyshev polynomial and the corresponding error correction method. The main idea of the proposed scheme is in the usage of the duplicated node points in the generalized Chebyshev polynomials of two different degrees by adding necessary sample points instead of re-sampling all points. At each integration step, the proposed method is comprised of two equations for the solution and the error, respectively. The constructed algorithm controls both the error and the time step size simultaneously and possesses a good performance in the computational cost compared to the original method. Two stiff problems are numerically solved to assess the effectiveness of the proposed scheme.

Keywords: stiff initial value problem, error correction method, generalized Chebyshev polynomial, node points

Procedia PDF Downloads 462
228 Optimal Image Representation for Linear Canonical Transform Multiplexing

Authors: Navdeep Goel, Salvador Gabarda


Digital images are widely used in computer applications. To store or transmit the uncompressed images requires considerable storage capacity and transmission bandwidth. Image compression is a means to perform transmission or storage of visual data in the most economical way. This paper explains about how images can be encoded to be transmitted in a multiplexing time-frequency domain channel. Multiplexing involves packing signals together whose representations are compact in the working domain. In order to optimize transmission resources each 4x4 pixel block of the image is transformed by a suitable polynomial approximation, into a minimal number of coefficients. Less than 4*4 coefficients in one block spares a significant amount of transmitted information, but some information is lost. Different approximations for image transformation have been evaluated as polynomial representation (Vandermonde matrix), least squares + gradient descent, 1-D Chebyshev polynomials, 2-D Chebyshev polynomials or singular value decomposition (SVD). Results have been compared in terms of nominal compression rate (NCR), compression ratio (CR) and peak signal-to-noise ratio (PSNR) in order to minimize the error function defined as the difference between the original pixel gray levels and the approximated polynomial output. Polynomial coefficients have been later encoded and handled for generating chirps in a target rate of about two chirps per 4*4 pixel block and then submitted to a transmission multiplexing operation in the time-frequency domain.

Keywords: chirp signals, image multiplexing, image transformation, linear canonical transform, polynomial approximation

Procedia PDF Downloads 338
227 Transformations between Bivariate Polynomial Bases

Authors: Dimitris Varsamis, Nicholas Karampetakis


It is well known that any interpolating polynomial P(x,y) on the vector space Pn,m of two-variable polynomials with degree less than n in terms of x and less than m in terms of y has various representations that depends on the basis of Pn,m that we select i.e. monomial, Newton and Lagrange basis etc. The aim of this paper is twofold: a) to present transformations between the coordinates of the polynomial P(x,y) in the aforementioned basis and b) to present transformations between these bases.

Keywords: bivariate interpolation polynomial, polynomial basis, transformations, interpolating polynomial

Procedia PDF Downloads 324
226 A Robust Optimization of Chassis Durability/Comfort Compromise Using Chebyshev Polynomial Chaos Expansion Method

Authors: Hanwei Gao, Louis Jezequel, Eric Cabrol, Bernard Vitry


The chassis system is composed of complex elements that take up all the loads from the tire-ground contact area and thus it plays an important role in numerous specifications such as durability, comfort, crash, etc. During the development of new vehicle projects in Renault, durability validation is always the main focus while deployment of comfort comes later in the project. Therefore, sometimes design choices have to be reconsidered because of the natural incompatibility between these two specifications. Besides, robustness is also an important point of concern as it is related to manufacturing costs as well as the performance after the ageing of components like shock absorbers. In this paper an approach is proposed aiming to realize a multi-objective optimization between chassis endurance and comfort while taking the random factors into consideration. The adaptive-sparse polynomial chaos expansion method (PCE) with Chebyshev polynomial series has been applied to predict responses’ uncertainty intervals of a system according to its uncertain-but-bounded parameters. The approach can be divided into three steps. First an initial design of experiments is realized to build the response surfaces which represent statistically a black-box system. Secondly within several iterations an optimum set is proposed and validated which will form a Pareto front. At the same time the robustness of each response, served as additional objectives, is calculated from the pre-defined parameter intervals and the response surfaces obtained in the first step. Finally an inverse strategy is carried out to determine the parameters’ tolerance combination with a maximally acceptable degradation of the responses in terms of manufacturing costs. A quarter car model has been tested as an example by applying the road excitations from the actual road measurements for both endurance and comfort calculations. One indicator based on the Basquin’s law is defined to compare the global chassis durability of different parameter settings. Another indicator related to comfort is obtained from the vertical acceleration of the sprung mass. An optimum set with best robustness has been finally obtained and the reference tests prove a good robustness prediction of Chebyshev PCE method. This example demonstrates the effectiveness and reliability of the approach, in particular its ability to save computational costs for a complex system.

Keywords: chassis durability, Chebyshev polynomials, multi-objective optimization, polynomial chaos expansion, ride comfort, robust design

Procedia PDF Downloads 65
225 From Convexity in Graphs to Polynomial Rings

Authors: Ladznar S. Laja, Rosalio G. Artes, Jr.


This paper introduced a graph polynomial relating convexity concepts. A graph polynomial is a polynomial representing a graph given some parameters. On the other hand, a subgraph H of a graph G is said to be convex in G if for every pair of vertices in H, every shortest path with these end-vertices lies entirely in H. We define the convex subgraph polynomial of a graph G to be the generating function of the sequence of the numbers of convex subgraphs of G of cardinalities ranging from zero to the order of G. This graph polynomial is monic since G itself is convex. The convex index which counts the number of convex subgraphs of G of all orders is just the evaluation of this polynomial at 1. Relationships relating algebraic properties of convex subgraphs polynomial with graph theoretic concepts are established.

Keywords: convex subgraph, convex index, generating function, polynomial ring

Procedia PDF Downloads 131
224 Introduction to Paired Domination Polynomial of a Graph

Authors: Puttaswamy, Anwar Alwardi, Nayaka S. R.


One of the algebraic representation of a graph is the graph polynomial. In this article, we introduce the paired-domination polynomial of a graph G. The paired-domination polynomial of a graph G of order n is the polynomial Dp(G, x) with the coefficients dp(G, i) where dp(G, i) denotes the number of paired dominating sets of G of cardinality i and γpd(G) denotes the paired-domination number of G. We obtain some properties of Dp(G, x) and its coefficients. Further, we compute this polynomial for some families of standard graphs. Further, we obtain some characterization for some specific graphs.

Keywords: domination polynomial, paired dominating set, paired domination number, paired domination polynomial

Procedia PDF Downloads 150
223 On the Zeros of the Degree Polynomial of a Graph

Authors: S. R. Nayaka, Putta Swamy


Graph polynomial is one of the algebraic representations of the Graph. The degree polynomial is one of the simple algebraic representations of graphs. The degree polynomial of a graph G of order n is the polynomial Deg(G, x) with the coefficients deg(G,i) where deg(G,i) denotes the number of vertices of degree i in G. In this article, we investigate the behavior of the roots of some families of Graphs in the complex field. We investigate for the graphs having only integral roots. Further, we characterize the graphs having single roots or having real roots and behavior of the polynomial at the particular value is also obtained.

Keywords: degree polynomial, regular graph, minimum and maximum degree, graph operations

Procedia PDF Downloads 158
222 Numerical Solution of Space Fractional Order Solute Transport System

Authors: Shubham Jaiswal


In the present article, a drive is taken to compute the solution of spatial fractional order advection-dispersion equation having source/sink term with given initial and boundary conditions. The equation is converted to a system of ordinary differential equations using second-kind shifted Chebyshev polynomials, which have finally been solved using finite difference method. The striking feature of the article is the fast transportation of solute concentration as and when the system approaches fractional order from standard order for specified values of the parameters of the system.

Keywords: spatial fractional order advection-dispersion equation, second-kind shifted Chebyshev polynomial, collocation method, conservative system, non-conservative system

Procedia PDF Downloads 175
221 Effect of Coriolis Force on Magnetoconvection in an Anisotropic Porous Medium

Authors: N. F. M. Mokhtar, N. Z. A. Hamid


This paper reports an analytical investigation of the stability and thermal convection in a horizontal anisotropic porous medium in the presence of Coriolis force and magnetic field. The Darcy model is used in the momentum equation and Boussinesq approximation is considered for the density variation of the porous medium. The upper and lower boundaries of the porous medium are assumed to be conducting to temperature perturbation and we used first order Chebyshev polynomial Tau method to solve the resulting eigenvalue problem. Analytical solution is obtained for the case of stationary convection. It is found that the porous layer system becomes unstable when the mechanical anisotropy parameter elevated and increasing the Coriolis force and magnetic field help to stabilize the anisotropy porous medium.

Keywords: anisotropic, Chebyshev tau method, Coriolis force, Magnetic field

Procedia PDF Downloads 136
220 A Hybrid Block Multistep Method for Direct Numerical Integration of Fourth Order Initial Value Problems

Authors: Adamu S. Salawu, Ibrahim O. Isah


Direct solution to several forms of fourth-order ordinary differential equations is not easily obtained without first reducing them to a system of first-order equations. Thus, numerical methods are being developed with the underlying techniques in the literature, which seeks to approximate some classes of fourth-order initial value problems with admissible error bounds. Multistep methods present a great advantage of the ease of implementation but with a setback of several functions evaluation for every stage of implementation. However, hybrid methods conventionally show a slightly higher order of truncation for any k-step linear multistep method, with the possibility of obtaining solutions at off mesh points within the interval of solution. In the light of the foregoing, we propose the continuous form of a hybrid multistep method with Chebyshev polynomial as a basis function for the numerical integration of fourth-order initial value problems of ordinary differential equations. The basis function is interpolated and collocated at some points on the interval [0, 2] to yield a system of equations, which is solved to obtain the unknowns of the approximating polynomial. The continuous form obtained, its first and second derivatives are evaluated at carefully chosen points to obtain the proposed block method needed to directly approximate fourth-order initial value problems. The method is analyzed for convergence. Implementation of the method is done by conducting numerical experiments on some test problems. The outcome of the implementation of the method suggests that the method performs well on problems with oscillatory or trigonometric terms since the approximations at several points on the solution domain did not deviate too far from the theoretical solutions. The method also shows better performance compared with an existing hybrid method when implemented on a larger interval of solution.

Keywords: Chebyshev polynomial, collocation, hybrid multistep method, initial value problems, interpolation

Procedia PDF Downloads 59
219 Generic Polynomial of Integers and Applications

Authors: Nidal Ali


Consider an algebraic number field K of degree n, A0 K is its ring of integers and a prime number p inert in K. Let F(u1, . . . , un, x) be the generic polynomial of integers of K. We will study in advance the stability of this polynomial and then, we will apply it in order to obtain all the monic irreducible polynomials in Fp[x] of degree d dividing n.

Keywords: generic polynomial, irreducibility, iteration, stability, inert prime, totally ramified

Procedia PDF Downloads 276
218 The K-Distance Neighborhood Polynomial of a Graph

Authors: Soner Nandappa D., Ahmed Mohammed Naji


In a graph G = (V, E), the distance from a vertex v to a vertex u is the length of shortest v to u path. The eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G) is the maximum eccentricity. The k-distance neighborhood of v, for 0 ≤ k ≤ e(v), is Nk(v) = {u ϵ V (G) : d(v, u) = k}. In this paper, we introduce a new distance degree based topological polynomial of a graph G is called a k- distance neighborhood polynomial, denoted Nk(G, x). It is a polynomial with the coefficient of the term k, for 0 ≤ k ≤ e(v), is the sum of the cardinalities of Nk(v) for every v ϵ V (G). Some properties of k- distance neighborhood polynomials are obtained. Exact formulas of the k- distance neighborhood polynomial for some well-known graphs, Cartesian product and join of graphs are presented.

Keywords: vertex degrees, distance in graphs, graph operation, Nk-polynomials

Procedia PDF Downloads 335
217 Fractional Order Differentiator Using Chebyshev Polynomials

Authors: Koushlendra Kumar Singh, Manish Kumar Bajpai, Rajesh Kumar Pandey


A discrete time fractional orderdifferentiator has been modeled for estimating the fractional order derivatives of contaminated signal. The proposed approach is based on Chebyshev’s polynomials. We use the Riemann-Liouville fractional order derivative definition for designing the fractional order SG differentiator. In first step we calculate the window weight corresponding to the required fractional order. Then signal is convoluted with this calculated window’s weight for finding the fractional order derivatives of signals. Several signals are considered for evaluating the accuracy of the proposed method.

Keywords: fractional order derivative, chebyshev polynomials, signals, S-G differentiator

Procedia PDF Downloads 511
216 Hosoya Polynomials of Zero-Divisor Graphs

Authors: Abdul Jalil M. Khalaf, Esraa M. Kadhim


The Hosoya polynomial of a graph G is a graphical invariant polynomial that its first derivative at x= 1 is equal to the Wiener index and second derivative at x=1 is equal to the Hyper-Wiener index. In this paper we study the Hosoya polynomial of zero-divisor graphs.

Keywords: Hosoya polynomial, wiener index, Hyper-Wiener index, zero-divisor graphs

Procedia PDF Downloads 438
215 Segmentation of Piecewise Polynomial Regression Model by Using Reversible Jump MCMC Algorithm

Authors: Suparman


Piecewise polynomial regression model is very flexible model for modeling the data. If the piecewise polynomial regression model is matched against the data, its parameters are not generally known. This paper studies the parameter estimation problem of piecewise polynomial regression model. The method which is used to estimate the parameters of the piecewise polynomial regression model is Bayesian method. Unfortunately, the Bayes estimator cannot be found analytically. Reversible jump MCMC algorithm is proposed to solve this problem. Reversible jump MCMC algorithm generates the Markov chain that converges to the limit distribution of the posterior distribution of piecewise polynomial regression model parameter. The resulting Markov chain is used to calculate the Bayes estimator for the parameters of piecewise polynomial regression model.

Keywords: piecewise regression, bayesian, reversible jump MCMC, segmentation

Procedia PDF Downloads 293
214 A Numerical Solution Based on Operational Matrix of Differentiation of Shifted Second Kind Chebyshev Wavelets for a Stefan Problem

Authors: Rajeev, N. K. Raigar


In this study, one dimensional phase change problem (a Stefan problem) is considered and a numerical solution of this problem is discussed. First, we use similarity transformation to convert the governing equations into ordinary differential equations with its boundary conditions. The solutions of ordinary differential equation with the associated boundary conditions and interface condition (Stefan condition) are obtained by using a numerical approach based on operational matrix of differentiation of shifted second kind Chebyshev wavelets. The obtained results are compared with existing exact solution which is sufficiently accurate.

Keywords: operational matrix of differentiation, similarity transformation, shifted second kind chebyshev wavelets, stefan problem

Procedia PDF Downloads 335
213 A Proof for Goldbach's Conjecture

Authors: Hashem Sazegar


In 1937, Vinograd of Russian Mathematician proved that each odd large number can be shown by three primes. In 1973, Chen Jingrun proved that each odd number can be shown by one prime plus a number that has maximum two primes. In this article, we state one proof for Goldbach’conjecture. Introduction: Bertrand’s postulate state for every positive integer n, there is always at least one prime p, such that n < p < 2n. This was first proved by Chebyshev in 1850, which is why postulate is also called the Bertrand-Chebyshev theorem. Legendre’s conjecture states that there is a prime between n2 and (n+1)2 for every positive integer n, which is one of the four Landau’s problems. The rest of these four basic problems are; (i) Twin prime conjecture: There are infinitely many primes p such that p+2 is a prime. (ii) Goldbach’s conjecture: Every even integer n > 2 can be written asthe sum of two primes. (iii) Are there infinitely many primes p such that p−1 is a perfect square? Problems (i), (ii), and (iii) are open till date.

Keywords: Bertrand-Chebyshev theorem, Landau’s problems, twin prime, Legendre’s conjecture, Oppermann’s conjecture

Procedia PDF Downloads 322
212 Modeling and Simulation of a CMOS-Based Analog Function Generator

Authors: Madina Hamiane


Modelling and simulation of an analogy function generator is presented based on a polynomial expansion model. The proposed function generator model is based on a 10th order polynomial approximation of any of the required functions. The polynomial approximations of these functions can then be implemented using basic CMOS circuit blocks. In this paper, a circuit model is proposed that can simultaneously generate many different mathematical functions. The circuit model is designed and simulated with HSPICE and its performance is demonstrated through the simulation of a number of non-linear functions.

Keywords: modelling and simulation, analog function generator, polynomial approximation, CMOS transistors

Procedia PDF Downloads 373
211 Stabilization Control of the Nonlinear AIDS Model Based on the Theory of Polynomial Fuzzy Control Systems

Authors: Shahrokh Barati


In this paper, we introduced AIDS disease at first, then proposed dynamic model illustrate its progress, after expression of a short history of nonlinear modeling by polynomial phasing systems, we considered the stability conditions of the systems, which contained a huge amount of researches in order to modeling and control of AIDS in dynamic nonlinear form, in this approach using a frame work of control any polynomial phasing modeling system which have been generalized by part of phasing model of T-S, in order to control the system in better way, the stability conditions were achieved based on polynomial functions, then we focused to design the appropriate controller, firstly we considered the equilibrium points of system and their conditions and in order to examine changes in the parameters, we presented polynomial phase model that was the generalized approach rather than previous Takagi Sugeno models, then with using case we evaluated the equations in both open loop and close loop and with helping the controlling feedback, the close loop equations of system were calculated, to simulate nonlinear model of AIDS disease, we used polynomial phasing controller output that was capable to make the parameters of a nonlinear system to follow a sustainable reference model properly.

Keywords: polynomial fuzzy, AIDS, nonlinear AIDS model, fuzzy control systems

Procedia PDF Downloads 390
210 On CR-Structure and F-Structure Satisfying Polynomial Equation

Authors: Manisha Kankarej


The purpose of this paper is to show a relation between CR structure and F-structure satisfying polynomial equation. In this paper, we have checked the significance of CR structure and F-structure on Integrability conditions and Nijenhuis tensor. It was proved that all the properties of Integrability conditions and Nijenhuis tensor are satisfied by CR structures and F-structure satisfying polynomial equation.

Keywords: CR-submainfolds, CR-structure, integrability condition, Nijenhuis tensor

Procedia PDF Downloads 419
209 Stress Solitary Waves Generated by a Second-Order Polynomial Constitutive Equation

Authors: Tsun-Hui Huang, Shyue-Cheng Yang, Chiou-Fen Shieha


In this paper, a nonlinear constitutive law and a curve fitting, two relationships between the stress-strain and the shear stress-strain for sandstone material were used to obtain a second-order polynomial constitutive equation. Based on the established polynomial constitutive equations and Newton’s second law, a mathematical model of the non-homogeneous nonlinear wave equation under an external pressure was derived. The external pressure can be assumed as an impulse function to simulate a real earthquake source. A displacement response under nonlinear two-dimensional wave equation was determined by a numerical method and computer-aided software. The results show that a suit pressure in the sandstone generates the phenomenon of stress solitary waves.

Keywords: polynomial constitutive equation, solitary, stress solitary waves, nonlinear constitutive law

Procedia PDF Downloads 411
208 Explicit Chain Homotopic Function to Compute Hochschild Homology of the Polynomial Algebra

Authors: Zuhier Altawallbeh


In this paper, an explicit homotopic function is constructed to compute the Hochschild homology of a finite dimensional free k-module V. Because the polynomial algebra is of course fundamental in the computation of the Hochschild homology HH and the cyclic homology CH of commutative algebras, we concentrate our work to compute HH of the polynomial providing certain homotopic function.

Keywords: hochschild homology, homotopic function, free and projective modules, free resolution, exterior algebra, symmetric algebra

Procedia PDF Downloads 331
207 Forward Stable Computation of Roots of Real Polynomials with Only Real Distinct Roots

Authors: Nevena Jakovčević Stor, Ivan Slapničar


Any polynomial can be expressed as a characteristic polynomial of a complex symmetric arrowhead matrix. This expression is not unique. If the polynomial is real with only real distinct roots, the matrix can be chosen as real. By using accurate forward stable algorithm for computing eigen values of real symmetric arrowhead matrices we derive a forward stable algorithm for computation of roots of such polynomials in O(n^2 ) operations. The algorithm computes each root to almost full accuracy. In some cases, the algorithm invokes extended precision routines, but only in the non-iterative part. Our examples include numerically difficult problems, like the well-known Wilkinson’s polynomials. Our algorithm compares favorably to other method for polynomial root-finding, like MPSolve or Newton’s method.

Keywords: roots of polynomials, eigenvalue decomposition, arrowhead matrix, high relative accuracy

Procedia PDF Downloads 333
206 Identification of Nonlinear Systems Structured by Hammerstein-Wiener Model

Authors: A. Brouri, F. Giri, A. Mkhida, A. Elkarkri, M. L. Chhibat


Standard Hammerstein-Wiener models consist of a linear subsystem sandwiched by two memoryless nonlinearities. Presently, the linear subsystem is allowed to be parametric or not, continuous- or discrete-time. The input and output nonlinearities are polynomial and may be noninvertible. A two-stage identification method is developed such the parameters of all nonlinear elements are estimated first using the Kozen-Landau polynomial decomposition algorithm. The obtained estimates are then based upon in the identification of the linear subsystem, making use of suitable pre-ad post-compensators.

Keywords: nonlinear system identification, Hammerstein-Wiener systems, frequency identification, polynomial decomposition

Procedia PDF Downloads 395
205 Application of Chinese Remainder Theorem to Find The Messages Sent in Broadcast

Authors: Ayubi Wirara, Ardya Suryadinata


Improper application of the RSA algorithm scheme can cause vulnerability to attacks. The attack utilizes the relationship between broadcast messages sent to the user with some fixed polynomial functions that belong to each user. Scheme attacks carried out by applying the Chinese Remainder Theorem to obtain a general polynomial equation with the same modulus. The formation of the general polynomial becomes a first step to get back the original message. Furthermore, to solve these equations can use Coppersmith's theorem.

Keywords: RSA algorithm, broadcast message, Chinese Remainder Theorem, Coppersmith’s theorem

Procedia PDF Downloads 259
204 Inverse Polynomial Numerical Scheme for the Solution of Initial Value Problems in Ordinary Differential Equations

Authors: Ogunrinde Roseline Bosede


This paper presents the development, analysis and implementation of an inverse polynomial numerical method which is well suitable for solving initial value problems in first order ordinary differential equations with applications to sample problems. We also present some basic concepts and fundamental theories which are vital to the analysis of the scheme. We analyzed the consistency, convergence, and stability properties of the scheme. Numerical experiments were carried out and the results compared with the theoretical or exact solution and the algorithm was later coded using MATLAB programming language.

Keywords: differential equations, numerical, polynomial, initial value problem, differential equation

Procedia PDF Downloads 355
203 On Chromaticity of Wheels

Authors: Zainab Yasir Abed Al-Rekaby, Abdul Jalil M. Khalaf


Let the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if they share the same chromatic polynomial. A Graph G is chromatically unique, if G is isomorphic to H for any graph H such that G is chromatically equivalent to H. The study of chromatically equivalent and chromatically unique problems is called chromaticity. This paper shows that a wheel W12 is chromatically unique.

Keywords: chromatic polynomial, chromatically equivalent, chromatically unique, wheel

Procedia PDF Downloads 342
202 Numerical Modelling of Laminated Shells Made of Functionally Graded Elastic and Piezoelectric Materials

Authors: Gennady M. Kulikov, Svetlana V. Plotnikova


This paper focuses on implementation of the sampling surfaces (SaS) method for the three-dimensional (3D) stress analysis of functionally graded (FG) laminated elastic and piezoelectric shells. The SaS formulation is based on choosing inside the nth layer In not equally spaced SaS parallel to the middle surface of the shell in order to introduce the electric potentials and displacements of these surfaces as basic shell variables. Such choice of unknowns permits the presentation of the proposed FG piezoelectric shell formulation in a very compact form. The SaS are located inside each layer at Chebyshev polynomial nodes that improves the convergence of the SaS method significantly. As a result, the SaS formulation can be applied efficiently to 3D solutions for FG piezoelectric laminated shells, which asymptotically approach the exact solutions of piezoelectricity as the number of SaS In goes to infinity.

Keywords: electroelasticity, functionally graded material, laminated piezoelectric shell, sampling surfaces method

Procedia PDF Downloads 380