Tensorial basis spline collocation method for Poisson's equation (Q1971411): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcph.1999.6338 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064917845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Direct Solvers for Piecewise Hermite Bicubic Orthogonal Spline Collocation Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical guide to splines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast 3D Poisson solver of arbitrary order accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Direct Solution of Poisson's Equation Using Fourier Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of $O(h^4 )$ Cubic Spline Collocation Methods for Elliptic Partial Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct solution of partial difference equations by tensor product methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basis-spline collocation method for the lattice solution of boundary value problems / rank
 
Normal rank

Revision as of 13:54, 29 May 2024

scientific article
Language Label Description Also known as
English
Tensorial basis spline collocation method for Poisson's equation
scientific article

    Statements

    Tensorial basis spline collocation method for Poisson's equation (English)
    0 references
    0 references
    0 references
    10 October 2000
    0 references
    The paper describes a collocation method for 3D Poisson equations using tensor product splines. Since on uniform meshes the inverse matrix can be calculated as function of small 1D matrices and a 3D diagonal matrix a direct method has been proposed. Numerical experiments show fourth and sixth order convergence for cubic and quintic splines, respectively, and that the direct solver is competitive to iterative fast Fourier transform-based methods. The implementation on distributed memory parallel machines is discussed.
    0 references
    Poisson equations
    0 references
    Vlasov equation
    0 references
    tensor product splines
    0 references
    collocation
    0 references
    direct method
    0 references
    parallel computation
    0 references
    numerical experiments
    0 references
    convergence
    0 references
    iterative fast Fourier transform based methods
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references