scientific article
From MaRDI portal
zbMath0658.65047MaRDI QIDQ3806684
Hans J. Stetter, Winfried Auzinger
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
eigenvalue problemhomotopy methodisolated zerosstandard Gauss eliminationsystem of multivariate polynomial equations
Related Items
Computing border bases, An improvement of the rational representation for high-dimensional systems, Algorithms to compute the topology of orientable real algebraic surfaces, An introduction to commutative and noncommutative Gröbner bases, Stickelberger and the Eigenvalue Theorem, A Comprehensive Approach for Camera/LIDAR Frame Alignment, Stable normal forms for polynomial system solving, A numerical elimination method for polynomial computations, Accurate solution of polynomial equations using Macaulay resultant matrices, Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs, Prony's method in several variables: symbolic solutions by universal interpolation, Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm, Computing border bases using mutant strategies, Pseudospectra of exponential matrix polynomials, Computing coupled border bases, Toric eigenvalue methods for solving sparse polynomial systems, On the null spaces of the Macaulay matrix, Computing syzygies in finite dimension using fast linear algebra, A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems, An FGLM-like algorithm for computing the radical of a zero-dimensional ideal, Artificial discontinuities of single-parametric Gröbner bases, Simultaneous triangularization of commuting matrices for the solution of polynomial equations, Multiplication matrices and ideals of projective dimension zero, Multidimensional realisation theory and polynomial system solving, Computing all border bases for ideals of points, The multiplicity of zeros of algebraic system in eigenvalue method, On the pointwise limits of bivariate Lagrange projectors, Overdetermined Weierstrass iteration and the nearest consistent system, Bezoutian and quotient ring structure, Some constructions for real algebraic curves, Deformation techniques for efficient polynomial equation solving., Multivariate polynomials, duality, and structured matrices, Solving a sparse system using linear algebra, Approximate GCD and its application to ill-conditioned algebraic equations, A new notion of reduction: Generating universal Gröbner bases of ideals in \(K[x,y\)], Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems, Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems, Bar code for monomial ideals, Solutions of systems of algebraic equations and linear maps on residue class rings, Computation of a specified root of a polynomial system of equations using eigenvectors, Pivoting in extended rings for computing approximate Gröbner bases, Complexity of Gröbner basis detection and border basis detection, From Oil Fields to Hilbert Schemes, Regularization and Matrix Computation in Numerical Polynomial Algebra, Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin), A Polyhedral Characterization of Border Bases, On the computation of an arrangement of quadrics in 3D, Characterizations of border bases, Macaulay style formulas for sparse resultants, Multivariate polynomial system solving using intersections of eigenspaces., Explicit formulas for the multivariate resultant., Using symmetries in the eigenvalue method for polynomial systems, Solving polynomial systems via symbolic-numeric reduction to geometric involutive form, Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one, Radical computations of zero-dimensional ideals and real root counting., Bar code: a visual representation for finite sets of terms and its applications, Motivations for an arbitrary precision interval arithmetic and the MPFI library, Degröbnerization: a political manifesto, On decomposing systems of polynomial equations with finitely many solutions
