On generating Sobolev orthogonal polynomials

DOI10.1007/s00211-023-01379-3arXiv2302.10691OpenAlexW4388084951MaRDI QIDQ6193844

Niel Van Buggenhout

Publication date: 19 March 2024

Published in: Numerische Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

quadrature ruleHessenberg inverse eigenvalue problem

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Sobolev orthogonal polynomials
• The numerically stable reconstruction of Jacobi matrices from spectral data
• Sensitivity of the Lanczos recurrence to Gaussian quadrature data: how malignant can small weights be?
• Polynomial interpolation results in Sobolev spaces
• The numerically stable reconstruction of a Jacobi matrix from spectral data
• Zero location and \(n\)th root asymptotics of Sobolev orthogonal polynomials
• Pseudozeros of polynomials and pseudospectra of companion matrices
• Zeros of Sobolev orthogonal polynomials following from coherent pairs
• The characterization of the quasi-typical extension of an inner product
• On Fourier series of a discrete Jacobi--Sobolev inner product
• Orthogonal matrix polynomials and higher-order recurrence relations
• Computing orthogonal polynomials in Sobolev spaces
• Laguerre-Sobolev orthogonal polynomials
• Accurate recovery of recursion coefficients from Gaussian quadrature formulas
• The Lanczos algorithm and complex Gauss quadrature
• Generation of orthogonal rational functions by procedures for structured matrices
• Confluent Vandermonde with Arnoldi
• Jacobi-Sobolev orthogonal polynomials and spectral methods for elliptic boundary value problems
• Numerical methods for general and structured eigenvalue problems.
• Balancing a matrix for calculation of eigenvalues and eigenvectors
• Higher-order recurrence relations, Sobolev-type inner products and matrix factorizations
• On the stability of computing polynomial roots via confederate linearizations
• Generation and Use of Orthogonal Polynomials for Data-Fitting with a Digital Computer
• Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method
• Discrete Least Squares Approximation by Trigonometric Polynomials
• Structured inverse eigenvalue problems
• Computing the Roots of Complex Orthogonal and Kernel Polynomials
• Eine Erweiterung des Orthogonalitätsbegriffes bei Polynomen und deren Anwendung auf die beste Approximation.
• Fast QR Decomposition of Vandermonde-Like Mmatrices and Polynomial Least Squares Approximation
• On Recurrence Relations for Sobolev Orthogonal Polynomials
• Multiple Recursion Conjugate Gradient Algorithms Part I: Sufficient Conditions
• Vandermonde with Arnoldi
• Functions of Matrices
• Convergence Analysis of Krylov Subspace Iterations with Methods from Potential Theory
• Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
• The Lanczos and Conjugate Gradient Algorithms
• Calculation of Gauss Quadrature Rules
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• Fast algorithms using orthogonal polynomials
• Sobolev orthogonal polynomials in the complex plane
• Analytic aspects of Sobolev orthogonal polynomials revisited
• On computing modified moments for half-range Hermite weights