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

134 results for “computational methods”

Set a search alert
Research ArticleOpen accessIn the abstractThe Exact Root Algorithm for Computing the Real Roots of an Nth Degree PolynomialE. A. Adebile, V. I. IdokoProblem statement: The need to find an efficient and reliable algorithm for computing the exact real roots of the steady-state polynomial encountered in the investigation of temperature profiles in biological tissues during Microwave heating and other similar cases as found in the literature gave rise to this study. Approach: The algorithm (simply called ERA-Exact Root Algorithm) adopted polynomial deflation technique … …Journal of Mathematics and Statistics, Vol. 6, Issue 3 · 30 Sep 2010 · 7,555 accessesView PDFCite
Research ArticleOpen accessIn the abstractModeling Heterogeneity in Phase II Clinical TrialsChristopher N. Barnes, Shesh N. RaiProblem statement: The common assumption in non-randomized Phase II clinical trials is a homogeneous population with homogeneous response. This assumption is at odds with many trials today; a heterogeneous response due to the existence of subgroups. Approach: In order to examine the effects of heterogeneity on the trial outcome, a systematic platform is developed to quantify the range and classes … …Current Research in Biostatistics, Vol. 1, Issue 1 · 30 Jun 2010 · 10,127 accessesView PDFCite
Research ArticleOpen accessIn the abstractQuarter-Sweep Projected Modified Gauss-Seidel Algorithm Applied to Linear Complementarity ProblemW. S. Koh, J. Sulaiman, R. MailProblem statement: Modified Gauss-Seidel (MGS) was developed in order to improve the convergence rate of classical iterative method in solving linear system. In solving linear system iteratively, it takes longer time when many computational points involved. It is known that by applying quarter-sweep iteration scheme, it can decrease the computational operations without altering the accuracy. In this study, we investigated … …American Journal of Applied Sciences, Vol. 7, Issue 6 · 30 Jun 2010 · 7,399 accessesView PDFCite
Research ArticleOpen accessIn the abstractNumerical Solution of Second-Order Linear Fredholm Integro-Differential Equation Using Generalized Minimal Residual MethodElayaraja Aruchunan, Jumat SulaimanProblem statement: This research purposely brought up to solve complicated equations such as partial differential equations, integral equations, Integro-Differential Equations (IDE), stochastic equations and others. Many physical phenomena contain mathematical formulations such integro-differential equations which are arise in fluid dynamics, biological models and chemical kinetics. In fact, several formulations and numerical solutions of the linear Fredholm integro-differential equation of second … …American Journal of Applied Sciences, Vol. 7, Issue 6 · 30 Jun 2010 · 8,198 accessesView PDFCite
Research ArticleOpen accessIn the abstractMemoryless Modified Symmetric Rank-One Method for Large-Scale Unconstrained OptimizationFarzin Modarres, Malik Abu Hassan, Wah June LeongProblem statement: Memoryless QN methods have been regarded effective techniques for solving large-scale problems that can be considered as one step limited memory QN methods. In this study, we present a scaled memoryless modified Symmetric Rank-One (SR1) algorithm and investigate the numerical performance of the proposed algorithm for solving large-scale unconstrained optimization problems. Approach: The basic idea is to apply … …American Journal of Applied Sciences, Vol. 6, Issue 12 · 31 Dec 2009 · 7,981 accessesView PDFCite
Research ArticleOpen accessIn the abstractNumerical Solution of Fourth Order Linear Ordinary Differential Equations by Cubic Spline Collocation Tau MethodO.A. Taiwo, O.M. OgunlaranProblem Statement: Many boundary value problems that arise in real life situations defy analytical solution; hence numerical techniques are desirable to find the solution of such equations. New numerical methods which are comparatively better than the existing ones in terms of efficiency, accuracy, stability, convergence and computational cost are always needed. Approach: In this study, we developed and applied three … …Journal of Mathematics and Statistics, Vol. 4, Issue 4 · 31 Dec 2008 · 6,985 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Comparative Study of Stability Testing Approaches of Two-Dimensional Recursive Digital FiltersK. R. Santhi, M. Ponnavaikko, N. GangatharanThere are many problems in science and engineering whose solution is applied in the design of Multi-Dimensional (MD) digital filters. Digital filtering finds an important position in the field of digital signal and image processing. Recently there had been a great deal of interest in the design and stability analysis of Two-Dimensional (2-D) recursive digital filters. The design techniques for … …Journal of Computer Science, Vol. 4, Issue 12 · 31 Dec 2008 · 6,867 accessesView PDFCite
Research ArticleOpen accessIn the abstractValidation of the Calculation and Measurement Techniques of Earth Resistance ValuesN. Mohamad Nor, R. Rajab, K. RamarMuch research has been published in the literature on the mathematical approaches to obtain the most accurate earth resistance and resistivity values. However, the published research only conducted the comparisons among the mathematical/computational techniques and so far none has conducted validation tests of these mathematical/computational methods against the real earth resistance measurement at real field sites. Thus, the main contribution … …American Journal of Applied Sciences, Vol. 5, Issue 10 · 31 Oct 2008 · 7,214 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Survey of Protein Fold Recognition AlgorithmsMohammed Said Abual-Rub, Rosni AbdullahProblem statement: Predicting the tertiary structure of proteins from their linear sequence is really a big challenge in biology. This challenge is related to the fact that the traditional computational methods are not powerful enough to search for the correct structure in the huge conformational space. This inadequate capability of the computational methods, however, is a major obstacle in facing … …Journal of Computer Science, Vol. 4, Issue 9 · 30 Sep 2008 · 6,877 accessesView PDFCite
Research ArticleOpen accessIn the abstractGenetic Algorithm Based Probabilistic Motif Discovery in Unaligned Biological SequencesM. Hemalatha, K. VivekanandanFinding motif in biosequences is the most important primitive operation in computational biology. There are many computational requirements for a motif discovery algorithm such as computer memory space requirement and computational complexity. To overcome the complexity of motif discovery, we propose an alternative solution integrating genetic algorithm and Fuzzy Art machine learning approaches for eliminating multiple sequence alignment process. Problem … …Journal of Computer Science, Vol. 4, Issue 8 · 31 Aug 2008 · 6,729 accessesView PDFCite