Polynomial and rational evaluation and interpolation (with structured matrices)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1644 LNCS, Issue , 1999, Pages 585-594

  Olshevsky, Vadim ^a   Pan, Victor Y ^b  

^a GEORGIA STATE UNIVERSITY   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COSINE TRANSFORMS; IMAGE PROCESSING; INTERPOLATION; LINEAR TRANSFORMATIONS; PETROLEUM RESERVOIR EVALUATION; POLYNOMIAL APPROXIMATION;

APPROXIMATE SOLUTION; ARITHMETIC COMPLEXITY; EUCLIDEAN ALGORITHMS; MATRIX REPRESENTATION; OUTPUT ERROR BOUNDS; POLYNOMIAL EVALUATION; RATIONAL INTERPOLATION; SIGNAL AND IMAGE PROCESSING;

MATRIX ALGEBRA;

EID: 84887444936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_55     Document Type: Conference Paper

References (30)

1. [AHU74] A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass, 1974.
2. [BKO, a] T. Boros, T. Kailath, V. Olshevsky, Pivoting and Backward Stabillity of Fast Algorithms for Solving Cauchy Linear Systems (submitted).
3. [BM75] A. Borodin, I. Munro, The Computational Complexity of Algebraic and Numeric Problems, American Elsevier, New York, 1975.
4. [BP94] D. Bini, V. Y. Pan, Polynomial and Matrix Computations, Volume 1: Fundamental Algorithms, Birkḧauser, Boston, 1994.
5. [CdB80] C.D. Conte, C. de Boor, Elementary Numerical Analysis: An Algorithmic Approach, McGraw-Hill, New York, 1980.
6. [CGR88] J. Carier, L. Greengard, V. Rokhlin, A Fast Adaptive Multipole Algorithm for Particle Simulation, SIAM J. Sci. Stat. Comput., 9, 669{686, 1988.
7. [FHR93] T. Fink, G. Heinig, K. Rost, An Inversion Formula and Fast Algorithms for Cauchy-Vandermonde Matrices, Linear Algebra Appl., 183, 179{191, 1993.
8. [G86] J. von zur Gathen, Parallel Arithmetic Computations: A Survey, Lecture Notes in Computer Science, 233, 93-112, Springer, Berlin, 1986.
9. [GR87] L. Greengard, V. Rokhlin, A Fast Algorithm for Particle Simulation, J. of Comput. Physics, 73, 325-348, 1987.
10. [KO96] T. Kailath, V. Olshevsky, Displacement Structure Approach to Discrete- Trigonometric-Transform Based Preconditioners of G. Strang and of T. Chan, Calcolo, 33, 191-208, 1996.
11. [KR90] R. Karp, V. Ramachandran, A Survey of Parallel Algorithms for Shared Memory Machines, Handbook for Theoretical Computer Science (J. van Leeuwen editor), 869{941, North Holland, Amsterdam, 1990.
12. [Le92] F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees & Hypercubes, Morgan Kaufmann, San Mateo, CA 1992.
13. [OP98] V. Olshevsky, V. Y. Pan, A Unified Superfast Algorithm for Boundary Rational Tangential Interpolation Problem, Proc. 39th Ann. IEEE Symp. Foundations of Comp. Sci., 192-201, IEEE Comp. Soc. Press, 1998.
14. [OP99] V. Olshevsky, V. Y. Pan, Polynomial and Rational Interpolation and Multipoint Evaluation with Application of Structured Matrices, preprint, 1999 (submitted).
15. [P90] V. Y. Pan, Computations with Dense Structured Matrices, Math. of Computation, 55, 191, 179{190, 1990.
16. [P95] V. Y. Pan, An Algebraic Approach to Approximate Evaluation of a Polynomial on a Set of Real Points, Advances in Computational Mathematics, 3, 41{58, 1995.
17. [P95a] V. Y. Pan, Optimal (up to Polylog Factors) Sequential and Parallel Algorithms for Approximating Complex Polynomial Zeros, Proc. 27th Ann. ACM Symposium on Theory of Computing, 741{750, ACM Press, New York, 1995.
18. [P96] V. Y. Pan, Optimal and Nearly Optimal Algorithms for Approximating Polynomial Zeros, Computers & Math. (with Applications), 31, 12, 97{ 138, 1996.
19. [P99] V. Y. Pan, Superfast Divide-and-Conquer Algorithm for Structured Matrices, preprint, 1999 (submitted).
20. [PACLS98] V. Y. Pan, M. AbuTabanjeh, Z. Chen, E. Landowne, A. Sadikou, New Transformations of Cauchy Matrices and Trummer's Problem, Computer and Math. (with Applics.), 35, 12, 1-5, 1998.
21. [PACPS98] V. Y. Pan, M. AbuTabanjeh, Z. Chen, S. Providence, A. Sadikou, Transformations of Cauchy Matrices for Trummer's Problem and a Cauchy-like Linear Solver, Proc. of 5th Annual International Symposium on Solving Irregularly Structured Problems in Parallel, (Irregular98), (A. Ferreira, J. Rolim, H. Simon, S.-H. Teng Editors), Lecture Notes in Computer Science, 1457, 274-284, Springer, 1998.
22. [PLST93] V. Y. Pan, E. Landowne, A. Sadikou, O. Tiga, A New Approach to Fast Polynomial Interpolation and Multipoint Evaluation, Computers & Math. (with Applications), 25, 9, 25{30, 1993.
23. [Po96] B. Porat, A Course in Digital Signal Processing, Wiley, New York, 1996.
24. [PZHY97] V. Y. Pan, A. Zheng, X. Huang, Y. Yu, Fast Multipoint Polynomial Evaluation and Interpolation via Computations with Structured Matrices, Annals of Numerical Math., 4, 483{510, January 1997.
25. [R88] V. Rokhlin, A Fast Algorithm for the Discrete Laplace Transformation, J. of Complexity, 4, 12-32, 1988.
26. [Ri90] T. Rivlin, Chebyshev Polynomials, Wiley, New York, 1990.
27. [SB80] J. Stoer, R. Bulirsch, Introduction to Numerical Analysis, Springer, New York, 1980.
28. [SN96] G. Strang, T. Nguyen, Wavelet and Filterbanks, Wellesley-Cambridge Press, Cambridge, Mass., 1996.
29. [Str73] V. Strassen, Die Berechnungskomplexeẗat von elementarysymmetrischen Funktionen und von Interpolationskoeffizienten, Numerische Mathematik, 20, 3, 238-251.
30. [W98] A. F. Ware, Fast Approximate Fourier Transforms for Irregularly Spaced Data, SIAM Review, 40, 4, 838-856, 1998.