Journal article
Optimal grids for anisotropic problems
Electronic transactions on numerical analysis, Vol.26, pp.55-81
01 Jan 2007
Abstract
Spectral convergence of optimal grids for anisotropic problems is both numerically observed and explained. For elliptic problems, the gridding algorithm is reduced to a Stieltjes rational approximation on an interval of a line in the complex plane instead of the real axis as in the isotropic case. We show rigorously why this occurs for a semi-infinite and bounded interval. We then extend the gridding algorithm to hyperbolic problems on bounded domains. For the propagative modes, the problem is reduced to a rational approximation on an interval of the negative real semiaxis, similarly to in the isotropic case. For the wave problem we present numerical examples in 2-D anisotropic media.
Metrics
2 Record Views
Details
- Title
- Optimal grids for anisotropic problems
- Creators
- S. Asvadurov - McKinsey & Co Inc, Moscow 115054, RussiaV. Druskin - Schlumberger Doll Res Ctr, Cambridge, MA 02141 USAS. Moskow - Univ Florida, Dept Math, Gainesville, FL 32611 USA
- Publication Details
- Electronic transactions on numerical analysis, Vol.26, pp.55-81
- Publisher
- Kent State University
- Number of pages
- 27
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Mathematics
- Identifiers
- 991021863513604721
UN Sustainable Development Goals (SDGs)
This output has contributed to the advancement of the following goals:
Source: InCites
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Collaboration types
- Industry collaboration
- Domestic collaboration
- International collaboration
- Web of Science research areas
- Mathematics, Applied