Optimized point shifts and poles in the linear rational pseudospectral method for boundary value problems
DOI10.1016/j.jcp.2004.10.009zbMath1070.65062OpenAlexW2052826039MaRDI QIDQ1777061
Hans D. Mittelmann, Jean-Paul Berrut
Publication date: 12 May 2005
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/4151/files/1_berrut_ops.pdf
convergencenumerical resultsboundary layerspseudospectral methodsMesh generationTwo-point boundary value problemsLinear rational collocationPoint shift optimizationPole optimization
Stability and convergence of numerical methods for ordinary differential equations (65L20) Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations (65L60) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Linear boundary value problems for ordinary differential equations (34B05)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mappings and accuracy for Chebyshev pseudo-spectral approximations
- A modified Chebyshev pseudospectral method with an \(O(N^{-1})\) time step restriction
- The barycentric weights of rational interpolation with prescribed poles
- The linear rational pseudospectral method with preassigned poles
- Adaptive point shifts in rational approximation with optimized denominator.
- Rational interpolation through the optimal attachment of poles to the interpolating polynomial
- Preconditioned minimal residual methods for Chebyshev spectral calculations
- The errors in calculating the pseudospectral differentiation matrices for Čebyšev-Gauss-Lobatto points
- Improving the accuracy of the matrix differentiation method for arbitrary collocation points
- The Linear Rational Pseudospectral Method with Iteratively Optimized Poles for Two-Point Boundary Value Problems
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- A Fast Adaptive Numerical Method for Stiff Two-Point Boundary Value Problems
- Pseudospectral Solution of Near-Singular Problems using Numerical Coordinate Transformations Based on Adaptivity
- Spectral Methods in MATLAB
- Barycentric Lagrange Interpolation
- Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
This page was built for publication: Optimized point shifts and poles in the linear rational pseudospectral method for boundary value problems