권호 표지

Journal of applied mathematics & informatics

한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)

  • 연3회간
  • /
  • 2734-1194(pISSN)
  • /
  • 2234-8417(eISSN)

과학기술표준분류

  • 수학 ＞ 응용수학

Aim & Scope

This is a broad based journal covering all branches of computational or applied mathematics with special encouragement to researchers in theoretical computer science and mathematical Informatics. Thus, the major areas, such as Numerical Analysis, Discrete Optimization, Linear and Nonlinear Programming, Theory of Computation(Computational Complexity, Automata and Formal Languages), Control Theory, Theory of Algorithms, Computational Logic, Applied Combinatorics (including graphs, codes, and designs), Coding Theory, Cryptographics, Big data, AI, Fuzzy Theory with applications, Differential Equations with applications, etc., are all included. A large variety of scientific problems also necessarily involve Algebra, Analysis, Geometry, Probability and Statistics, and so on. The journal welcomes research papers in all branches of mathematics which have some bearing on the application to scientific problems, including papers in the areas of Actuarial Science, Mathematical Biology, Mathematical Economics and Finance.

KSCI KCI SCOPUS

제23권1_2호

  1. Zalmai, G.J. 1
    The purpose of this paper is to develop a fairly large number of sets of global parametric sufficient optimality conditions under various generalized $({\theta},\;{\eta},\;{\rho})-V-invexity$ assumptions for a discrete minmax fractional programming problem involving arbitrary norms.
  2. Jun, Se-Ran;Kang, Sung-Kwon;Kwon, Yong-Hoon 25
    A direct solver for the Legendre tau approximation for the two-dimensional Poisson problem is proposed. Using the factorization of symmetric eigenvalue problem, the algorithm overcomes the weak points of the Schur decomposition and the conventional diagonalization techniques for the Legendre tau approximation. The convergence of the method is proved and numerical results are presented.
  3. Pany Ambit Kumar;Nataraj Neela;Singh Sangita 43
    In this paper, an $H^1-Galerkin$ mixed finite element method is used to approximate the solution as well as the flux of Burgers' equation. Error estimates have been derived. The results of the numerical experiment show the efficacy of the mixed method and justifies the theoretical results obtained in the paper.
  4. Han, Sier;Tian, Zheng 57
    This paper considers how to detect structure change in persistence from I(1) to I(0) with innovations in the domain of attraction of a K-stable law. We derive the asymptotic distribution of test statistic and find that the asymptotic distribution of test statistics depends on the stable index K, which is often typically unknown and difficult to estimate. Therefore the subsampling method is proposed to detect changes without estimating K. We establish the asymptotic validity of this method and assess its performance in finite samples by means of simulation study.
  5. Kim, Gwang-Il;Kong, Jae-Hoon;Lee, Sun-Hong 73
    The general stereographic projection which maps a point on a sphere with arbitrary radius to a point on a plane stereographically and its inverse projection have the pythagorean-hodograph (PH) preserving property in the sense that they map a PH curve to another PH curve. Upon this fact, for given spatial $C^1$ Hermite data, we construct a spatial PH curve on a sphere that is a $C^1$ Hermite interpolant of the given data as follows: First, we solve $C^1$ Hermite interpolation problem for the stereographically projected planar data of the given data in $\mathbb{R}^3$ with planar PH curves expressed in the complex representation. Second, we construct spherical PH curves which are interpolants for the given data in $\mathbb{R}^3$ using the inverse general stereographic projection.
  6. Bao, Zhen-Hua;Ye, Zhong-Xing 87
    In this paper, we consider the Sparre Andersen risk model modified by the inclusion of interest on the surplus. By using the techniques of Cai and Dickson [Ins.: Math. Econ. 32(2003)], we give the functional and also the exponential type upper bounds for the tail probability of the deficit at ruin. Some special cases are also discussed.
  7. Li, Meili;Duan, Yongrui;Fu, Xianlong;Wang, Miansen 101
    In this paper, by using fractional power of operators and Sadovskii fixed point theorem, we study the controllability of abstract neutral functional integrodifferential systems with infinite delay. As application, an example is provided to illustrate the obtained results.
  8. Xu, Zhaoliang;Wang, Guorong 113
    Let A and E be $m{\times}n$ matrices and W an $n{\times}m$ matrix, and let $A_{d,w}$ denote the W-weighted Drazin inverse of A. In this paper, a new representation of the W-weighted Drazin inverse of A is given. Some new properties for the W-weighted Drazin inverse $A_{d,w}\;and\;B_{d,w}$ are investigated, where B=A+E. In addition, the Banach-type perturbation theorem for the W-weighted Drazin inverse of A and B are established, and the perturbation bounds for ${\parallel}B_{d,w}{\parallel}\;and\;{\parallel}B_{d,w}-A_{d,w}{\parallel}/{\parallel}A_{d,w}{\parallel}$ are also presented. When A and B are square matrices and W is identity matrix, some known results in the literature related to the Drazin inverse and the group inverse are directly reduced by the results in this paper as special cases.
  9. Bhatta Dambaru D. 127
    We present the boundary value problem (BVP) for the heave motion due to a vertical circular cylinder in water of finite depth. The BVP is presented in terms of velocity potential function. The velocity potential is obtained by considering two regions, namely, interior region and exterior region. The solutions for these two regions are obtained by the method of separation of variables. The analytical expressions for the hydrodynamic coefficients are derived. Computational results are presented for various depth to radius and draft to radius ratios.
  10. Valanarasu, T.;Ramanujam, N. 141
    In this paper a numerical method is presented to solve singularly perturbed two points boundary value problems for second order ordinary differential equations consisting a discontinuous source term. First, in this method, an asymptotic expansion approximation of the solution of the boundary value problem is constructed using the basic ideas of a well known perturbation method WKB. Then some initial value problems and terminal value problems are constructed such that their solutions are the terms of this asymptotic expansion. These initial value problems are happened to be singularly perturbed problems and therefore fitted mesh method (Shishkin mesh) are used to solve these problems. Necessary error estimates are derived and examples provided to illustrate the method.
  11. Liang, Tachen 153
    This paper deals with the empirical Bayes two-action problem of testing $H_0\;:\;{\theta}{\leq}{\theta}_0$: versus $H_1\;:\;{\theta}>{\theta}_0$ using a linear error loss for some discrete nonexponential families having probability function either $$f_1(x{\mid}{\theta})=(x{\alpha}+1-{\theta}){\theta}^x\prod\limits_{j=0}^x\;(j{\alpha}+1)$$ or $$f_2(x{\mid}{\theta})=[{\theta}\prod\limits_{j=0}^{x-1}(j{\alpha}+1-{\theta})]/[\prod\limits_{j=0}^x\;(j{\alpha}+1)]$$. Two empirical Bayes tests ${\delta}_n^*\;and\;{\delta}_n^{**}$ are constructed. We have shown that both ${\delta}_n^*\;and\;{\delta}_n^{**}$ are asymptotically optimal, and their regrets converge to zero at an exponential decay rate O(exp(-cn)) for some c>0, where n is the number of historical data available when the present decision problem is considered.
  12. Liu, Yuji 167
    The existence of solutions of the following multi-point boundary value problem $${x^{(n)}(t)=f(t,\;x(t),\;x'(t),{\cdots}, x^{(n-2)}(t))+r(t),\;0 is studied. Sufficient conditions for the existence of at least one solution of BVP(*) are established. It is of interest that the growth conditions imposed on f are allowed to be super-linear (the degrees of phases variables are allowed to be greater than 1 if it is a polynomial). The results are different from known ones since we don't apply the Green's functions of the corresponding problem and the method to obtain a priori bounds of solutions are different enough from known ones. Examples that can not be solved by known results are given to illustrate our theorems.
  13. Noor Muhammad Aslam 183
    In this paper, we introduce and study a new class of equilibrium problems, known as regularized mixed quasi equilibrium problems. We use the auxiliary principle technique to suggest and analyze some iterative schemes for regularized equilibrium problems. We prove that the convergence of these iterative methods requires either pseudomonotonicity or partially relaxed strongly monotonicity. Our proofs of convergence are very simple. As special cases, we obtain earlier results for solving equilibrium problems and variational inequalities involving the convex sets.
  14. Ciurea, Eleonor;Deaconu, Adrian 193
    In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow. A linear time and space method to decide if the problem has solution is presented. Strongly and weakly polynomial algorithms for solving the ImF problem are proposed. Some particular cases are studied and a numerical example is given.
  15. Ryoo, C.S. 205
    Over the years, there has been increasing interest in solving mathematical problems with the aid of computers. The main purpose of this paper is to investigate the roots of the q-Bernoulli polynomials $B_{n,q}{^r}(x)$ for values of the index n by using computer. Finally, we consider the reflection symmetries of the q-Bernoulli polynomials $B_{n,q}{^r}(x)$.
  16. Jumarie, Gyu 215
    By using the variational calculus of fractional order, one derives a Hamilton-Jacobi equation and a Lagrangian variational approach to the optimal control of one-dimensional fractional dynamics with fractional cost function. It is shown that these two methods are equivalent, as a result of the Lagrange's characteristics method (a new approach) for solving non linear fractional partial differential equations. The key of this results is the fractional Taylor's series $f(x+h)=E_{\alpha}(h^{\alpha}D^{\alpha})f(x)$ where $E_{\alpha}(.)$ is the Mittag-Leffler function.
  17. Cai, X.;Liu, F. 229
    Multi-term fractional differential equations have been used to simulate fractional-order control system. It has been demonstrated the necessity of the such controllers for the more efficient control of fractional-order dynamical system. In this paper, the multi-term fractional ordinary differential equations are transferred into equivalent a system of equations. The existence and uniqueness of the new system are proved. A fractional order difference approximation is constructed by a decoupled technique and fractional-order numerical techniques. The consistence, convergence and stability of the numerical approximation are proved. Finally, some numerical results are presented to demonstrate that the numerical approximation is a computationally efficient method. The new method can be applied to solve the fractional-order control system.
  18. Popescu, Mihai 243
    This paper deals with determining the sufficient conditions of minimum for the class of problems in which the necessary conditions of optimum are satisfied in the strengthened form Legendre-Clebsch. To this paper, we shall use the sweep method which analysis the conditions of existence of the conjugated points on the optimal trajectory. The study we have done evaluates the command variation on the neighboring optimal trajectory. The sufficient conditions of minimum are obtained by imposing the positivity of the second variation. The results that this method offers are applied to the problem o the orbital rendez-vous for the linear case of the equations of movement.
  19. Pirzada, S.;Naikoo, T.A.;Shah, N.A. 257
    An oriented graph is a digraph with no symmetric pairs of directed arcs and without loops. The score of a vertex $v_i$ in an oriented graph D is $a_{v_i}\;(or\;simply\;a_i)=n-1+d_{v_i}^+-d_{v_i}^-,\;where\; d_{v_i}^+\;and\;d_{v_i}^-$ are the outdegree and indegree, respectively, of $v_i$ and n is the number of vertices in D. In this paper, we give a new proof of Avery's theorem and obtain some stronger inequalities for scores in oriented graphs. We also characterize strongly transitive oriented graphs.
  20. Feng, Yan;Zhang, Xuesheng;Liu, Liying 269
    This paper describes a direct search method for a class of linearly constrained optimization problem. Through research we find it can be treated as an unconstrained optimization problem. And with the decrease of dimension of the variables need to be computed in the algorithms, the implementation of convergence to KKT points will be simplified to some extent. Convergence is shown under mild conditions which allow successive frames to be rotated, translated, and scaled relative to one another.
  21. Ahmad, I.;Yaqub, Mohd.;Ahmed, A. 281
    A pair of symmetric fractional variational programming problems is formulated over cones. Weak, strong, converse and self duality theorems are discussed under pseudoinvexity. Static symmetric dual fractional programs are included as special case and corresponding symmetric duality results are merely stated.
  22. Kim, Ju-Hong 293
    Recently a risk measure pricing and hedging is replacing a utility-based maximization problem in the literature. In this paper, we treat the optimal problem of risk measure pricing and hedging in the friction market, i.e. in the presence of transaction costs. The risk measure pricing is also verified with the contexts in the literature.
  23. Guo, Qiang;Liu, Jian-Guo 311
    This article studies a modified BFGS algorithm for solving smooth unconstrained strongly convex minimization problem. The modified BFGS method is based on the new quasi-Newton equation $B_k+1{^s}_k=yk\;where\;y_k^*=yk+A_ks_k\;and\;A_k$ is a matrix. Wei, Li and Qi [WLQ] have proven that the average performance of two of those algorithms is better than that of the classical one. In this paper, we prove the global convergence of these algorithms associated to a general line search rule.
  24. Su, Zhanjun;Ding, Ren 321
    We say that a triangle ${\Delta}$ tiles the polygon ${\rho}\;if\;{\rho}$ can be decomposed into finitely many non-overlapping triangles similar to ${\Delta}$. Let ${\rho}$ be a parallelogram with angles ${\delta}\;and\;{\pi}-{\delta}\;(0<{\delta}{\leq}{\pi}/2)$ and let ${\Delta}$ be a triangle with angles ${\alpha};{\beta},\;{\gamma}\;({\alpha}{\leq}{\beta}{\leq}{\gamma})$. We prove that if ${\Delta}$ tiles ${\rho}$ then either ${\delta}{\in}\;({\alpha},\;{\beta},\;{\gamma},\;{\pi}-{\gamma},\;{\pi}-2{\gamma})\;or\;dimL_{\rho}=dimL_{{\Delta}}$. We also prove that for every parallelogram P, and for every integer n $(where\;n{\geq}2,\;n{\neq}3)$ there is a triangle ${\Delta}$ so that n similar copies of ${\Delta}\;tile\;{\rho}$.
  25. Li, Zhaoxiang;Liu, Yanpei 329
    A map is bisingular if each edge is either a loop or an isthmus (i.e., on the boundary of the same face). In this paper we study the number of rooted bisingular maps on the sphere and the torus, and we also present formula for such maps with four parameters: the root-valency, the number of isthmus, the number of planar loops and the number of essential loops.
  26. Chen, Jinhai;Li, Weiguo 337
    In this paper, we obtain some new bounds for Perron root of a nonnegative matrix, which are expressed by easily calculated function in element of matrix. These new results generalize and improve the bounds of G. Frobenius [1] and H. Minc [2], and also extend the known results by Liu [6].
  27. Zhao, Haiqing;Feng, Enmin 345
    In this paper, cone-valued Lyapunov functions are employed to study the impulsive control system with variable times. The stability criteria on the non-zero solution of the impulsive control system are given by the cone-valued Lyapunov functions and the results of the controllability on the control system are also obtained.
  28. Song, Chun-Ling;Xia, Zun-Quan;Zhang, Li-Wei;Li, Shu-Yang 353
    A necessary and sufficient condition for Demyanov difference and Minkowski difference of compact convex subsets in $R^2$ being equal is given in this paper. Several examples are computed by Matlab to test our result. The necessary and sufficient condition makes us to compute Clarke subdifferential by quasidifferential for a special of Lipschitz functions.
  29. Jie, Shen;Pang, Li-Ping 361
    In this paper we propose an implementable method for solving a nonsmooth convex optimization problem by combining Moreau-Yosida regularization, bundle and quasi-Newton ideas. The method we propose makes use of approximate subgradients of the objective function, which makes the method easier to implement. We also prove the convergence of the proposed method under some additional assumptions.
  30. Lele, Celestin;Moutari, Salissou 369
    This paper is devoted to the foldness theory of implicative ideals in BCK-algebras. We use the fuzzy point concept to give some characterizations of fuzzy n-fold implicative ideals and establish some relationships with various n-fold ideals. We also construct some algorithms for studying the foldness of implicative ideals in BCK-algebras.
  31. Kar Tapan Kumar 385
    The dynamics of a prey-predator system, where predator population has two stages, juvenile and adult with harvesting are modelled by a system of delay differential equation. Our analysis shows that, both the delay and harvesting effort may play a significant role on the stability of the system. Numerical simulations are given to illustrate the results.
  32. Hussain Malik Zawwar;Hussain Maria 397
    Visualization of 2D and 3D data, which arises from some scientific phenomena, physical model or mathematical formula, in the form of curve or surface view is one of the important topics in Computer Graphics. The problem gets critically important when data possesses some inherent shape feature. For example, it may have positive feature in one instance and monotone in the other. This paper is concerned with the solution of similar problems when data has convex shape and its visualization is required to have similar inherent features to that of data. A rational cubic function [5] has been used for the review of visualization of 2D data. After that it has been generalized for the visualization of 3D data. Moreover, simple sufficient constraints are made on the free parameters in the description of rational bicubic functions to visualize the 3D convex data in the view of convex surfaces.
  33. Zuo, Chunyan;Wang, Xiaoxia 411
    In this paper, the connection among the attractor, the attractor neighborhood and the domain of influence are investigated. A necessary and sufficient condition of the existence of the quasi-attractor is established. Some results of Conley in [2] are generalized.
  34. Choi, Sung-Woo 419
    Medial axis transform (MAT) is very sensitive to noise, in the sense that, even if a shape is perturbed only slightly, the Hausdorff distance between the MATs of the original shape and the perturbed one may be large. Recently, Choi et al.(2002) showed that MAT is stable for a class of 2D domains called weakly injective, if we view this phenomenon with the one-sided Hausdorff distance, rather than with the two-sided Hausdorff distance. In this paper, we extend this result to general 2D domains with natural boundary regularity. We also present explicit bounds for this general one-sided stability of the 2D MAT.
  35. Yoon, Jung-Ho 435
    An important approach towards solving the scattered data problem is by using radial basis functions. However, for a large class of smooth basis functions such as Gaussians, the existing theories guarantee the interpolant to approximate well only for a very small class of very smooth approximate which is the so-called 'native' space. The approximands f need to be extremely smooth. Hence, the purpose of this paper is to study approximation by a scattered shifts of a radial basis functions. We provide error estimates on larger spaces, especially on the homogeneous Sobolev spaces.
  36. Jeong, Jin-Mun;Kim, Han-Geul 445
    This paper deals with the approximate controllability for the nonlinear functional differential equations with time delay and studies a variation of constant formula for solutions of the given equations.
  37. Choi, Won 455
    In allelic model $X=(x_1,\;x_2,\;{\cdots},\;x_d)$, $$M_f(t)=f(p(t))-{\int}_0^t\;Lf(p(t))ds$$ is a P-martingale for diffusion operator L under the certain conditions. In this note, we try to apply diffusion processes for countable-allelic model in population genetic model and we can define a new diffusion operator $L^*$. Since the martingale problem for this operator $L^*$ is related to diffusion processes, we can define a integral which is combined with operator $L^*$ and a bilinar form $<{\cdot},{\cdot}>$. We can find properties for this integral using maximum principle.
  38. Kim, Shi-Nuk 461
    Parameter identification is studied in viscoelastic rods by solving an inverse problem numerically. The material properties of the rod, which appear in the constitutive relations, are recovered by optimizing an objective function constructed from reference strain data. The resulting inverse algorithm consists of an optimization algorithm coupled with a corresponding direct algorithm that computes the strain fields given a set of material properties. Numerical results are presented for two model inverse problems; (i)the effect of noise in the reference strain fields (ii) the effect of minimal reference data in space and/or time data.
  39. Chang, Se-Kyung 471
    In this paper we establish some recurrence relations satisfied by the quotient moments of the upper record values from the Weibull distribution. Suppose $X{\in}WEI({\lambda})\;then\;E(\frac {X^\tau_U(m)} {X^{s+1}_{U(n)}})=\frac{1}{(s-\lambda+1)}E(\frac {X^\tau_U(m)}{X^{s-\lambda+1}_{U(n-1)}})-\frac{1}{(s-\lambda+1)}+E(\frac{X^\tau_U(m)}{X^{s-\lambda+1}_{U(n)}})\;and\;E(\frac {X^{\tau+1}_{U(m)}}{X^s_{U(n)}})=\frac{1}{(r+\lambda+1)}E(\frac{X^{\tau+\lambda+1}_{U(m)}}{X^s_{U(n-1)}})-\frac{1}{(\tau+\lambda+1)}E(\frac{X^{\tau+\lambda+1}_{U(m-1)}}{X^s_{U(n-1)}})$.
  40. Kim, Sung-Kyun;Kim, Sung-Lai;Lee, Young-Whan 479
    A sequential procedure is proposed in order to construct one-sided confidence intervals for a normal mean with guaranteed coverage probability and ${\beta}-protection$ when the normal mean and variance are identical. First-order asymptotic properties on the sequential sample size are found. The derived results hold with uniformity in the total parameter space or its subsets.
  41. Lee, Choon-HO 489
    Let g be a continuous function on an interval I which is not constant on any subinterval of I, and let ${\mu}$ be a Borel measure on I. In this paper we give a necessary and sufficient conditions guaranteeing, for the strongly measurable function f on I with values in a Banach space X, the existence of a continuous primitive function F on I with respect to g.
  42. Baek, In-Soo 497
    We consider a non-empty subset having same local dimension of a self-similar measure on a most generalized Cantor set. We study trans-formed lower(upper) local dimensions of an element of the subset which are local dimensions of all the self-similar measures on the most generalized Cantor set. They give better information of Hausdorff(packing) dimension of the afore-mentioned subset than those only from local dimension of a given self-similar measure.
  43. Yang, Moon-Hee;Rhee, Min-Surp 505
    In this paper, we provide some fundamental properties and basic theoretical results of K-class-based dedicated storage policy in a unit load system assuming the constant-space assumption that the number of storage locations for a class is not the maximum aggregate inventory position for a class but the sum of space requirement for products assigned to the class. The main theorem is that there exists a (K+1) -class-based storage layout whose expexted single command (SC) travel time is not greater than that of a K-class-based storage layout, i.e, $E(SC^*_{K+1}){\leq}E(SC^*_K)\;for\;K=1,{\cdots}$, (n-1).
  44. Shin, Dong-Soo 517
    Let R/I be an Artinian algebra of codimension 3 with Hilbert function H such that $h_{d-1}>h_d=h_{d+1}$. Ahn and Shin showed that A cannot be level if ${\beta}_{1,d+2}(Gin(I))={\beta}_{2,d+2}(Gin(I))$ where Gin(I) is a generic initial ideal of I. We prove that some certain graded Artinian algebra R/I cannot be level if either ${\beta}_{1,d}(I^{lex})={\beta}_{2,d}(I^{lex})+1\;or\;{\beta}_{1,d+1}(I^{lex})={\beta}_{2,d+1}(I^{lex})\;where\;I^{lex}$ is a lex-segment ideal associated to I.
  45. Jeong, Jae-Ug 525
    In this paper, we prove the weak and strong convergence of the Noor iterative scheme to a common fixed point for two asymptotically nonexpansive mappings in a uniformly convex Banach space under a condition weaker than compactness. Our theorems improve and generalize some previous results.
  46. Kang, Jeong-Heung 537
    We investigate complemented Banach sublattices of the Banach envelope of $Weak_L1$. In particular, the Banach envelope of $Weak_L1$ contains a complemented Banach sublattice that is isometrically isomorphic to a nonseparable Banach lattice $l_p(S),\;1{\leq}p<{\infty}\;and\;|S|{\leq}2^{{\aleph}0}$.
  47. Hong, Dug-Hun;Kim, Kyung-Tae 547
    In this note, we extends some of the results of Liu [Fuzzy Sets and systems 157 (2006) 869-878]. This extension consists of a simple proof involving weighted functions and their preference index. We also give an elementary simple proof of the maximum entropy weighting function problem with a given preference index value without using any advanced theory like variational principles or without using Lagrangian multiplier methods.
  48. Hwang, Seok-Yoon 553
    In this paper we propose the concept of fuzzy basis of fuzzy submachine, which is the generalized form of crisp basis of submachine, and we extend the system of generators and free subset to fuzzy forms, from which we prove that minimal system of fuzzy generators, maximally free fuzzy subset, and fuzzy basis are equivalent forms.
  49. Shim, Hong-Tae 563
    There has been a considerable research interest in medical communities for neuronal fiber tracking with magnetic resonance diffusion tensor imaging(DTI). DTI data have abundant structural boundaries that need to be preserved during interpolation to facilitate fiber tracking. Sigmoid function has been used in recent papers but the sigmoid function still is not good enough to be served as an positive interpolation in mathematical point of view. In this paper, we construct and provide two families positive cardinal interpolation functions.
  50. Choo, S.M. 571
    Finite difference schemes are considered for a generalization of the Cahn-Hilliard equation with Neumann boundary conditions and the Kuramoto-Sivashinsky equation with a periodic boundary condition, which is of the type $ut+\frac{{\partial}^2} {{\partial}x^2}\;g\;(u,\;u_x,\;u_{xx})=f(u,\;u_x,\;u_{xx})$. Stability and $L^{\infty}$ error estimates of approximate solutions for the corresponding schemes are obtained using the extended Lax-Richtmyer equivalence theorem.
  51. Park, Suk-Bong 581
    We reconsider the classical orthogonal polynomials which are solutions to a second order differential equation of the form $$l_2(x)y'(x)+l_1(x)y'(x)={\lambda}_ny(x)$$. We investigate two characterization theorems of F. Marcellan et all and K.H.Kwon et al. which gave necessary and sufficient conditions on $l_1(x)\;and\;l_2(x)$ for the above differential equation to have orthogonal polynomial solutions. The purpose of this paper is to give a proof that each result in their papers respectively is equivalent.