Angel Díaz, Ioannis Z. Emiris, Erich Kaltofen, Victor Y. Pan  Home/Search
Context
Related
| sop.inria.fr/saga/emiri...DEKPalg.ps.gz ncsu.edu/~kaltofen/bibli...DEKP98.ps.gz ncsu.edu/~kaltofen/bibli...DEKP99.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sop.inria.fr/saga/personnel/Io... (more) From: ncsu.edu/~kaltofen/biblio...node3 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This article, along with [Elkadi and Mourrain 1996], explain the correlation between residue theory and the Dixon matrix, which yields an alternative method for studying and approximating all common solutions. In 1916, Macaulay [1916] constructed a matrix whose determinant is a multiple of the classical resultant for n homogeneous polynomials in n variables. The Macaulay matrix si16 multaneously generalizes the Sylvester matrix and the coefficient matrix of a system of linear equations [Canny... (Update)
Similar documents (at the sentence level):
56.3%: Algebraic Algorithms - Díaz, Kaltofen, Pan (1997) (Correct)
Active bibliography (related documents): More All
1.3: Solving A Polynomial Equation: Some History And Recent Progress - Pan (1997) (Correct)
1.1: Publications by Erich Kaltofen - Kaltofen (1999) (Correct)
0.6: Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree.. - Pan (1996) (Correct)
Similar documents based on text: More All
0.5: Applications Of FFT - Emiris, Pan (1999) (Correct)
0.5: Modular Arithmetic for Linear Algebra Computations in the Real .. - Emiris, Pan, Yu (1998) (Correct)
0.4: Symbolic and Numeric Methods for Exploiting Structure in.. - Emiris, Pan (1997) (Correct)
BibTeX entry: (Update)
@misc{ az-algebraic,
author = "Angel Díaz and Ioannis Z. Emiris and Erich Kaltofen and Victor Y. Pan",
title = "Algebraic Algorithms",
url = "citeseer.ist.psu.edu/156775.html" }
Citations (may not include all citations):2441 Johns Hopkins University Press (context) - Golub, Van Loan - 1996
860 The Theory of Error-Correcting Codes (context) - MacWilliams, Sloan - 1977
624 The Algebraic Eigenvalue Problem (context) - Wilkinson - 1965
532 LAPACK Users' Guide (context) - Anderson - 1992
441 Symmetric Eigenvalue Problem (context) - Parlett - 1980
346 Computer Solution of Large Sparse Positive Definite Linear S.. (context) - George, Liu - 1981
308 Matrix multiplication via arithmetic progressions (context) - Coppersmith, Winograd - 1990
234 Accuracy and Stability of Numerical Algorithms (context) - Higham - 1996
175 Matrix Eigensystem Routines: EISPACK Guide (context) - Smith - 1970
167 Grobner bases: An algorithmic method in polynomial ideal the.. (context) - Buchberger - 1985
134 Iterative Methods for Solving Linear Systems (context) - Greenbaum - 1997
117 Applied Numerical Linear Algebra (context) - Demmel - 1997
117 Rounding errors in algebraic processes (context) - Wilkinson - 1964
100 Generalized nested dissection (context) - Lipton, Rose et al. - 1979
94 Parallel algorithms for sparse linear systems (context) - Heath, Ng et al. - 1991
94 Graphs and Algorithms (context) - Gondran, Minoux - 1984
87 Numerical Linear Algebra (context) - Trefethen, Bau - 1997
79 Parallel Computing: Theory and Practice (context) - Quinn - 1994
71 Ein Algorithmus zum Auffinden der Basiselemente des Restklas.. (context) - Buchberger - 1965
69 Factoring polynomials over large finite fields (context) - Berlekamp - 1970
67 Matrix Eigensystem Routines: EISPACK Guide Extension (context) - Garbow - 1972
65 Grobner bases A Computational Approach to Commutative Algebr.. (context) - Becker, Weispfenning - 1993
62 Polynomial and Matrix Computations (context) - Bini, Pan - 1994
58 Algebraic Complexity Theory (context) - Burgisser, Clausen et al. - 1997
53 Algebraic theory of modular systems (context) - Macaulay - 1916
51 Resultants and Multidimensional Determinants (context) - Gelfand, Kapranov et al. - 1994
50 An elimination algorithm for the computation of all zeros of.. (context) - Auzinger, Stetter - 1988
48 The number of roots of a system of equations (context) - Bernstein - 1975
40 Multigrid Methods (context) - McCormick - 1987
40 Probabilistic algorithms in finite fields - Rabin - 1980
39 A new algorithm for factoring polynomials over finite fields (context) - Cantor, Zassenhaus - 1981
38 Sylvester's identity and multistep integers preserving Gauss.. (context) - Bareiss - 1968
37 Computer Algebra Systems and Algorithms for Algebraic Comput.. (context) - Davenport, Tournier et al. - 1988
37 Efficient computation of zero-dimensional Grobner bases by c.. (context) - Faugere, Gianni et al. - 1993
35 Nearly optimal algorithms for canonical matrix forms - Giesbrecht - 1995
34 An efficient algorithm for the sparse mixed resultant - Canny, Emiris - 1993
34 Solving systems of non-linear polynomial equations faster (context) - Canny, Kaltofen et al. - 1989
34 Effective Polynomial Computations (context) - Zippel - 1993
34 Algebraic and Numeric Techniques for Modeling and Robotics - Manocha - 1992
33 Sparse elimination theory (context) - Sturmfels - 1991
33 On Euclid's algorithm and the theory of subresultants (context) - Brown, Traub - 1971
30 A new polynomial factorization algorithm and its implementat.. - Shoup - 1995
30 Elimination methods an introduction (context) - Kapur - 1992
30 the rapid computation of various polylogarithmic constants - Bailey, Borwein et al. - 1995
29 Subresultants and reduced polynomial remainder sequences (context) - Collins - 1967
29 The analysis of a nested dissection algorithm (context) - Gilbert, Tarjan - 1987
29 Greatest common divisors of polynomials given by straight-li.. - Kaltofen - 1988
27 Computing Frobenius maps and factoring polynomials - Gathen, Shoup - 1992
26 Parallel algorithms for matrix normal forms - Kaltofen, Krishnamoorthy et al. - 1990
24 Improved sparse multivariate polynomial interpolation algori.. - Kaltofen, Lakshman - 1988
24 the complexity of sparse elimination - Emiris - 1996
24 Ungar Publishing Co (context) - van der Waerden - 1950
21 Polynomial factorization (context) - Kaltofen - 1982
20 Generalized characteristic polynomials (context) - Canny - 1990
18 The structure of sparse resultant matrices - Emiris, Pan - 1997
16 A bibliography on roots of polynomials (context) - McNamee - 1993
16 A theoretical basis for the reduction of polynomials to cano.. (context) - Buchberger - 1976
15 Algebraic approach of residues and applications - Cardinal, Mourrain - 1996
14 Conformational analysis of molecular chains using nanokinema.. - Manocha, Zhu et al. - 1995
13 A three-stage variable-shift iteration for polynomial zeros .. (context) - Jenkins, Traub - 1970
13 Computer Science Division (context) - Emiris, Applications et al. - 1994
12 Effective Noether irreducibility forms and applications (context) - Kaltofen - 1995
12 On Hensel factorization (context) - Zassenhaus - 1969
12 Symbolic Algebraic Comput (context) - Levelt, Proc et al. - 1995
11 an integer relation finding algorithm (context) - Ferguson, Bailey et al. - 1996
10 Certified approximate univariate GCDs - Emiris, Galligo et al. - 1997
8 Factorization of polynomials given by straight-line programs - Kaltofen - 1989
8 On arithmetical algorithms over finite fields (context) - Cantor - 1989
7 LAPACK Users' Guide (context) - Dongarra - 1978
6 the complexity of computing Grobner bases for zero-dimension.. (context) - Lakshman - 1990
6 Multigrid methods for symmetric positive definite block toep.. (context) - Fiorentino, Serra - 1996
6 New deterministic factorization algorithms for polynomials o.. (context) - Niederreiter - 1994
5 FoxBox a System for Manipulating Symbolic Objects in Black B.. (context) - D'iaz - 1997
5 Fast and efficient parallel solution of sparse linear system.. - Pan, Reif - 1993
4 Complexity of algorithms for linear systems of equations (context) - Pan - 1991
4 Factoring polynomials via relation-finding (context) - Miller - 1992
4 A root-finding algorithm based on Newton's method (context) - Madsen - 1973
4 Algebraic geometry for computer-aided design (context) - Stederberg, Goldman - 1986
4 Generalizations of Laguerre's method: higher order methods (context) - Foster - 1981
4 Multidimensional Euclidean algorithms (context) - Ferguson, Forcade - 1982
3 the reducibility of polynomials over a finite field (context) - Schwarz - 1956
3 On parallel computations with band matrices (context) - Pan, Sobze et al. - 1995
3 On approximating polynomial zeros: Modified quadtree constru.. (context) - Pan - 1994
3 The computation of puiseux expansions and a quantitative ver.. (context) - Walsh - 1993
2 Symbolic parameterization of curves (context) - Sendra, Winkler - 1991
2 A heuristic irreducibility test for univariate polynomials (context) - Monagan - 1992
2 on Scientific and Statistical Computing (context) - Pan, Reif et al. - 1992
2 The elimination of three quantics in two independent variabl.. (context) - Dixon - 1908
2 A note on the complexity of constructing Grobner-bases (context) - Buchberger - 1983
2 GCD's and factoring polynomials using Grobner bases (context) - Gianni, Trager - 1985
1 Computational Complexity of Algebraic and Numeric Problems (context) - Bini, Pan et al. - 1975
1 Addison and Wesley (context) - many, Kaltofen's et al. - 1974
1 Solution of partial differential equations on vector and par.. (context) - Math, Ortega et al. - 1985
1 Resultants and Implicit Representation of Rational Surfaces (context) - Cayley, theory et al. - 1990
Documents on the same site (http://www-sop.inria.fr/saga/personnel/Ioannis.Emiris/): More
Certified Approximate Univariate GCDs - Emiris, Galligo, Lombardi (1997) (Correct)
An Efficient Algorithm for the Sparse Mixed Resultant - Canny, Emiris (1993) (Correct)
Symbolic and Numeric Methods for Exploiting Structure in.. - Emiris, Pan (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC