1964
DOI: 10.1007/bf01386067
|View full text |Cite
|
Sign up to set email alerts
|

Direct solution of partial difference equations by tensor product methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
148
0
2

Year Published

1993
1993
2020
2020

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 260 publications
(150 citation statements)
references
References 7 publications
0
148
0
2
Order By: Relevance
“…However, this cost can be significantly reduced by using a discrete version of "separation of variables" -the matrix decomposition/diagonalization method [15,8,24]. To this end, we consider the following generalized eigenvalue problems:…”
Section: Efficient Implementationmentioning
confidence: 99%
See 1 more Smart Citation
“…However, this cost can be significantly reduced by using a discrete version of "separation of variables" -the matrix decomposition/diagonalization method [15,8,24]. To this end, we consider the following generalized eigenvalue problems:…”
Section: Efficient Implementationmentioning
confidence: 99%
“…In particular, we shall extend most of the solution techniques in [24] for usual PDEs to fractional PDEs. More precisely, for separable fractional PDEs, we shall apply the matrix diagonalization methods (i.e., discrete separation of variables) [15,8,24] to reduce a (discrete) multi-dimensional problem to a sequence of (discrete ) one-dimensional problems or to a diagonal system with a total cost of just a few N d+1 flops (d is the space dimension); for non-separable fractional PDEs, we shall apply a preconditioned BICGSTAB iterative method using (i) a related fractional separable problem with constant-coefficients as preconditioned, and (ii) a fast matrix-free algorithm for the matrix-vector multiplication, so that the total cost is still O(N d+1 ). Thus, the cost of a spectral method for fractional PDEs is essentially the same as that for usual PDEs.…”
Section: Introductionmentioning
confidence: 99%
“…We exploit this in the application of our solvers and preconditioners as discussed in this section. In particular, we show how to generalize the FDM described in [11], to non-symmetric discrete convection-diffusion systems with constant wind w. We then examine the use of FDM applied to (2.11) on a single element.…”
Section: Fast Diagonalization Methods (Fdm)mentioning
confidence: 99%
“…Hence, (3.12) can be efficiently solved by using the matrix decomposition method [15,27] at a cost of…”
Section: Space Discretization-spectral-galerkin Methodsmentioning
confidence: 99%