Infinitely many quasi-coincidence point solutions of multivariate polynomial problems
From MaRDI portal
Publication:2015347
Recommendations
Cites work
- scientific article; zbMATH DE number 5706765 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 6025194 (Why is no real title available?)
- A non-NP-complete algorithm for a quasi-fixed polynomial problem
- Algorithms for modular counting of roots of multivariate polynomials
- Coincidence theorems on nonconvex sets and its applications
- Coincidence theorems, generalized variational inequality theorems, and minimax inequality theorems for the \(\Phi \)-mapping on \(G\)-convex spaces
- Factoring Multivariate Polynomials over Algebraic Number Fields
- New nonlinear conditions and inequalities for the existence of coincidence points and fixed points
- New quasi-coincidence point polynomial problems
- On approximate coincidence point properties and their applications to fixed point theory
- On coincidence point and fixed point theorems for nonlinear multivalued maps
- On multiplicities in polynomial system solving
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Cited in
(5)- Quasi-fixed polynomial solutions of real-valued polynomial equation
- New quasi-coincidence point polynomial problems
- Infinitely many eigenfunctions for polynomial problems: exact results
- scientific article; zbMATH DE number 5706765 (Why is no real title available?)
- scientific article; zbMATH DE number 6025194 (Why is no real title available?)
This page was built for publication: Infinitely many quasi-coincidence point solutions of multivariate polynomial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015347)