http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2397 JAEM 2015, Vol 5, No 2 koleksiyonunu içerir. Tue, 07 Apr 2026 17:16:53 GMT 2026-04-07T17:16:53Z http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6050 Compressive split-step Fourier method Bayındır, Cihan In this paper an approach for decreasing the computational effort required for the split-step Fourier method (SSFM) is introduced. It is shown that using the sparsity property of the simulated signals, the compressive sampling algorithm can be used as a very efficient tool for the split-step spectral simulations of various phenomena which can be modeled by using differential equations. The proposed method depends on the idea of using a smaller number of spectral components compared to the classical split-step Fourier method with a high number of components. After performing the time integration with a smaller number of spectral components and using the compressive sampling technique with l(1) minimization, it is shown that the sparse signal can be reconstructed with a significantly better efficiency compared to the classical split-step Fourier method. Proposed method can be named as compressive split-step Fourier method (CSSFM). For testing of the proposed method the Nonlinear Schrodinger Equation and its one-soliton and two-soliton solutions are considered. Wed, 01 Apr 2015 00:00:00 GMT http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6050 2015-04-01T00:00:00Z http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6034 Book Review: Oktay Veliyev. Multidimensional Periodic Schrödinger Operator (Perturbation Theory and Applications) Hasanoğlu, Elman [No abstract available] Wed, 01 Apr 2015 00:00:00 GMT http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/6034 2015-04-01T00:00:00Z http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2570 Trivially extendable graphs Angaleeswari, K.; Sumathi, P.; Swaminathan, V. Let G be a simple graph. Let k be a positive integer. G is said to be k-extendable if every independent set of cardinality k is contained in a maximum independent set of G. G is said to be trivially extendable if G is not k-extendable for 1 ? k ? (?0(G) ? 1). A well covered graph is one in which every maximal independent set is maximum. Study of k-extendable graphs has been made in [7,8,9]. In this paper a study of trivially extendable graphs is made. Characterization of graphs with ?0(G) = (n ? 3) and which is trivially extendable has been done. Similarly graphs with ?0(G) = (n ? 2) is also studied for trivial extensibility. Tue, 24 Mar 2015 00:00:00 GMT http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2570 2015-03-24T00:00:00Z http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2569 A efficient computational method for solving stochastic itô-volterra integral equations Mohammadi, Fakhrodin In this paper, a new stochastic operational matrix for the Legendre wavelets is presented and a general procedure for forming this matrix is given. A computational method based on this stochastic operational matrix is proposed for solving stochastic Itô-Voltera integral equations. Convergence and error analysis of the Legendre wavelets basis are investigated. To reveal the accuracy and efficiency of the proposed method some numerical examples are included. Thu, 01 Jan 2015 00:00:00 GMT http://belgelik.isikun.edu.tr/xmlui/handleiubelgelik/2569 2015-01-01T00:00:00Z