Fast and Accurate Con-Eigenvalue Algorithm for Optimal Rational Approximations

DOI10.1137/110821901zbMath1263.65040arXiv1012.3196OpenAlexW2964068193MaRDI QIDQ4918156

Gregory Beylkin, Terry S. Haut

Publication date: 23 April 2013

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.3196

zbMATH Keywords

high relative accuracycon-eigenvalue problemoptimal rational approximations

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) (H^infty)-control (93B36) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items (11)

Evaluation of small elements of the eigenvectors of certain symmetric tridiagonal matrices with high relative accuracy ⋮ Spherical Bessel transform via exponential sum approximation of spherical Bessel function ⋮ On computing distributions of products of non-negative independent random variables ⋮ Consimilarity of quaternions and coneigenvalues of quaternion matrices ⋮ Near optimal rational approximations of large data sets ⋮ Computation of adaptive Fourier series by sparse approximation of exponential sums ⋮ Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices ⋮ On computing distributions of products of random variables via Gaussian multiresolution analysis ⋮ \textsc{mxpfit}: a library for finding optimal multi-exponential approximations ⋮ Data-Driven Algorithms for Signal Processing with Trigonometric Rational Functions ⋮ Efficient representation and accurate evaluation of oscillatory integrals and functions

This page was built for publication: Fast and Accurate Con-Eigenvalue Algorithm for Optimal Rational Approximations