Ünal Göktaş
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ünal Göktaş has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Willy Hereman
Department of Applied Mathematics and Statistics Colorado School of Mines 80401-1887 Golden CO USA
11 shared publications D. Baldwin
2 shared publications- Devendra Kapadia
Wolfram Research, Inc. 100 Trade Center Drive, Champaign, IL 61820, USA
2 shared publications - Antonio J. Miller
Advanced Sensors and Control Department, The Applied Research Laboratory, The Pennsylvania State University, State College, PA 16804-0030, USA
1 shared publication Farid Rajabli
Turgut Özal University, Ankara
1 shared publicationGrant Erdmann
Department of Mathematical and Computer Sciences|Colorado School of Mines
1 shared publication
Latest Publications
- Open Access
- 1 June 2016
- Published by Elsevier in Alexandria Engineering Journal
- Vol. 55 (2) , 1661-1666
Application of perturbation–iteration method to Lotka–Volterra equations
- 1 June 2016
- Published by Elsevier in Alexandria Engineering Journal
- Vol. 55 (2) , 1661-1666
Open AccessApplication of perturbation–iteration method to Lotka–Volterra equations
- 26 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 10 (4) , 1071-1075
Application of Dempster-Schafer Method in Family-Based Association Studies
In experiments designed for family-based association studies, methods such as transmission disequilibrium test require large number of trios to identify single-nucleotide polymorphisms associated with the disease. However, unavailability of a large number of trios is the Achilles' heel of many complex diseases, especially for late-onset diseases. In this paper, we propose a novel approach to this problem by means of the Dempster-Shafer method. The simulation studies show that the Dempster-Shafer method has a promising overall performance, in identifying single-nucleotide polymorphisms in the correct association class, as it has 90 percent accuracy even with 60 trios.
- 26 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 10 (4) , 1071-1075
Application of Dempster-Schafer Method in Family-Based Association Studies
In experiments designed for family-based association studies, methods such as transmission disequilibrium test require large number of trios to identify single-nucleotide polymorphisms associated with the disease. However, unavailability of a large number of trios is the Achilles' heel of many complex diseases, especially for late-onset diseases. In this paper, we propose a novel approach to this problem by means of the Dempster-Shafer method. The simulation studies show that the Dempster-Shafer method has a promising overall performance, in identifying single-nucleotide polymorphisms in the correct association class, as it has 90 percent accuracy even with 60 trios.
- 1 February 2012
- Published by Taylor & Francis in Applicable Analysis
- Vol. 91 (2) , 381-402
Scaling invariant Lax pairs of nonlinear evolution equations
A completely integrable nonlinear partial differential equation (PDE) can be associated with a system of linear PDEs in an auxiliary function whose compatibility requires that the original PDE is satisfied. This associated system is called a Lax pair. Two equivalent representations are presented. The first uses a pair of differential operators which leads to a higher order linear system for the auxiliary function. The second uses a pair of matrices which leads to a first-order linear system. In this article, we present a method, which is easily implemented in MAPLE or MATHEMATICA, to compute an operator Lax pair for a set of PDEs. In the operator representation, the determining equations for the Lax pair split into a set of kinematic constraints which are independent of the original equation and a set of dynamical equations which depend on it. The kinematic constraints can be solved generically. We assume that the operators have a scaling symmetry. The dynamical equations are then reduced to a set of nonlinear algebraic equations. This approach is illustrated with well-known examples from soliton theory. In particular, it is applied to a three parameter class of fifth-order Korteweg–de Vries (KdV)-like evolution equations which includes the Lax fifth-order KdV, Sawada-Kotera and Kaup–Kuperschmidt equations. A second Lax pair was found for the Sawada–Kotera equation.
- 1 February 2012
- Published by Taylor & Francis in Applicable Analysis
- Vol. 91 (2) , 381-402
Scaling invariant Lax pairs of nonlinear evolution equations
A completely integrable nonlinear partial differential equation (PDE) can be associated with a system of linear PDEs in an auxiliary function whose compatibility requires that the original PDE is satisfied. This associated system is called a Lax pair. Two equivalent representations are presented. The first uses a pair of differential operators which leads to a higher order linear system for the auxiliary function. The second uses a pair of matrices which leads to a first-order linear system. In this article, we present a method, which is easily implemented in MAPLE or MATHEMATICA, to compute an operator Lax pair for a set of PDEs. In the operator representation, the determining equations for the Lax pair split into a set of kinematic constraints which are independent of the original equation and a set of dynamical equations which depend on it. The kinematic constraints can be solved generically. We assume that the operators have a scaling symmetry. The dynamical equations are then reduced to a set of nonlinear algebraic equations. This approach is illustrated with well-known examples from soliton theory. In particular, it is applied to a three parameter class of fifth-order Korteweg–de Vries (KdV)-like evolution equations which includes the Lax fifth-order KdV, Sawada-Kotera and Kaup–Kuperschmidt equations. A second Lax pair was found for the Sawada–Kotera equation.
- Open Access
- 1 December 2011
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 16 (4) , 784-796
Methods in Mathematica for Solving Ordinary Differential Equations
An overview of the solution methods for ordinary differential equations in the Mathematica function DSolve is presented.
- 1 December 2011
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 16 (4) , 784-796
Open AccessMethods in Mathematica for Solving Ordinary Differential Equations
An overview of the solution methods for ordinary differential equations in the Mathematica function DSolve is presented.
- 24 September 2011
- Published by Springer Nature
- p. 153-168
Symbolic Computation of Conservation Laws, Generalized Symmetries, and Recursion Operators for Nonlinear Differential–Difference Equations
- 24 September 2011
- Published by Springer Nature
- p. 153-168
Symbolic Computation of Conservation Laws, Generalized Symmetries, and Recursion Operators for Nonlinear Differential–Difference Equations
- Open Access
Symbolic Computation of Conservation Laws, Generalized Symmetries, and Recursion Operators for Nonlinear Differential-Difference Equations
Algorithms for the symbolic computation of polynomial conservation laws, generalized symmetries, and recursion operators for systems of nonlinear differential-difference equations (DDEs) are presented. The algorithms can be used to test the complete integrability of nonlinear DDEs. The ubiquitous Toda lattice illustrates the steps of the algorithms, which have been implemented in {\em Mathematica}. The codes {\sc InvariantsSymmetries.m} and {\sc DDERecursionOperator.m} can aid researchers interested in properties of nonlinear DDEs.
Open AccessSymbolic Computation of Conservation Laws, Generalized Symmetries, and Recursion Operators for Nonlinear Differential-Difference Equations
Algorithms for the symbolic computation of polynomial conservation laws, generalized symmetries, and recursion operators for systems of nonlinear differential-difference equations (DDEs) are presented. The algorithms can be used to test the complete integrability of nonlinear DDEs. The ubiquitous Toda lattice illustrates the steps of the algorithms, which have been implemented in {\em Mathematica}. The codes {\sc InvariantsSymmetries.m} and {\sc DDERecursionOperator.m} can aid researchers interested in properties of nonlinear DDEs.
- Open Access
Symbolic Computation of Recursion Operators for Nonlinear Differential-Difference equations
An algorithm for the symbolic computation of recursion operators for systems of nonlinear differential-difference equations (DDEs) is presented. Recursion operators allow one to generate an infinite sequence of generalized symmetries. The existence of a recursion operator therefore guarantees the complete integrability of the DDE. The algo-rithm is based in part on the concept of dilation invariance and uses our earlier algorithms for the symbolic computation of conservation laws and generalized symmetries. The algorithm has been applied to a number of well-known DDEs, including the Kac-van Moerbeke (Volterra), Toda, and Ablowitz-Ladik lattices, for which recursion opera-tors are shown. The algorithm has been implemented in Mathematica, a leading com-puter algebra system. The package DDERecursionOperator.m is briefly discussed.
Open AccessSymbolic Computation of Recursion Operators for Nonlinear Differential-Difference equations
An algorithm for the symbolic computation of recursion operators for systems of nonlinear differential-difference equations (DDEs) is presented. Recursion operators allow one to generate an infinite sequence of generalized symmetries. The existence of a recursion operator therefore guarantees the complete integrability of the DDE. The algo-rithm is based in part on the concept of dilation invariance and uses our earlier algorithms for the symbolic computation of conservation laws and generalized symmetries. The algorithm has been applied to a number of well-known DDEs, including the Kac-van Moerbeke (Volterra), Toda, and Ablowitz-Ladik lattices, for which recursion opera-tors are shown. The algorithm has been implemented in Mathematica, a leading com-puter algebra system. The package DDERecursionOperator.m is briefly discussed.
- Open Access
Methods in Mathematica for Solving Ordinary Differential Equations
An overview of the solution methods for ordinary differential equations in the Mathematica function DSolve is presented.
Open AccessMethods in Mathematica for Solving Ordinary Differential Equations
An overview of the solution methods for ordinary differential equations in the Mathematica function DSolve is presented.
- Open Access
- 1 April 2011
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 16 (1) , 1-12
Symbolic Computation of Recursion Operators for Nonlinear Differential-Difference Equations
An algorithm for the symbolic computation of recursion operators for systems of nonlinear differential-difference equations (DDEs) is presented. Recursion operators allow one to generate an infinite sequence of generalized symmetries. The existence of a recursion operator therefore guarantees the complete integrability of the DDE. The algorithm is based in part on the concept of dilation invariance and uses our earlier algorithms for the symbolic computation of conservation laws and generalized symmetries. The algorithm has been applied to a number of well-known DDEs, including the Kacvan Moerbeke (Volterra), Toda, and Ablowitz-Ladik lattices, for which recursion operators are shown. The algorithm has been implemented in Mathematica, a leading computer algebra system. The package DDERecursionOperator.m is briefly discussed.
- 1 April 2011
- Published by MDPI AG in Mathematical and Computational Applications
- Vol. 16 (1) , 1-12
Open AccessSymbolic Computation of Recursion Operators for Nonlinear Differential-Difference Equations
An algorithm for the symbolic computation of recursion operators for systems of nonlinear differential-difference equations (DDEs) is presented. Recursion operators allow one to generate an infinite sequence of generalized symmetries. The existence of a recursion operator therefore guarantees the complete integrability of the DDE. The algorithm is based in part on the concept of dilation invariance and uses our earlier algorithms for the symbolic computation of conservation laws and generalized symmetries. The algorithm has been applied to a number of well-known DDEs, including the Kacvan Moerbeke (Volterra), Toda, and Ablowitz-Ladik lattices, for which recursion operators are shown. The algorithm has been implemented in Mathematica, a leading computer algebra system. The package DDERecursionOperator.m is briefly discussed.
- 1 October 2004
- Published by Elsevier in Computer Physics Communications
- Vol. 162 (3) , 203-217
Symbolic computation of hyperbolic tangent solutions for nonlinear differential–difference equations
- 1 October 2004
- Published by Elsevier in Computer Physics Communications
- Vol. 162 (3) , 203-217
Symbolic computation of hyperbolic tangent solutions for nonlinear differential–difference equations