The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
algorithmscontinuation methodexclusion methodsGröbner baseshomotopyNewton methodnumerical algebraic geometrypolynomial systemstextbookwitness setsZariski topology
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects of higher-dimensional varieties (14Q15) Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Solving polynomial systems via symbolic-numeric reduction to geometric involutive form
- Implicit Riquier bases for PDAE and their semi-discretizations
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Deformation techniques for sparse systems
- Self-locking analysis in closed kinematic chains
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors
- Trace test
- Arc length based maximal Lyapunov functions and domains of attraction estimation for polynomial nonlinear systems
- Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
- Computational algebraic geometry and global analysis of regional manipulators
- Homotopy continuation of the high-order flux reconstruction/correction procedure via reconstruction (FR/CPR) method for steady flow simulation
- Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation
- Computing the unique CANDECOMP/PARAFAC decomposition of unbalanced tensors by homotopy method
- Tensor decomposition and homotopy continuation
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Efficiently counting affine roots of mixed trigonometric polynomial systems
- Equivalent realisations of a rigid graph
- Decoupled molecules with binding polynomials of bidegree \((n,2)\)
- On the bit complexity of polynomial system solving
- Maximum likelihood estimation of symmetric group-based models via numerical algebraic geometry
- Unification and extension of intersection algorithms in numerical algebraic geometry
- A homotopy method for parameter estimation of nonlinear differential equations with multiple optima
- Eigenfunction expansion method for multiple solutions of fourth-order ordinary differential equations with cubic polynomial nonlinearity
- Global structure of curves from generalized unitarity cut of three-loop diagrams
- Solving some special cases of monomial ratio equations appearing frequently in physical and engineering problems
- Numerical algebraic geometry: a new perspective on gauge and string theories
- Steady state bifurcation of a periodically excited system under delayed feedback controls
- Numerically computing real points on algebraic sets
- Numerical algebraic geometry and semidefinite programming
- Dissipation-based continuation method for multiphase flow in heterogeneous porous media
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
- Computing the equisingularity type of a pseudo-irreducible polynomial
- A stochastic homotopy tracking algorithm for parametric systems of nonlinear equations
- Clustering complex zeros of triangular systems of polynomials
- Solving decomposable sparse systems
- Fiber product homotopy method for multiparameter eigenvalue problems
- An adaptive homotopy tracking algorithm for solving nonlinear parametric systems with applications in nonlinear ODEs
- Inner-approximating domains of attraction for discrete-time switched systems via multi-step multiple Lyapunov-like functions
- Noetherian operators and primary decomposition
- Homotopy continuation for the spectra of persistent Laplacians
- The numerical algebraic geometry of bottlenecks
- Using monodromy to statistically estimate the number of solutions
- Euclidean distance degree and mixed volume
- Smooth points on semi-algebraic sets
- Catastrophe in elastic tensegrity frameworks
- Nondegeneracy of eigenvectors and singular vector tuples of tensors
- Low-rank approximation to entangled multipartite quantum systems
- Rank-1 approximation for entangled multipartite real systems
- Binomiality testing and computing sparse polynomials via witness sets
- Book review of: M. Michałek and B. Sturmfels, Invitation to nonlinear algebra
- HomPINNs: Homotopy physics-informed neural networks for learning multiple solutions of nonlinear elliptic differential equations
- Numerical root finding via Cox rings
- Multiprojective witness sets and a trace test
- On some configurations of oppositely charged trapped vortices in the plane
- A singular value homotopy for finding critical parameter values
- Solving determinantal systems using homotopy techniques
- Mixed precision path tracking for polynomial homotopy continuation
- A weight initialization based on the linear product structure for neural networks
- A bootstrapping approach for computing multiple solutions of differential equations
- On the complexity of computing with planar algebraic curves
- Optimized parametrization of systems of incidences between rigid bodies
- The classification of real singularities using \textsc{Singular}. III: Unimodal singularities of corank 2
- A homotopy method with adaptive basis selection for computing multiple solutions of differential equations
- Real monodromy action
- A new centrality measure of nodes in multilayer networks under the framework of tensor computation
- Spatial pattern formation in reaction-diffusion models: a computational approach
- An adaptive homotopy method for computing bifurcations of nonlinear parametric systems
- Nonlinear power-like iteration by polar decomposition and its application to tensor approximation
- Homotopy techniques for tensor decomposition and perfect identifiability
- Computing complex and real tropical curves using monodromy
- Is the addition of higher-order interactions in ecological models increasing the understanding of ecological dynamics?
- Adaptive strategies for solving parameterized systems using homotopy continuation
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- A numerical realization of the conditions of Max Nöther's residual intersection theorem
- Symmetric homotopy method for discretized elliptic equations with cubic and quintic nonlinearities
- A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties
- Computing real witness points of positive dimensional polynomial systems
- Design and evaluation of homotopies for efficient and robust continuation
- A numerical elimination method for polynomial computations
- Cell decomposition of almost smooth real algebraic surfaces
- Tracing multiple solution branches for nonlinear ordinary differential equations: Chebyshev and Fourier spectral methods and a degree-increasing spectral homotopy [DISH]
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- A homotopy method for solving multilinear systems with M-tensors
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- Optimal quadrature rules for odd-degree spline spaces and their application to tensor-product-based isogeometric analysis
- Improved complexity bounds for counting points on hyperelliptic curves
- Unmixing the mixed volume computation
- A homotopy method for computing the largest eigenvalue of an irreducible nonnegative tensor
- Sampling algebraic sets in local intrinsic coordinates
- Guessing singular dependencies
- Exploring collision-free path planning by using homotopy continuation methods
- On approximate triangular decompositions in dimension zero
- Determining dimension of the solution component that contains a computed zero of a polynomial system
- Newton's method with deflation for isolated singularities of polynomial systems
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- Kinematical analysis of overconstrained and underconstrained mechanisms by means of computational algebraic geometry
- Computing the common zeros of two bivariate functions via Bézout resultants
- Towards a better integration of modelers and black box constraint solvers within the product design process
This page was built for publication: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312787)