Zobrazeno 1 - 10
of 1 798
pro vyhledávání: '"[INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC]"'
Publikováno v:
Journal of Symbolic Computation
Journal of Symbolic Computation, 2023, ⟨10.1016/j.jsc.2022.08.014⟩
Journal of Symbolic Computation, 2023, ⟨10.1016/j.jsc.2022.08.014⟩
International audience; An interpolation problem is defined by a set of linear forms on the (multivariate) polynomial ring and values to be achieved by an interpolant. For Lagrange interpolation the linear forms consist of evaluations at some nodes,w
Publikováno v:
Journal of Symbolic Computation
Journal of Symbolic Computation, 2022, ⟨10.1016/j.jsc.2022.08.012⟩
Journal of Symbolic Computation, 2022, ⟨10.1016/j.jsc.2022.08.012⟩
We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space. Our method
Autor:
Nicholas Coxon
Publikováno v:
Journal of Symbolic Computation. 110:66-80
We show that simple modifications to van der Hoeven's forward and inverse truncated Fourier transforms allow the algorithms to be performed in-place, and with only a linear overhead in complexity.
Autor:
Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos, Panagiotis Repouskos, Elias Tsigaridas
Publikováno v:
Linear Algebra and its Applications
Linear Algebra and its Applications, 2022, 648, pp.205-232. ⟨10.1016/j.laa.2022.04.002⟩
Linear Algebra and its Applications, 2022, 648, pp.205-232. ⟨10.1016/j.laa.2022.04.002⟩
International audience; We present algorithmic, complexity, and implementation results on the problem of sampling points from a spectrahedron, that is, the feasible region of a semidefinite program.Our main tool is geometric random walks. We analyze
Publikováno v:
ISSAC'23 : International Symposium on Symbolic and Algebraic Computation 2023
ISSAC'23 : International Symposium on Symbolic and Algebraic Computation 2023, Jul 2023, Tromso, Norway. ⟨10.1145/3597066.3597122⟩
ISSAC'23 : International Symposium on Symbolic and Algebraic Computation 2023, Jul 2023, Tromso, Norway. ⟨10.1145/3597066.3597122⟩
International audience; Twenty years ago, Zeng [28, 30] proposed floating-point algorithms to compute multiple roots of univariate polynomials with real or complex coefficients beyond the so-called "attainable accuracy barrier". Based on these founda
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4254::958c829e2c19dffcf85cd0451fceea6e
https://hal.science/hal-04138791/document
https://hal.science/hal-04138791/document
Publikováno v:
ISSAC '23: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation
ISSAC 2023-48th International Symposium on Symbolic and Algebraic Computation
ISSAC 2023-48th International Symposium on Symbolic and Algebraic Computation, Jul 2023, Tromsø, Norway. ⟨10.1145/3597066.3597081⟩
ISSAC 2023-48th International Symposium on Symbolic and Algebraic Computation
ISSAC 2023-48th International Symposium on Symbolic and Algebraic Computation, Jul 2023, Tromsø, Norway. ⟨10.1145/3597066.3597081⟩
We consider the problem of answering connectivity queries on a real algebraic curve. The curve is given as the real trace of an algebraic curve, assumed to be in generic position, and being defined by some rational parametrizations. The query points
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5616b14b8ec08d08b9531443060b6b3
https://hal.science/hal-04000614v2/file/algcurves-merged.pdf
https://hal.science/hal-04000614v2/file/algcurves-merged.pdf
Autor:
Romero, Margarida, Alexandre, Frédéric
Publikováno v:
ISLS 2023-Annual Meeting of the International Society of the Learning Sciences
ISLS 2023-Annual Meeting of the International Society of the Learning Sciences, Jun 2023, Montréal, Canada
ISLS 2023-Annual Meeting of the International Society of the Learning Sciences, Jun 2023, Montréal, Canada
International audience; In computational neuroscience and bioinspired artificial intelligence (AI), different studies aim at understanding the mechanisms of perception such as shape recognition and sensori-motor coordination such as grasping or pinch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::baa77a6a129bd1095ebfd93080b52027
https://hal.science/hal-04124474
https://hal.science/hal-04124474
We address univariate root isolation when the polynomial's coefficients are in a multiple field extension. We consider a polynomial $F \in L[Y]$, where $L$ is a multiple algebraic extension of $\mathbb{Q}$. We provide aggregate bounds for $F$ and alg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f31717f70d5712a8e33c7656eb6c823
https://hal.science/hal-04116621/file/Isolating_roots_in_a_multiple_field_extension__HAL_.pdf
https://hal.science/hal-04116621/file/Isolating_roots_in_a_multiple_field_extension__HAL_.pdf
International audience; Due to the increasing number of objects in Low Earth orbit, the fast and reliable estimation of the collision risk is an important challenge for spacecraft owners/operators. Among the available risk indicators, we focus on com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ec8d46ca20eeb07049ee1a5dc2611baf
https://hal.laas.fr/hal-04134188/file/Instantaneous_POC.pdf
https://hal.laas.fr/hal-04134188/file/Instantaneous_POC.pdf
We study polynomial systems with prescribed monomial supports in the Cox rings of toric varieties built from complete polyhedral fans. We present combinatorial formulas for the dimensions of their associated subvarieties under genericity assumptions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1876197885acd992788edc3143a5390
http://arxiv.org/abs/2305.07439
http://arxiv.org/abs/2305.07439