Deflation Conjecture and Local Dimensions of Brent Equations
If an algebraic variety is determined by an ideal which is not radical, the codimension of the variety does not correspond to the rank of its Jacobian. To find an upper bound for the dimension locally, co-called deflation process can be used.\N\NThe deflation was originally used in the case of isolated singular solutions. The paper generalizes the process to the case of irreducible components with multiplicies by executing the process for a point on the studied irreducible component.\N\NIn each step of the process, the ideal defining the variety is enlarged so that the rank of the Jacobian is increased in each step. The working conjecture states that the deflation process terminates after finitaly many steps. In case the point considered for the computation is geometric smooth, the stable value of the deflation process is an upper bound for the local dimension, otherwise it is a lower bound.\N\NAfterwards, the deflation process is exhibited on Brent equations related to matrix multiplication. Specific examples are computed.\N\NIn the conclusion some related open questions are mentioned.
- A Newton’s iteration converges quadratically to nonisolated solutions too
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- A numerical local dimension test for points on the solution set of a system of polynomial equations
- Computing the dimension of real algebraic sets
- Computing the multiplicity structure in solving polynomial systems
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- Determining dimension of the solution component that contains a computed zero of a polynomial system
- Discovering faster matrix multiplication algorithms with reinforcement learning
- Flip Graphs for Matrix Multiplication
- Gaussian elimination is not optimal
- Geometry and complexity theory
- Ideals, Varieties, and Algorithms
- Isosingular sets and deflation
- Mechanism mobility and a local dimension test
- Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
- Most tensor problems are NP-hard
- Multiple zeros of nonlinear systems
- New ways to multiply \(3 \times 3\)-matrices
- Newton's method with deflation for isolated singularities of polynomial systems
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- Numerically solving polynomial systems with Bertini
- On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
- Smooth points on semi-algebraic sets
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- The bilinear complexity and practical algorithms for matrix multiplication
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
This page was built for publication: Deflation Conjecture and Local Dimensions of Brent Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6925276)
