Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Prairie View A&M University

Journal

2017

Articles 61 - 65 of 65

Full-Text Articles in Physical Sciences and Mathematics

A Semiparametric Estimation For The Nonlinear Vector Autoregressive Time Series Model, Rahman Farnoosh, Mahtab Hajebi, Seyed J. Mortazavi Jun 2017

A Semiparametric Estimation For The Nonlinear Vector Autoregressive Time Series Model, Rahman Farnoosh, Mahtab Hajebi, Seyed J. Mortazavi

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, the nonlinear vector autoregressive model is considered and a semiparametric method is proposed to estimate the nonlinear vector regression function. We use Taylor series expansion up to the second order which has a parametric framework as a representation of the nonlinear vector regression function. After the parameters are estimated through the least squares method, the obtained nonlinear vector regression function is adjusted by a nonparametric diagonal matrix, and the proposed diagonal matrix is also estimated through the nonparametric smooth-kernel approach. Estimating the parameters can yield the desired estimate of the vector regression function based on the data. …


Application Of Kudryashov Method For The Ito Equations, Mozhgan Akbari Jun 2017

Application Of Kudryashov Method For The Ito Equations, Mozhgan Akbari

Applications and Applied Mathematics: An International Journal (AAM)

In this present work, the Kudryashov method is used to construct exact solutions of the (1+1)- dimensional and the (1+2)-dimensional form of the generalized Ito integro-differential equation. The Kudryashov method is a powerful method for obtaining exact solutions of nonlinear evolution equations. This method can be applied to non-integrable equations as well as integrable ones.


Asymptotic Behavior Of Waves In A Nonuniform Medium, Nezam Iraniparast, Lan Nguyen, Mikhail Khenner Jun 2017

Asymptotic Behavior Of Waves In A Nonuniform Medium, Nezam Iraniparast, Lan Nguyen, Mikhail Khenner

Applications and Applied Mathematics: An International Journal (AAM)

An incoming wave on an infinite string, that has uniform density except for one or two jump discontinuities, splits into transmitted and reflected waves. These waves can explicitly be described in terms of the incoming wave with changes in the amplitude and speed. But when a string or membrane has continuous inhomogeneity in a finite region the waves can only be approximated or described asymptotically. Here, we study the cases of monochromatic waves along a nonuniform density string and plane waves along a membrane with nonuniform density. In both cases the speed of the physical system is assumed to tend …


Representation And Decomposition Of An Intuitionistic Fuzzy Matrix Using Some (Α, Α') Cuts, T. Muthuraji, S. Sriram Jun 2017

Representation And Decomposition Of An Intuitionistic Fuzzy Matrix Using Some (Α, Α') Cuts, T. Muthuraji, S. Sriram

Applications and Applied Mathematics: An International Journal (AAM)

The aim of this paper is to study the properties of various (α, α') cuts on Intuitionistic Fuzzy Matrices. Here we introduce different kinds of cuts on Intuitionistic Fuzzy Sets. We discuss some properties of the cuts with some other existing operators on Intuitionistic Fuzzy Matrix. Finally some representation and decomposition of an Intuitionistic Fuzzy Matrix using (α, α') cuts are given.


On Strong Domination Number Of Graphs, S. K. Vaidya, S. H. Karkar Jun 2017

On Strong Domination Number Of Graphs, S. K. Vaidya, S. H. Karkar

Applications and Applied Mathematics: An International Journal (AAM)

A subset S of a vertex set V is called a dominating set of graph G if every vertex of V -S is dominated by some element of set S. If e is an edge with end vertices u and v and degree of u is greater than or equal to degree of v then we say u strongly dominates v. If every vertex of V - S is strongly dominated by some vertex of S then S is called strong dominating set. The minimum cardinality of a strong dominating set is called the strong domination number of graph. We …