نتایج جستجو برای: pesudo cubic

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

Journal: :computational methods for differential equations 0
k. r. raslan department of mathematics, faculty of science, al-azhar university talaat s. el-danaf department of mathematics, faculty of science, menoufia university khalid k. ali department of mathematics, faculty of science, al-azhar univesity

in the present article, a numerical method is proposed for the numerical solution of thekdv equation by using a new approach by combining cubic b-spline functions. in this paper we convert the kdv equation to system of two equations. the method is shown to be unconditionally stable using von-neumann technique. to test accuracy the error norms2l, ∞l are computed. three invariants of motion are p...

Journal: :international journal of mathematical modelling and computations 0
j. rashidinia department of mathematics, islamic azad university,central tehran branch, iran iran, islamic republic of f. esfahani department of mathemetics, iran university of science and technology iran, islamic republic of s. jamalzadeh department of mathemetics, iran university of science and technology iran, islamic republic of

we develope a numerical method based on b-spline collocation method to solve linear klein-gordon equation. the proposed scheme is unconditionally stable. the results of numerical experiments have been compared with the exact solution to show the efficiency of the method computationally. easy and economical implementation is the strength of this approach.

Journal: :journal of algebraic systems 2015
saeid alikhani sommayeh jahari

let $g$ be a simple graph of order $n$ and size $m$.the edge covering of $g$ is a set of edges such that every vertex of $g$ is incident to at least one edge of the set. the edge cover polynomial of $g$ is the polynomial$e(g,x)=sum_{i=rho(g)}^{m} e(g,i) x^{i}$,where $e(g,i)$ is the number of edge coverings of $g$ of size $i$, and$rho(g)$ is the edge covering number of $g$. in this paper we stud...

Journal: :Australasian J. Combinatorics 2015
Mariusz Meszka Alexander Rosa

We determine those cubic graphs with at most 22 vertices which are leaves of partial triple systems. As a first step towards a complete characterization of cubic leaves, we also show several classes of cubic graphs to be leaves.

‎A tree containing exactly two non-pendant vertices is called a double-star‎. ‎Let $k_1$ and $k_2$ be two positive integers‎. ‎The double-star with degree sequence $(k_1+1‎, ‎k_2+1‎, ‎1‎, ‎ldots‎, ‎1)$ is denoted by $S_{k_1‎, ‎k_2}$‎. ‎It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching‎. ‎In this paper‎, ‎we study the $S_{1,2}$-decomposit...

Fareeha Saadia Malik Zawwar Hussain, Maria Hussain

The rational cubic function with three parameters has been extended to rational bi-cubic function to visualize the shape of regular convex surface data. The rational bi-cubic function involves six parameters in each rectangular patch. Data dependent constraints are derived on four of these parameters to visualize the shape of convex surface data while other two are free to refine the shape of s...

2001
Chaim Goodman-Strauss John M. Sullivan Charles E. Peck

A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears many (but not all) of them can be relaxed to smooth minimal surfaces (under an appropriate smoothing flow, keeping their symmetries). Here we give a complete classification of the cubic polyhedra. Among these are five new infi...

Journal: :IACR Cryptology ePrint Archive 2010
M. A. Popov

Post-nonclassical intuitionistic “natural” arithmetic with its fundamental simplifications in the case of the problem of asymptotic distribution of primes is considered. It is showed that an existence of the cubic groups and n3th density of prime distribution are assuming an existence of the one-way function of the form f(x3) = y, fˉ1(y) =?x3.

Journal: :Random Struct. Algorithms 2008
Manuel Bodirsky Clemens Gröpl Mihyun Kang

We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, i.e., we count connected cubic planar graphs up to isomorphisms that fix a certain directed edge. Based on decompositions along the connectivity structure, we derive recurrence formulas for the exact number of rooted ...

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

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