• Title/Summary/Keyword: K-point

Search Result 28,023, Processing Time 0.05 seconds

FIXED POINT THEOREMS FOR GENERALIZED NONEXPANSIVE SET-VALUED MAPPINGS IN CONE METRIC SPACES

  • Kim, Seung-Hyun;Lee, Byung-Soo
    • East Asian mathematical journal
    • /
    • v.27 no.5
    • /
    • pp.557-564
    • /
    • 2011
  • In 2007, Huang and Zhang [1] introduced a cone metric space with a cone metric generalizing the usual metric space by replacing the real numbers with Banach space ordered by the cone. They considered some fixed point theorems for contractive mappings in cone metric spaces. Since then, the fixed point theory for mappings in cone metric spaces has become a subject of interest in [1-6] and references therein. In this paper, we consider some fixed point theorems for generalized nonexpansive setvalued mappings under suitable conditions in sequentially compact cone metric spaces and complete cone metric spaces.

RELAXED PROXIMAL POINT ALGORITHMS BASED ON A-AXIMAL RELAXED MONOTONICITY FRAMEWORKS WITH APPLICATIONS

  • Agarwal, Ravi P.;Verma, Ram U.
    • East Asian mathematical journal
    • /
    • v.27 no.5
    • /
    • pp.545-555
    • /
    • 2011
  • Based on the A-maximal(m)-relaxed monotonicity frameworks, the approximation solvability of a general class of variational inclusion problems using the relaxed proximal point algorithm is explored, while generalizing most of the investigations, especially of Xu (2002) on strong convergence of modified version of the relaxed proximal point algorithm, Eckstein and Bertsekas (1992) on weak convergence using the relaxed proximal point algorithm to the context of the Douglas-Rachford splitting method, and Rockafellar (1976) on weak as well as strong convergence results on proximal point algorithms in real Hilbert space settings. Furthermore, the main result has been applied to the context of the H-maximal monotonicity frameworks for solving a general class of variational inclusion problems. It seems the obtained results can be used to generalize the Yosida approximation that, in turn, can be applied to first- order evolution inclusions, and can also be applied to Douglas-Rachford splitting methods for finding the zero of the sum of two A-maximal (m)-relaxed monotone mappings.

POSITIVE PSEUDO-SYMMETRIC SOLUTIONS FOR THREE-POINT BOUNDARY VALUE PROBLEMS WITH DEPENDENCE ON THE FIRST ORDER DERIVATIVE

  • Guo, Yanping;Han, Xiaohu;Wei, Wenying
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.5_6
    • /
    • pp.1323-1329
    • /
    • 2010
  • In this paper, a new fixed point theorem in cone is applied to obtain the existence of at least one positive pseudo-symmetric solution for the second order three-point boundary value problem {x" + f(t, x, x')=0, t $\in$ (0, 1), x(0)=0, x(1)=x($\eta$), where f is nonnegative continuous function; ${\eta}\;{\in}$ (0, 1) and f(t, u, v) = f(1+$\eta$-t, u, -v).

Neutral-point Potential Balancing Method for Switched-Inductor Z-Source Three-level Inverter

  • Wang, Xiaogang;Zhang, Jie
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.3
    • /
    • pp.1203-1210
    • /
    • 2017
  • Switched-inductor (SL) Z-source three-level inverter is a novel high power topology. The SL based impedance network can boost the input dc voltage to a higher value than the single LC impedance network. However, as all the neutral-point-clamped (NPC) inverters, the SL Z-source three-level inverter has to balance the neutral-point (NP) potential too. The principle of the inverter is introduced and then the effects of NP potential unbalance are analyzed. A NP balancing method is proposed. Other than the methods for conventional NPC inverter without Z-source impedance network, the upper and lower shoot-through durations are corrected by the feedforward compensation factors. With the proposed method, the NP potential is balanced and the voltage boosting ability of the Z-source network is not affected obviously. Simulations are conducted to verify the proposed method.

On-Line Calculation of the Critical Point of Voltage Collapse Based on Multiple Load Flow Solutions (다중조류계산을 이용한 전압붕괴 임계점의 On-Line 계산)

  • Nam, Hae-Kon;Kim, Dong-Jun
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.134-136
    • /
    • 1993
  • This paper presents a novel and efficient method to calculate the critical point of voltage collapse. Conjugate gradient and modified Newton-Raphson methods are employed to calculate two pairs of multiple load flow solutions for two operating conditions, i.e., both +mode and -mode voltages for two loading conditions respectively. Then these four voltage magnitude-load data sets of the bus which is most susceptible to voltage collapse, are fitted to third order polynomial using Lagrangian interpolation in order to represent approximate nose curve (P-V curve). This nose curve locates first estimate of the critical point of voltage collapse. The procedure described above is repeated near the critical point and the new estimate will be very close to the critical point. The proposed method is tested for the eleven bus Klos-Kerner system, with good accuracy and fast computation time.

  • PDF

New large-update primal interior point algorithms based on kernel functions for LCPs

  • Kim, Min-Kyung;Cho, Gyeong-Mi
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.11 no.4
    • /
    • pp.69-88
    • /
    • 2007
  • In this paper we propose new large-update primal-dual interior point algorithms for $P_{\neq}({\kappa})$ linear complementarity problems(LCPs). New search directions and proximity measures are proposed based on a specific class of kernel functions, ${\psi}(t)={\frac{t^{p+1}-1}{p+1}}+{\frac{t^{-q}-1}{q}}$, q>0, $p{\in}[0,\;1]$, which are the generalized form of the ones in [3] and [12]. It is the first to use this class of kernel functions in the complexity analysis of interior point method(IPM) for $P_*({\kappa})$LCPs. We showed that if a strictly feasible starting point is available, then new large-update primal-dual interior point algorithms for $P_*({\kappa})$ LCPs have the best known complexity $O((1+2{\kappa}){\sqrt{2n}}(log2n)log{\frac{n}{\varepsilon}})$ when p=1 and $q=\frac{1}{2}(log2n)-1$.

  • PDF

Projection Loss for Point Cloud Augmentation (점운증강을 위한 프로젝션 손실)

  • Wu, Chenmou;Lee, Hyo-Jone
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2019.05a
    • /
    • pp.482-484
    • /
    • 2019
  • Learning and analyzing 3D point clouds with deep networks is challenging due to the limited and irregularity of the data. In this paper, we present a data-driven point cloud augmentation technique. The key idea is to learn multilevel features per point and to reconstruct to a similar point set. Our network is applied to a projection loss function that encourages the predicted points to remain on the geometric shapes with a particular target. We conduct various experiments using ShapeNet part data to evaluate our method and demonstrate its possibility. Results show that our generated points have a similar shape and are located closer to the object.

A Fixed Point for Pair of Maps in Intuitionistic Fuzzy Mtric Space

  • Park, Jong-Seo;Kim, Seon-Yu
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.7 no.3
    • /
    • pp.159-164
    • /
    • 2007
  • Park, Park and Kwun[6] is defined the intuitionistic fuzzy metric space in which it is a little revised from Park[5]. According to this paper, Park, Kwun and Park[11] Park and Kwun[10], Park, Park and Kwun[7] are established some fixed point theorems in the intuitionistic fuzzy metric space. Furthermore, Park, Park and Kwun[6] obtained common fixed point theorem in the intuitionistic fuzzy metric space, and also, Park, Park and Kwun[8] proved common fixed points of maps on intuitionistic fuzzy metric spaces. We prove a fixed point for pair of maps with another method from Park, Park and Kwun[7] in intuitionistic fuzzy metric space defined by Park, Park and Kwun[6]. Our research are an extension of Vijayaraju and Marudai's result[14] and generalization of Park, Park and Kwun[7], Park and Kwun[10].

THE CRITICAL PODS OF PLANAR QUADRATIC POLYNOMIAL MAPS OF TOPOLOGICAL DEGREE 2

  • Misong Chang;Sunyang Ko;Chong Gyu Lee;Sang-Min Lee
    • Bulletin of the Korean Mathematical Society
    • /
    • v.60 no.3
    • /
    • pp.659-675
    • /
    • 2023
  • Let K be an algebraically closed field of characteristic 0 and let f be a non-fibered planar quadratic polynomial map of topological degree 2 defined over K. We assume further that the meromorphic extension of f on the projective plane has the unique indeterminacy point. We define the critical pod of f where f sends a critical point to another critical point. By observing the behavior of f at the critical pod, we can determine a good conjugate of f which shows its statue in GIT sense.

The Measurement and Prediction of Flash Point for Binary Mixtures of Methanol, Ethanol, 2-Propanol and 1-Butanol at 101.3 kPa (Methanol, Ethanol, 2-Propanol 그리고 1-Butanol 이성분 혼합계에 대한 101.3 kPa에서의 인화점 측정 및 예측)

  • Oh, In Seok;In, Se Jin
    • Fire Science and Engineering
    • /
    • v.29 no.5
    • /
    • pp.1-6
    • /
    • 2015
  • Flash point is one of the most important variables used to characterize fire and explosion hazard of liquids. The lower flash point data were measured for the binary systems {methanol + 1-butanol}, {ethanol + 1-butanol} and {2-propanol + 1-butanol} at 101.3 kPa. Experiments were performed according to the standard test method (ASTM D 3278) using a SETA closed cup flash point tester. The measured flash points were compared with the predicted values calculated using the following activity coefficient models: Wilson, Non-Random Two Liquid (NRTL), and UNIversal QUAsiChemical (UNIQUAC). The measured FP data agreed well with the predicted values of Raoult's law, Wilson, NRTL and UNIQUAC models. The average absolute deviation between the predicted and measured lower FP was less than 1.14 K.