A comparison of basis functions for the pseudo-spectral method for a model reaction-diffusion problem (Q579895): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
The authors consider two schemes for approximating the Laplacian operator in reaction-diffusion systems. Experiments are based on the model equation \[ (1)\quad u_ t=\Delta u+F(u),\text{ where } u=u(x,t),\quad x\in \Omega \subset {\mathbb{R}}^ m,\quad m=1\quad or^ 2,\quad and\text{ where } u(x,t)=0\quad for\quad x\in \partial \Omega. \] The solution u is approximated in terms of a finite basis of either eigenfunctions of the Laplacian (as in the spectral method) or Chebychev polynomials; collocation is used to derive equations for the coefficients in these bases. Due to the non-periodic boundary conditions, the eigenfunction expansion cannot be expected to converge superalgebraically. Also, the effect of nonlinearities needs to be demonstrated. The authors present numerical results for various cases of (1), over line segments, rectangles, and circles. Logarithmic error curves illustrate convergence of the eigenfunction basis scheme with order \(O(N^{-2})\) or \(O(N^{-4})\), where N is the number of basis functions, while the Chebychev basis scheme seems to converge faster than any power of N. However, the eigenfunction basis gives better (and in many cases adequate) accuracy, and is easier to program, than the Chebychev basis scheme, for small values of N. The paper is well-written. | |||
Property / review text: The authors consider two schemes for approximating the Laplacian operator in reaction-diffusion systems. Experiments are based on the model equation \[ (1)\quad u_ t=\Delta u+F(u),\text{ where } u=u(x,t),\quad x\in \Omega \subset {\mathbb{R}}^ m,\quad m=1\quad or^ 2,\quad and\text{ where } u(x,t)=0\quad for\quad x\in \partial \Omega. \] The solution u is approximated in terms of a finite basis of either eigenfunctions of the Laplacian (as in the spectral method) or Chebychev polynomials; collocation is used to derive equations for the coefficients in these bases. Due to the non-periodic boundary conditions, the eigenfunction expansion cannot be expected to converge superalgebraically. Also, the effect of nonlinearities needs to be demonstrated. The authors present numerical results for various cases of (1), over line segments, rectangles, and circles. Logarithmic error curves illustrate convergence of the eigenfunction basis scheme with order \(O(N^{-2})\) or \(O(N^{-4})\), where N is the number of basis functions, while the Chebychev basis scheme seems to converge faster than any power of N. However, the eigenfunction basis gives better (and in many cases adequate) accuracy, and is easier to program, than the Chebychev basis scheme, for small values of N. The paper is well-written. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Q593482 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65N35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 35K57 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4016123 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
pseudo-spectral method | |||
Property / zbMATH Keywords: pseudo-spectral method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
basis functions | |||
Property / zbMATH Keywords: basis functions / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Laplacian operator | |||
Property / zbMATH Keywords: Laplacian operator / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
reaction- diffusion systems | |||
Property / zbMATH Keywords: reaction- diffusion systems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Chebychev polynomials | |||
Property / zbMATH Keywords: Chebychev polynomials / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
collocation | |||
Property / zbMATH Keywords: collocation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
eigenfunction expansion | |||
Property / zbMATH Keywords: eigenfunction expansion / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Logarithmic error curves | |||
Property / zbMATH Keywords: Logarithmic error curves / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
convergence | |||
Property / zbMATH Keywords: convergence / rank | |||
Normal rank |
Revision as of 17:32, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A comparison of basis functions for the pseudo-spectral method for a model reaction-diffusion problem |
scientific article |
Statements
A comparison of basis functions for the pseudo-spectral method for a model reaction-diffusion problem (English)
0 references
1986
0 references
The authors consider two schemes for approximating the Laplacian operator in reaction-diffusion systems. Experiments are based on the model equation \[ (1)\quad u_ t=\Delta u+F(u),\text{ where } u=u(x,t),\quad x\in \Omega \subset {\mathbb{R}}^ m,\quad m=1\quad or^ 2,\quad and\text{ where } u(x,t)=0\quad for\quad x\in \partial \Omega. \] The solution u is approximated in terms of a finite basis of either eigenfunctions of the Laplacian (as in the spectral method) or Chebychev polynomials; collocation is used to derive equations for the coefficients in these bases. Due to the non-periodic boundary conditions, the eigenfunction expansion cannot be expected to converge superalgebraically. Also, the effect of nonlinearities needs to be demonstrated. The authors present numerical results for various cases of (1), over line segments, rectangles, and circles. Logarithmic error curves illustrate convergence of the eigenfunction basis scheme with order \(O(N^{-2})\) or \(O(N^{-4})\), where N is the number of basis functions, while the Chebychev basis scheme seems to converge faster than any power of N. However, the eigenfunction basis gives better (and in many cases adequate) accuracy, and is easier to program, than the Chebychev basis scheme, for small values of N. The paper is well-written.
0 references
pseudo-spectral method
0 references
basis functions
0 references
Laplacian operator
0 references
reaction- diffusion systems
0 references
Chebychev polynomials
0 references
collocation
0 references
eigenfunction expansion
0 references
Logarithmic error curves
0 references
convergence
0 references