Solving systems of polynomial equations -- a tensor approach

DOI10.1007/978-3-030-97549-4_38zbMath1505.65202OpenAlexW4226120520MaRDI QIDQ2128457

Philippe Dreesen, Mariya Ishteva

Publication date: 22 April 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-97549-4_38

zbMATH Keywords

systems of polynomial equationstensorscanonical polyadic decompositionpartial symmetry

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Multilinear algebra, tensor calculus (15A69)

Uses Software

• Tensorlab

Cites Work

• Tensor Decompositions and Applications
• Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• A literature survey of low-rank tensor approximation techniques
• Tensor Spaces and Numerical Tensor Calculus
• Linear systems with a canonical polyadic decomposition constrained solution: Algorithms and applications
• Tensor Decomposition for Signal Processing and Machine Learning
• Numerical Polynomial Algebra
• Ideals, Varieties, and Algorithms
• Applied Multiway Data Analysis

This page was built for publication: Solving systems of polynomial equations -- a tensor approach