Gotowa bibliografia na temat „Symbolic computation continuation”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Symbolic computation continuation”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Symbolic computation continuation"
Jiu, Lin, Christophe Vignat i Tanay Wakhare. "Analytic continuation for multiple zeta values using symbolic representations". International Journal of Number Theory 16, nr 03 (25.09.2019): 579–602. http://dx.doi.org/10.1142/s1793042120500293.
Pełny tekst źródłaBeach, K. S. D., R. J. Gooding i F. Marsiglio. "Reliable Padé analytical continuation method based on a high-accuracy symbolic computation algorithm". Physical Review B 61, nr 8 (15.02.2000): 5147–57. http://dx.doi.org/10.1103/physrevb.61.5147.
Pełny tekst źródłaLi, T. Y. "Numerical solution of multivariate polynomial systems by homotopy continuation methods". Acta Numerica 6 (styczeń 1997): 399–436. http://dx.doi.org/10.1017/s0962492900002749.
Pełny tekst źródłaGreif, Hajo. "Exploring Minds: Modes of Modeling and Simulation in Artificial Intelligence". Perspectives on Science 29, nr 4 (lipiec 2021): 409–35. http://dx.doi.org/10.1162/posc_a_00377.
Pełny tekst źródłaBlümlein, Johannes, Nikolai Fadeev i Carsten Schneider. "Computing Mellin Representations and Asymptotics of Nested Binomial Sums in a Symbolic Way: The RICA Package". ACM Communications in Computer Algebra 57, nr 2 (czerwiec 2023): 31–34. http://dx.doi.org/10.1145/3614408.3614410.
Pełny tekst źródłaMerlet, J. P. "Mixing neural networks, continuation and symbolic computation to solve parametric systems of non linear equations". Neural Networks, kwiecień 2024, 106316. http://dx.doi.org/10.1016/j.neunet.2024.106316.
Pełny tekst źródłaChowdhury, Abhishek, i Sourav Maji. "Counting $$\mathcal{N}$$ = 8 black holes as algebraic varieties". Journal of High Energy Physics 2024, nr 5 (8.05.2024). http://dx.doi.org/10.1007/jhep05(2024)091.
Pełny tekst źródłaDin, Crystal Chang, Reiner Hähnle, Ludovic Henrio, Einar Broch Johnsen, Violet Ka I. Pun i S. Lizeth Tapia Tarifa. "Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages". ACM Transactions on Programming Languages and Systems, 16.02.2024. http://dx.doi.org/10.1145/3648439.
Pełny tekst źródłaRozprawy doktorskie na temat "Symbolic computation continuation"
Vu, Thi Xuan. "Homotopy algorithms for solving structured determinantal systems". Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS478.
Pełny tekst źródłaMultivariate polynomial systems arising in numerous applications have special structures. In particular, determinantal structures and invariant systems appear in a wide range of applications such as in polynomial optimization and related questions in real algebraic geometry. The goal of this thesis is to provide efficient algorithms to solve such structured systems. In order to solve the first kind of systems, we design efficient algorithms by using the symbolic homotopy continuation techniques. While the homotopy methods, in both numeric and symbolic, are well-understood and widely used in polynomial system solving for square systems, the use of these methods to solve over-detemined systems is not so clear. Meanwhile, determinantal systems are over-determined with more equations than unknowns. We provide probabilistic homotopy algorithms which take advantage of the determinantal structure to compute isolated points in the zero-sets of determinantal systems. The runtimes of our algorithms are polynomial in the sum of the multiplicities of isolated points and the degree of the homotopy curve. We also give the bounds on the number of isolated points that we have to compute in three contexts: all entries of the input are in classical polynomial rings, all these polynomials are sparse, and they are weighted polynomials. In the second half of the thesis, we deal with the problem of finding critical points of a symmetric polynomial map on an invariant algebraic set. We exploit the invariance properties of the input to split the solution space according to the orbits of the symmetric group. This allows us to design an algorithm which gives a triangular description of the solution space and which runs in time polynomial in the number of points that we have to compute. Our results are illustrated by applications in studying real algebraic sets defined by invariant polynomial systems by the means of the critical point method
Części książek na temat "Symbolic computation continuation"
Freire, E., E. Gamero i E. Ponce. "Symbolic Computation and Bifurcation Methods". W Continuation and Bifurcations: Numerical Techniques and Applications, 105–22. Dordrecht: Springer Netherlands, 1990. http://dx.doi.org/10.1007/978-94-009-0659-4_7.
Pełny tekst źródłaBogner, Christian, Armin Schweitzer i Stefan Weinzierl. "Analytic Continuation of the Kite Family". W Texts & Monographs in Symbolic Computation, 79–91. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-04480-0_4.
Pełny tekst źródłaStreszczenia konferencji na temat "Symbolic computation continuation"
Xu, Juan, Michael Burr i Chee Yap. "An Approach for Certifying Homotopy Continuation Paths". W ISSAC '18: International Symposium on Symbolic and Algebraic Computation. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3208976.3209010.
Pełny tekst źródłaVerschelde, Jan, i Xiangcheng Yu. "Accelerating polynomial homotopy continuation on a graphics processing unit with double double and quad double arithmetic". W PASCO '15: International Workshop on Parallel Symbolic Computation. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2790282.2790294.
Pełny tekst źródła