• Title/Summary/Keyword: Applied example

Search Result 2,640, Processing Time 0.026 seconds

Preform Design by the Sensitivity Method (민감도법을 이용한 자유단조 공정의 예비성형체 설계)

  • 심현보;노현철;서의권
    • Transactions of Materials Processing
    • /
    • v.10 no.4
    • /
    • pp.294-301
    • /
    • 2001
  • The sensitivity method has been applied to find perform shape that results in the desired shape after foring. As a 2D example, initial shape of specimen for the cylinder shape without barrelling after forging has been found. The method is then applied to various shapes of 3D free forging and initial shapes of the corresponding specimens after forging have been found successfully The sensitivity method is proven to be an effective and accurate tool for the preform design.

  • PDF

Bayesian Test for Equality of Coefficients of Variation in the Normal Distributions

  • Lee, Hee-Choon;Kang, Sang-Gil;Kim, Dal-Ho
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.49-56
    • /
    • 2003
  • When X and Y have independent normal distributions, we develop a Bayesian testing procedure for the equality of two coefficients of variation. Under the reference prior of the coefficient of variation, we propose a Bayesian test procedure for the equality of two coefficients of variation using fractional Bayes factor. A real data example is provided.

  • PDF

MODIFIED NUMEROV METHOD FOR SOLVING SYSTEM OF SECOND-ORDER BOUNDARY-VALUE PROBLEMS

  • Al-Said, Eisa A.;Noor, Muhammad Aslam
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.1
    • /
    • pp.129-136
    • /
    • 2001
  • We introduce and discuss a new numerical method for solving system of second order boundary value problems, where the solution is required to satisfy some extra continuity conditions on the subintervals in addition to the usual boundary conditions. We show that the present method gives approximations which are better than that produced by other collocation, finite difference and spline methods. Numerical example is presented to illustrate the applicability of the new method. AMS Mathematics Subject Classification : 65L12, 49J40.

ON THE CONVERGENCE AND APPLICATIONS OF NEWTON-LIKE METHODS FOR ANALYTIC OPERATORS

  • Argyros, Ioannis K.
    • Journal of applied mathematics & informatics
    • /
    • v.10 no.1_2
    • /
    • pp.41-50
    • /
    • 2002
  • We provide local and semilocal theorems for the convergence of Newton-like methods to a locally unique solution of an equation in a Banach space. The analytic property of the operator involved replaces the usual domain condition for Newton-like methods. In the case of the local results we show that the radius of convergence can be enlarged. A numerical example is given to justify our claim . This observation is important and finds applications in steplength selection in predictor-corrector continuation procedures.

ON QUADRATIC FRACTIONAL GENERALIZED SOLID BI-CRITERION TRANSPORTATION PROBLEM

  • Manjusri Basu;Acharya, Debi-Prasad
    • Journal of applied mathematics & informatics
    • /
    • v.10 no.1_2
    • /
    • pp.131-143
    • /
    • 2002
  • In this paper hi-criterion quadratic fractional generalized solid transportation problem is studied. An algorithm is developed to obtain the time-cost trade-off pairs and hence identifies the optimum trade-off pairs giving the equal priority to both time and cost. A numerical example is illustrated to support the algorithm.

MULTIGRID METHOD FOR NONLINEAR INTEGRAL EQUATIONS

  • HOSAE LEE
    • Journal of applied mathematics & informatics
    • /
    • v.4 no.2
    • /
    • pp.487-500
    • /
    • 1997
  • In this paper we introduce a multigrid method for solving the nonliear Urysohn integral equation. The algorithm is derived from a discrete resolvent equation which approximates the continuous resolvent equation of the nonlinear Urysohn integral equa-tion. The algorithm is mathematically equivalent to Atkinson's adap-tive twogrid iteration. But the two are different computationally. We show the convergence of the algorithm and its equivalence to Atkinson's adaptive twogrid iteration. in our numerical example we compare our algorithm to other multigrid methods for solving the nonliear Urysohn integral equation including the nonlinear multigrid nethod introduced by hackbush.

EXTRA-GRADIENT METHODS FOR QUASI-NONEXPANSIVE OPERATORS

  • JEONG, JAE UG
    • Journal of applied mathematics & informatics
    • /
    • v.34 no.5_6
    • /
    • pp.467-478
    • /
    • 2016
  • In this paper, we propose an Ishikawa-type extra-gradient iterative algorithm for finding a solution of split feasibility, fixed point problems and equilibrium problems of quasi-nonexpansive mappings. It is proven that under suitable conditions, the sequences generated by the proposed iterative algorithms converge weakly to a solution of the split feasibility, fixed point problems and equilibrium problems. An example is given to illustrate the main result of this paper.

A STUDY FOR DEVELOPMENT OF FILM NEGATIVE IN BULK REACTION CASE

  • Ha, Sung-N.;Park, Jung-Joon
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.1_2
    • /
    • pp.365-374
    • /
    • 2008
  • We study a mathematical modeling for development of film negative and concentrate the bulk reaction problem. We prove nonnegativeness of developer, coupler and dye function in two dimensional case. Also we prove stability of our numerical scheme. Finally, we discuss numerical example which have specified constants.

  • PDF

STABILITY OF IMPULSIVE CELLULAR NEURAL NETWORKS WITH TIME-VARYING DELAYS

  • Zhang, Lijuan;Yu, Lixin
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.5_6
    • /
    • pp.1327-1335
    • /
    • 2011
  • This paper demonstrates that there is a unique exponentially stable equilibrium state of a class of impulsive cellular neural network with delays. The analysis exploits M-matrix theory and generalized comparison principle to derive some easily verifiable sufficient conditions for the global exponential stability of the equilibrium state. The results extend and improve earlier publications. An example with its simulation is given for illustration of theoretical results.

AN EXACT PENALTY FUNCTION METHOD FOR SOLVING A CLASS OF NONLINEAR BILEVEL PROGRAMS

  • Lv, Yibing
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.5_6
    • /
    • pp.1533-1539
    • /
    • 2011
  • In this paper, a class of nonlinear bilevel programs, i.e. the lower level problem is linear programs, is considered. Aiming at this special structure, we append the duality gap of the lower level problem to the upper level objective with a penalty and obtain a penalized problem. Using the penalty method, we give an existence theorem of solution and propose an algorithm. Then, a numerical example is given to illustrate the algorithm.