Matches in SemOpenAlex for { <https://semopenalex.org/work/W2017413072> ?p ?o ?g. }
- W2017413072 endingPage "3182" @default.
- W2017413072 startingPage "3164" @default.
- W2017413072 abstract "Elimination methods are highly effective for the solution of linear and nonlinear systems of equations, but reversal of the elimination principle can be beneficial as well: competent incorporation of additional independent constraints and variables or more generally immersion of the original computational problem into a larger task, defined by a larger number of independent constraints and variables can improve global convergence of iterative algorithms, that is their convergence from the start. A well known example is the dual linear and nonlinear programming, which enhances the power of optimization algorithms. We believe that this is just an ad hoc application of general Principle of Expansion with Independent Constraints; it should be explored systematically for devising iterative algorithms for the solution of equations and systems of equations and for optimization. At the end of this paper we comment on other applications and extensions of this principle. Presently we show it at work for the approximation of a single zero of a univariate polynomial p of a degree n. Empirical global convergence of the known algorithms for this task is much weaker than that of the algorithms for all n zeros, such as Weierstrass–Durand–Kerner’s root-finder, which reduces its root-finding task to Viète’s (Vieta’s) system of n polynomial equations with n unknowns. We adjust this root-finder to the approximation of a single zero of p, preserve its fast global convergence and decrease the number of arithmetic operations per iteration from quadratic to linear. Together with computing a zero of a polynomial p, the algorithm deflates this polynomial as by-product, and then could be reapplied to the quotient to approximate the next zero of p. Alternatively by using m processors that exchange no data, one can concurrently approximate up to m zeros of p. Our tests confirm the efficiency of the proposed algorithms. Technically our root-finding boils down to computations with structured matrices, polynomials and partial fraction decompositions. Our study of these links can be of independent interest; e.g., as by-product we express the inverse of a Sylvester matrix via its last column, thus extending the celebrated result of Gohberg and Sementsul (1972) [22] from Toeplitz to Sylvester matrix inverses." @default.
- W2017413072 created "2016-06-24" @default.
- W2017413072 creator A5007207817 @default.
- W2017413072 creator A5056866601 @default.
- W2017413072 date "2011-10-01" @default.
- W2017413072 modified "2023-09-26" @default.
- W2017413072 title "Root-finding by expansion with independent constraints" @default.
- W2017413072 cites W1832583097 @default.
- W2017413072 cites W1965692635 @default.
- W2017413072 cites W1973014977 @default.
- W2017413072 cites W1984465856 @default.
- W2017413072 cites W1995250895 @default.
- W2017413072 cites W1998761587 @default.
- W2017413072 cites W2001224529 @default.
- W2017413072 cites W2012342541 @default.
- W2017413072 cites W2014884518 @default.
- W2017413072 cites W2017951318 @default.
- W2017413072 cites W2035380993 @default.
- W2017413072 cites W2035714636 @default.
- W2017413072 cites W2038339167 @default.
- W2017413072 cites W2043237762 @default.
- W2017413072 cites W2050835552 @default.
- W2017413072 cites W2053020126 @default.
- W2017413072 cites W2071771712 @default.
- W2017413072 cites W2073998620 @default.
- W2017413072 cites W2079536609 @default.
- W2017413072 cites W2085735842 @default.
- W2017413072 cites W2090960299 @default.
- W2017413072 cites W2094876285 @default.
- W2017413072 cites W2097541598 @default.
- W2017413072 cites W2115515485 @default.
- W2017413072 cites W2144619406 @default.
- W2017413072 cites W2155969572 @default.
- W2017413072 cites W2165679222 @default.
- W2017413072 cites W2167622232 @default.
- W2017413072 cites W4255942865 @default.
- W2017413072 doi "https://doi.org/10.1016/j.camwa.2011.08.029" @default.
- W2017413072 hasPublicationYear "2011" @default.
- W2017413072 type Work @default.
- W2017413072 sameAs 2017413072 @default.
- W2017413072 citedByCount "9" @default.
- W2017413072 countsByYear W20174130722012 @default.
- W2017413072 countsByYear W20174130722013 @default.
- W2017413072 countsByYear W20174130722014 @default.
- W2017413072 countsByYear W20174130722017 @default.
- W2017413072 crossrefType "journal-article" @default.
- W2017413072 hasAuthorship W2017413072A5007207817 @default.
- W2017413072 hasAuthorship W2017413072A5056866601 @default.
- W2017413072 hasBestOaLocation W20174130721 @default.
- W2017413072 hasConcept C121332964 @default.
- W2017413072 hasConcept C126255220 @default.
- W2017413072 hasConcept C127162648 @default.
- W2017413072 hasConcept C134306372 @default.
- W2017413072 hasConcept C138885662 @default.
- W2017413072 hasConcept C158622935 @default.
- W2017413072 hasConcept C162324750 @default.
- W2017413072 hasConcept C2777303404 @default.
- W2017413072 hasConcept C2780813799 @default.
- W2017413072 hasConcept C28826006 @default.
- W2017413072 hasConcept C31258907 @default.
- W2017413072 hasConcept C33923547 @default.
- W2017413072 hasConcept C41008148 @default.
- W2017413072 hasConcept C41895202 @default.
- W2017413072 hasConcept C50522688 @default.
- W2017413072 hasConcept C57869625 @default.
- W2017413072 hasConcept C62520636 @default.
- W2017413072 hasConcept C90119067 @default.
- W2017413072 hasConceptScore W2017413072C121332964 @default.
- W2017413072 hasConceptScore W2017413072C126255220 @default.
- W2017413072 hasConceptScore W2017413072C127162648 @default.
- W2017413072 hasConceptScore W2017413072C134306372 @default.
- W2017413072 hasConceptScore W2017413072C138885662 @default.
- W2017413072 hasConceptScore W2017413072C158622935 @default.
- W2017413072 hasConceptScore W2017413072C162324750 @default.
- W2017413072 hasConceptScore W2017413072C2777303404 @default.
- W2017413072 hasConceptScore W2017413072C2780813799 @default.
- W2017413072 hasConceptScore W2017413072C28826006 @default.
- W2017413072 hasConceptScore W2017413072C31258907 @default.
- W2017413072 hasConceptScore W2017413072C33923547 @default.
- W2017413072 hasConceptScore W2017413072C41008148 @default.
- W2017413072 hasConceptScore W2017413072C41895202 @default.
- W2017413072 hasConceptScore W2017413072C50522688 @default.
- W2017413072 hasConceptScore W2017413072C57869625 @default.
- W2017413072 hasConceptScore W2017413072C62520636 @default.
- W2017413072 hasConceptScore W2017413072C90119067 @default.
- W2017413072 hasIssue "8" @default.
- W2017413072 hasLocation W20174130721 @default.
- W2017413072 hasOpenAccess W2017413072 @default.
- W2017413072 hasPrimaryLocation W20174130721 @default.
- W2017413072 hasRelatedWork W130791004 @default.
- W2017413072 hasRelatedWork W1984543043 @default.
- W2017413072 hasRelatedWork W2038137143 @default.
- W2017413072 hasRelatedWork W2070832276 @default.
- W2017413072 hasRelatedWork W2077192697 @default.
- W2017413072 hasRelatedWork W2084461749 @default.
- W2017413072 hasRelatedWork W2362641799 @default.
- W2017413072 hasRelatedWork W2757198137 @default.
- W2017413072 hasRelatedWork W2902563245 @default.