By Topic

What is Hybrid Symbolic-Numeric Computation?

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kaltofen, E. ; North Carolina State Univ., Raleigh, NC, USA

Hybrid symbolic-numeric computation constitutes the Fifth of my "Seven Dwarfs" of Symbolic Computation [1], which I have listed in my SNSC talk in Hagenberg in 2008. Hybridization requires that the solution of a computational mathematical problem should utilize both a numeric and a symbolic algorithmic component. The growth of the symbolic parts in scientific computing is driven by industry, as the proliferation of MapleSIM, a hybrid symbolic-numeric engineering design platform, testifies. In my talk, I will introduce two hybrid algorithms: one is our ArtinProver agorithm for proving the globality of an optimum of a rational function via an exact sum-of-squares certificate. The second is a randomized algorithm for recovering a sparse signal via a series of Hankel matrix condition number estimates. Specifically, I will discuss the important questions: what is an exact certificate, and what is the meaning of "success with high probability" in randomized algorithms with imprecise floating point data.

Published in:

Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2011 13th International Symposium on

Date of Conference:

26-29 Sept. 2011