Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

299 results for “solving”
Set a search alert
Research ArticleOpen accessEvery word in the titleThe Existence, Uniqueness and Error Bounds of Approximation Splines Interpolation for Solving Second-Order Initial Value ProblemsAbbas Y. Al Bayati, Rostam K. Saeed, Faraidun K. Hama-SalhProblem statement: The lacunary interpolation problem, which we had investigated in this study, consisted in finding the six degree spline S(x) of deficiency four, interpolating data given on the function value and third and fifth order in the interval [0,1]. Also, an extra initial condition was prescribed on the first derivative. Other purpose of this construction was to solve the … …Journal of Mathematics and Statistics, Vol. 5, Issue 2 · 30 Jun 2009 · 8,172 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleIntegrating Gene Expression Programming and Geographic Information Systems for Solving a Multi Site Land Use Allocation ProblemKhalid A. EldrandalyProblem statement: Land use planning may be defined as the process of allocating different activities or uses to specific units of area within a region. Multi sites Land Use Allocation Problems (MLUA) refer to the problem of allocating more than one land use type in an area. MLUA problem is one of the truly NP Complete (combinatorial optimization) problems. Approach: … …American Journal of Applied Sciences, Vol. 6, Issue 5 · 31 May 2009 · 7,849 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleBlock Methods based on Newton Interpolations for Solving Special Second Order Ordinary Differential Equations DirectlyYap Lee Ken, Fudziah Ismail, Mohamed Suleiman, Suriah Md. AminThis study focused mainly on the derivation of the 2 and 3-point block methods with constant coefficients for solving special second order ordinary differential equations directly based on Newton-Gregory backward interpolation formula. The performance of the new methods was compared with the conventional 1-point method using a standard set of test problems. Numerical results were presented to illustrate the effectiveness … …Journal of Mathematics and Statistics, Vol. 4, Issue 3 · 30 Sep 2008 · 8,120 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSolving Protein Folding Problem using Elitism-Based Compact Genetic AlgorithmAmr Badr, Ibtehal M. Aref, Basma M. Hussien, Yosr EmanProteins are vital components of living cells. A number of diseases such as Alzheimer's, Cystic fibrosis and Mad Cow diseases are shown to result from misfunctioning of proteins. Problem statement: Protein folding problem is the process of predicting the optimal 3D molecular structure of a protein, or tertiary structure, which is an indication of its proper function. Approach: An enhancement … …Journal of Computer Science, Vol. 4, Issue 7 · 31 Jul 2008 · 6,856 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleHomotopy Perturbation Method and Variational Iteration Method for Solving Zakharov-Kuznetsov EquationB. Ganjavi, H. Mohammadi, D.D. Ganji, A. BarariThis article investigates a nonlinear dispersive Zakharov-Kuznetsov ZK (3, 3, 3) equation. This equation governs the behavior of weakly nonlinear ion-acoustic waves in plasma comprising cold ions and hot isothermal electrons in the presence of a uniform magnetic field. Homotopy Perturbation Method (HPM) and Variational Iteration Method (VIM) are implemented for solving the ZK equation. Homotopy results were compared with … …American Journal of Applied Sciences, Vol. 5, Issue 7 · 31 Jul 2008 · 6,798 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleOptimization Based Heuristic Approaches for Solving an Integrated One-dimensional Cutting Stock-Transportation ProblemSirirat Wongprakornkul, Peerayuth CharnsethikulIn this work, the integration of the one-dimensional cutting stock problem with multiple cutting facilities and the transportation problem was formulated mathematically as a large-scale discrete optimization problem. Benders partitioning approach and the column-generation technique with the direct method and the proposed heuristic method for solving corresponding integer programming (IP) were developed into three approaches and were used to solve … …Journal of Mathematics and Statistics, Vol. 3, Issue 3 · 30 Sep 2007 · 6,741 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleParallel Iterative Algorithms with Accelerate Convergence for Solving Implicit Difference EquationsQing-Fu Liu, Wei-Jun Zhong, Mancho ManevThis study focuses on the solution of implicit difference equations, which are very difficult to compute in parallel for the diffusion equation. For improving the convergence rates and the properties of gradual-approach convergence of Segment-Classic-Implicit-Iterative (SCII) and Segment-Crank-Nicolson-Iterative (SCNI) algorithms realizing efficient iterative computation in parallel by segmenting grid domains, SCII and SCNI algorithms with accelerated convergence are studied and … …American Journal of Applied Sciences, Vol. 1, Issue 1 · 31 Mar 2004 · 6,799 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAlgorithmization of Electrostatic Model for Solving the Direct Problem of ElectrographyTagirbek Gaidarbekovich Aslanov, Naur Zamirovich Ivanov, Shamil Shamil`evich Anudinov, Tatiana Vladimirovna KarlovaAn analysis of the creation and implementation of algorithms to control cardiological processes occurring in the cardiovascular system using software and hardware diagnostic systems is a required activity. This study considers ways to improve the methods of medical data processing using electronic diagnostic systems, relying on existing methods of mathematical simulation of human body states. This study describes the development … …Journal of Computer Science, Vol. 21, Issue 4 · 7 Mar 2025 · 5,330 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSolving the Robust Design Problem for a Two-Commodity Flow Network with Node FailureNoha Hamdy Radwan, Moatamad Refaat Hassan, Mohamed Eid HusseinThe robust design in a flow network is one of the most important problems. It is defined as searching the optimal capacity that can be assigned to the nodes such that the network still survived even under the node’s failure. This problem is considered NP-hard. So, this study presents a genetic-based algorithm to determine the maximum node capacity for a … …American Journal of Engineering and Applied Sciences, Vol. 13, Issue 4 · 28 Dec 2020 · 6,593 accessesView PDFCite