BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Institute of Mathematics and Informatics - ECPv6.0.8//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Institute of Mathematics and Informatics
X-ORIGINAL-URL:https://math.bas.bg
X-WR-CALDESC:Събития за Institute of Mathematics and Informatics
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Sofia
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20221030T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20231029T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20240911T140000
DTEND;TZID=Europe/Sofia:20240911T153000
DTSTAMP:20260405T143326
CREATED:20240829T154321Z
LAST-MODIFIED:20240829T154607Z
UID:16707-1726063200-1726068600@math.bas.bg
SUMMARY:Семинар по Приложна математика
DESCRIPTION:Subdiffusion-reaction systems: from microscopic random walk to the mesoscopic fractional PDE’s\nДокладчик: проф. Сергей Федотов\, ръководител на групата по приложна математика в университета на Манчестър\nДата: 11.09.2024 г.\nЧас: 14:00 ч.\nМясто: зала 403 \nРезюме: An interesting feature of subdiffusion-reaction systems is the lack of a universal model for reactions in subdiffusive media. Consequently\, the coarse-grained fractional subdiffusion-reaction equations depend on the specific details of the underlying microscopic random walk models. This complexity arises from the memory effects inherent in subdiffusive transport systems. Simply adding a reaction term to the transport equation can be physically inconsistent. Due to the memory effect\, the subdiffusion process depends on the entire history of the system’s evolution making the diffusion and reaction processes inseparable. \n 
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%bf%d0%be-%d0%bf%d1%80%d0%b8%d0%bb%d0%be%d0%b6%d0%bd%d0%b0-%d0%bc%d0%b0%d1%82%d0%b5%d0%bc%d0%b0%d1%82%d0%b8%d0%ba%d0%b0-11/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
CATEGORIES:Редовен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20240903T140000
DTEND;TZID=Europe/Sofia:20240903T153000
DTSTAMP:20260405T143326
CREATED:20240829T155653Z
LAST-MODIFIED:20240829T155653Z
UID:16712-1725372000-1725377400@math.bas.bg
SUMMARY:Семинар по Приложна математика
DESCRIPTION:About maximal distance minimizers. What is it and why they are so good?\nДокладчик: Яна Теплицкая\nДата: 03.09.2024 г.\nЧас: 14:00 ч.\nМясто: зала 256 \nРезюме \n 
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%bf%d0%be-%d0%bf%d1%80%d0%b8%d0%bb%d0%be%d0%b6%d0%bd%d0%b0-%d0%bc%d0%b0%d1%82%d0%b5%d0%bc%d0%b0%d1%82%d0%b8%d0%ba%d0%b0-12/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
CATEGORIES:Редовен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20240528T150000
DTEND;TZID=Europe/Sofia:20240528T163000
DTSTAMP:20260405T143326
CREATED:20240523T174358Z
LAST-MODIFIED:20240523T174358Z
UID:16356-1716908400-1716913800@math.bas.bg
SUMMARY:Семинар по Приложна математика
DESCRIPTION:An efficient approach for searching three-body periodic orbits passing through Euler configuration\nДокладчик: Иван Христов (ФМИ-СУ)\nДата: 28.05.2024 г.\nЧас: 15:00 ч.\nМясто: зала 503 \nРезюме: The classic gravitational three-body problem is considered. The motion of the bodies is determined by Newton’s second law and Newton’s law of universal gravitation. We are interested in a special case of planar periodic orbits – those that pass through Euler configuration. \nIn this talk a new efficient approach for searching three-body periodic equal-mass collisionless orbits passing through Euler configuration is presented [1]. The approach is based on a symmetry property of the solutions at the half period. Depending on two previously established symmetry types on the shape sphere\, each solution is presented by one or two distinct initial conditions (one or two points in the search domain). A high precision numerical search based on Newton-Raphson method on a relatively coarse search grid for solutions with relatively short scale-invariant periods is conducted. The results of the search clearly demonstrate the efficiency of the approach. More than 12\,000 initial conditions for periodic collisionless orbits (most of which new ones) are found. The extensive high precision computations are performed in Nestum cluster\, Sofia Tech Park. \n[1] Ivan Hristov\, Radoslava Hristova. “An efficient approach for searching three-body periodic orbits passing through Eulerian configuration.” arXiv preprint arXiv:2404.16526 (2024). \n 
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%bf%d0%be-%d0%bf%d1%80%d0%b8%d0%bb%d0%be%d0%b6%d0%bd%d0%b0-%d0%bc%d0%b0%d1%82%d0%b5%d0%bc%d0%b0%d1%82%d0%b8%d0%ba%d0%b0-10/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
CATEGORIES:Редовен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20240327T160000
DTEND;TZID=Europe/Sofia:20240327T173000
DTSTAMP:20260405T143326
CREATED:20240325T222412Z
LAST-MODIFIED:20240325T222412Z
UID:16094-1711555200-1711560600@math.bas.bg
SUMMARY:Семинар по Приложна математика
DESCRIPTION:On constructions of spherical codes\nДокладчик: д-р Константин Воробьов\, ИМИ – БАН\nДата: 27.03.2024 г.\nЧас: 16:00 ч.\nМясто: зала 503 \nРезюме: In this talk\, we review various approaches to construct spherical codes with a given coding distance. We also propose a new approach that allows us to find new codes on spheres in small dimensions. In particular\, we find a previously unknown kissing arrangement of 40 spheres in R^5. \n 
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%bf%d0%be-%d0%bf%d1%80%d0%b8%d0%bb%d0%be%d0%b6%d0%bd%d0%b0-%d0%bc%d0%b0%d1%82%d0%b5%d0%bc%d0%b0%d1%82%d0%b8%d0%ba%d0%b0-9/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
CATEGORIES:Редовен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20240131T150000
DTEND;TZID=Europe/Sofia:20240131T163000
DTSTAMP:20260405T143326
CREATED:20240131T143833Z
LAST-MODIFIED:20240131T143833Z
UID:15897-1706713200-1706718600@math.bas.bg
SUMMARY:Семинар по Приложна математика
DESCRIPTION:Temporal networks\, Tensors\, and applications to ML\nДокладчик: проф. Огнян Кунчев\, ИМИ – БАН\nДата: 31.01.2024 г.\nЧас: 15:00 ч.\nМясто: … \nРезюме: Recently\, temporal networks got an increasing interest\, related to their numerous applications in real-life data analysis. The temporal networks (more mathematically\, “graphs depending on time”) are a typical example of a Tensor – the adjacency matrix depends on several parameters and is a tensor (in the mathematical sense of the word). We present some recent results about the structure of the spectrum of the normalized Laplacian in the case of “slowly varying temporal networks”. The detailed structure of the spectrum gives rise of the notion of “constant block Jacobi model”\, which has closed-form solution for the spectrum and the eigenfunctions. This brings a reconsideration of the notion of Fiedler vector for temporal networks. Depending on the time\, some discussion about the recent history of Tensors (mathematical sense) and their application in ML may be presented. \nФейсбук страница на семинара: Семинар по Приложна математика \nСеминарът ще бъде излъчен и по Zoom:\nhttps://us02web.zoom.us/j/85916659659?pwd=dFQxaDdPaWVLbVNhcFcwdUxTZWhoQT09
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%bf%d0%be-%d0%bf%d1%80%d0%b8%d0%bb%d0%be%d0%b6%d0%bd%d0%b0-%d0%bc%d0%b0%d1%82%d0%b5%d0%bc%d0%b0%d1%82%d0%b8%d0%ba%d0%b0-8/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
CATEGORIES:Редовен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20231114T140000
DTEND;TZID=Europe/Sofia:20231114T153000
DTSTAMP:20260405T143326
CREATED:20231110T170235Z
LAST-MODIFIED:20231110T170235Z
UID:15406-1699970400-1699975800@math.bas.bg
SUMMARY:Семинар по Приложна математика
DESCRIPTION:How log-concavity fought lottery frauds in Florida and what it did after winning\nДокладчик: Дмитри Карп\nДата: 14.11.2023 г.\nЧас: 14:00 ч.\nМясто: Зала 503 на ИМИ-БАН \nРезюме: In the talk I will first discuss the log-concavity in parameters of the normalized beta function (which represents the cumulative distribution function of beta distributed random variable) that has been used recently in an investigation of lottery frauds in Florida.  I will then present some related  properties of incomplete beta function and proceed to general log-concavity problems and their particular cases motivated by various problems in statistics\, probability and analysis. \nФейсбук страница на семинара: Семинар по Приложна математика
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%bf%d0%be-%d0%bf%d1%80%d0%b8%d0%bb%d0%be%d0%b6%d0%bd%d0%b0-%d0%bc%d0%b0%d1%82%d0%b5%d0%bc%d0%b0%d1%82%d0%b8%d0%ba%d0%b0-7/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
CATEGORIES:Редовен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20231025T150000
DTEND;TZID=Europe/Sofia:20231025T163000
DTSTAMP:20260405T143326
CREATED:20231010T182251Z
LAST-MODIFIED:20231010T182251Z
UID:15162-1698246000-1698251400@math.bas.bg
SUMMARY:Семинар по Приложна математика
DESCRIPTION:Крайни автомати и невронни мрежи за езиково моделиране\nДокладчик: проф. Стоян Михов\nДата: 25.10.2023 г.\nЧас: 15:00 ч.\nМясто: Зала 503 на ИМИ-БАН \nРезюме: Езиковите модели са основен инструмент за решаването на редица сложни задачи като извличане на информация\, генерация на естествен език\, машинен превод\, речева комуникация и много други. Традиционно езиковите модели се представят с крайни преобразуватели. През последните години обаче езиковите модели\, базирани на невронни мрежи\, извършиха значителен скок в качеството на езиковото моделиране\, с което се постигнаха близки до човешки способности в много задачи за разбиране на естествен език. \nВ предстоящата лекция ще направим първо кратък преглед на традиционните представяния на езикови модели\, базирани на крайни преобразуватели. След това ще покажем често използвани архитектури на невронни мрежи за езиково моделиране и ще обсъдим техните предимства спрямо моделите\, базирани на крайни преобразуватели.\nВ третата част на лекцията ще представим нашия подход за конструиране на ансамбли от крайни автомати\, използвайки методите на дълбокото машинно обучение. По този начин ще комбинираме високото качество на невронните езикови модели с изчислителната ефективност на крайните автомати. Ще покажем\, че клас от архитектури на невронни мрежи е изчислително изоморфен на клас от ансамбли от крайни автомати.\nВ заключение\, ще представим емпирични резултати\, показващи\, че с помощта на нашия подход достигаме до перплексия (качество) на езиковите модели\, реализирани с ансамбли от крайни автомати\, конкурентна с перплексията на невронните езикови модели. \nФейсбук страница на семинара: Семинар по Приложна математика
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%bf%d0%be-%d0%bf%d1%80%d0%b8%d0%bb%d0%be%d0%b6%d0%bd%d0%b0-%d0%bc%d0%b0%d1%82%d0%b5%d0%bc%d0%b0%d1%82%d0%b8%d0%ba%d0%b0-6/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
CATEGORIES:Редовен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20230606T173000
DTEND;TZID=Europe/Sofia:20230606T190000
DTSTAMP:20260405T143326
CREATED:20230601T073209Z
LAST-MODIFIED:20230601T073537Z
UID:14459-1686072600-1686078000@math.bas.bg
SUMMARY:Семинар по Приложна математика
DESCRIPTION:Minimax problems and results for sum of translates functions\nАвтори: Bálint Farkas\, Béla Nagy and Szilárd Révész\, Alfréd Rényi Institute of Mathematics\nДата: 06.06.2023 г.\nЧас: 17:30 ч.\nМясто: Зала 503 на ИМИ-БАН \nРезюме: We introduce a general framework to investigate minimax problems for sum of translates functions \nF(x\,t)=\sum_k K(t-x_j) or F(x\,t)=J(t)+\sum_k K(t-x_j)\, \nwhere K is a general concave “kernel function” and J is an “outer field” function\, t runs [0\,1]\, and x=(x_1\,…\,x_n) is a set of nodes which are used to translate the kernel. \nOur setup is very close to logarithmic potential theory\, but fixing n and focusing on a more detailed analysis\, we obtain new results even for very classical problems. Extending a method of P. Fenton\, we reach considerable generality while proving precise results for minimax\, maximin and equioscillating node systems\, and the behavior of the local (interval) maxima. One of our main motivations is to generalize Bojanov’s theorem about the variant of the Chebyshev problem with prescribed zero multiplicities. In particular\, we derive a weighted generalization with surprisingly general weights. \nФейсбук страница на семинара: Семинар по Приложна математика
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%bf%d0%be-%d0%bf%d1%80%d0%b8%d0%bb%d0%be%d0%b6%d0%bd%d0%b0-%d0%bc%d0%b0%d1%82%d0%b5%d0%bc%d0%b0%d1%82%d0%b8%d0%ba%d0%b0-5/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
CATEGORIES:Редовен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20230523T160000
DTEND;TZID=Europe/Sofia:20230523T173000
DTSTAMP:20260405T143326
CREATED:20230515T125006Z
LAST-MODIFIED:20230515T125139Z
UID:14317-1684857600-1684863000@math.bas.bg
SUMMARY:Семинар по Приложна математика
DESCRIPTION:NUMERICAL SOLUTION OF MULTIDIMENSIONAL SPECTRAL FRACTIONAL DIFFUSION PROBLEMS: FROM CAFFARELLI TO BURA\nЛектор: чл.-кор. Св. Маргенов (ИИКТ-БАН)\nЧас: 15:00\nДата: 23.05.2023 г.\nМясто: Зала 503 на ИМИ-БАН \nРезюме: Fractional diffusion operators appear naturally in many areas in mathematics\, physics\, ect. The most important property of the related b.v. problems is that they are nonlocal. \nLet us consider the fractional power of a self-adjoint elliptic operator introduced through its spectral decomposition. It is also self-adjoint but nonlocal. Advanced numerical methods in this area have been heavily influenced by the pioneering work in differential operator theory by Caffarelli and Silvestre\, “An Extension Problem Associated with the Fractional Laplacian”\, 2007. \nAfter discretization\, nonlocal problems lead to linear systems with dense matrices. In the multidimensional case and domains with general geometry\, the considered problems are extremely expensive from a computational point of view. Over the past decade\, several different techniques have been proposed to localize the nonlocal operator\, thereby increasing the spatial dimension of the computational domain. \nWe have developed an alternative approach. Let A be a SPD sparse matrix arising from finite element method (FEM) or finite difference method (FDM) discretization of the initial (local) problem. \nBased on the best uniform rational approximations (BURA) of degree k of zα\, 0 ≤ z ≤ 1\, a class of efficient solution methods for algebraic systems involving Aα\, 0 < α < 1\, is proposed and analysed. Robust error estimates with respect to the condition number κ(A) are derived\, showing the exponential convergence of the BURA methods with respect to the degree of rational approximation. \nAlthough the fractional power of A is a dense matrix\, the algorithm has complexity of order O(N log2N)\, where N is the number of unknowns. At this point\, we assume that some solver of optimal complexity (say multigrid or multilevel) is used for the auxiliary systems with matrices A + djI\, dj ≥ 0\, j = 1\, . . . \, k. \nThe presented (up to 3D) numerical tests are focussed on problems with low regularity of the solutions\, including cases of adaptive mesh refinement. The comparative analysis demonstrates the superiority of the BURA methods provided with rigorous theoretical results. Some recent works about BURA based preconditioning of coupled problems and non-overlapping domain decomposition methods are discussed at the end. \nФейсбук страница на семинара: Семинар по Приложна математика
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%bf%d0%be-%d0%bf%d1%80%d0%b8%d0%bb%d0%be%d0%b6%d0%bd%d0%b0-%d0%bc%d0%b0%d1%82%d0%b5%d0%bc%d0%b0%d1%82%d0%b8%d0%ba%d0%b0-4/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
CATEGORIES:Редовен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20230214T160000
DTEND;TZID=Europe/Sofia:20230214T173000
DTSTAMP:20260405T143326
CREATED:20230203T093533Z
LAST-MODIFIED:20230203T094105Z
UID:13751-1676390400-1676395800@math.bas.bg
SUMMARY:Семинар по Приложна математика
DESCRIPTION:A New Walk on Equations Monte Carlo Method for Linear Algebraic Problems\nЛектор: проф. Иван Димов\nЧас: 16:00\nДата: 14.02.2023\nМясто: Зала 503 на ИМИ-БАН \nРезюме: A new Walk on Equations (WE) Monte Carlo algorithm for Linear Algebra (LA) problem\, namely\, functionals of the solution\, eigenvalue problems\, etc.\, is proposed and studied. This algorithm relies on a non-discounted sum of an absorbed random walk. It can be applied for either real or complex matrices. Several techniques like simultaneous scoring or the sequential Monte Carlo method are applied to improve the basic algorithm. Numerical tests are performed on examples with matrices of different size and on systems coming from various important applications. Comparisons with standard deterministic\, including unimprovable Conjugate Gradient Method (CGM) or Monte Carlo algorithms will be also presented. \nФейсбук страница на семинара: Семинар по Приложна математика
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%bf%d0%be-%d0%bf%d1%80%d0%b8%d0%bb%d0%be%d0%b6%d0%bd%d0%b0-%d0%bc%d0%b0%d1%82%d0%b5%d0%bc%d0%b0%d1%82%d0%b8%d0%ba%d0%b0-3/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
CATEGORIES:Редовен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20221207T150000
DTEND;TZID=Europe/Sofia:20221207T163000
DTSTAMP:20260405T143326
CREATED:20221201T173606Z
LAST-MODIFIED:20221201T173606Z
UID:13362-1670425200-1670430600@math.bas.bg
SUMMARY:Семинар по Приложна математика
DESCRIPTION:Втората сбирка на новоучредения \nСеминар по приложна математика\,\nкойто е част от дейностите на програма ПИКОМ\, \nще се състои на 07.12.2022 от 15:00 в Заседателната зала на ИМИ. \nДоклад на тема: \nIntroduction to Steiner Trees\nще изнесе д-р Данила Черкашин\, пост-докторант в ИМИ – БАН.  \nФейсбук страница на семинара: Семинар по Приложна математика
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%bf%d0%be-%d0%bf%d1%80%d0%b8%d0%bb%d0%be%d0%b6%d0%bd%d0%b0-%d0%bc%d0%b0%d1%82%d0%b5%d0%bc%d0%b0%d1%82%d0%b8%d0%ba%d0%b0-2/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
CATEGORIES:Редовен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20221108T150000
DTEND;TZID=Europe/Sofia:20221108T163000
DTSTAMP:20260405T143326
CREATED:20221103T110057Z
LAST-MODIFIED:20221103T174417Z
UID:13157-1667919600-1667925000@math.bas.bg
SUMMARY:Семинар по Приложна математика
DESCRIPTION:Първата сбирка на новоучредения \nСеминар по приложна математика\,\nкойто е част от дейностите на програма ПИКОМ\, ще се състои на 08.11.2022 от 15:00 в зала 503 на ИМИ. \nДоклад на тема: \nРешаване на оптимизационни задачи с квантови отгряващи компютри\nще изнесе проф. Христо Джиджев (ИИКТ-БАН).  \nРезюме: Квантовите отгряващи (quantum annealing) компютри (КОК)\, като тези на канадската компания D-Wave Systems Inc.\, използват квантови ефекти за търсене решения на задачи\, които са трудни за решаване на класическите компютри. За разлика от по-известните универсални квантови компютри\, КОК са специализирани да решават клас задачи от квадратична оптимизация\, които включват всички NP-трудни задачи\, като например задачата за максималната клика\, оцветяването на графи\, и задачата за търговски пътник. Благодарение на тази специализация\, тези компютри разполагат с много по-голям брой кубити в сравнение със съществуващите универсални компютри и са по-лесни за програмиране и използване. \nB този доклад ще направя кратък преглед на областта на квантовите изчисления\, след което ще разгледам по-подробно устройството и начина на действие на КОК и как те могат да се използват за решаване на оптимизационни задачи. Ще използвам някои прости примери за илюстрация на методите и ще обсъдя някои трудности и предизвикателства при използването на КОК\, както и методи за преодоляването им. Ще се опитам да представя материала по начин достъпен за хора без предварителна подготовка по квантова информация и квантови изчисления. \nФейсбук страница на семинара: Семинар по Приложна математика
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%bf%d0%be-%d0%bf%d1%80%d0%b8%d0%bb%d0%be%d0%b6%d0%bd%d0%b0-%d0%bc%d0%b0%d1%82%d0%b5%d0%bc%d0%b0%d1%82%d0%b8%d0%ba%d0%b0/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
END:VCALENDAR