Decoupling Multivariate Polynomials Using First-Order Information and Tensor Decompositions
From MaRDI portal
Abstract: We present a method to decompose a set of multivariate real polynomials into linear combinations of univariate polynomials in linear forms of the input variables. The method proceeds by collecting the first-order information of the polynomials in a set of operating points, which is captured by the Jacobian matrix evaluated at the operating points. The polyadic canonical decomposition of the three-way tensor of Jacobian matrices directly returns the unknown linear relations, as well as the necessary information to reconstruct the univariate polynomials. The conditions under which this decoupling procedure works are discussed, and the method is illustrated on several numerical examples.
Recommendations
- Decoupling multivariate polynomials: interconnections between tensorizations
- Approximate decoupling of multivariate polynomials using weighted tensor decomposition.
- On the Problem of Decoupling Multivariate Polynomials
- Decomposition Algorithms for Tensors and Polynomials
- Multivariate polynomial decomposition
- scientific article; zbMATH DE number 2125607
- Probabilistic Tensor Canonical Polyadic Decomposition With Orthogonal Factors
- Multihomogeneous polynomial decomposition using moment matrices
- On multivariate polynomial matrix factorization problems
- Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part I: the canonical polyadic decomposition
Cites work
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 773851 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Block-oriented nonlinear system identification
- Canonical polyadic decomposition of third-order tensors: reduction to generalized eigenvalue decomposition
- Decomposition of quantics in sums of powers of linear forms
- Decompositions of a Higher-Order Tensor in Block Terms—Part I: Lemmas for Partitioned Matrices
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Eigenvectors of tensors and algorithms for Waring decomposition
- Identification of nonlinear systems using polynomial nonlinear state space models
- Identification of systems with localised nonlinearity: from state-space to block-structured models
- On Waring's problem for several algebraic forms
- On a decomposition of polynomials in several variables
- On the uniqueness of the canonical polyadic decomposition of third-order tensors. II: Uniqueness of the overall decomposition
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(L_r,L_r,1) terms, and a new generalization
- Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
- Representations of multivariate polynomials by sums of univariate polynomials in linear forms
- Symmetric Tensors and Symmetric Tensor Rank
- Symmetric tensor decomposition
- Tensor Decompositions and Applications
- The typical rank of tall three-way arrays
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Varieties of sums of power
Cited in
(12)- Simultaneous direct sum decompositions of several multivariate polynomials
- Symmetric tensor decomposition by an iterative eigendecomposition algorithm
- On the Problem of Decoupling Multivariate Polynomials
- Polynomial decompositions with invariance and positivity inspired by tensors
- A few-shot identification method for stochastic dynamical systems based on residual multipeaks adaptive sampling
- Identifiability of an X-rank decomposition of polynomial maps
- Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition
- Low rank tensor methods in Galerkin-based isogeometric analysis
- Simultaneous block diagonalization of symmetric matrices via congruence
- Approximate decoupling of multivariate polynomials using weighted tensor decomposition.
- Learning low-dimensional separable decompositions of MIMO non-linear systems
- Decoupling multivariate polynomials: interconnections between tensorizations
This page was built for publication: Decoupling Multivariate Polynomials Using First-Order Information and Tensor Decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264998)
