Fast Boolean approximation methods for solving integral equations in high dimensions (Q2567967)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast Boolean approximation methods for solving integral equations in high dimensions |
scientific article; zbMATH DE number 2212357
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast Boolean approximation methods for solving integral equations in high dimensions |
scientific article; zbMATH DE number 2212357 |
Statements
Fast Boolean approximation methods for solving integral equations in high dimensions (English)
0 references
6 October 2005
0 references
The paper is devoted to the construction of an effective numerical method for the solution of Fredholm integral equations of the second kind in high dimensions. The authors present a Boolean collocation method and a Boolean Galerkin method for the solution of integral equations in high dimensions. Beforehand they investigate a Boolean approximation for smooth functions. It is proved that the Boolean collocation method and the Boolean Galerkin method for the integral equation have convergence in order \(O(h \log_2^{d-1} h^{-1})\) and computational cost in order \(O(h^{-1} log_2^{d-1} h^{-1}),\) where \(h\) is the mesh size used in the methods, and the parameter \(d\) is the dimensional of the equations.
0 references
Boolean approximation
0 references
Boolean collocation methods
0 references
Boolean Galerkin methods
0 references
high-dimension Fredholm integral equations
0 references
0 references
0 references
0.8129659295082092
0 references
0.806678056716919
0 references
0.7834136486053467
0 references
0.7816722393035889
0 references