Thanh Hieu Le

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper presents an algorithm for computing a decomposition of a non-negative real polynomial as a sum of squares of rational functions. Rational functions in our algorithm have the denominators that are powers of the sum of squares of coordinate functions. Numerical experiments are performed for several well-known polynomials such as Motzkin(More)
In this paper, we formulate the feasibility problem corresponding to a filter design problem as a convex optimization problem. Combined with a bisection rule this leads to an algorithm of minimizing the design parameter in the filter design problem. A safety margin is introduced to solve the numerical difficulties when solving this type of problems(More)
An algorithm for computing the singular value decomposition of normal matrices using intermediate complex symmetric matrices is proposed. This algorithm, as most eigenvalue and singular value algorithms, consists of two steps. It is based on combining the unitarily equivalence of normal matrices to complex symmetric tridiagonal form with the symmetric(More)
  • 1