Zobrazeno 1 - 10
of 733
pro vyhledávání: '"Wilkinson's polynomial"'
Autor:
Gómez Casanueva, Cristina
Publikováno v:
UCrea Repositorio Abierto de la Universidad de Cantabria
Universidad de Cantabria (UC)
Universidad de Cantabria (UC)
RESUMEN: En este trabajo se estudia el concepto de condicionamiento o número de condición de un polinomio, en el caso de polinomios homogéneos y no homogéneos. El número de condición mide como varían las soluciones de un polinomio al producirs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9dad9419cdd33c5155e6ab5ae3d3a90a
http://hdl.handle.net/10902/22882
http://hdl.handle.net/10902/22882
Publikováno v:
Recercat: Dipósit de la Recerca de Catalunya
Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Recercat. Dipósit de la Recerca de Catalunya
instname
Dipòsit Digital de Documents de la UAB
Universitat Autònoma de Barcelona
Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Recercat. Dipósit de la Recerca de Catalunya
instname
Dipòsit Digital de Documents de la UAB
Universitat Autònoma de Barcelona
In this paper we determine the maximum number of polynomial solutions of Bernoulli differential equations and of some integrable polynomial Abel differential equations. As far as we know, the tools used to prove our results have not been utilized bef
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88407d0bb740281badbdbbb14b3d9a01
http://hdl.handle.net/2072/417114
http://hdl.handle.net/2072/417114
Autor:
Jae Hyoung Lee, Gue Myung Lee
Publikováno v:
Mathematical Programming. 169:177-198
In this paper, we establish tractable sum of squares characterizations of the containment of a convex set, defined by a SOS-concave matrix inequality, in a non-convex set, defined by difference of a SOS-convex polynomial and a support function, with
Publikováno v:
Computers & Graphics. 67:14-23
Finding an implicit polynomial that fits a set of observations X is the goal of many researches in recent years. However, most existing algorithms assume the knowledge of the degree of the implicit polynomial that best represents the points. This pap
Autor:
Lijian Chen
Publikováno v:
Optimization Methods and Software. 34:115-138
We proposed a polynomial approximation-based approach to solve a specific type of chance-constrained optimization problem that can be equivalently transformed into a convex programme. This type of ...
Publikováno v:
Journal of Systems Science and Complexity. 30:967-982
Estimating the number of isolated roots of a polynomial system is not only a fundamental study theme in algebraic geometry but also an important subproblem of homotopy methods for solving polynomial systems. For the mixed trigonometric polynomial sys
Publikováno v:
Probabilistic Engineering Mechanics. 48:76-84
Probability of failure sensitivity analysis is a subject of major interest in uncertainty based optimization. However, the computational effort required to obtain accurate results is frequently very high. In this work we present a novel strategy for
Autor:
王志强 Wang Zhi-qiang, 马海波 Ma Hai-bo
Publikováno v:
Optics and Precision Engineering. 25:1112-1117
Autor:
Indrajit Lahiri, Bipul Pal
Publikováno v:
Journal of Contemporary Mathematical Analysis (Armenian Academy of Sciences). 52:54-60
Publikováno v:
Open Journal of Statistics. :689-701
Approximation of finite population totals in the presence of auxiliary information is considered. A polynomial based on Lagrange polynomial is proposed. Like the local polynomial regression, Horvitz Thompson and ratio estimators, this approximation t