Auswahl der wissenschaftlichen Literatur zum Thema „Certified Numerical Algorithms“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Certified Numerical Algorithms" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Certified Numerical Algorithms"
Bouazizi, Faïçal. „Algebraic certification of numerical algorithms computing Lagrange resolvents“. Journal of Algebra and Its Applications 17, Nr. 01 (Januar 2018): 1850007. http://dx.doi.org/10.1142/s021949881850007x.
Der volle Inhalt der QuelleSegonne, Charlotte, und Pierre Duthon. „Qualification of the PAVIN Fog and Rain Platform and Its Digital Twin for the Evaluation of a Pedestrian Detector in Fog“. Journal of Imaging 9, Nr. 10 (03.10.2023): 211. http://dx.doi.org/10.3390/jimaging9100211.
Der volle Inhalt der QuelleMykhailov, O. V. „Results of Comparative Evaluation of Algorithms for Calculating Scaling Factors of Difficult-To-Measure Nuclides in CHNPP Wastes at 241Am Example“. Nuclear Power and the Environment 21, Nr. 2 (2021): 61–70. http://dx.doi.org/10.31717/2311-8253.21.2.6.
Der volle Inhalt der QuelleGiacomini, Matteo, Olivier Pantz und Karim Trabelsi. „Certified Descent Algorithm for shape optimization driven by fully-computable a posteriori error estimators“. ESAIM: Control, Optimisation and Calculus of Variations 23, Nr. 3 (28.04.2017): 977–1001. http://dx.doi.org/10.1051/cocv/2016021.
Der volle Inhalt der QuelleImbach, Rémi, Guillaume Moroz und Marc Pouget. „A certified numerical algorithm for the topology of resultant and discriminant curves“. Journal of Symbolic Computation 80 (Mai 2017): 285–306. http://dx.doi.org/10.1016/j.jsc.2016.03.011.
Der volle Inhalt der QuelleHorai, Mio, Hideo Kobayashi und Takashi G. Nitta. „A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem“. Abstract and Applied Analysis 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/1304954.
Der volle Inhalt der QuelleKrait, George, Sylvain Lazard, Guillaume Moroz und Marc Pouget. „Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves“. Journal of Computational and Applied Mathematics 394 (Oktober 2021): 113553. http://dx.doi.org/10.1016/j.cam.2021.113553.
Der volle Inhalt der QuelleArkhipova, O. V., N. N. Dolgikh, S. Yu Dolinger, V. Z. Kovalev und D. S. Osipov. „Wavelet transform algorithm of daily load graphs for choosing parameters of hybrid energy storage“. Omsk Scientific Bulletin, Nr. 174 (2020): 57–62. http://dx.doi.org/10.25206/1813-8225-2020-174-57-62.
Der volle Inhalt der QuelleTran, Gia, Ricardo Santos, Hiroaki Ogawa, Makoto Nakamura, Kei Sakaguchi und Andreas Kassler. „Context-Based Dynamic Meshed Backhaul Construction for 5G Heterogeneous Networks“. Journal of Sensor and Actuator Networks 7, Nr. 4 (02.10.2018): 43. http://dx.doi.org/10.3390/jsan7040043.
Der volle Inhalt der QuelleMa, Ceyi, Yinghong Wen und Jinbao Zhang. „A Fast, Hybrid, Time-Domain Discontinuous Galerkin-Physical Optics Method for Composite Electromagnetic Scattering Analysis“. Applied Sciences 11, Nr. 6 (17.03.2021): 2694. http://dx.doi.org/10.3390/app11062694.
Der volle Inhalt der QuelleDissertationen zum Thema "Certified Numerical Algorithms"
Krait, George. „Isolating the Singularities of the Plane Projection of Generic Space Curves and Applications in Robotics“. Electronic Thesis or Diss., Université de Lorraine, 2021. http://www.theses.fr/2021LORR0092.
Der volle Inhalt der QuelleIsolating the singularities of a plane curve is the first step towards computing its topology. For this, numerical methods are efficient but not certified in general. We are interested in developing certified numerical algorithms for isolating the singularities. In order to do so, we restrict our attention to the special case of plane curves that are projections of smooth curves in higher dimensions. This type of curves appears naturally in robotics applications and scientific visualization. In this setting, we show that the singularities can be encoded by a regular square system whose solutions can be isolated with certified numerical methods. Our analysis is conditioned by assumptions that we prove to be generic using transversality theory. We also provide a semi-algorithm to check their validity. Finally, we present experiments in visualization and robotics, some of which are not reachable by other methods, and discuss the efficiency of our method
Giacomini, Matteo. „Quantitative a posteriori error estimators in Finite Element-based shape optimization“. Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLX070/document.
Der volle Inhalt der QuelleGradient-based shape optimization strategies rely on the computation of the so-called shape gradient. In many applications, the objective functional depends both on the shape of the domain and on the solution of a PDE which can only be solved approximately (e.g. via the Finite Element Method). Hence, the direction computed using the discretized shape gradient may not be a genuine descent direction for the objective functional. This Ph.D. thesis is devoted to the construction of a certification procedure to validate the descent direction in gradient-based shape optimization methods using a posteriori estimators of the error due to the Finite Element approximation of the shape gradient.By means of a goal-oriented procedure, we derive a fully computable certified upper bound of the aforementioned error. The resulting Certified Descent Algorithm (CDA) for shape optimization is able to identify a genuine descent direction at each iteration and features a reliable stopping criterion basedon the norm of the shape gradient.Two main applications are tackled in the thesis. First, we consider the scalar inverse identification problem of Electrical Impedance Tomography and we investigate several a posteriori estimators. A first procedure is inspired by the complementary energy principle and involves the solution of additionalglobal problems. In order to reduce the computational cost of the certification step, an estimator which depends solely on local quantities is derived via an equilibrated fluxes approach. The estimators are validated for a two-dimensional case and some numerical simulations are presented to test the discussed methods. A second application focuses on the vectorial problem of optimal design of elastic structures. Within this framework, we derive the volumetric expression of the shape gradient of the compliance using both H 1 -based and dual mixed variational formulations of the linear elasticity equation. Some preliminary numerical tests are performed to minimize the compliance under a volume constraint in 2D using the Boundary Variation Algorithm and an a posteriori estimator of the error in the shape gradient is obtained via the complementary energy principle
Buchteile zum Thema "Certified Numerical Algorithms"
Peruffo, Andrea, Daniele Ahmed und Alessandro Abate. „Automated and Formal Synthesis of Neural Barrier Certificates for Dynamical Models“. In Tools and Algorithms for the Construction and Analysis of Systems, 370–88. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_20.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Certified Numerical Algorithms"
Arusoaie, Andrei, David Nowak, Vlad Rusu und Dorel Lucanu. „A Certified Procedure for RL Verification“. In 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2017. http://dx.doi.org/10.1109/synasc.2017.00031.
Der volle Inhalt der QuelleMartin-Dorel, Erik, Laurence Rideau, Laurent Thery, Micaela Mayero und Ioana Pasca. „Certified, Efficient and Sharp Univariate Taylor Models in COQ“. In 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2013. http://dx.doi.org/10.1109/synasc.2013.33.
Der volle Inhalt der QuelleMehrabi, Mehdi, Tuhid Pashaee, Mohsen Sharifpur und Josua P. Meyer. „Application of Genetic Algorithm-Polynomial Neural Network for Modelling Heat Transfer and Fluid Flow Characteristics of a Double-Pipe Heat Exchanger“. In ASME 2013 Heat Transfer Summer Conference collocated with the ASME 2013 7th International Conference on Energy Sustainability and the ASME 2013 11th International Conference on Fuel Cell Science, Engineering and Technology. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/ht2013-17194.
Der volle Inhalt der QuelleGraillat, Stef, und Philippe Trébuchet. „A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system“. In the 2009 international symposium. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1576702.1576727.
Der volle Inhalt der QuelleChen, Jingjing, Yadong Wu, Zhonglin Wang und Anjenq Wang. „Nacelle: Air Intake Aerodynamic Design and Inlet Compatibility“. In ASME 2014 Gas Turbine India Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/gtindia2014-8182.
Der volle Inhalt der Quelle