• Title/Summary/Keyword: Root finding

Search Result 179, Processing Time 0.028 seconds

Study of Spectral Factorization using Circulant Matrix Factorization to Design the FIR/IIR Lattice Filters (FIR/IIR Lattice 필터의 설계를 위한 Circulant Matrix Factorization을 사용한 Spectral Factorization에 관한 연구)

  • 김상태;박종원
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.3
    • /
    • pp.437-447
    • /
    • 2003
  • We propose the methods to design the finite impulse response (FIR) and the infinite impulse response (IIR) lattice filters using Schur algorithm through the spectral factorization of the covariance matrix by circulant matrix factorization (CMF). Circulant matrix factorization is also very powerful tool used fur spectral factorization of the covariance polynomial in matrix domain to obtain the minimum phase polynomial without the polynomial root finding problem. Schur algorithm is the method for a fast Cholesky factorization of Toeplitz matrix, which easily determines the lattice filter parameters. Examples for the case of the FIR Inter and for the case of the IIR filter are included, and performance of our method check by comparing of our method and another methods (polynomial root finding and cepstral deconvolution).

Design of FIR/IIR Lattice Filters using the Circulant Matrix Factorization (Circulant Matrix Factorization을 이용한 FIR/IIR Lattice 필터의 설계)

  • Kim Sang-Tae;Lim Yong-Kon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.1
    • /
    • pp.35-44
    • /
    • 2004
  • We Propose the methods to design the finite impulse response (FIR) and the infinite impulse response (IIR) lattice filters using Schur algorithm through the spectral factorization of the covariance matrix by circulant matrix factorization (CMF). Circulant matrix factorization is also very powerful tool used for spectral factorization of the covariance polynomial in matrix domain to obtain the minimum phase polynomial without the polynomial root finding problem. Schur algorithm is the method for a fast Cholesky factorization of Toeplitz matrix, which easily determines the lattice filter parameters. Examples for the case of the FIR filter and for the case of the In filter are included, and performance of our method check by comparing of our method and another methods (polynomial root finding and cepstral deconvolution).

Asymmetry in mesial root number and morphology in mandibular second molars: a case report

  • Nayak, Gurudutt;Shetty, Shashit;Shekhar, Rhitu
    • Restorative Dentistry and Endodontics
    • /
    • v.39 no.1
    • /
    • pp.45-50
    • /
    • 2014
  • Ambiguity in the root morphology of the mandibular second molars is quite common. The most common root canal configuration is 2 roots and 3 canals, nonetheless other possibilities may still exist. The presence of accessory roots is an interesting example of anatomic root variation. While the presence of radix entomolaris or radix paramolaris is regarded as a typical clinical finding of a three-rooted mandibular second permanent molar, the occurrence of an additional mesial root is rather uncommon and represents a possibility of deviation from the regular norms. This case report describes successful endodontic management of a three-rooted mandibular second molar presenting with an unusual accessory mesial root, which was identified with the aid of multiangled radiographs and cone-beam computed tomography imaging. This article also discusses the prevalence, etiology, morphological variations, clinical approach to diagnosis, and significance of supernumerary roots in contemporary clinical dentistry.

A QUADRAPARAMETRIC FAMILY OF EIGHTH-ORDER ROOT-FINDING METHODS

  • Kim, Young Ik
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.27 no.1
    • /
    • pp.133-143
    • /
    • 2014
  • A new three-step quadraparametric family of eighth-order iterative methods free from second derivatives are proposed in this paper to find a simple root of a nonlinear equation. Convergence analysis as well as numerical experiments confirms the eighth-order convergence and asymptotic error constants.

FINDING THE INTERSECTION POINT OF A NONPARAMETRIC SURFACE AND A LINE IN $R^3$

  • Kim, Hoi-Sub;Jo, Chang-Mog;Lee, Se-Joon;Jun, Cha-Soo
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.7 no.1
    • /
    • pp.1-5
    • /
    • 2003
  • We suggest Bisection method, Fixed point method and Newton's method for finding the intersection point of a nonparametric surface and a line in $R^3$ and apply ray-tracing in Color Picture Tube or Color Display Tube.

  • PDF

Root Cause Analysis of the Information Industry Ecosystem Problems (정보산업 생태계 문제의 근본원인 분석)

  • Kim, Sung Kun;Ahn, Nam Gyu
    • Journal of Information Technology Applications and Management
    • /
    • v.24 no.4
    • /
    • pp.71-92
    • /
    • 2017
  • Finding a root cause is an essential step to solving a complex problem. Some previous studies have used the Delphi method for gathering opinions about root causes from geographically dispersed experts. However, we assert that complicated problems such as an industry ecosystem would make a general type of the Delphi method less practical because of too much psychological burden on study participants. In this study we present a preliminary list-based Delphi study method for identifying a root cause. This method was used to identify a root cause and draw a causal map for the information industry ecosystem problems.

Palatal root resection of compromised maxillary first molars (구개근 절제술을 이용한 상악 제일 대구치의 치료)

  • Jeong, Seong-Nyum
    • Journal of Periodontal and Implant Science
    • /
    • v.39 no.3
    • /
    • pp.375-381
    • /
    • 2009
  • Purpose: Root resection can be a valuable procedure when the tooth in question has a high strategic value. The prognosis of root resection has been well documented in previous studies, but the results focused on the palatal root resection have not been discussed in depth. I represent here the short term effectiveness of palatal root resection of maxillary first molars. Methods: Palatal root resection was performed on maxillary first molars of three patients. All the palatal roots were floating state on the radiographic finding and showed full probing depth and purulent exudation at initial examination. Reduction of palatal cusp and occlusal table was performed concomitantly. Endodontic therapy was completed after root resection. Results: Compromised maxillary first molars were treated successfully by palatal root resection in 3 cases. The mobility of resected tooth was decreased a little bit. The probing pocket depth of remaining buccal roots was not increased compared to initial depth. All the patients satisfied with comfort and cost effective results and the fact they could save their natural teeth. Conclusions: Within the above results, palatal root resection is an effective procedure treating compromised maxillary first molar showing advanced palatal bone loss to root apex with or without pulp involvement when proper case selection is performed.

Two Types of Algorithms for Finding the Cube Root in Finite Fields (유한체상에서 세제곱근을 찾는 두 종류의 알고리즘)

  • Cho, Gook Hwa
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.5
    • /
    • pp.499-503
    • /
    • 2016
  • We study algorithms that can efficiently find cube roots by modifying Cipolla-Lehmer algorithm. In this paper, we present two type algorithms for finding cube roots in finite field, which improves Cipolla-Lehmer algorithm. If the number of multiplications of two type algorithms has a little bit of a difference, then it is more efficient algorithm which have less storage variables.

Autotransplantation of impacted mandibular canine (매복 하악 견치의 자가이식술을 이용한 치험례)

  • Hong, Seong-Soo;Lee, Sang-Ho;Kim, Dong-Phil
    • Journal of the korean academy of Pediatric Dentistry
    • /
    • v.24 no.3
    • /
    • pp.710-717
    • /
    • 1997
  • Autotransplantation is the transplantation of embeded, impacted, or unerupted tooth, into extraction socket or surgically prepared socket in the same individual. Clinically, successful autotransplantation must show radiolucent space(periodontal ligament space) between transplanted tooth and supporting bone, lamina dura, no root resorption, no ankylosis, no inflammatory change, and physiologic tooth mobility. It is important that procedure is atraumatic, and the instruments should not contact the root surface during procedure. We performed autotransplantation of impacted mandibular canine that transversely located beneath the apices of the mandibular incisors with uncompletely developed apex. In radiographs and clinical evaluation, this transplant showed successful clinical finding except irregularity of mesial root surface after 14 months. It is conclued that transplantation of canine with $\frac{1}{2}{\sim}\frac{3}{4}$ root development provides a good chance of pulp survival, limited risk of root resorption and ensures sufficient final length, and is thus recommended.

  • PDF

A Cholesky Decomposition of the Inverse of Covariance Matrix

  • Park, Jong-Tae;Kang, Chul
    • Journal of the Korean Data and Information Science Society
    • /
    • v.14 no.4
    • /
    • pp.1007-1012
    • /
    • 2003
  • A recursive procedure for finding the Cholesky root of the inverse of sample covariance matrix, leading to a direct solution for the inverse of a positive definite matrix, is developed using the likelihood equation for the maximum likelihood estimation of the Cholesky root under normality assumptions. An example of the Hilbert matrix is considered for an illustration of the procedure.

  • PDF