?
A Fast Direct Algorithm for Implementing a High-Order Finite Element Method on Rectangles as Applied to Boundary Value Problems for the Poisson Equation
Doklady Mathematics. 2017. Vol. 95. No. 2. P. 129–135.
Zlotnik A.A., Zlotnik I.A.
A new fast direct algorithm for implementing a finite element method (FEM) of order on rectangles as applied to boundary value problems for Poisson-type equations is described that extends a well-known algorithm for the case of difference schemes or bilinear finite elements (n = 1). Its core consists of fast direct and inverse algorithms for expansion in terms of eigenvectors of one-dimensional eigenvalue problems for an nth-order FEM based on the fast discrete Fourier transform. The amount of arithmetic operations is logarithmically optimal in the theory and is rather attractive in practice. The algorithm admits numerous further applications (including the multidimensional case).
Keywords: boundary value problemsFFTFast direct algorithmhigh order finite element methodPoisson equation
Publication based on the results of:
Shabanov N., Kuricheva O., Kurbatova J. et al., / Series Working Papers SSRN "Department of Economics Ca’ Foscari University of Venice". 2026.
The carbon balance of an ecosystem is the difference between Gross Primary Productivity (GPP) and Ecosystem Respiration (Reco) as expressed by Net Ecosystem Exchange (NEE). While remote sensing retrievals of GPP have reached maturity, Reco estimation remains underexplored and ultimately cast bias on NEE. Here we present an end-to-end multi-scale analysis of the mechanism of ...
Added: August 21, 2026
Ponomarenko A., / Series Computer Science "arxiv.org". 2025.
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...
Added: July 30, 2026
Loubenets E. R., / Series arxiv.org "quant-ph". 2026. No. 2607.18050.
In many quantum applications it is important to know whether or not a Bell nonlocal two-qudit state exhibits its nonlocality under correlation scenarios with some given numbers S1,S2≥1 of generalized quantum measurements at two sites. In the present article, we find analytically a new general locality condition sufficient for a nonseparable Werner state with a ...
Added: July 21, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Chow polylogarithms are some special functions arising in explicit description of the Beilinson regulator map. The most interesting functional equation for this function reflects its vanishing on the boundary in the Bloch's cycle complex. We show that this functional equation formally follows from more simple ones, namely skew-symmetry, functoriality and multiplicativity.
To prove this, we study ...
Added: July 16, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Let K be a field of characteristic zero. We prove that its motivic cohomology in degree m−1 and weight m is rationally isomorphic to the cohomology of the polylogarithmic complex. This gives a partial extension of A. Suslin theorem describing the indecomposable K3 of a field. ...
Added: July 16, 2026
Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.
This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...
Added: July 9, 2026
Piontkovski D., / Series arXiv "math". 2026.
A noncommutative projective variety is defined, following Artin and Zhang, by a graded coherent algebra 𝐴. The category of coherent sheaves is then the quotient qgr(𝐴) of the category of finitely presented graded modules by the subcategory of torsion modules. We consider the categorical and polynomial entropies of the Serre twist, that is, of the ...
Added: June 23, 2026
Piontkovski D., / Series arXiv "math". 2025.
If a symmetric multilinear algebra is weakly nil, then it is Engel. This result may be regarded as an infinite-dimensional analogue of the well-known Jacobian theorem, which states that if a polynomial mapping has a polynomial inverse, then its Jacobian matrix is invertible. This refines a theorem of Gerstenhaber and partially answers a question posed ...
Added: June 23, 2026
Konakov V., Kucher D., Mammen E., / Series arXiv "math". 2026. No. 2606.11142v1.
In this paper, we construct strong approximations for discrete-time Markov chains weakly converging to continuous diffusion processes, as well as for their perturbed counterparts. Under the assumption of bounded coefficients, we construct closely coupled versions of these processes on a shared probability space. In particular, for both non-degenerate and degenerate cases, we maximize the probability ...
Added: June 11, 2026
Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.
A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...
Added: May 19, 2026
Dorovskiy A., / Series arXiv "math". 2026.
In this paper the structural stability of generic families of vector fields of the PC-HC class on the two-dimensional sphere is proved. A classification of these families up to moderate equivalence in neighborhoods of their large bifurcation supports is presented, based on such invariants as the configuration and the characteristic set. The realization lemma is proved. ...
Added: May 14, 2026
Taletskii D., / Series arXiv "math". 2026.
A vertex subset of a graph is called a \textit{distance-$k$ independent set} if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal distance-$k$ independent sets among all $n$-vertex trees. It equals~$n$ if $n \leq k ...
Added: May 1, 2026
Ovcharenko M., / Series arXiv "math". 2026.
We introduce an explicit class of tempered Laurent polynomials in the sense of Villegas and Doran--Kerr in n⩽4 variables including all Landau--Ginzburg models for smooth Fano threefolds with very ample anticanonical class. We check that it contains Landau--Ginzburg models for various Fano fourfolds which are complete intersections in smooth toric varieties and Grassmannians of planes, ...
Added: April 30, 2026
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Gromov V., Tomashchuk K., Beschastnov Y. et al., Известия высших учебных заведений. Прикладная нелинейная динамика 2025 Т. 33 № 4 С. 435–465
The purpose of this study is to develop a numerical method for bifurcation analysis of nonlinear partial differential equations, based on the reduction of partial differential equations to ordinary ones, using the Kolmogorov-Arnold theorem.
Methods. This paper describes a method for reducing partial differential equations to ordinary ones using the Kolmogorov-Arnold theorem, as well as methods for the ...
Added: February 6, 2025
Sergei Valentinovich Fedorenko, IEEE Access 2021 Vol. 9 P. 38673–38686
A novel method for finding roots of polynomials over finite fields has been proposed.
This method is based on the cyclotomic discrete Fourier transform algorithm.
The improvement is achieved by using the normalized cyclic convolutions,
which have a small complexity and allow matrix decomposition,
as well as methods of adapting the truncated normalized cyclic convolutions calculation.
For small values of ...
Added: April 15, 2021
Zlotnik A.A., Zlotnik I.A., Computational Mathematics and Mathematical Physics 2020 Vol. 60 No. 2 P. 240–257
We present direct logarithmically optimal in theory and fast in practice algorithms to implement the tensor products finite element method (FEM) based on the tensor products of the 1D high-order FEM spaces on multi-dimensional rectangular parallelepipeds for solving the $N$-dimensional Poisson type equation $-\Delta u+\alpha u=f$ ($N\geq 2$) with the Dirichlet boundary conditions. They are based ...
Added: May 19, 2020
Gordin V. A., В кн.: Современные проблемы математического моделирования: сборник трудов XVIII Всероссийской конференции-школы молодых исследователей (пос. Абрау-Дюрсо, 16–20 сентября 2019 г.).: Ростов н/Д: Издательство ЮФУ, 2019. Гл. 9 С. 40–52.
When solving boundary value problems of mathematical physics, compact schemes allow increasing (in comparison with classical ones) the solution accuracy order with a slight increase in the number of arithmetic operations. An indispensable condition of the algorithm is the use of the double-sweep approach. A method for calculating the coefficients of schemes is shown both ...
Added: December 30, 2019
Гордин В.А., Шадрин Д. А., В кн.: Современные проблемы математического моделирования: сборник трудов XVIII Всероссийской конференции-школы молодых исследователей (пос. Абрау-Дюрсо, 16–20 сентября 2019 г.).: Ростов н/Д: Издательство ЮФУ, 2019. Гл. 10 С. 53–57.
The boundary value problem for the Poisson and Helmholtz equations with a piecewise constant coefficient with a jump on a triangle is studied numerically. At the jump of the coefficient (at the boundary of the media), the docking conditions are set. A compact difference scheme with high accuracy with a relatively small number of calculations ...
Added: December 30, 2019
Veretennikov A., Theory of Probability and Mathematical Statistics 2017 Vol. 95 P. 195–206
Poisson equation n the whole space is solved for a generator of a diffusion process with a potential which may change sign. ...
Added: December 6, 2019
Guschina O., Shevgunov T., Efimov E. et al., , in: Advances in Intelligent Systems and Computing* 2. Vol. 1047: Proceedings of 3rd Computational Methods in Systems and Software 2019.: Springer, 2019. P. 167–175.
This paper deals with the technique known as the periodic synchronous averaging. The exact analytical expression for the fast Fourier transform (FFT) representing the digital spectrum of the signal undergoing periodic synchronous averaging is derived using the general signal and spectral framework. This formula connects the coefficient of Fourier series of the original continuous-time signal ...
Added: December 1, 2019
Krichever I., Грушевский С., Нортон Х., Успехи математических наук 2019 Т. 74 № 2(446) С. 81–148
We study the behaviour of real-normalized (RN) meromorphic differentials on Riemann surfaces under degeneration. We describe all possible limits of RN differentials on any stable curve. In particular we prove that the residues at the nodes are solutions of a suitable Kirchhoff problem on the dual graph of the curve. We further show that the ...
Added: October 31, 2019
Злотник А.А., Злотник И.А., Журнал вычислительной математики и математической физики 2020 Т. 60 № 2 С. 234–252
Представлены прямые логарифмически оптимальные в теории и быстрые на практике алгоритмы реализации
метода конечных элементов (МКЭ) на основе тензорных произведений 1D пространств МКЭ высокого порядка
на многомерных прямоугольных параллелепипедах для решения уравнения типа Пуассона. Они основаны на хорошо известных Фурье-подходах. Ключевыми новыми элементами являются детальное описание собственных пар 1D задач на собственные значения для МКЭ высокого порядка и быстрые ...
Added: September 4, 2019
Stegailov V., Timofeev A., , in: Суперкомпьютерные дни в России: Труды международной конференции (24-25 сентября 2018 г., г. Москва).: М.: МГУ, 2018. P. 149–159.
Modern Elbrus-4S and Elbrus-8S processors show floating point performance comparable to the popular Intel processors in the field of high-performance computing. Tasks oriented to take advantage of the VLIW architecture show even greater efficiency on Elbrus processors. In this paper the efficiency of the most popular materials science codes in the field of classical molecular ...
Added: October 31, 2018