Add to ORKGThe problem of preconditioning the pseudospectral Chebyshev approximation of an elliptic operator is considered. The numerical sensitiveness to variations of the coefficients of the operator are investigated for two classes of preconditioning matrices: one arising from finite differences, the other from finite elements. The preconditioned system is solved by a conjugate gradient type method, and by a DuFort-Frankel method with dynamical parameters. The methods are compared on some test problems with the Richardson method and with the minimal residual Richardson method
Origins of spectral methods, especially their relation to the Method of Weighted Residuals, are surv...
The superconsistent collocation method, which is based on a collocation grid different from the one ...
Spectral element schemes for the solution of elliptic boundary value problems are considered. Precon...
The problem of preconditioning the pseudospectral Chebyshev approximation of an elliptic operator is...
The systems of algebraic equations which arise from spectral discretizations of elliptic equations a...
Efficient solution of the equations from spectral discretizations is essential if the high-order acc...
A new Chebyshev pseudospectral algorithm for second-order elliptic equations using finite element pr...
AbstractThis paper examines the role of preconditioning in the solution of time-dependent partial di...
Two different ways of treating non-Dirichlet boundary conditions in Chebyshev and Legendre collocati...
In order to solve linear system of equations obtained from numerical discretisation fast and accurat...
Master of Science in Applied Mathematics. University of KwaZulu-Natal, Durban 2015.Chebyshev type sp...
Chebyshev pseudospectral methods are used to compute two dimensional smooth compressible flows. Grid...
The Stokes equations are solved by a Chebyshev pseudospectral method on a rectangular domain. As the...
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterativ...
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterativ...
Origins of spectral methods, especially their relation to the Method of Weighted Residuals, are surv...
The superconsistent collocation method, which is based on a collocation grid different from the one ...
Spectral element schemes for the solution of elliptic boundary value problems are considered. Precon...
The problem of preconditioning the pseudospectral Chebyshev approximation of an elliptic operator is...
The systems of algebraic equations which arise from spectral discretizations of elliptic equations a...
Efficient solution of the equations from spectral discretizations is essential if the high-order acc...
A new Chebyshev pseudospectral algorithm for second-order elliptic equations using finite element pr...
AbstractThis paper examines the role of preconditioning in the solution of time-dependent partial di...
Two different ways of treating non-Dirichlet boundary conditions in Chebyshev and Legendre collocati...
In order to solve linear system of equations obtained from numerical discretisation fast and accurat...
Master of Science in Applied Mathematics. University of KwaZulu-Natal, Durban 2015.Chebyshev type sp...
Chebyshev pseudospectral methods are used to compute two dimensional smooth compressible flows. Grid...
The Stokes equations are solved by a Chebyshev pseudospectral method on a rectangular domain. As the...
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterativ...
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterativ...
Origins of spectral methods, especially their relation to the Method of Weighted Residuals, are surv...
The superconsistent collocation method, which is based on a collocation grid different from the one ...
Spectral element schemes for the solution of elliptic boundary value problems are considered. Precon...