Skip to main content

Numerical Algorithms

Ausgabe 1/2021

Inhalt (20 Artikel)

Original Paper

Backward error measures for roots of polynomials

Simon Telen, Sascha Timme, Marc Van Barel

Original Paper

Solving interval linear least squares problems by PPS-methods

Sergey P. Shary, Behnam Moradi

Open Access Original Paper

Alternatives to the EM algorithm for ML estimation of location, scatter matrix, and degree of freedom of the Student t distribution

Marzieh Hasannasab, Johannes Hertrich, Friederike Laus, Gabriele Steidl

Original Paper

Stability properties of disk polynomials

J. M. Carnicer, E. Mainar, J. M. Peña

Original Paper

High-dimensional sparse Fourier algorithms

Bosu Choi, Andrew Christlieb, Yang Wang

Original Paper

On the linear convergence of circumcentered isometry methods

Heinz H. Bauschke, Hui Ouyang, Xianfu Wang

Original Paper

Mean-square convergence of numerical methods for random ordinary differential equations

Peng Wang, Yanzhao Cao, Xiaoying Han, Peter Kloeden

Original Paper

Kernel-based interpolation at approximate Fekete points

Toni Karvonen, Simo Särkkä, Ken’ichiro Tanaka

Correction

Correction to: Kernel-based interpolation at approximate Fekete points

Toni Karvonen, Simo Särkkä, Ken’ichiro Tanaka

Open Access Original Paper

On the condition number of Vandermonde matrices with pairs of nearly-colliding nodes

Stefan Kunis, Dominik Nagel

Premium Partner