On symmetrizing the ultraspherical spectral method for self-adjoint problems
From MaRDI portal
Publication:777553
DOI10.1016/j.jcp.2020.109383zbMath1436.81040arXiv1903.08538OpenAlexW3009760708MaRDI QIDQ777553
Jared Lee Aurentz, Richard Mikael Slevinsky
Publication date: 7 July 2020
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.08538
spectral methodsinfinite-dimensional linear algebrasymmetric-definite and banded eigenvalue problems
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10)
Related Items
Fast algorithms using orthogonal polynomials, An efficient numerical technique for estimating eigenvalues of second-order non-self-adjoint Sturm-Liouville problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ten equivalent definitions of the fractional Laplace operator
- Computing energy eigenvalues of anharmonic oscillators using the double exponential sinc collocation method
- Some simple estimates for singular values of a matrix
- A fast and well-conditioned spectral method for singular integral equations
- An efficient direct solver for multidimensional elliptic Robin boundary value problems using a Legendre spectral-Galerkin method
- The automatic solution of partial differential equations using a global spectral method
- Automatic spectral collocation for integral, integro-differential, and integrally reformulated differential equations
- Efficient multi-dimensional solution of PDEs using Chebyshev spectral methods
- Perturbation bounds for the definite generalized eigenvalue problem
- Fractional quantum mechanics and Lévy path integrals
- Tensor calculus in polar coordinates using Jacobi polynomials
- Error estimates for Rayleigh-Ritz approximations of eigenvalues and eigenfunctions of the Mathieu and spheroidal wave equation
- Orthogonal systems with a skew-symmetric differentiation matrix
- Galerkin orthogonal polynomials
- On the infinite-dimensional QR algorithm
- Approximate solution of the Sturm-Liouville problems with Legendre-Galerkin-Chebyshev collocation method
- On the approximation of spectra of linear operators on Hilbert spaces
- Efficient spectral-Galerkin algorithms for direct solution for second-order differential equations using Jacobi polynomials
- New shape functions for triangular \(p\)-FEM using integrated Jacobi polynomials
- Diagonal similarity transformations which isolate Gerschgorin disks
- Tridiagonalization of a symmetric band matrix
- Rectangular spectral collocation
- A Fast and Well-Conditioned Spectral Method
- Fast transforms: Banded matrices with banded inverses
- Gerschgorin’s theorem for generalized eigenvalue problems in the Euclidean metric
- The Spectrum of the Chebyshev Collocation Operator for the Heat Equation
- A Fast Algorithm for the Evaluation of Legendre Expansions
- Computing with Expansions in Gegenbauer Polynomials
- Spectrum of the Jacobi Tau Approximation for the Second Derivative Operator
- The Eigenvalues of Second-Order Spectral Differentiation Matrices
- The Rayleigh Quotient Iteration and Some Generalizations for Nonnormal Matrices
- Efficient Spectral-Galerkin Method I. Direct Solvers of Second- and Fourth-Order Equations Using Legendre Polynomials
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- Efficient Spectral-Galerkin Method II. Direct Solvers of Second- and Fourth-Order Equations Using Chebyshev Polynomials
- Vibrations of non-uniform rings studied by means of the differential quadrature method
- Boundary Conditions in Chebyshev and Legendre Methods
- Efficient Spectral-Galerkin Algorithms for Direct Solution of Second-Order Equations Using Ultraspherical Polynomials
- A Sparse Spectral Method on Triangles
- An Algorithm for the Banded Symmetric Generalized Matrix
- Reduction of a band-symmetric generalized eigenvalue problem
- Bounds for Eigenvalues of Certain Tridiagonal Matrices
- A fast algorithm for particle simulations
