• Title/Summary/Keyword: f-approximation problem

Search Result 32, Processing Time 0.018 seconds

SOME ALGORITHMS OF THE BEST SIMULTANEOUS APPROXIMATION

  • Rhee, Hyang J.
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.22 no.2
    • /
    • pp.141-148
    • /
    • 2009
  • We consider various algorithms calculating best onesided simultaneous approximations. We assume that X is a compact subset of $\mathbb{R}^{m}$ satisfying $X=\overline{intX}$, S is an n-dimensional subspace of C(X), and $\mu$ is any 'admissible' measure on X. For any l-tuple $f_1,\;{\cdots},\;f_{\ell}$ in C(X), we present various ideas for best approximation to F from S(F). The problem of best (both one and two-sided) approximation is a linear programming problem.

  • PDF

ON STUDY OF f-APPROXIMATION PROBLEMS AND σ-INVOLUTORY VARIATIONAL INEQUALITY PROBLEMS

  • Mitra, Siddharth;Das, Prasanta Kumar
    • Nonlinear Functional Analysis and Applications
    • /
    • v.27 no.2
    • /
    • pp.223-232
    • /
    • 2022
  • The purpose of the paper is to define f-projection operator to develop the f-projection method. The existence of a variational inequality problem is studied using fixed point theorem which establishes the existence of f-projection method. The concept of ρ-projective operator and σ-involutory operator are defined with suitable examples. The relation in between ρ-projective operator and σ-involutory operator are shown. The concept of σ-involutory variational inequality problem is defined and its existence theorem is also established.

TWO-SIDED BEST SIMULTANEOUS APPROXIMATION

  • Rhee, Hyang Joo
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.23 no.4
    • /
    • pp.705-710
    • /
    • 2010
  • Let $C_1(X)$ be a normed linear space over ${\mathbb{R}}^m$, and S be an n-dimensional subspace of $C_1(X)$ with spaned by {$s_1,{\cdots},s_n$}. For each ${\ell}$- tuple vectors F in $C_1(X)$, the two-sided best simultaneous approximation problem is $$\min_{s{\in}S}\;\max\limits_{i=1}^\ell\{{\parallel}f_i-s{\parallel}_1\}$$. A $s{\in}S$ attaining the above minimum is called a two-sided best simultaneous approximation or a Chebyshev center for $F=\{f_1,{\cdots},f_{\ell}\}$ from S. This paper is concerned with algorithm for calculating two-sided best simultaneous approximation, in the case of continuous functions.

A Bayesian Approach to Linear Calibration Design Problem

  • Kim, Sung-Chul
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.20 no.3
    • /
    • pp.105-122
    • /
    • 1995
  • Based on linear models, the inference about the true measurement x$_{f}$ and the optimal designs x (nx1) for the calibration experiments are considered via Baysian statistical decision analysis. The posterior distribution of x$_{f}$ given the observation y$_{f}$ (qxl) and the calibration experiment is obtained with normal priors for x$_{f}$ and for themodel parameters (.alpha., .betha.). This posterior distribution is not in the form of any known distributions, which leads to the use of a numerical integration or an approximation for the calculation of the overall expected loss. The general structure of the expected loss function is characterized in the form of a conjecture. A near-optimal design is obtained through the approximation nof the conditional covariance matrix of the joint distribution of (x$_{f}$ , y$_{f}$ $^{T}$ )$^{T}$ . Numerical results for the univariate case are given to demonstrate the conjecture and to evaluate the approximation.n.

  • PDF

STABLE NUMERICAL DIFFERENTIATION: WHEN IS IT POSSIBLE?

  • Ramm, Alexander G.;Smirnova, Alexandra
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.7 no.1
    • /
    • pp.47-61
    • /
    • 2003
  • Two principally different statements of the problem of stable numerical differentiation are considered. It is analyzed when it is possible in principle to get a stable approximation to the derivative ${\Large f}'$ given noisy data ${\Large f}_{\delta}$. Computational aspects of the problem are discussed and illustrated by examples. These examples show the practical value of the new understanding of the problem of stable differentiation.

  • PDF

SOBOLEV TYPE APPROXIMATION ORDER BY SCATTERED SHIFTS OF A RADIAL BASIS FUNCTION

  • Yoon, Jung-Ho
    • Journal of applied mathematics & informatics
    • /
    • v.23 no.1_2
    • /
    • pp.435-443
    • /
    • 2007
  • 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.

ON THE OSTROWSKI INEQUALITY FOR THE RIEMANN-STIELTJES INTEGRAL ${\int}_a^b$ f (t) du (t), WHERE f IS OF HÖLDER TYPE AND u IS OF BOUNDED VARIATION AND APPLICATIONS

  • DRAGOMIR, S.S.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.5 no.1
    • /
    • pp.35-45
    • /
    • 2001
  • In this paper we point out an Ostrowski type inequality for the Riemann-Stieltjes integral ${\int}_a^b$ f (t) du (t), where f is of p-H-$H{\ddot{o}}lder$ type on [a,b], and u is of bounded variation on [a,b]. Applications for the approximation problem of the Riemann-Stieltjes integral in terms of Riemann-Stieltjes sums are also given.

  • PDF

Dislocation in Semi-infinite Half Plane Subject to Adhesive Complete Contact with Square Wedge: Part II - Approximation and Application of Corrective Functions (직각 쐐기와 응착접촉 하는 반무한 평판 내 전위: 제2부 - 보정 함수의 근사 및 응용)

  • Kim, Hyung-Kyu
    • Tribology and Lubricants
    • /
    • v.38 no.3
    • /
    • pp.84-92
    • /
    • 2022
  • In Part I, developed was a method to obtain the stress field due to an edge dislocation that locates in an elastic half plane beneath the contact edge of an elastically similar square wedge. Essential result was the corrective functions which incorporate a traction free condition of the free surfaces. In the sequel to Part I, features of the corrective functions, Fkij,(k = x, y;i,j = x,y) are investigated in this Part II at first. It is found that Fxxx(ŷ) = Fxyx(ŷ) where ŷ = y/η and η being the location of an edge dislocation on the y axis. When compared with the corrective functions derived for the case of an edge dislocation at x = ξ, analogy is found when the indices of y and x are exchanged with each other as can be readily expected. The corrective functions are curve fitted by using the scatter data generated using a numerical technique. The algebraic form for the curve fitting is designed as Fkij(ŷ) = $\frac{1}{\hat{y}^{1-{\lambda}}I+yp}$$\sum_{q=0}^{m}{\left}$$\left[A_q\left(\frac{\hat{y}}{1+\hat{y}} \right)^q \right]$ where λI=0.5445, the eigenvalue of the adhesive complete contact problem introduced in Part I. To investigate the exponent of Fkij, i.e.(1 - λI) and p, Log|Fkij|(ŷ)-Log|(ŷ)| is plotted and investigated. All the coefficients and powers in the algebraic form of the corrective functions are obtained using Mathematica. Method of analyzing a surface perpendicular crack emanated from the complete contact edge is explained as an application of the curve-fitted corrective functions.

Growing Algorithm of Wavelet Neural Network using F-projection (F-투영법을 이용한 웨이블렛 신경망의 성장 알고리즘)

  • 서재용;김용택;조현찬;김용민;전홍태
    • Proceedings of the IEEK Conference
    • /
    • 2001.06c
    • /
    • pp.15-168
    • /
    • 2001
  • In this paper, we propose growing algorithm of wavelet neural network. It is growing algorithm that adds hidden nodes using wavelet frame which approximately supports orthogonality in wavelet neural network based on wavelet theory. The result of this processing can be reduced global error and progresses performance efficiency of wavelet neural network. We apply the proposed algorithm to approximation problem and evaluate effectiveness of proposed algorithm.

  • PDF

ON THE OSTROWSKI'S INEQUALITY FOR RIEMANN-STIELTJES INTEGRAL AND APPLICATIONS

  • Dragomir, S.S.
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.3
    • /
    • pp.843-859
    • /
    • 2000
  • An Ostrowski type integral inequality for the Riemann-Stieltjes integral ${\int^b}_a$ f(t) du(t), where f is assumed to be of bounded variation on [a, b] and u is of r - H - $H\"{o}lder$ type on the same interval, is given. Applications to the approximation problem of the Riemann-Stieltjes integral in terms of Riemann-Stieltjes sums are also pointed out.