• Title/Summary/Keyword: Continuous Approximation

Search Result 208, Processing Time 0.026 seconds

Comparative Studies of Topology Optimization Using Continuous Approximation of Material Distribution (재료분포의 연속적인 근사를 이용한 위상최적설계 방법의 비교 연구)

  • Lim, Young-Seok;Yoo, Jeong-Hoon;Terada, Kenjiro;Nishiwaki, Shin-Ji;Min, Seung-Jae
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.30 no.2 s.245
    • /
    • pp.164-170
    • /
    • 2006
  • To prevent the numerical instabilities in topology optimization, continuous approximation of material distribution (CAMD) is proposed to the homogenization design method (HDM) and the simple isotropic material with penalization (SIMP) method. The continuous FE approximation of design variables including high order elements is applied to the formulation of SIMP method. Numerical examples are presented to compare the efficiency of CAMD both in HDM and SIMP.

CIRCLE APPROXIMATION USING PARAMETRIC POLYNOMIAL CURVES OF HIGH DEGREE IN EXPLICIT FORM

  • Ahn, Young Joon
    • Communications of the Korean Mathematical Society
    • /
    • v.37 no.4
    • /
    • pp.1259-1267
    • /
    • 2022
  • In this paper we present a full circle approximation method using parametric polynomial curves with algebraic coefficients which are curvature continuous at both endpoints. Our method yields the n-th degree parametric polynomial curves which have a total number of 2n contacts with the full circle at both endpoints and the midpoint. The parametric polynomial approximants have algebraic coefficients involving rational numbers and radicals for degree higher than four. We obtain the exact Hausdorff distances between the circle and the approximation curves.

Nonlinear Function Approximation Using Efficient Higher-order Feedforward Neural Networks (효율적 고차 신경회로망을 이용한 비선형 함수 근사에 대한 연구)

  • 신요안
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.1
    • /
    • pp.251-268
    • /
    • 1996
  • In this paper, a higher-order feedforward neural network called ridge polynomial network (RPN) which shows good approximation capability for nonlnear continuous functions defined on compact subsets in multi-dimensional Euclidean spaces, is presented. This network provides more efficient and regular structure as compared to ordinary higher-order feedforward networks based on Gabor-Kolmogrov polynomial expansions, while maintating their fast learning property. the ridge polynomial network is a generalization of the pi-sigma network (PSN) and uses a specialform of ridge polynomials. It is shown that any multivariate polynomial can be exactly represented in this form, and thus realized by a RPN. The approximation capability of the RPNs for arbitrary continuous functions is shown by this representation theorem and the classical weierstrass polynomial approximation theorem. The RPN provides a natural mechanism for incremental function approximation based on learning algorithm of the PSN. Simulation results on several applications such as multivariate function approximation and pattern classification assert nonlinear approximation capability of the RPN.

  • PDF

PARAMETRIC APPROXIMATION OF MONOTONE DECREASING SEQUENCE

  • Rhee, Hyang J.
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.17 no.1
    • /
    • pp.77-83
    • /
    • 2004
  • The aim of this work is to generalize parametric approximation in order to apply them to an one-sided $L_1$-approximation. A natural question now arises : when is the parameter map $$P:f{\rightarrow}P_{K(f)}(f)$$ continuous on $C_1(X)$ ? We find some results with a monotone decreasing sequence about above question.

  • PDF

VISCOSITY METHODS OF APPROXIMATION FOR A COMMON SOLUTION OF A FINITE FAMILY OF ACCRETIVE OPERATORS

  • Chen, Jun-Min;Zhang, Li-Juan;Fan, Tie-Gang
    • East Asian mathematical journal
    • /
    • v.27 no.1
    • /
    • pp.11-21
    • /
    • 2011
  • In this paper, we try to extend the viscosity approximation technique to find a particular common zero of a finite family of accretive mappings in a Banach space which is strictly convex reflexive and has a weakly sequentially continuous duality mapping. The explicit viscosity approximation scheme is proposed and its strong convergence to a solution of a variational inequality is proved.

DEGREE OF APPROXIMATION BY KANTOROVICH-CHOQUET QUASI-INTERPOLATION NEURAL NETWORK OPERATORS REVISITED

  • GEORGE A., ANASTASSIOU
    • Journal of Applied and Pure Mathematics
    • /
    • v.4 no.5_6
    • /
    • pp.269-286
    • /
    • 2022
  • In this article we exhibit univariate and multivariate quantitative approximation by Kantorovich-Choquet type quasi-interpolation neural network operators with respect to supremum norm. This is done with rates using the first univariate and multivariate moduli of continuity. We approximate continuous and bounded functions on ℝN , N ∈ ℕ. When they are also uniformly continuous we have pointwise and uniform convergences. Our activation functions are induced by the arctangent, algebraic, Gudermannian and generalized symmetrical sigmoid functions.

THE CAPABILITY OF PERIODIC NEURAL NETWORK APPROXIMATION

  • Hahm, Nahmwoo;Hong, Bum Il
    • Korean Journal of Mathematics
    • /
    • v.18 no.2
    • /
    • pp.167-174
    • /
    • 2010
  • In this paper, we investigate the possibility of $2{\pi}$-periodic continuous function approximation by periodic neural networks. Using the Riemann sum and the quadrature formula, we show the capability of a periodic neural network approximation.

Approximate discrete variable optimization of plate structures using dual methods

  • Salajegheh, Eysa
    • Structural Engineering and Mechanics
    • /
    • v.3 no.4
    • /
    • pp.359-372
    • /
    • 1995
  • This study presents an efficient method for optimum design of plate and shell structures, when the design variables are continuous or discrete. Both sizing and shape design variables are considered. First the structural responses such as element forces are approximated in terms of some intermediate variables. By substituting these approximate relations into the original design problem, an explicit nonlinear approximate design task with high quality approximation is achieved. This problem with continuous variables, can be solved by means of numerical optimization techniques very efficiently, the results of which are then used for discrete variable optimization. Now, the approximate problem is converted into a sequence of second level approximation problems of separable form and each of which is solved by a dual strategy with discrete design variables. The approach is efficient in terms of the number of required structural analyses, as well as the overall computational cost of optimization. Examples are offered and compared with other methods to demonstrate the features of the proposed method.

Structural Design of Piezoelectric Actuator Considering Polarization Direction and Continuous Approximation of Material Distribution (분극방향과 재료분포의 연속적 근사방법을 고려한 압전형 액추에이터의 구조설계)

  • Lim, Young-Seok;Yoo, Jeong-Hoon;Min, Seung-Jae
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.30 no.9 s.252
    • /
    • pp.1102-1109
    • /
    • 2006
  • In this paper, the polarization of piezoelectric materials is considered to improve actuation since the piezoelectric polarization has influences on the performance of the actuator. The topology design of compliant mechanism can be formulated as an optimization problem of material distribution in a fixed design domain and continuous approximation of material distribution (CAMD) method has demonstrated its effectiveness to prevent the numerical instabilities in topology optimization. The optimization problem is formulated to maximize the mean transduction ratio subject to the total volume constraints and solved using a sequential linear programming algorithm. The effect of CAMD and the performance improvement of actuator are confirmed through Moonie actuator and PZT suspension design.