• Title/Summary/Keyword: approximation operators

Search Result 94, Processing Time 0.033 seconds

THE OPERATORS 𝜋G OF BEST APPROXIMATIONS AND CONTINUOUS METRIC PROJECTIONS

  • RHEE, HYANG JOO
    • Journal of applied mathematics & informatics
    • /
    • v.40 no.3_4
    • /
    • pp.669-674
    • /
    • 2022
  • In this paper, we shall consider some properties of the metric projection as a set valued mapping. For a set G in a metric space E, the mapping 𝜋G; x → 𝜋G(x) of E into 2G is called set valued metric projection of E onto G. We investigated the properties related to the projection PS(·)(·) and 𝜋S(·)(·) as one-sided best simultaneous approximations.

ON SPACES OF WEAK* TO WEAK CONTINUOUS COMPACT OPERATORS

  • Kim, Ju Myung
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.1
    • /
    • pp.161-173
    • /
    • 2013
  • This paper is concerned with the space $\mathcal{K}_{w^*}(X^*,Y)$ of $weak^*$ to weak continuous compact operators from the dual space $X^*$ of a Banach space X to a Banach space Y. We show that if $X^*$ or $Y^*$ has the Radon-Nikod$\acute{y}$m property, $\mathcal{C}$ is a convex subset of $\mathcal{K}_{w^*}(X^*,Y)$ with $0{\in}\mathcal{C}$ and T is a bounded linear operator from $X^*$ into Y, then $T{\in}\bar{\mathcal{C}}^{{\tau}_{\mathcal{c}}}$ if and only if $T{\in}\bar{\{S{\in}\mathcal{C}:{\parallel}S{\parallel}{\leq}{\parallel}T{\parallel}\}}^{{\tau}_{\mathcal{c}}}$, where ${\tau}_{\mathcal{c}}$ is the topology of uniform convergence on each compact subset of X, moreover, if $T{\in}\mathcal{K}_{w^*}(X^*, Y)$, here $\mathcal{C}$ need not to contain 0, then $T{\in}\bar{\mathcal{C}}^{{\tau}_{\mathcal{c}}}$ if and only if $T{\in}\bar{\mathcal{C}}$ in the topology of the operator norm. Some properties of $\mathcal{K}_{w^*}(X^*,Y)$ are presented.

PRECONDITIONING FOR THE p-VERSION BOUNDARY ELEMENT METHOD IN THREE DIMENSIONS WITH TRIANGULAR ELEMENTS

  • Cao, Wei-Ming;Guo, Benqi
    • Journal of the Korean Mathematical Society
    • /
    • v.41 no.2
    • /
    • pp.345-368
    • /
    • 2004
  • A preconditioning algorithm is developed in this paper for the iterative solution of the linear system of equations resulting from the p-version boundary element approximation of the three dimensional integral equation with hypersingular operators. The preconditioner is derived by first making the nodal and side basis functions locally orthogonal to the element internal bases, and then by decoupling the nodal and side bases from the internal bases. Its implementation consists of solving a global problem on the wire-basket and a series of local problems defined on a single element. Moreover, the condition number of the preconditioned system is shown to be of order $O((1+ln/p)^{7})$. This technique can be applied to discretization with triangular elements and with general basis functions.

The Design of the IIR Differintegrator and its Application in Edge Detection

  • Jain, Madhu;Gupta, Maneesha;Jain, N.K.
    • Journal of Information Processing Systems
    • /
    • v.10 no.2
    • /
    • pp.223-239
    • /
    • 2014
  • New IIR digital differintegrators (differentiator and integrator) with very minor absolute relative errors are presented in this paper. The digital integrator is designed by interpolating some of the existing integrators. The optimum value of the interpolation ratio is obtained through linear programming optimization. Subsequently, by modifying the transfer function of the proposed integrator appropriately, new digital differentiator is obtained. Simulation results demonstrate that the proposed differintegrator are a more accurate approximation of ideal ones, than the existing differintegrators. Furthermore, the proposed differentiator has been tested in an image processing application. Edges characterize boundaries and are, therefore, a problem of fundamental importance in image processing. For comparison purpose Prewitt, Sobel, Roberts, Canny, Laplacian of Gaussian (LOG), Zerocross operators were used and their results are displayed. The results of edge detection by some of the existing differentiators are also provided. The simulation results have shown the superiority of the proposed approach over existing ones.

LONG-TIME BEHAVIOR OF A FAMILY OF INCOMPRESSIBLE THREE-DIMENSIONAL LERAY-α-LIKE MODELS

  • Anh, Cung The;Thuy, Le Thi;Tinh, Le Tran
    • Bulletin of the Korean Mathematical Society
    • /
    • v.58 no.5
    • /
    • pp.1109-1127
    • /
    • 2021
  • We study the long-term dynamics for a family of incompressible three-dimensional Leray-α-like models that employ the spectral fractional Laplacian operators. This family of equations interpolates between incompressible hyperviscous Navier-Stokes equations and the Leray-α model when varying two nonnegative parameters 𝜃1 and 𝜃2. We prove the existence of a finite-dimensional global attractor for the continuous semigroup associated to these models. We also show that an operator which projects the weak solution of Leray-α-like models into a finite-dimensional space is determining if it annihilates the difference of two "nearby" weak solutions asymptotically, and if it satisfies an approximation inequality.

A comparative study on learning effects based on the reliability model depending on Makeham distribution (Makeham분포에 의존한 신뢰성모형에 근거한 학습효과 특성에 관한 비교 연구)

  • Kim, Hee-Cheul;Cheul, Shin-Hyun
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.5
    • /
    • pp.496-502
    • /
    • 2016
  • In this study, we investigated the comparative NHPP software model based on learning techniques that operators in the process of software testing and development of software products that can be applied to software test tool. The life distribution was applied Makeham distribution based on finite fault NHPP. Software error detection techniques known in advance, but influencing factors for considering the errors found automatically and learning factors, by prior experience, to find precisely the error factor setting up the testing manager are presented comparing the problem. As a result, the learning factor is larger than automatic error that is usually well-organized model could be established. This paper, a trust characterization of applying using time among failures and parameter approximation using maximum likelihood estimation, after the effectiveness of the data through trend examination model selection were well-organized using the mean square error and $R^2$. From this paper, the software operators must be considered life distribution by the basic knowledge of the software to confirm failure modes which may be helped.

Suggestion for a splitting technique of the square-root operator of three dimensional acoustic parabolic equation based on two variable rational approximant with a factored denominator (인수분해 된 분모를 갖는 두 변수 유리함수 근사에 기반한 3차원 음향 포물선 방정식 제곱근 연산자의 분할기법 제안)

  • Lee, Keunhwa
    • The Journal of the Acoustical Society of Korea
    • /
    • v.36 no.1
    • /
    • pp.1-11
    • /
    • 2017
  • In this study, novel approximate form of the square-root operator of three dimensional acoustic Parabolic Equation (3D PE) is proposed using a rational approximant for two variables. This form has two advantages in comparison with existing approximation studies of the square-root operator. One is the wide-angle capability. The proposed form has wider angle accuracy to the inclination angle of ${\pm}62^{\circ}$ from the range axis of 3D PE at the bearing angle of $45^{\circ}$, which is approximately three times the angle limit of the existing 3D PE algorithm. Another is that the denominator of our approximate form can be expressed into the product of one-dimensional operators for depth and cross-range. Such a splitting form is very preferable in the numerical analysis in that the 3D PE can be easily transformed into the tridiagonal matrix equation. To confirm the capability of the proposed approximate form, comparative study of other approximation methods is conducted based on the phase error analysis, and the proposed method shows best performance.

Optimal design of floating substructures for spar-type wind turbine systems

  • Choi, Ejae;Han, Changwan;Kim, Hanjong;Park, Seonghun
    • Wind and Structures
    • /
    • v.18 no.3
    • /
    • pp.253-265
    • /
    • 2014
  • The platform and floating structure of spar type offshore wind turbine systems should be designed in order for the 6-DOF motions to be minimized, considering diverse loading environments such as the ocean wave, wind, and current conditions. The objective of this study is to optimally design the platform and substructure of a 3MW spar type wind turbine system with the maximum postural stability in 6-DOF motions as well as the minimum material cost. Therefore, design variables of the platform and substructure were first determined and then optimized by a hydrodynamic analysis. For the hydrodynamic analysis, the body weight of the system was considered, and the ocean wave conditions were quantified to the wave forces using the Morison's equation. Moreover, the minimal number of computation analysis models was generated by the Design of Experiments (DOE), and the design variables of the platform and substructure were finally optimized by using a genetic algorithm with a neural network approximation.

Evolutionary Algorithm for solving Optimum Communication Spanning Tree Problem (최적 통신 걸침 나무 문제를 해결하기 위한 진화 알고리즘)

  • Soak Sang-Moon;Chang Seok-Cheol;Byun Sung-Cheal;Ahn Byung-Ha
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.4
    • /
    • pp.268-276
    • /
    • 2005
  • This paper deals with optimum communication spanning tree(OCST) problem. Generally, OCST problem is known as NP-hard problem and recently, it is reveled as MAX SNP hard by Papadimitriou and Yannakakis. Nevertheless, many researchers have used polynomial approximation algorithm for solving this problem. This paper uses evolutionary algorithm. Especially, when an evolutionary algorithm is applied to tree network problem such as the OCST problem, representation and genetic operator should be considered simultaneously because they affect greatly the performance of algorithm. So, we introduce a new representation method to improve the weakness of previous representation which is proposed for solving the degree constrained minimum spanning tree problem. And we also propose a new decoding method to generate a reliable tree using the proposed representation. And then, for finding a suitable genetic operator which works well on the proposed representation, we tested three kinds of genetic operators using the information of network or the genetic information of parents. Consequently, we could confirm that the proposed method gives better results than the previous methods.

Development of a Flow Analysis Code Using an Unstructured Grid with the Cell-Centered Method

  • Myong, Hyon-Kook;Kim, Jong-Tae
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.12
    • /
    • pp.2218-2229
    • /
    • 2006
  • A conservative finite-volume numerical method for unstructured grids with the cell-centered method has been developed for computing flow and heat transfer by combining the attractive features of the existing pressure-based procedures with the advances made in unstructured grid techniques. This method uses an integral form of governing equations for arbitrary convex polyhedra. Care is taken in the discretization and solution procedure to avoid formulations that are cell-shape-specific. A collocated variable arrangement formulation is developed, i.e. all dependent variables such as pressure and velocity are stored at cell centers. For both convective and diffusive fluxes the forms superior to both accuracy and stability are particularly adopted and formulated through a systematic study on the existing approximation ones. Gradients required for the evaluation of diffusion fluxes and for second-order-accurate convective operators are computed by using a linear reconstruction based on the divergence theorem. Momentum interpolation is used to prevent the pressure checkerboarding and a segregated solution strategy is adopted to minimize the storage requirements with the pressure-velocity coupling by the SIMPLE algorithm. An algebraic solver using iterative preconditioned conjugate gradient method is used for the solution of linearized equations. The flow analysis code (PowerCFD) developed by the present method is evaluated for its application to several 2-D structured-mesh benchmark problems using a variety of unstructured quadrilateral and triangular meshes. The present flow analysis code by using unstructured grids with the cell-centered method clearly demonstrate the same accuracy and robustness as that for a typical structured mesh.