Abstract
Approximate algebraic computation (AAC) has been one of the most important research areas in algebraic computation. The basis of AAC is an algorithm of computing approximate greatest common divisors (AppGCD) proposed by T. Sasaki and the author. AppGCD and its applications work well, especially, for obtaining accurate results of ill-conditioned problems. Algorithms and implementation methods of AppGCD are briefly surveyed and its applications such as hybrid integral, hybrid rational function approximation (HRFA), data smoothing by using HRFA and new hybrid method for computing Cauchy principal value integral are described. Further, a pathological feature of HRFA and relations of HRFA and ill-conditioned problems, and their applications are discussed.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
W. Auzinger and H. J. Stetter: An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations, Numerical Mathematics, 86, ISNM, edited by R. P. Agarwal et al., Birkhäuser, pp. 11–30, 1988.
E. H. Bareiss: The numerical solution of polynomial equations and the resultant procedure, Mathematical Method for Digital Computers, vol. 2, John Wiley, pp. 185–214, 1967.
R. M. Corless, P. M. Gianni, B. M. Trager and S. M. Watt: The singular value decomposition for polynomial systems, Proc. ISSAC’ 95, ACM Press, pp. 195–207, 1995.
J. Grabmeier, E. Kaltofen and V. Weispfenning: Computer Algebra Handbook, Springer, pp. 112–125, 2003.
I. Z. Emiris, A. Galligo and H. Lombardi: Certified approximate univariate GCDs, J. Pure Appl. Algebra, 117, pp. 229–251, 1997.
E. Horowitz: Algorithms for partial fraction decomposition and rational function integration, Proc. 2nd ACM Symp. Symbolic and Algebraic Manipulation, pp. 441–457, 1971.
V. Hribernig and H. J. Stetter: Detection and validation of clusters of polynomial zeros, J. Symb. Comp., 24, pp. 667–681, 1997.
H. Kai and M.-T. Noda: Hybrid rational function approximation and data smmoothing, J. Jap. Appl. Math., 3, pp. 323–336, 1993 (in Japanese).
H. Kai and M.-T. Noda: Cauchy principal value integral using hybrid integral, SIGSAM BULLETIN, 31, pp. 37–38, 1997.
H. Kai and M.-T. Noda: Hybrid computation of Cauchy-type singular integral, SIGSAM BULLETIN, 32, pp. 59–60, 1998.
H. Kai and M.-T. Noda: Hybrid rational function approximation and its accuracy analysis, Reliable Computing, 6, pp. 429–438, 2000.
E. Kaltofen: Fast parallel absolute irreducibility testing, J. Symb. Comp., 1, pp. 57–67, 1985.
E. Kaltofen: http://www.math.ncsu.edu/?kaltofen/bibliography/kaltofen.html#GKW02, pp. 112–129, 2005.
N. Karmarkar and Y. N. Lakshman: Approximate polynomial greatest common divisors and nearest singular polynomials, Proc. ISSAC’ 96, ACM Press, pp. 35–39, 1996.
G. Litvinov: Approximate construction of rational approximations and the effect of error autocorrection: Applications, Russian Journal of Mathematical Physics, vol. 1, no. 3, pp. 1–45, 1994.
Y. Nakajima, H. Kai and M.-T. Noda: Hybrid rational function approximation and ill-conditioned problem, J. JSSAC, 11, pp. 141–152, 2005.
M.-T. Noda and E. Miyahiro: On the symbolic/numeric hybrid integration, Proc. ISSAC’ 90, ACM Press, p. 304, 1990.
M.-T. Noda, E. Miyahiro and H. Kai: Hybrid rational function approximation and its use in the hybrid integration, Advances in Computer Methods for Partial Differential Equations VII, edited by R. Vichnevetsky, D. Knight and G. Richter, IMACS, pp. 565–571, 1992.
M.-T. Noda and E. Miyahiro: Extension of the hybrid integral by using the hybrid rational function approximation, J. Jap. Appl. Math., 2, pp. 193–206, 1992 (in Japanese).
M.-T. Noda and T. Sasaki: The interval arithmetic for the ill-conditioned polynomial equation, RIMS (Research Institute of Mathematical Sciences, Kyoto University) Lecture Note, 673, pp. 47–61, 1988.
M.-T. Noda and T. Sasaki: Approximate GCD and its application to ill-conditioned algebraic equations, JCAM, 38, pp. 335–351, 1991.
M. Ochi, M.-T. Noda and T. Sasaki: Approximate GCD of multivariate polynomials and application to ill-conditioned system of algebraic equations, J. Inf. Proces., 14, pp. 292–300, 1991.
V. Y. Pan: Computation of approximate polynomial GCDs and an extension, Proc. 9th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 68–77, 1998.
J. R. Rice: The Approximation of Functions II, Addison-Wesley, pp. 76–122, 1969.
T. J. Rivlin: An Introduction to Approximation of Functions, Blaisdell, pp. 120–141, 1969.
T. Sasaki and M.-T. Noda: Approximate square-free decomposition and root-finding of ill-conditioned algebraic equations, J. Inf. Proces., 12, pp. 159–168, 1989.
T. Sasaki and M. Sasaki: A unified method for multivariate polynomial factorization, J. Inf. Proces., 10, pp. 21–39, 1993.
A. Schönhage: Quasi-GCD computations, J. Complexity, 1, pp. 118–137, 1985.
T. W. Sederberg and G. Z. Chang: Best linear common divisors for approximate degree reduction, Computer-Aided Design, 25, pp. 163–168, 1993.
K. Shirayanagi and M. Sweedler: A theory of stabilizing algebraic algorithms, Tech. Rep. 95-28, Cornell Univ., pp. 1–92, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Birkhäuser Verlag Basel/Switzerland
About this paper
Cite this paper
Noda, MT. (2007). Ill-conditioned Properties and Hybrid Computations. In: Wang, D., Zhi, L. (eds) Symbolic-Numeric Computation. Trends in Mathematics. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-7984-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-7643-7984-1_2
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-7983-4
Online ISBN: 978-3-7643-7984-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)