• East Asian mathematical journal
• /
• v.24 no.1
• /
• pp.57-65
• /
• 2008

The approximate solvability of a generalized system for non-linear variational inequality in Hilbert spaces was studied, based on the convergence of projection methods. But little research was done in Banach space. The primary reason was that projection mapping lacked preferably property in Banach space. In this paper, we introduced the generalized projection methods. By using these methods, the results presented in this paper extended the main results of S. S. Chang [3] from Hilbert spaces to Banach space.

• Journal of Biomedical Engineering Research
• /
• v.15 no.3
• /
• pp.275-280
• /
• 1994

In the case of the image reconstruction from unknown projection data such as imaging the object with opaque obstructions, conventional reconstruction algorithms may reconstruct a degraded image. In this paper, a new method for the estimation of the unknown projection data based on known projection data and the bandwidth of projection data is proposed. The proposed method successfully estimates the unknown projection data through iterative transformation between projection space and frequency space using the known projection data and the bandwidth of the projection data. Computer simulation shows that the proposed method significantly improves image quality and convergence behavior over conventional algorithms. In addition, the proposed method is successfully applied to ultrasound attenuation CT using a sponge phantom.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.93-100
• /
• 2012

In this paper, we present a strongly convergent parallel projection algorithm by introducing some parameter sequences for convex feasibility problem. To prove the strong convergence in a simple way, we transmit the parallel algorithm in the original space to an alternating one in a newly constructed product space. Thus, the strong convergence of the parallel projection algorithm is derived with the help of the alternating one under some parametric controlling conditions.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.5
• /
• pp.1215-1235
• /
• 2022

In this paper we study Szegö kernel projections for Hardy spaces in quaternionic Clifford analysis. At first we introduce the matrix Szegö projection operator for the Hardy space of quaternionic Hermitean monogenic functions by the characterization of the matrix Hilbert transform in the quaternionic Clifford analysis. Then we establish the Kerzman-Stein formula which closely connects the matrix Szegö projection operator with the Hardy projection operator onto the Hardy space, and we get the matrix Szegö projection operator in terms of the Hardy projection operator and its adjoint. At last, we construct the explicit matrix Szegö kernel function for the Hardy space on the sphere as an example, and get the solution to a Diriclet boundary value problem for matrix functions.

• International Journal of Automotive Technology
• /
• v.2 no.3
• /
• pp.117-122
• /
• 2001

For a dynamic analysis of a constrained multibody system, it is necessary to have a routine for satisfying kinematic constraints. LU decomposition scheme, which is used to divide coordinates into dependent and independent coordinates, is efficient but has great difficulty near the singular configuration. Other method such as the projection matrix, which is more stable near a singular configuration, takes longer simulation time due to the large amount of calculation for decomposition. In this paper, the row space and the null space of the Jacobian matrix are proposed by using the pseudo-inverse method and the projection matrix. The equations of the motion of a system are replaced with independent acceleration components using the null space of the Jacobian matrix. Also a new hybrid method is proposed, combining the LU decomposition and the projection matrix. The proposed hybrid method has following advantages. (1) The simulation efficiency is preserved by the LU method during the simulation. (2) The accuracy of the solution is also achieved by the projection method near the singular configuration.

• Journal of the Chungcheong Mathematical Society
• /
• v.28 no.3
• /
• pp.473-482
• /
• 2015

Let Qf be the maximal derivative of f with respect to the Bergman metric $b_B$. In this paper, we will find conditions such that $(1-{\parallel}z{\parallel})^s(Qf)^p(z)$ is bounded on B. We will also find conditions such that Bergman projection type operator $P_r$ is bounded operator from $L^p(B,d{\mu}_r)$ to the holomorphic Besov p-space Bs $B^s_p(B)$ with weight s.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.22 no.1
• /
• pp.170-176
• /
• 1998

In this paper, the column space and null space of the Jacobian matrix were obtained by using the pseudo-inverse method and projection matrix. The equations of motion of the system were replaced by independent acceleration components using the null space matrix. The proposed method has the following advantages. (1) It is simple to derive the null space. (2) The efficiency is improved by getting rid of constrained force terms. (3) Neither null space updating nor coordinate partitioning method is required. The suggested algorithm is applied to a three-dimensional vehicle model to show the efficiency.

• Journal of the Chungcheong Mathematical Society
• /
• v.33 no.4
• /
• pp.489-495
• /
• 2020

We define new integral operators on the Haydy space similar to Szegö projection. We consider a relationship between these Szegö type operators and the partial sum of Taylor series on the Hardy space.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.298-312
• /
• 2017

The fourth industrial revolution is expected to show technological innovation that develops among different fields beyond boundaries through the convergence and integration of fields. With the development and convergence of digital technology, users can receive information anywhere in the world. In this paper, we propose an adaptive interaction concept in a various environment by using a mobile robot based on projection augmented reality (AR). Most previous studies have aimed fixed projector or projection for a pre-designed environment. Thus, they provide only limited information. To overcome the abovementioned problem, we provide the adaptive information by implementing a projection AR system that can be mounted on the mobile robot. For that, the mobile robot based on the projection system was defined as Pervasive AR. Pervasive AR is configured with a pervasive display, a pervasive interface, and seamless interaction. The Pervasive AR technology enables the user to access information immediately by expanding the display area into real space, which implies an environment of intuitive and convenient interaction by expanding the user interface. This system can be applied to various areas, such as a home environment and a public space.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1C
• /
• pp.82-91
• /
• 2005

This paper introduces an efficient affine projection algorithm(APA) using iterative hyperplane projection. Among various fast converging adaptation algorithms, APA has been preferred to be employed for various applications due to its inherent effectiveness against the rank deficient problem. However, the amount of complexity of the conventional APA could not be negligible because of the accomplishment of sample matrix inversion(SMI). Moreover, the 'shifting invariance property' usually exploited in single channel case does not hold for the application of space-time decision-directed equalizer(STDE) deployed in single-input-multi-output(SIMO) systems. Thus, it is impossible to utilize the fast adaptation schemes such as fast transversal filter(FlF) having low-complexity. To accomplish such tasks, this paper introduces the low-complexity APA by employing hyperplane projection algorithm, which shows the excellent tracking capability as well as the fast convergence. In order to confirm th validity of the proposed method, its performance is evaluated under wireless SIMO channel in respect to bit error rate(BER) behavior and computational complexity.