Algorithm 413
From MaRDI portal
Software:16548
swMATH4371MaRDI QIDQ16548FDOQ16548
Author name not available (Why is that?)
Cited In (25)
- Analytic discrete transparent boundary conditions for high-order Padé parabolic equations
- The Faber polynomials for circular sectors
- Computing Forward-Difference Intervals for Numerical Optimization
- Title not available (Why is that?)
- Detection of the singularities of a complex function by numerical approximations of its Laurent coefficients
- Computation of Faber Series With Application to Numerical Polynomial Approximation in the Complex Plane
- Accelerated polynomial approximation of finite order entire functions by growth reduction
- Computational Techniques Based on the Lanczos Representation
- Accuracy and stability of computing high-order derivatives of analytic functions by Cauchy integrals
- Finite element method with discrete transparent boundary conditions for the one-dimensional nonstationary Schrödinger equation
- Complex-step derivative approximation in noisy environment
- An algorithm for numerical differentiation of a function of one real variable
- Discrete transparent boundary conditions for the Schrödinger equation: fast calculation, approximation, and stability
- Discrete transparent boundary conditions for wide angle parabolic equations in underwater acoustics
- Numerical evaluation of analytic functions by Cauchy's theorem
- A numerical differentiation library exploiting parallel architectures
- Finite difference formulas in the complex plane
- Near-Minimax Polynomial Approximation in an Elliptical Region
- Robust rational interpolation and least-squares
- On the condition number of Lagrangian numerical differentiation
- Fast and stable rational interpolation in roots of unity and Chebyshev points
- Numerical initial data deformation exploiting a gluing construction: I. Exterior asymptotic Schwarzschild
- An FFT-based algorithm for \(2\)D power series expansions
- Using Complex Variables to Estimate Derivatives of Real Functions
- Numerical Analysis
This page was built for software: Algorithm 413