• Title/Summary/Keyword: inverse polynomial

Search Result 92, Processing Time 0.031 seconds

COMPATIBLE PAIRS OF ORTHOGONAL POLYNOMIALS

  • Kim, D.H.;Kwon, Kil-H.;Lee, D.W.;Marcellan, F.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.36 no.4
    • /
    • pp.779-797
    • /
    • 1999
  • We find necessary and sufficient conditions for an orthogonal polynomial system to be compatible with another orthogonal polynomial system. As applications, we find new characterizations of semi-classical and clasical orthorgonal polynomials.

  • PDF

Necessary and Sufficient Conditions for Characteristic Transfer Function Matrices

  • Eisaka, Toshio
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1875-1877
    • /
    • 2002
  • There exist several forms of transfer function descriptions for multivariable LTI systems. We treat transfer function matrix with characteristic polynomial as its common denominator named Characteristic Transfer-function Matrices (CTM). First, we clarify necessary and sufficient conditions of CTM, then, we show some related lemmas. These interpretations not only offer deeper explanations but they also provide ways for calculations of all possible transfer matrices, system zeros, and inverse polynomial matrices.

  • PDF

Accuracy of Precision Ground Coordinates Determination Using Inverse RPC in KOMPSAT Satellite Data (다목적실용위성(KOMPSAT)의 Inverse RPC 해석을 통한 정밀지상좌표 결정 정확도)

  • Seo, DooChun;Jung, JaeHun;Hong, KiByung
    • Aerospace Engineering and Technology
    • /
    • v.13 no.2
    • /
    • pp.99-107
    • /
    • 2014
  • There are two types of Physical Model and RFM (Rational Function Model) is to determinate ground coordinates using KOMPSAT-2 and KOMPSAT-3 satellite data. Generally, RPCs(Rational Polynomial Coefficients) based on RFM is provided for users. This RPCs is to compute the ground coordinates to the image coordinates. If users produce ortho-image with provided RPCs is useful, directly compute the ground coordinates corresponding to image coordinates and check location accuracy etc. are difficult. In this study, a basic algorithm of inverse RPCs that calculates the image coordinates to ground coordinates, compute based on provided RPCs and evaluation of determinated ground coordinates using developed inverse RPCs were proposed.

EXPLICIT MINIMUM POLYNOMIAL, EIGENVECTOR AND INVERSE FORMULA OF DOUBLY LESLIE MATRIX

  • WANICHARPICHAT, WIWAT
    • Journal of applied mathematics & informatics
    • /
    • v.33 no.3_4
    • /
    • pp.247-260
    • /
    • 2015
  • The special form of Schur complement is extended to have a Schur's formula to obtains the explicit formula of determinant, inverse, and eigenvector formula of the doubly Leslie matrix which is the generalized forms of the Leslie matrix. It is also a generalized form of the doubly companion matrix, and the companion matrix, respectively. The doubly Leslie matrix is a nonderogatory matrix.

Design of Elliptic Curve Cryptographic Coprocessor over binary fields for the IC card (IC 카드를 위한 polynomial 기반의 타원곡선 암호시스템 연산기 설계)

  • 최용제;김호원;김무섭;박영수
    • Proceedings of the IEEK Conference
    • /
    • 2001.06b
    • /
    • pp.305-308
    • /
    • 2001
  • This paper describes the design of elliptic curve cryptographic (ECC) coprocessor over binary fields for the If card. This coprocessor is implemented by the shift-and-add algorithm for the field multiplication algorithm. And the modified almost inverse algorithm(MAIA) is selected for the inverse multiplication algorithm. These two algorithms is merged to minimize the hardware size. Scalar multiplication is performed by the binary Non Adjacent Format(NAF) method. The ECC we have implemented is defined over the field GF(2$^{163}$), which is a SEC-2 recommendation[7]..

  • PDF

GENERALIZED INVERSES IN NUMERICAL SOLUTIONS OF CAUCHY SINGULAR INTEGRAL EQUATIONS

  • Kim, S.
    • Communications of the Korean Mathematical Society
    • /
    • v.13 no.4
    • /
    • pp.875-888
    • /
    • 1998
  • The use of the zeros of Chebyshev polynomial of the first kind $T_{4n+4(x}$ ) and second kind $U_{2n+1}$ (x) for Gauss-Chebyshev quad-rature and collocation of singular integral equations of Cauchy type yields computationally accurate solutions over other combinations of $T_{n}$ /(x) and $U_{m}$(x) as in [8]. We show that the coefficient matrix of the overdetermined system has the generalized inverse. We estimate the residual error using the norm of the generalized inverse.e.

  • PDF

Investigation of the Effects of Some Numerical Procedure on the High Precision Structural Analysis (초정밀 구조해석을 위한 수치절차의 영향 분석)

  • Jung, Kang-Sik;You, Hong-Hee
    • Proceedings of the KSME Conference
    • /
    • 2004.04a
    • /
    • pp.756-761
    • /
    • 2004
  • The effects of two important numerical procedures on the high precision structural analysis are investigated in this study. The two numerical procedures include continuous variable approximation and time integration. For the continuous variable approximation, polynomial mode functions generated by the Gram-Schmidt process are introduced and the numerical results obtained by employing the polynomial mode functions are compared to those obtained by classical beam mode functions. The effect of the time integration procedure on the analysis precision is also investigated. It is found that the two procedures affect the precision of structural analysis significantly.

  • PDF

Inverse Offset Method for Adaptive Cutter Path Generation from Point-based Surface

  • Kayal, Prasenjit
    • International Journal of CAD/CAM
    • /
    • v.7 no.1
    • /
    • pp.21-30
    • /
    • 2007
  • The inverse offset method (IOM) is widely used for generating cutter paths from the point-based surface where the surface is characterised by a set of surface points rather than parametric polynomial surface equations. In the IOM, cutter path planning is carried out by specifying the grid sizes, called the step-forward and step-interval distances respectively in the forward and transverse cutting directions. The step-forward distance causes the chordal deviation and the step-forward distance produces the cusp. The chordal deviation and cusp are also functions of local surface slopes and curvatures. As the slopes and curvatures vary over the surface, different step-forward and step-interval distances are appropriate in different areas for obtaining the machined surface accurately and efficiently. In this paper, the chordal deviation and cusp height are calculated in consideration with the surface slopes and curvatures, and their combined effect is used to estimate the machined surface error. An adaptive grid generation algorithm is proposed, which enables the IOM to generate cutter paths adaptively using different step-forward and step-interval distances in different regions rather than constant step-forward and step-interval distances for entire surface.

Tailoring the second mode of Euler-Bernoulli beams: an analytical approach

  • Sarkar, Korak;Ganguli, Ranjan
    • Structural Engineering and Mechanics
    • /
    • v.51 no.5
    • /
    • pp.773-792
    • /
    • 2014
  • In this paper, we study the inverse mode shape problem for an Euler-Bernoulli beam, using an analytical approach. The mass and stiffness variations are determined for a beam, having various boundary conditions, which has a prescribed polynomial second mode shape with an internal node. It is found that physically feasible rectangular cross-section beams which satisfy the inverse problem exist for a variety of boundary conditions. The effect of the location of the internal node on the mass and stiffness variations and on the deflection of the beam is studied. The derived functions are used to verify the p-version finite element code, for the cantilever boundary condition. The paper also presents the bounds on the location of the internal node, for a valid mass and stiffness variation, for any given boundary condition. The derived property variations, corresponding to a given mode shape and boundary condition, also provides a simple closed-form solution for a class of non-uniform Euler-Bernoulli beams. These closed-form solutions can also be used to check optimization algorithms proposed for modal tailoring.

PROPERTIES OF INDUCED INVERSE POLYNOMIAL MODULES OVER A SUBMONOID

  • Cho, Eunha;Jeong, Jinsun
    • Korean Journal of Mathematics
    • /
    • v.20 no.3
    • /
    • pp.307-314
    • /
    • 2012
  • Let M be a left R-module and R be a ring with unity, and $S=\{0,2,3,4,{\ldots}\}$ be a submonoid. Then $M[x^{-s}]=\{a_0+a_2x^{-2}+a_3x^{-3}+{\cdots}+a_nx^{-n}{\mid}a_i{\in}M\}$ is an $R[x^s]$-module. In this paper we show some properties of $M[x^{-s}]$ as an $R[x^s]$-module. Let $f:M{\rightarrow}N$ be an R-linear map and $\overline{M}[x^{-s}]=\{a_2x^{-2}+a_3x^{-3}+{\cdots}+a_nx^{-n}{\mid}a_i{\in}M\}$ and define $N+\overline{M}[x^{-s}]=\{b_0+a_2x^{-2}+a_3x^{-3}+{\cdots}+a_nx^{-n}{\mid}b_0{\in}N,\;a_i{\in}M}$. Then $N+\overline{M}[x^{-s}]$ is an $R[x^s]$-module. We show that given a short exact sequence $0{\rightarrow}L{\rightarrow}M{\rightarrow}N{\rightarrow}0$ of R-modules, $0{\rightarrow}L{\rightarrow}M[x^{-s}]{\rightarrow}N+\overline{M}[x^{-s}]{\rightarrow}0$ is a short exact sequence of $R[x^s]$-module. Then we show $E_1+\overline{E_0}[x^{-s}]$ is not an injective left $R[x^s]$-module, in general.