A new parallel version of a dichotomy based algorithm for indexing powder diffraction data
URI (для ссылок/цитирований):
https://www.degruyter.com/view/journals/zkri/235/6-7/article-p203.xmlhttps://elib.sfu-kras.ru/handle/2311/142963
Автор:
Ivan, Šimeček
Aleksandr, Zaloga
Jan, Trdlička
Коллективный автор:
Институт цветных металлов и материаловедения
Кафедра композиционных материалов и физико-химии металлургических процессов
Дата:
2020-06Журнал:
Zeitschrift für Kristallographie - Crystalline MaterialsКвартиль журнала в Scopus:
Q2Квартиль журнала в Web of Science:
Q3Библиографическое описание:
Ivan, Šimeček. A new parallel version of a dichotomy based algorithm for indexing powder diffraction data [Текст] / Šimeček Ivan, Zaloga Aleksandr, Trdlička Jan // Zeitschrift für Kristallographie - Crystalline Materials. — 2020. — Т. 235 (6-7). — С. 203-212Аннотация:
One of the key parts of the crystal structure solution process from powder diffraction data is the determination of the lattice parameters from experimental data shortly called indexing. The successive dichotomy method is one of the most common ones for this process because it allows an exhaustive search. In this paper, we discuss several improvements for this indexing method that significantly reduces the search space and decrease the solution time. We also propose a combination of this method with other indexing methods: grid search and TREOR. The effectiveness and time-consumption of such algorithm were tested on several datasets, including orthorhombic, monoclinic, and triclinic examples. Finally, we discuss the impacts of the proposed improvements.
Коллекции:
Метаданные:
Показать полную информациюСвязанные материалы
Показаны похожие ресурсы по названию, автору или тематике.
-
Анализ параметризированных алгоритмов на основе эластичности функций сложности
Bykova, Valentina V.; Быкова, Валентина В. (Сибирский федеральный университет. Siberian Federal University., 2011-04)We give a brief overview of results and problems of parameterized algorithmics as the new direction of computational complexity theory. We offer a new indicator of computational complexity for parameterized algorithm ... -
Algorithms for adaptive processing of signals in a flat phased antenna array
Тяпкин, Валерий Николаевич; Дмитриев, Дмитрий Дмитриевич; Карцан, Игорь Николаевич; Ефремова, Светлана Владимировна (2017-07)The following paper discusses a conducted synthesis and assessment of the effectiveness of control algorithms for null formation in the radiation pattern of a flat phased antenna array according to two coordinates; the ... -
Algorithms for adaptive processing of signals in a flat phased antenna array
Тяпкин, Валерий Николаевич; Карцан, Игорь Николаевич; Дмитриев, Дмитрий Дмитриевич; Ефремова, Светлана Владимировна (2017-10)The following paper discusses a conducted synthesis and assessment of the effectiveness of control algorithms for null formation in the radiation pattern of a flat phased antenna array according to two coordinates; the ... -
A Recursive Algorithm for Estimating the Correlation Matrix of the Interference Based on the QR Decomposition (RETRACTED)
Tyapkin, Valery N.; Dmitriev, Dmitry D.; Gladyshev, Andrey B.; Zverev, Peter Yu.; Тяпкин, Валерий Н.; Дмитриев, Дмитрий Д.; Гладышев, Андрей Б.; Зверев, Пётр Ю. (Сибирский федеральный университет. Siberian Federal University, 2020-03)Many tasks of digital signal processing require the implementation of matrix operations in real time. These are operations of matrix inversion or solving systems of linear algebraic or dif- ferential equations (Kalman ... -
A Recursive Algorithm for Estimating the Correlation Matrix of the Interference Based on the QR Decomposition
Тяпкин, Валерий Николаевич; Дмитрий, Дмитриевич Дмитриев; Гладышев, Андрей Борисович; Зверев, Петр Юрьевич (2020-03)Many tasks of digital signal processing require the implementation of matrix operations in real time. These are operations of matrix inversion or solving systems of linear algebraic or dif- ferential equations (Kalman ...