Block Iterative Algorithms for Solving Hermite Bicubic Collocation Equations

In this paper, we present a so-called local elimination technique by which a nonsymmetric system arising in the discretization of the Poisson equation with a Hermite bicubic collocation approximation is reduced to a block tridiagonal and "block symmetric" system. A class of block iterative...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on numerical analysis Vol. 33; no. 2; pp. 589 - 601
Main Author: Sun, W.
Format: Journal Article
Language:English
Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.04.1996
Subjects:
Algorithms
Applied mathematics
Boundary conditions
Difference equations
Eigenvalues
Elliptic differential equations
Exact sciences and technology
Fast Fourier transformations
Fourier transforms
Iterative methods
Linear systems
Mathematics
Numerical analysis
Numerical analysis. Scientific computation
Numerical linear algebra
Partial differential equations
Partial differential equations, boundary value problems
Poisson equation
Sciences and techniques of general use
Tensors
Textual collocation
Numerical approximation
Convergence rate
Poisson equation
Iterative method
Collocation method
Algorithm
Partial differential equation
Discretization method
Spline approximation
ISSN:0036-1429, 1095-7170
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we present a so-called local elimination technique by which a nonsymmetric system arising in the discretization of the Poisson equation with a Hermite bicubic collocation approximation is reduced to a block tridiagonal and "block symmetric" system. A class of block iterative algorithms is developed for solving the resulting system. The convergence rates of algorithms are discussed.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0036-1429
1095-7170
DOI:10.1137/0733031