Results 91 to 100 of about 183 (122)

Electronic Moment Tensor Potentials include both electronic and vibrational degrees of freedom

npj Computational Materials
We present the electronic moment tensor potentials (eMTPs), a class of machine-learning interatomic models and a generalization of the classical MTPs, reproducing both the electronic and vibrational degrees of freedom, up to the accuracy of ab initio ...
Prashanth Srinivasan, David Demuriya, Blazej Grabowski, Alexander Shapeev   +3 more
doaj   +1 more source

Stability Analysis of Grünwald Interpolation Operators on Chebyshev Nodes

In 1941, G. Grünwald proved the convergence of a sequence of operators constructed using classical Lagrange interpolation at Chebyshev nodes. In this work, we establish a perturbed version of Grünwald's result, thereby extending the class of admissible nodal points.
openaire   +2 more sources

A POLYNOMIAL INTERPOLATION PROCESS AT QUASI-CHEBYSHEV NODES WITH THE FFT

A POLYNOMIAL INTERPOLATION PROCESS AT QUASI-CHEBYSHEV NODES WITH THE FFT
Interpolation polynomial p n at the Chebyshev nodes cosπj/n (0 ≤ j ≤ n) for smooth functions is known to converge fast as n → ∞. The sequence {p n } is constructed recursively and efficiently in O(n log 2 n) flops for each p n by using the FFT, where n is increased geometrically, n = 2 i (i = 2, 3,...), until an estimated error is within a given ...
openaire  

On the condition number of the Vandermonde matrix with the mock-chebyshev nodes

, 2023
Şehitoğulları, Doğan, İbrahimoğlu, Bayram Ali   +1 more
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A fast algorithm for computing the mock-Chebyshev nodes

Journal of Computational and Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
B Ali Ibrahimoglu
exaly   +3 more sources

Fast factorization of rectangular Vandermonde matrices with Chebyshev nodes

Numerical Algorithms, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mykhailo Kuian, Sergij V Shiyanovskii, Lothar Reichel   +2 more
exaly   +2 more sources

Uniform weighted approximation on the square by polynomial interpolation at Chebyshev nodes

Applied Mathematics and Computation, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Donatella Occorsio, Woula Themistoclakis   +1 more
exaly   +5 more sources

On the asymptotic constant for the rate of Hermite–Fejér convergence on Chebyshev nodes

Acta Mathematica Hungarica, 2015
The Hermit-Fejér (HF) interpolation prescribes function values with the extra constraint that the derivative in the interpolation points is zero. Here the authors consider real polynomial HF-interpolating in the Chebyshev points of the interval \(I=[-1,1]\).
Elias Berriochoa, Alicia Cachafeiro
exaly   +3 more sources

A new fast algorithm for computing the mock-Chebyshev nodes

Applied Numerical Mathematics
Mock-Chebyshev points on an interval is a set of points asymptotically distributed like the Chebyshev weight of the first kind and therefore are better suited for polynomial interpolation since they result in a smaller Lebesgue constant. In a previous paper, [J. Comput. Appl. Math. 373, Article ID 112336, 9 p.
B Ali Ibrahimoglu
exaly   +3 more sources

Vandermonde systems on Gauss–Lobatto Chebyshev nodes

Applied Mathematics and Computation, 2005
Methods for factorization of the inverses of the Vandermonde matrices on Gauss-Lobatto Chebyshev nodes are presented and an algorithm for solving the primal and the dual system is given. Asymptotic estimates of the Frobenius norm of both the Vandermonde matrix and its inverse and an explicit formula for its determinant are derived. Results of numerical
Eisinberg A, FEDELE, Giuseppe
openaire   +2 more sources