• 대한수학회보
• /
• 제52권1호
• /
• pp.69-83
• /
• 2015

In this paper we introduce and study the separable weak bounded approximation properties which is strictly stronger than the approximation property and but weaker than the bounded approximation property. It provides new sufficient conditions for the metric approximation property for a dual Banach space.

• 천문학논총
• /
• 제30권2호
• /
• pp.569-572
• /
• 2015

We first deduce a uniform formula forthe Fermi energy of degenerate and relativistic electrons in the weak-magnetic field approximation. Then we obtain an expression of the special solution for the electron Fermi energy through this formula, and express the electron Fermi energy as a function of electron fraction and matter density. Our method is universally suitable for relativistic electron- matter regions in neutron stars in the weak-magnetic field approximation.

• Korean Journal of Mathematics
• /
• 제31권3호
• /
• pp.269-294
• /
• 2023

The purpose of this paper is to introduce a new three-step iterative process and show that our iteration scheme is faster than other existing iteration schemes in the literature. We provide a numerical example supported by graphs and tables to validate our proofs. We also prove convergence and stability results for the approximation of fixed points of the contractive-like mapping in the framework of uniformly convex Banach space. In addition, we have established some weak and strong convergence theorems for nonexpansive mappings.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.25-42
• /
• 2007

A direct solver for the Legendre tau approximation for the two-dimensional Poisson problem is proposed. Using the factorization of symmetric eigenvalue problem, the algorithm overcomes the weak points of the Schur decomposition and the conventional diagonalization techniques for the Legendre tau approximation. The convergence of the method is proved and numerical results are presented.

• 천문학회보
• /
• 제21권
• /
• pp.10.1-10.1
• /
• 1996

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제26권2호
• /
• pp.76-107
• /
• 2022

In this paper, we study the temporal decay of global weak solutions to the inhomogeneous Hall-magnetohydrodynamic (Hall-MHD) equations. First, an approximation problem and its weak solutions are obtained via the Caffarelli-Kohn-Nirenberg retarded mollification technique. Then, we prove that the approximate solutions satisfy uniform decay estimates. Finally, using the weak convergence method, we construct weak solutions with optimal decay rates to the inhomogeneous Hall-MHD equations.

• International Journal of Control, Automation, and Systems
• /
• 제4권6호
• /
• pp.689-696
• /
• 2006

This paper presents a new algorithm for the closed-loop $H_{\infty}$ composite control of weakly coupled bilinear systems with time-varying parameter uncertainties and exogenous disturbance using the successive Galerkin approximation(SGA). By using weak coupling theory, the robust $H_{\infty}$ control can be obtained from two reduced-order robust $H_{\infty}$ control problems in parallel. The $H_{\infty}$ control theory guarantees robust closed-loop performance but the resulting problem is difficult to solve for uncertain bilinear systems. In order to overcome the difficulties inherent in the $H_{\infty}$ control problem, two $H_{\infty}$ control laws are constructed in terms of the approximated solution to two independent Hamilton-Jacobi-Isaac equations using the SGA method. One of the purposes of this paper is to design a closed-loop parallel robust $H_{\infty}$ control law for the weakly coupled bilinear systems with parameter uncertainties using the SGA method. The other is to reduce the computational complexity when the SGA method is applied to the high order systems.

• East Asian mathematical journal
• /
• 제27권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.

• Structural Engineering and Mechanics
• /
• 제35권4호
• /
• pp.511-533
• /
• 2010

As a truly meshfree method, meshless equilibrium on line method (MELM), for 2D elasticity problems is presented. In MELM, the problem domain is represented by a set of distributed nodes, and equilibrium is satisfied on lines for any node within this domain. In contrary to conventional meshfree methods, test domains are lines in this method, and all integrals can be easily evaluated over straight lines along x and y directions. Proposed weak formulation has the same concept as the equilibrium on line method which was previously used by the authors for enforcement of the Neumann boundary conditions in the strong-form meshless methods. In this paper, the idea of the equilibrium on line method is developed to use as the weak forms of the governing equations at inner nodes of the problem domain. The moving least squares (MLS) approximation is used to interpolate solution variables in this paper. Numerical studies have shown that this method is simple to implement, while leading to accurate results.

• Interaction and multiscale mechanics
• /
• 제2권3호
• /
• pp.295-319
• /
• 2009

In this work, we discuss a reproducing kernel collocation method (RKCM) for solving $2^{nd}$ order PDE based on strong formulation, where the reproducing kernel shape functions with compact support are used as approximation functions. The method based on strong form collocation avoids the domain integration, and leads to well-conditioned discrete system of equations. We investigate the convergence and the computational complexity for this proposed method. An important result obtained from the analysis is that the degree of basis in the reproducing kernel approximation has to be greater than one for the method to converge. Some numerical experiments are provided to validate the error analysis. The complexity of RKCM is also analyzed, and the complexity comparison with the weak formulation using reproducing kernel approximation is presented.