Infinitely many quasi-coincidence point solutions of multivariate polynomial problems

DOI10.1155/2013/307913zbMath1381.39020OpenAlexW2093999990WikidataQ58915893 ScholiaQ58915893MaRDI QIDQ2015347

Yi-Chou Chen

Publication date: 23 June 2014

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/307913

Mathematics Subject Classification ID

Fixed-point theorems (47H10) Functional equations for real functions (39B22)

Related Items (1)

Infinitely many eigenfunctions for polynomial problems: exact results

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-NP-complete algorithm for a quasi-fixed polynomial problem
• On approximate coincidence point properties and their applications to fixed point theory
• On coincidence point and fixed point theorems for nonlinear multivalued maps
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• Coincidence theorems on nonconvex sets and its applications
• New nonlinear conditions and inequalities for the existence of coincidence points and fixed points
• New quasi-coincidence point polynomial problems
• Coincidence theorems, generalized variational inequality theorems, and minimax inequality theorems for the \(\Phi \)-mapping on \(G\)-convex spaces
• Algorithms for modular counting of roots of multivariate polynomials
• Factoring Multivariate Polynomials over Algebraic Number Fields
• On multiplicities in polynomial system solving
• Univariate Polynomial Real Root Isolation: Continued Fractions Revisited

This page was built for publication: Infinitely many quasi-coincidence point solutions of multivariate polynomial problems